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-10.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-10.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.010s CPU, 0.015s wall-clock]
Generated 43 rules.
Computing model... [0.180s CPU, 0.175s wall-clock]
1215 relevant atoms
1128 auxiliary atoms
2343 final queue length
4343 total queue pushes
Completing instantiation... [0.310s CPU, 0.309s wall-clock]
Instantiating: [0.530s CPU, 0.531s wall-clock]
Computing fact groups...
Finding invariants...
16 initial candidates
Finding invariants: [0.040s CPU, 0.046s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.040s CPU, 0.035s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
30 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.100s CPU, 0.106s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.018s wall-clock]
Translating task: [0.350s CPU, 0.348s wall-clock]
1080 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
38 propositions removed
Detecting unreachable propositions: [0.160s CPU, 0.170s wall-clock]
Reordering and filtering variables...
32 of 32 variables necessary.
24 of 32 mutex groups necessary.
816 of 816 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.090s CPU, 0.085s wall-clock]
Translator variables: 32
Translator derived variables: 0
Translator facts: 204
Translator goal facts: 4
Translator mutex groups: 24
Translator total mutex groups size: 252
Translator operators: 816
Translator axioms: 0
Translator task size: 7332
Translator peak memory: 37720 KB
Writing output... [0.120s CPU, 0.123s wall-clock]
Done! [1.400s CPU, 1.407s wall-clock]
planner.py version 0.0.1
Time: 0.29s
Memory: 63MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.12s
Memory: 65MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+4MB)
UNSAT
Iteration Time: 0.17s
Iteration 2
Queue: [7]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('check', [7])]
Grounding Time: 0.06s
Memory: 69MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 70MB (+1MB)
UNSAT
Iteration Time: 0.08s
Iteration 3
Queue: [9]
Grounded Until: 7
Grounding... [('step', [8]), ('step', [9]), ('check', [9])]
Grounding Time: 0.05s
Memory: 70MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.08s
Memory: 71MB (+1MB)
UNSAT
Iteration Time: 0.16s
Iteration 4
Queue: [14]
Grounded Until: 9
Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])]
Grounding Time: 0.15s
Memory: 79MB (+8MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("lift","hoist0","crate1","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),1) occurs(action(("drive","truck1","depot2","depot0")),1) occurs(action(("drive","truck0","depot1","distributor2")),1) occurs(action(("lift","hoist5","crate3","crate2","distributor2")),1) occurs(action(("lift","hoist2","crate4","pallet2","depot2")),1) occurs(action(("load","hoist5","crate3","truck0","distributor2")),2) occurs(action(("load","hoist0","crate1","truck1","depot0")),2) occurs(action(("lift","hoist5","crate2","pallet5","distributor2")),3) occurs(action(("lift","hoist3","crate5","pallet3","distributor0")),3) occurs(action(("drive","truck0","distributor2","depot0")),3) occurs(action(("drive","truck1","depot0","distributor0")),3) occurs(action(("drop","hoist1","crate0","pallet1","depot1")),3) occurs(action(("unload","hoist0","crate3","truck0","depot0")),4) occurs(action(("lift","hoist1","crate0","pallet1","depot1")),4) occurs(action(("drop","hoist5","crate2","pallet5","distributor2")),4) occurs(action(("load","hoist3","crate5","truck1","distributor0")),4) occurs(action(("drop","hoist0","crate3","pallet0","depot0")),5) occurs(action(("drive","truck1","distributor0","depot0")),5) occurs(action(("drive","truck0","depot0","distributor2")),5) occurs(action(("unload","hoist0","crate5","truck1","depot0")),6) occurs(action(("drive","truck0","distributor2","depot1")),6) occurs(action(("drop","hoist0","crate5","crate3","depot0")),7) occurs(action(("load","hoist1","crate0","truck0","depot1")),7) occurs(action(("drive","truck1","depot0","depot2")),7) occurs(action(("load","hoist2","crate4","truck1","depot2")),8) occurs(action(("drive","truck0","depot1","depot0")),8) occurs(action(("lift","hoist0","crate5","crate3","depot0")),8) occurs(action(("lift","hoist5","crate2","pallet5","distributor2")),9) occurs(action(("drive","truck1","depot2","distributor2")),9) occurs(action(("load","hoist0","crate5","truck0","depot0")),9) occurs(action(("load","hoist5","crate2","truck1","distributor2")),10) occurs(action(("unload","hoist0","crate5","truck0","depot0")),10) occurs(action(("unload","hoist5","crate4","truck1","distributor2")),11) occurs(action(("drop","hoist0","crate5","crate3","depot0")),11) occurs(action(("drive","truck0","depot0","distributor1")),11) occurs(action(("drop","hoist5","crate4","pallet5","distributor2")),12) occurs(action(("drive","truck1","distributor2","distributor0")),12) occurs(action(("drive","truck0","distributor1","distributor2")),12) occurs(action(("unload","hoist3","crate2","truck1","distributor0")),13) occurs(action(("unload","hoist5","crate0","truck0","distributor2")),13) occurs(action(("lift","hoist0","crate5","crate3","depot0")),13) occurs(action(("drop","hoist3","crate2","pallet3","distributor0")),14) occurs(action(("drop","hoist5","crate0","crate4","distributor2")),14) occurs(action(("drop","hoist0","crate5","crate3","depot0")),14) occurs(action(("drive","truck0","distributor2","distributor1")),14) occurs(action(("drive","truck1","distributor0","depot2")),14)
Solving Time: 0.26s
Memory: 82MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 1.158s (Solving: 0.34s 1st Model: 0.25s Unsat: 0.08s)
CPU Time : 1.130s
Choices : 3893
Conflicts : 1637 (Analyzed: 1634)
Restarts : 19 (Average: 86.00 Last: 28)
Model-Level : 68.0
Problems : 4 (Average Length: 10.75 Splits: 0)
Lemmas : 1634 (Deleted: 0)
Binary : 129 (Ratio: 7.89%)
Ternary : 99 (Ratio: 6.06%)
Conflict : 1634 (Average Length: 59.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1634 (Average: 3.24 Max: 40 Sum: 5295)
Executed : 1513 (Average: 2.35 Max: 40 Sum: 3836 Ratio: 72.45%)
Bounded : 121 (Average: 12.06 Max: 16 Sum: 1459 Ratio: 27.55%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 19810 (Eliminated: 0 Frozen: 12590)
Constraints : 146576 (Binary: 95.8% Ternary: 2.1% Other: 2.1%)
Memory Peak : 82MB
Max. Length : 14 steps
Sol. Length : 14 steps