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-11.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-11.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 43 rules.
Computing model... [0.360s CPU, 0.355s wall-clock]
2415 relevant atoms
2024 auxiliary atoms
4439 final queue length
9131 total queue pushes
Completing instantiation... [0.790s CPU, 0.794s wall-clock]
Instantiating: [1.190s CPU, 1.192s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.056s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.060s CPU, 0.063s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
34 uncovered facts
Choosing groups: [0.010s CPU, 0.014s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.160s CPU, 0.165s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.040s CPU, 0.042s wall-clock]
Translating task: [0.880s CPU, 0.889s wall-clock]
2520 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
46 propositions removed
Detecting unreachable propositions: [0.440s CPU, 0.433s wall-clock]
Reordering and filtering variables...
44 of 44 variables necessary.
32 of 44 mutex groups necessary.
1800 of 1800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.210s CPU, 0.213s wall-clock]
Translator variables: 44
Translator derived variables: 0
Translator facts: 356
Translator goal facts: 10
Translator mutex groups: 32
Translator total mutex groups size: 452
Translator operators: 1800
Translator axioms: 0
Translator task size: 16702
Translator peak memory: 46796 KB
Writing output... [0.270s CPU, 0.299s wall-clock]
Done! [3.230s CPU, 3.260s wall-clock]
planner.py version 0.0.1

Time:	 0.63s
Memory: 92MB

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:		 92MB (+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.21s
Memory:		 92MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 94MB (+2MB)
UNSAT
Iteration Time:	 0.30s

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.21s
Memory:		 100MB (+6MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 106MB (+6MB)
UNSAT
Iteration Time:	 0.32s

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

Models       : 1+
Calls        : 4
Time         : 1.656s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time     : 1.636s

Choices      : 455      (Domain: 445)
Conflicts    : 51       (Analyzed: 50)
Restarts     : 0       
Model-Level  : 98.0    
Problems     : 4        (Average Length: 9.50 Splits: 0)
Lemmas       : 50       (Deleted: 0)
  Binary     : 2        (Ratio:   4.00%)
  Ternary    : 2        (Ratio:   4.00%)
  Conflict   : 50       (Average Length:  106.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 50       (Average:  9.88 Max:  36 Sum:    494)
  Executed   : 42       (Average:  7.48 Max:  36 Sum:    374 Ratio:  75.71%)
  Bounded    : 8        (Average: 15.00 Max:  17 Sum:    120 Ratio:  24.29%)

Rules        : 49311   
Atoms        : 49311   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 34892    (Eliminated:    0 Frozen: 4668)
Constraints  : 273199   (Binary:  97.0% Ternary:   1.5% Other:   1.5%)

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


