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-17.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-17.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 43 rules.
Computing model... [0.420s CPU, 0.412s wall-clock]
3667 relevant atoms
1884 auxiliary atoms
5551 final queue length
12993 total queue pushes
Completing instantiation... [1.100s CPU, 1.103s wall-clock]
Instantiating: [1.560s CPU, 1.570s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.050s CPU, 0.050s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.080s CPU, 0.073s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
42 uncovered facts
Choosing groups: [0.020s CPU, 0.015s wall-clock]
Building translation key... [0.000s CPU, 0.005s wall-clock]
Computing fact groups: [0.170s CPU, 0.173s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.009s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.062s wall-clock]
Translating task: [1.320s CPU, 1.323s wall-clock]
3930 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [0.620s CPU, 0.616s wall-clock]
Reordering and filtering variables...
50 of 50 variables necessary.
36 of 50 mutex groups necessary.
2938 of 2938 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.290s CPU, 0.287s wall-clock]
Translator variables: 50
Translator derived variables: 0
Translator facts: 408
Translator goal facts: 7
Translator mutex groups: 36
Translator total mutex groups size: 556
Translator operators: 2938
Translator axioms: 0
Translator task size: 26125
Translator peak memory: 49496 KB
Writing output... [0.410s CPU, 0.439s wall-clock]
Done! [4.470s CPU, 4.499s wall-clock]
planner.py version 0.0.1

Time:	 0.90s
Memory: 109MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.49s
Memory:		 117MB (+8MB)
Unblocking actions...
Solving...
Solving Time:	 0.03s
Memory:		 128MB (+11MB)
UNSAT
Iteration Time:	 0.69s

Iteration 2
Queue:		 [7]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time:	 0.21s
Memory:		 129MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate3","pallet6","depot0")),1) occurs(action(("lift","hoist3","crate7","crate5","distributor1")),1) occurs(action(("lift","hoist1","crate4","pallet1","depot1")),1) occurs(action(("drive","truck1","distributor1","depot1")),1) occurs(action(("drive","truck3","depot0","depot1")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("lift","hoist7","crate8","crate6","distributor1")),1) occurs(action(("load","hoist7","crate8","truck0","distributor1")),2) occurs(action(("load","hoist3","crate7","truck0","distributor1")),2) occurs(action(("drive","truck3","depot1","distributor1")),2) occurs(action(("drive","truck1","depot1","distributor1")),2) occurs(action(("lift","hoist3","crate6","pallet7","distributor1")),3) occurs(action(("load","hoist1","crate4","truck2","depot1")),3) occurs(action(("drive","truck0","distributor1","depot0")),3) occurs(action(("drive","truck3","distributor1","depot0")),3) occurs(action(("unload","hoist6","crate8","truck0","depot0")),4) occurs(action(("unload","hoist4","crate7","truck0","depot0")),4) occurs(action(("load","hoist3","crate6","truck1","distributor1")),4) occurs(action(("drive","truck3","depot0","distributor0")),4) occurs(action(("drive","truck2","depot1","depot0")),4) occurs(action(("lift","hoist7","crate5","crate0","distributor1")),4) occurs(action(("drop","hoist6","crate8","pallet6","depot0")),5) occurs(action(("unload","hoist5","crate4","truck2","depot0")),5) occurs(action(("lift","hoist3","crate1","pallet5","distributor1")),5) occurs(action(("drive","truck1","distributor1","depot1")),5) occurs(action(("drive","truck3","distributor0","depot1")),5) occurs(action(("lift","hoist2","crate9","pallet2","distributor0")),5) occurs(action(("drop","hoist7","crate5","crate0","distributor1")),5) occurs(action(("drive","truck0","depot0","depot1")),5) occurs(action(("drop","hoist5","crate4","pallet0","depot0")),6) occurs(action(("drop","hoist0","crate3","crate8","depot0")),6) occurs(action(("drop","hoist3","crate1","pallet7","distributor1")),6) occurs(action(("unload","hoist1","crate6","truck1","depot1")),6) occurs(action(("drive","truck2","depot0","distributor0")),6) occurs(action(("drop","hoist2","crate9","crate2","distributor0")),6) occurs(action(("drop","hoist4","crate7","crate3","depot0")),7) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),7) occurs(action(("drive","truck2","distributor0","depot1")),7)
Solving Time:	 0.04s
Memory:		 134MB (+5MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 2
Time         : 1.971s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.00s)
CPU Time     : 1.900s

Choices      : 593     
Conflicts    : 99       (Analyzed: 98)
Restarts     : 1        (Average: 98.00 Last: 28)
Model-Level  : 95.0    
Problems     : 2        (Average Length: 8.00 Splits: 0)
Lemmas       : 98       (Deleted: 0)
  Binary     : 5        (Ratio:   5.10%)
  Ternary    : 9        (Ratio:   9.18%)
  Conflict   : 98       (Average Length:   40.6 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 98       (Average:  6.56 Max:  52 Sum:    643)
  Executed   : 82       (Average:  5.17 Max:  52 Sum:    507 Ratio:  78.85%)
  Bounded    : 16       (Average:  8.50 Max:   9 Sum:    136 Ratio:  21.15%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 30061    (Eliminated:    0 Frozen: 18474)
Constraints  : 179433   (Binary:  96.5% Ternary:   2.3% Other:   1.2%)

Memory Peak  : 134MB
Max. Length  : 7 steps
Sol. Length  : 7 steps