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-8.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-8.pddl
Parsing...
Parsing: [0.020s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.014s wall-clock]
Generated 43 rules.
Computing model... [0.180s CPU, 0.182s wall-clock]
1365 relevant atoms
1130 auxiliary atoms
2495 final queue length
4859 total queue pushes
Completing instantiation... [0.350s CPU, 0.351s wall-clock]
Instantiating: [0.580s CPU, 0.577s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.046s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.040s CPU, 0.041s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
Choosing groups...
28 uncovered facts
Choosing groups: [0.000s CPU, 0.010s wall-clock]
Building translation key... [0.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.120s CPU, 0.120s 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.000s CPU, 0.005s 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.410s CPU, 0.407s wall-clock]
1290 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
40 propositions removed
Detecting unreachable propositions: [0.200s CPU, 0.201s wall-clock]
Reordering and filtering variables...
41 of 41 variables necessary.
29 of 41 mutex groups necessary.
912 of 912 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.110s CPU, 0.109s wall-clock]
Translator variables: 41
Translator derived variables: 0
Translator facts: 284
Translator goal facts: 7
Translator mutex groups: 29
Translator total mutex groups size: 329
Translator operators: 912
Translator axioms: 0
Translator task size: 8767
Translator peak memory: 38488 KB
Writing output... [0.140s CPU, 0.146s wall-clock]
Done! [1.600s CPU, 1.609s wall-clock]
planner.py version 0.0.1

Time:	 1.87s
Memory: 150MB

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.01s
Memory:		 150MB (+0MB)
UNSAT
Iteration Time:	 0.01s

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.99s
Memory:		 277MB (+127MB)
Unblocking actions...
Solving...
Solving Time:	 0.04s
Memory:		 277MB (+0MB)
UNSAT
Iteration Time:	 1.19s

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:	 1.43s
Memory:		 351MB (+74MB)
Unblocking actions...
Solving...
Solving Time:	 0.07s
Memory:		 351MB (+0MB)
UNSAT
Iteration Time:	 1.69s

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:	 1.10s
Memory:		 400MB (+49MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate9","pallet2","distributor1")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist1","crate6","crate5","distributor0")),1) occurs(action(("load","hoist2","crate9","truck1","distributor1")),2) occurs(action(("load","hoist1","crate6","truck0","distributor0")),2) occurs(action(("drive","truck0","distributor0","depot0")),2) occurs(action(("lift","hoist1","crate5","crate1","distributor0")),3) occurs(action(("drive","truck0","depot0","distributor1")),3) occurs(action(("lift","hoist2","crate7","crate4","distributor1")),3) occurs(action(("unload","hoist0","crate6","truck0","depot0")),3) occurs(action(("drive","truck1","distributor1","distributor0")),3) occurs(action(("load","hoist2","crate7","truck0","distributor1")),4) occurs(action(("drive","truck0","distributor1","depot0")),4) occurs(action(("drive","truck1","distributor0","depot0")),4) occurs(action(("load","hoist1","crate5","truck1","distributor0")),4) occurs(action(("lift","hoist1","crate1","pallet1","distributor0")),5) occurs(action(("lift","hoist2","crate4","pallet3","distributor1")),5) occurs(action(("load","hoist0","crate6","truck1","depot0")),5) occurs(action(("drive","truck0","depot0","distributor1")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),6) occurs(action(("load","hoist1","crate1","truck1","distributor0")),6) occurs(action(("drive","truck1","distributor0","distributor1")),6) occurs(action(("load","hoist2","crate4","truck0","distributor1")),6) occurs(action(("drive","truck0","distributor1","distributor0")),6) occurs(action(("unload","hoist1","crate7","truck0","distributor0")),7) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),7) occurs(action(("drive","truck0","distributor0","depot0")),7) occurs(action(("drop","hoist1","crate7","pallet1","distributor0")),8) occurs(action(("load","hoist2","crate1","truck1","distributor1")),8) occurs(action(("load","hoist0","crate2","truck0","depot0")),8) occurs(action(("unload","hoist2","crate6","truck1","distributor1")),9) occurs(action(("drive","truck0","depot0","distributor0")),9) occurs(action(("drive","truck1","distributor1","distributor0")),9) occurs(action(("unload","hoist0","crate2","truck0","depot0")),9) occurs(action(("drop","hoist2","crate6","pallet2","distributor1")),10) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),10) occurs(action(("drive","truck0","distributor0","depot0")),10) occurs(action(("load","hoist1","crate0","truck1","distributor0")),11) occurs(action(("drive","truck1","distributor0","distributor1")),11) occurs(action(("load","hoist0","crate2","truck0","depot0")),11) occurs(action(("lift","hoist1","crate8","crate3","distributor0")),12) occurs(action(("unload","hoist2","crate0","truck1","distributor1")),12) occurs(action(("drive","truck1","distributor1","depot0")),12) occurs(action(("drop","hoist1","crate8","pallet4","distributor0")),13) occurs(action(("drop","hoist2","crate0","pallet3","distributor1")),13) occurs(action(("unload","hoist0","crate9","truck1","depot0")),13) occurs(action(("drive","truck1","depot0","distributor1")),13) occurs(action(("drive","truck0","depot0","distributor0")),13) occurs(action(("lift","hoist1","crate3","pallet5","distributor0")),14) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),14) occurs(action(("drive","truck0","distributor0","depot0")),14) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),15) occurs(action(("drop","hoist1","crate3","crate8","distributor0")),15) occurs(action(("drop","hoist2","crate1","crate0","distributor1")),15) occurs(action(("drive","truck0","depot0","distributor0")),15) occurs(action(("drive","truck1","distributor1","distributor0")),15)
Solving Time:	 0.26s
Memory:		 400MB (+0MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 6.342s (Solving: 0.22s 1st Model: 0.20s Unsat: 0.02s)
CPU Time     : 6.320s

Choices      : 3207    
Conflicts    : 1349     (Analyzed: 1347)
Restarts     : 14       (Average: 96.21 Last: 54)
Model-Level  : 73.0    
Problems     : 4        (Average Length: 9.50 Splits: 0)
Lemmas       : 1347     (Deleted: 0)
  Binary     : 108      (Ratio:   8.02%)
  Ternary    : 94       (Ratio:   6.98%)
  Conflict   : 1347     (Average Length:   69.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 1347     (Average:  2.96 Max:  82 Sum:   3982)
  Executed   : 1288     (Average:  2.34 Max:  82 Sum:   3148 Ratio:  79.06%)
  Bounded    : 59       (Average: 14.14 Max:  17 Sum:    834 Ratio:  20.94%)

Rules        : 773702  
Atoms        : 773702  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 41925    (Eliminated:    0 Frozen: 36288)
Constraints  : 152431   (Binary:  95.5% Ternary:   2.3% Other:   2.1%)

Memory Peak  : 400MB
Max. Length  : 15 steps
Sol. Length  : 15 steps


