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-3.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-3.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock]
Preparing model... [0.020s CPU, 0.013s wall-clock]
Generated 43 rules.
Computing model... [0.100s CPU, 0.098s wall-clock]
582 relevant atoms
540 auxiliary atoms
1122 final queue length
1976 total queue pushes
Completing instantiation... [0.130s CPU, 0.133s wall-clock]
Instantiating: [0.270s CPU, 0.276s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.036s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
18 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.070s CPU, 0.070s 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.010s CPU, 0.007s wall-clock]
Translating task: [0.140s CPU, 0.142s wall-clock]
432 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
26 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.072s wall-clock]
Reordering and filtering variables...
26 of 26 variables necessary.
18 of 26 mutex groups necessary.
336 of 336 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.041s wall-clock]
Translator variables: 26
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 6
Translator mutex groups: 18
Translator total mutex groups size: 156
Translator operators: 336
Translator axioms: 0
Translator task size: 3146
Translator peak memory: 34904 KB
Writing output... [0.050s CPU, 0.054s wall-clock]
Done! [0.680s CPU, 0.686s wall-clock]
planner.py version 0.0.1

Time:	 0.14s
Memory: 52MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.06s
Memory:		 55MB (+3MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 56MB (+1MB)
UNSAT
Iteration Time:	 0.08s

Iteration 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.03s
Memory:		 56MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 57MB (+1MB)
UNSAT
Iteration Time:	 0.03s

Iteration 3
Queue:		 [9]
Grounded Until:	 7
Grounding...	 [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time:	 0.02s
Memory:		 57MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 57MB (+0MB)
UNSAT
Iteration Time:	 0.03s

Iteration 4
Queue:		 [14]
Grounded Until:	 9
Grounding...	 [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time:	 0.06s
Memory:		 60MB (+3MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist2","crate5","crate2","distributor1")),1) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),1) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("drive","truck0","depot0","distributor0")),2) occurs(action(("drive","truck1","distributor0","distributor1")),2) occurs(action(("drop","hoist2","crate5","crate2","distributor1")),2) occurs(action(("drop","hoist1","crate4","crate3","distributor0")),2) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),3) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),3) occurs(action(("drive","truck1","distributor1","depot0")),3) occurs(action(("load","hoist1","crate4","truck0","distributor0")),4) occurs(action(("load","hoist0","crate1","truck1","depot0")),4) occurs(action(("drop","hoist2","crate5","crate2","distributor1")),4) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),5) occurs(action(("lift","hoist1","crate3","crate0","distributor0")),5) occurs(action(("drive","truck0","distributor0","distributor1")),5) occurs(action(("drive","truck1","depot0","distributor0")),5) occurs(action(("load","hoist2","crate5","truck0","distributor1")),6) occurs(action(("load","hoist1","crate3","truck1","distributor0")),6) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),7) occurs(action(("lift","hoist2","crate2","pallet2","distributor1")),7) occurs(action(("drive","truck0","distributor1","distributor0")),7) occurs(action(("drive","truck1","distributor0","distributor1")),7) occurs(action(("load","hoist2","crate2","truck1","distributor1")),8) occurs(action(("load","hoist1","crate0","truck0","distributor0")),8) occurs(action(("unload","hoist1","crate4","truck0","distributor0")),9) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),9) occurs(action(("drop","hoist1","crate4","pallet1","distributor0")),10) occurs(action(("drop","hoist2","crate1","pallet2","distributor1")),10) occurs(action(("drive","truck1","distributor1","depot0")),10) occurs(action(("drive","truck0","distributor0","distributor1")),10) occurs(action(("lift","hoist1","crate4","pallet1","distributor0")),11) occurs(action(("unload","hoist0","crate2","truck1","depot0")),11) occurs(action(("unload","hoist2","crate0","truck0","distributor1")),11) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),12) occurs(action(("drop","hoist2","crate0","crate1","distributor1")),12) occurs(action(("drop","hoist1","crate4","pallet1","distributor0")),13) occurs(action(("unload","hoist2","crate5","truck0","distributor1")),13) occurs(action(("unload","hoist0","crate3","truck1","depot0")),13) occurs(action(("drop","hoist2","crate5","crate0","distributor1")),14) occurs(action(("drop","hoist0","crate3","crate2","depot0")),14)
Solving Time:	 0.05s
Memory:		 62MB (+2MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 0.411s (Solving: 0.05s 1st Model: 0.04s Unsat: 0.00s)
CPU Time     : 0.410s

Choices      : 972     
Conflicts    : 374      (Analyzed: 371)
Restarts     : 5        (Average: 74.20 Last: 30)
Model-Level  : 47.0    
Problems     : 4        (Average Length: 10.75 Splits: 0)
Lemmas       : 371      (Deleted: 0)
  Binary     : 36       (Ratio:   9.70%)
  Ternary    : 26       (Ratio:   7.01%)
  Conflict   : 371      (Average Length:   27.4 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 371      (Average:  4.02 Max:  32 Sum:   1493)
  Executed   : 329      (Average:  2.54 Max:  32 Sum:    941 Ratio:  63.03%)
  Bounded    : 42       (Average: 13.14 Max:  16 Sum:    552 Ratio:  36.97%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 10628    (Eliminated:    0 Frozen: 5467)
Constraints  : 65245    (Binary:  93.1% Ternary:   3.7% Other:   3.2%)

Memory Peak  : 62MB
Max. Length  : 14 steps
Sol. Length  : 14 steps


