INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-5.pddl']
INFO     translator arguments: []
INFO     translator time limit: None
INFO     translator memory limit: None
INFO     callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-5.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 43 rules.
Computing model... [0.170s CPU, 0.173s wall-clock]
1194 relevant atoms
992 auxiliary atoms
2186 final queue length
4280 total queue pushes
Completing instantiation... [0.350s CPU, 0.338s wall-clock]
Instantiating: [0.560s CPU, 0.553s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.044s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.040s CPU, 0.036s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
22 uncovered facts
Choosing groups: [0.010s CPU, 0.009s wall-clock]
Building translation key... [0.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.110s CPU, 0.112s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.006s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.019s wall-clock]
Translating task: [0.390s CPU, 0.394s wall-clock]
1080 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
34 propositions removed
Detecting unreachable propositions: [0.190s CPU, 0.192s wall-clock]
Reordering and filtering variables...
38 of 38 variables necessary.
26 of 38 mutex groups necessary.
792 of 792 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.100s CPU, 0.104s wall-clock]
Translator variables: 38
Translator derived variables: 0
Translator facts: 248
Translator goal facts: 10
Translator mutex groups: 26
Translator total mutex groups size: 296
Translator operators: 792
Translator axioms: 0
Translator task size: 7558
Translator peak memory: 40908 KB
Writing output... [0.130s CPU, 0.138s wall-clock]
Done! [1.530s CPU, 1.547s wall-clock]
planner.py version 0.0.1

Time:	 0.29s
Memory: 68MB

Iteration 1
Queue:		 [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 0
Solving...
Solving Time:	 0.00s
Memory:		 68MB (+0MB)
UNSAT
Iteration Time:	 0.00s

Iteration 2
Queue:		 [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.09s
Memory:		 68MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 69MB (+1MB)
UNSAT
Iteration Time:	 0.12s

Iteration 3
Queue:		 [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.10s
Memory:		 74MB (+5MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 76MB (+2MB)
UNSAT
Iteration Time:	 0.13s

Iteration 4
Queue:		 [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 10
Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time:	 0.11s
Memory:		 81MB (+5MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 83MB (+2MB)
UNSAT
Iteration Time:	 0.16s

Iteration 5
Queue:		 [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 15
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time:	 0.10s
Memory:		 88MB (+5MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist1","crate8","crate7","distributor0")),1) occurs(action(("lift","hoist0","crate4","crate3","depot0")),1) occurs(action(("lift","hoist2","crate9","crate5","distributor1")),1) occurs(action(("drive","truck1","distributor0","depot0")),1) occurs(action(("drive","truck0","depot0","distributor1")),1) occurs(action(("load","hoist2","crate9","truck0","distributor1")),2) occurs(action(("load","hoist0","crate4","truck1","depot0")),2) occurs(action(("drive","truck0","distributor1","depot0")),2) occurs(action(("drive","truck1","depot0","distributor0")),2) occurs(action(("lift","hoist0","crate3","crate1","depot0")),3) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),3) occurs(action(("load","hoist1","crate8","truck1","distributor0")),3) occurs(action(("lift","hoist1","crate7","crate6","distributor0")),4) occurs(action(("load","hoist0","crate3","truck0","depot0")),4) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),5) occurs(action(("load","hoist1","crate7","truck1","distributor0")),5) occurs(action(("lift","hoist1","crate6","pallet1","distributor0")),6) occurs(action(("load","hoist0","crate1","truck0","depot0")),6) occurs(action(("unload","hoist0","crate9","truck0","depot0")),7) occurs(action(("load","hoist1","crate6","truck1","distributor0")),7) occurs(action(("drive","truck1","distributor0","depot0")),7) occurs(action(("drive","truck0","depot0","distributor1")),7) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),8) occurs(action(("load","hoist2","crate5","truck0","distributor1")),8) occurs(action(("drive","truck0","distributor1","depot0")),8) occurs(action(("unload","hoist0","crate6","truck1","depot0")),9) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),9) occurs(action(("drop","hoist0","crate6","crate9","depot0")),10) occurs(action(("unload","hoist0","crate4","truck1","depot0")),11) occurs(action(("drive","truck1","depot0","distributor1")),11) occurs(action(("drop","hoist0","crate4","crate6","depot0")),12) occurs(action(("drive","truck1","distributor1","depot0")),12) occurs(action(("load","hoist2","crate2","truck1","distributor1")),12) occurs(action(("unload","hoist0","crate5","truck0","depot0")),13) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),13) occurs(action(("drive","truck0","depot0","distributor1")),13) occurs(action(("drop","hoist0","crate5","crate4","depot0")),14) occurs(action(("load","hoist2","crate0","truck0","distributor1")),14) occurs(action(("drive","truck0","distributor1","depot0")),14) occurs(action(("unload","hoist0","crate0","truck0","depot0")),15) occurs(action(("drive","truck0","depot0","distributor0")),15) occurs(action(("drop","hoist0","crate0","crate5","depot0")),16) occurs(action(("unload","hoist1","crate1","truck0","distributor0")),16) occurs(action(("drive","truck0","distributor0","distributor1")),16) occurs(action(("drop","hoist1","crate1","pallet1","distributor0")),17) occurs(action(("unload","hoist2","crate3","truck0","distributor1")),17) occurs(action(("unload","hoist0","crate2","truck1","depot0")),17) occurs(action(("drive","truck1","depot0","distributor0")),17) occurs(action(("drop","hoist2","crate3","pallet2","distributor1")),18) occurs(action(("unload","hoist1","crate7","truck1","distributor0")),18) occurs(action(("drive","truck1","distributor0","distributor1")),18) occurs(action(("drop","hoist0","crate2","crate0","depot0")),18) occurs(action(("drop","hoist1","crate7","crate1","distributor0")),19) occurs(action(("unload","hoist2","crate8","truck1","distributor1")),19) occurs(action(("drive","truck0","distributor1","depot0")),19) occurs(action(("drop","hoist2","crate8","crate3","distributor1")),20) occurs(action(("drive","truck1","distributor1","distributor0")),20)
Solving Time:	 0.01s
Memory:		 91MB (+3MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 5
Time         : 0.883s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time     : 0.872s

Choices      : 438      (Domain: 434)
Conflicts    : 30       (Analyzed: 28)
Restarts     : 0       
Model-Level  : 193.0   
Problems     : 5        (Average Length: 12.00 Splits: 0)
Lemmas       : 28       (Deleted: 0)
  Binary     : 1        (Ratio:   3.57%)
  Ternary    : 5        (Ratio:  17.86%)
  Conflict   : 28       (Average Length:   10.4 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 28       (Average: 14.43 Max: 119 Sum:    404)
  Executed   : 19       (Average:  9.54 Max: 119 Sum:    267 Ratio:  66.09%)
  Bounded    : 9        (Average: 15.22 Max:  22 Sum:    137 Ratio:  33.91%)

Rules        : 22353   
Atoms        : 22353   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 24680    (Eliminated:    0 Frozen: 4213)
Constraints  : 178687   (Binary:  95.3% Ternary:   2.3% Other:   2.4%)

Memory Peak  : 92MB
Max. Length  : 20 steps
Sol. Length  : 20 steps