COLIN planner and linear generator problem

Update 05/27/2012: Dr. Derek Long emailed me today that the old PDDL domain file used ADL encoding by mistake. However, COLIN cannot handle ADL. So please download the new domain file from their website to fix the problem. Or, you can simply comment out the at-start condition of the durative action refuel.

I am looking into a temporal planner COLIN.

I downloaded COLIN and the PDDL program for the Linear Generator problem, both from its website (http://www.inf.kcl.ac.uk/staff/andrew/planning/index.php?option=com_content&view=article&id=60&Itemid=70)

I am now skeptical of whether the planner can solve linear generator problem.

First, there are both

Problem Unsolvable

and

Solution Found

in the output. How can you find a solution for a problem claimed unsolvable by you?

Second, the plan is not valid at all:

0.000: (generate generator )  [0.000]

The binary executable of COLIN is compiled on 32-bit Linux whereas my Ubuntu box is 64-bit. But I really do not think this is the reason.

If you have any idea about this, please do let me know.

Complete output from the planner on my Linux Shell is as follows.

forrest@UbiMac:/forrest/.Apps$ ./colin-x86 genlinear.pddl genproblinear.pddl 
Report for: fuel-level
Preconditions:
 generate
 refuel
Could be a one way changing value
Assigns:
Increasers:
Decreasers:
Scalers:
Continuous value, affected by:
 generate
 refuel
Initial value assignments:
 (fuel-level generator) = 90
Dependencies:
Speculating that this value is: strictly positive
Report for: capacity
Preconditions:
 refuel
Fluent is static
Initial value assignments:
 (capacity generator) = 90
Noting that this value is: strictly positive
Re-examine behaviour of fuel-level
Final value: strictly positive
(fuel-level generator )
(capacity generator )
Have a metric tracking fluent: (capacity generator )
SubProblem 0 has goals: 0
Solving subproblem
<<2.000>>Initial heuristic = 2.000, tie breaker 0.000
(2.000) <<1.000>>b (1.000)d
Resorting to best-first search
b (1.000)d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.d.dd
Problem Unsolvable
;;;; Solution Found
; Time 5184.12
0.000: (generate generator )  [0.000]