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-19.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-19.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 43 rules.
Computing model... [0.400s CPU, 0.407s wall-clock]
3063 relevant atoms
2588 auxiliary atoms
5651 final queue length
11023 total queue pushes
Completing instantiation... [0.850s CPU, 0.859s wall-clock]
Instantiating: [1.330s CPU, 1.327s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.041s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.080s CPU, 0.075s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
44 uncovered facts
Choosing groups: [0.020s CPU, 0.014s wall-clock]
Building translation key... [0.010s CPU, 0.005s wall-clock]
Computing fact groups: [0.160s CPU, 0.163s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.008s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.050s CPU, 0.046s wall-clock]
Translating task: [0.970s CPU, 0.962s wall-clock]
2960 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [0.530s CPU, 0.531s wall-clock]
Reordering and filtering variables...
46 of 46 variables necessary.
34 of 46 mutex groups necessary.
2352 of 2352 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.220s CPU, 0.217s wall-clock]
Translator variables: 46
Translator derived variables: 0
Translator facts: 388
Translator goal facts: 7
Translator mutex groups: 34
Translator total mutex groups size: 482
Translator operators: 2352
Translator axioms: 0
Translator task size: 19963
Translator peak memory: 45912 KB
Writing output... [0.310s CPU, 0.338s wall-clock]
Done! [3.590s CPU, 3.617s wall-clock]
planner.py version 0.0.1

Time:	 0.67s
Memory: 93MB

Iteration 1
Queue:		 [0]
Grounded Until:	 0
Solving...
Solving Time:	 0.00s
Memory:		 93MB (+0MB)
UNSAT
Iteration Time:	 0.00s

Iteration 2
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.35s
Memory:		 93MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.02s
Memory:		 99MB (+6MB)
UNSAT
Iteration Time:	 0.49s

Iteration 3
Queue:		 [10]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.40s
Memory:		 114MB (+15MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist3","crate7","pallet3","depot3")),1) occurs(action(("lift","hoist4","crate2","pallet4","distributor0")),1) occurs(action(("lift","hoist5","crate5","crate3","distributor1")),1) occurs(action(("lift","hoist6","crate4","pallet8","distributor2")),1) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),1) occurs(action(("lift","hoist0","crate6","pallet0","depot0")),1) occurs(action(("drive","truck2","depot2","depot1")),1) occurs(action(("drive","truck0","depot0","distributor1")),1) occurs(action(("drive","truck1","distributor0","distributor3")),1) occurs(action(("drive","truck3","distributor3","distributor2")),1) occurs(action(("drop","hoist3","crate7","pallet3","depot3")),2) occurs(action(("load","hoist5","crate5","truck0","distributor1")),2) occurs(action(("load","hoist6","crate4","truck3","distributor2")),2) occurs(action(("load","hoist1","crate1","truck2","depot1")),2) occurs(action(("lift","hoist3","crate7","pallet3","depot3")),3) occurs(action(("lift","hoist5","crate3","pallet5","distributor1")),3) occurs(action(("drive","truck3","distributor2","distributor1")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drive","truck2","depot1","depot2")),3) occurs(action(("load","hoist0","crate6","truck0","depot0")),4) occurs(action(("drive","truck1","distributor3","depot3")),4) occurs(action(("load","hoist5","crate3","truck3","distributor1")),4) occurs(action(("drive","truck2","depot2","distributor2")),4) occurs(action(("unload","hoist5","crate4","truck3","distributor1")),5) occurs(action(("unload","hoist6","crate1","truck2","distributor2")),5) occurs(action(("load","hoist3","crate7","truck1","depot3")),5) occurs(action(("drive","truck0","depot0","distributor0")),5) occurs(action(("drop","hoist5","crate4","pallet5","distributor1")),6) occurs(action(("drop","hoist6","crate1","pallet8","distributor2")),6) occurs(action(("drive","truck2","distributor2","depot3")),6) occurs(action(("lift","hoist3","crate0","pallet9","depot3")),6) occurs(action(("drive","truck1","depot3","distributor1")),6) occurs(action(("drive","truck3","distributor1","distributor2")),6) occurs(action(("load","hoist4","crate2","truck0","distributor0")),6) occurs(action(("unload","hoist5","crate7","truck1","distributor1")),7) occurs(action(("unload","hoist4","crate6","truck0","distributor0")),7) occurs(action(("unload","hoist6","crate3","truck3","distributor2")),7) occurs(action(("load","hoist3","crate0","truck2","depot3")),7) occurs(action(("drop","hoist5","crate7","crate4","distributor1")),8) occurs(action(("drop","hoist4","crate6","pallet4","distributor0")),8) occurs(action(("drop","hoist6","crate3","crate1","distributor2")),8) occurs(action(("drive","truck3","distributor2","depot0")),8) occurs(action(("drive","truck0","distributor0","distributor1")),8) occurs(action(("drive","truck2","depot3","distributor2")),8) occurs(action(("unload","hoist5","crate5","truck0","distributor1")),9) occurs(action(("unload","hoist6","crate0","truck2","distributor2")),9) occurs(action(("drop","hoist5","crate5","crate7","distributor1")),10) occurs(action(("drop","hoist6","crate0","pallet6","distributor2")),10)
Solving Time:	 0.10s
Memory:		 121MB (+7MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 1.877s (Solving: 0.09s 1st Model: 0.08s Unsat: 0.00s)
CPU Time     : 1.790s

Choices      : 1522    
Conflicts    : 258      (Analyzed: 257)
Restarts     : 3        (Average: 85.67 Last: 67)
Model-Level  : 73.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 257      (Deleted: 0)
  Binary     : 20       (Ratio:   7.78%)
  Ternary    : 10       (Ratio:   3.89%)
  Conflict   : 257      (Average Length:   86.9 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 257      (Average:  7.02 Max:  90 Sum:   1805)
  Executed   : 221      (Average:  5.68 Max:  90 Sum:   1461 Ratio:  80.94%)
  Bounded    : 36       (Average:  9.56 Max:  12 Sum:    344 Ratio:  19.06%)

Rules        : 65764   
Atoms        : 65764   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 29168    (Eliminated:    0 Frozen: 24491)
Constraints  : 248336   (Binary:  97.4% Ternary:   1.1% Other:   1.5%)

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