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-7.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-7.pddl
Parsing...
Parsing: [0.010s CPU, 0.019s 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.020s CPU, 0.021s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 43 rules.
Computing model... [0.110s CPU, 0.103s wall-clock]
693 relevant atoms
630 auxiliary atoms
1323 final queue length
2339 total queue pushes
Completing instantiation... [0.160s CPU, 0.159s wall-clock]
Instantiating: [0.310s CPU, 0.304s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.030s CPU, 0.037s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.025s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
24 uncovered facts
Choosing groups: [0.000s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.080s CPU, 0.082s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.009s wall-clock]
Translating task: [0.170s CPU, 0.180s wall-clock]
558 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
32 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.089s wall-clock]
Reordering and filtering variables...
29 of 29 variables necessary.
21 of 29 mutex groups necessary.
408 of 408 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.049s wall-clock]
Translator variables: 29
Translator derived variables: 0
Translator facts: 156
Translator goal facts: 5
Translator mutex groups: 21
Translator total mutex groups size: 177
Translator operators: 408
Translator axioms: 0
Translator task size: 3877
Translator peak memory: 35416 KB
Writing output... [0.060s CPU, 0.065s wall-clock]
Done! [0.790s CPU, 0.803s wall-clock]
planner.py version 0.0.1

Time:	 0.18s
Memory: 54MB

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:		 54MB (+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.05s
Memory:		 55MB (+1MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 56MB (+1MB)
UNSAT
Iteration Time:	 0.07s

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.05s
Memory:		 58MB (+2MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 59MB (+1MB)
UNSAT
Iteration Time:	 0.07s

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.06s
Memory:		 62MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.51s
Memory:		 64MB (+2MB)
UNSAT
Iteration Time:	 0.59s

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.05s
Memory:		 67MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.96s
Memory:		 68MB (+1MB)
UNKNOWN
Iteration Time:	 1.03s

Iteration 6
Queue:		 [(5,25,0,True), (6,30,0,True)]
Grounded Until:	 20
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time:	 0.05s
Memory:		 71MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 1.03s
Memory:		 73MB (+2MB)
UNKNOWN
Iteration Time:	 1.11s

Iteration 7
Queue:		 [(6,30,0,True)]
Grounded Until:	 25
Grounding...	 [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time:	 0.07s
Memory:		 77MB (+4MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate3","crate2","distributor1")),1) occurs(action(("load","hoist2","crate3","truck0","distributor1")),2) occurs(action(("drive","truck0","distributor1","distributor0")),3) occurs(action(("unload","hoist1","crate3","truck0","distributor0")),4) occurs(action(("drop","hoist1","crate3","pallet1","distributor0")),5) occurs(action(("lift","hoist1","crate4","crate0","distributor0")),6) occurs(action(("load","hoist1","crate4","truck0","distributor0")),7) occurs(action(("drive","truck0","distributor0","distributor1")),8) occurs(action(("unload","hoist2","crate4","truck0","distributor1")),9) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),10) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),11) occurs(action(("drop","hoist2","crate4","crate2","distributor1")),12) occurs(action(("lift","hoist2","crate1","pallet5","distributor1")),13) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),14) occurs(action(("lift","hoist2","crate1","crate4","distributor1")),15) occurs(action(("load","hoist2","crate1","truck0","distributor1")),16) occurs(action(("lift","hoist2","crate4","crate2","distributor1")),17) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),18) occurs(action(("lift","hoist0","crate5","pallet0","depot0")),19) occurs(action(("load","hoist0","crate5","truck1","depot0")),20) occurs(action(("drive","truck1","depot0","distributor1")),21) occurs(action(("unload","hoist2","crate5","truck1","distributor1")),22) occurs(action(("drop","hoist2","crate5","crate2","distributor1")),23) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),24) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),25) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),26) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),27) occurs(action(("drive","truck0","distributor1","distributor0")),28) occurs(action(("lift","hoist2","crate5","crate1","distributor1")),29) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),30)
Solving Time:	 0.32s
Memory:		 78MB (+1MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 7
Time         : 3.480s (Solving: 2.81s 1st Model: 0.32s Unsat: 0.51s)
CPU Time     : 3.470s

Choices      : 45459   
Conflicts    : 27528    (Analyzed: 27525)
Restarts     : 290      (Average: 94.91 Last: 144)
Model-Level  : 50.0    
Problems     : 7        (Average Length: 17.00 Splits: 0)
Lemmas       : 27525    (Deleted: 17192)
  Binary     : 1898     (Ratio:   6.90%)
  Ternary    : 1247     (Ratio:   4.53%)
  Conflict   : 27525    (Average Length:   70.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 27525    (Average:  1.83 Max:  60 Sum:  50458)
  Executed   : 27205    (Average:  1.60 Max:  60 Sum:  43978 Ratio:  87.16%)
  Bounded    : 320      (Average: 20.25 Max:  32 Sum:   6480 Ratio:  12.84%)

Rules        : 11512   
Atoms        : 11512   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 20929    (Eliminated:    0 Frozen: 15671)
Constraints  : 146959   (Binary:  94.3% Ternary:   3.0% Other:   2.7%)

Memory Peak  : 80MB
Max. Length  : 30 steps
Sol. Length  : 30 steps


