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-4.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-4.pddl
Parsing...
Parsing: [0.020s CPU, 0.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.021s wall-clock]
Preparing model... [0.020s CPU, 0.012s wall-clock]
Generated 43 rules.
Computing model... [0.120s CPU, 0.121s wall-clock]
860 relevant atoms
750 auxiliary atoms
1610 final queue length
3016 total queue pushes
Completing instantiation... [0.210s CPU, 0.208s wall-clock]
Instantiating: [0.370s CPU, 0.369s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.045s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.030s CPU, 0.024s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
20 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.100s CPU, 0.092s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.012s wall-clock]
Translating task: [0.240s CPU, 0.233s wall-clock]
720 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
30 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.118s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
22 of 32 mutex groups necessary.
540 of 540 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.065s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 186
Translator goal facts: 6
Translator mutex groups: 22
Translator total mutex groups size: 222
Translator operators: 540
Translator axioms: 0
Translator task size: 5114
Translator peak memory: 36184 KB
Writing output... [0.140s CPU, 0.145s wall-clock]
Done! [1.060s CPU, 1.059s wall-clock]
planner.py version 0.0.1

Time:	 0.65s
Memory: 82MB

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:		 82MB (+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.58s
Memory:		 149MB (+67MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 153MB (+4MB)
UNSAT
Iteration Time:	 0.71s

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.71s
Memory:		 194MB (+41MB)
Unblocking actions...
Solving...
Solving Time:	 0.16s
Memory:		 197MB (+3MB)
UNSAT
Iteration Time:	 0.99s

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

Models       : 1+
Calls        : 4
Time         : 4.192s (Solving: 1.22s 1st Model: 1.09s Unsat: 0.13s)
CPU Time     : 4.180s

Choices      : 10204   
Conflicts    : 4767     (Analyzed: 4765)
Restarts     : 59       (Average: 80.76 Last: 97)
Model-Level  : 75.0    
Problems     : 4        (Average Length: 9.50 Splits: 0)
Lemmas       : 5368     (Deleted: 947)
  Binary     : 692      (Ratio:  12.89%)
  Ternary    : 509      (Ratio:   9.48%)
  Conflict   : 4765     (Average Length:   21.8 Ratio:  88.77%) 
  Loop       : 603      (Average Length:   48.4 Ratio:  11.23%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 4765     (Average:  3.45 Max:  46 Sum:  16445)
  Executed   : 4345     (Average:  2.12 Max:  46 Sum:  10106 Ratio:  61.45%)
  Bounded    : 420      (Average: 15.09 Max:  17 Sum:   6339 Ratio:  38.55%)

Rules        : 272461  
Atoms        : 272461  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 56431    (Eliminated:    0 Frozen: 53181)
Constraints  : 176411   (Binary:  87.9% Ternary:   6.2% Other:   5.9%)

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


