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-8.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-8.pddl Parsing... Parsing: [0.020s CPU, 0.020s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.023s wall-clock] Preparing model... [0.020s CPU, 0.016s wall-clock] Generated 43 rules. Computing model... [0.200s CPU, 0.195s wall-clock] 1365 relevant atoms 1130 auxiliary atoms 2495 final queue length 4859 total queue pushes Completing instantiation... [0.350s CPU, 0.351s wall-clock] Instantiating: [0.590s CPU, 0.595s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.050s CPU, 0.047s wall-clock] Checking invariant weight... [0.000s CPU, 0.004s wall-clock] Instantiating groups... [0.040s CPU, 0.041s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 28 uncovered facts Choosing groups: [0.010s CPU, 0.010s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [0.120s CPU, 0.121s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.005s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s CPU, 0.019s wall-clock] Translating task: [0.410s CPU, 0.409s wall-clock] 1290 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 40 propositions removed Detecting unreachable propositions: [0.200s CPU, 0.203s wall-clock] Reordering and filtering variables... 41 of 41 variables necessary. 29 of 41 mutex groups necessary. 912 of 912 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.110s CPU, 0.109s wall-clock] Translator variables: 41 Translator derived variables: 0 Translator facts: 284 Translator goal facts: 7 Translator mutex groups: 29 Translator total mutex groups size: 329 Translator operators: 912 Translator axioms: 0 Translator task size: 8767 Translator peak memory: 38488 KB Writing output... [0.140s CPU, 0.145s wall-clock] Done! [1.620s CPU, 1.634s wall-clock] planner.py version 0.0.1 Time: 0.33s Memory: 66MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.15s Memory: 70MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 74MB (+4MB) UNSAT Iteration Time: 0.20s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.07s Memory: 74MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 75MB (+1MB) UNSAT Iteration Time: 0.09s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.08s Memory: 78MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 79MB (+1MB) UNSAT Iteration Time: 0.11s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.16s Memory: 85MB (+6MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist0","crate2","pallet0","depot0")),1) occurs(action(("drive","truck0","distributor0","distributor1")),1) occurs(action(("lift","hoist2","crate7","crate4","distributor1")),1) occurs(action(("lift","hoist1","crate6","crate5","distributor0")),1) occurs(action(("load","hoist2","crate7","truck0","distributor1")),2) occurs(action(("load","hoist1","crate6","truck1","distributor0")),2) occurs(action(("lift","hoist2","crate9","pallet2","distributor1")),3) occurs(action(("drive","truck1","distributor0","depot0")),3) occurs(action(("lift","hoist1","crate5","crate1","distributor0")),3) occurs(action(("drive","truck0","distributor1","distributor0")),3) occurs(action(("drop","hoist2","crate9","crate4","distributor1")),4) occurs(action(("load","hoist1","crate5","truck0","distributor0")),4) occurs(action(("drive","truck1","depot0","distributor0")),4) occurs(action(("lift","hoist1","crate1","pallet1","distributor0")),5) occurs(action(("drive","truck1","distributor0","distributor1")),5) occurs(action(("lift","hoist2","crate9","crate4","distributor1")),5) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),5) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),6) occurs(action(("load","hoist2","crate9","truck1","distributor1")),6) occurs(action(("load","hoist1","crate1","truck0","distributor0")),6) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),7) occurs(action(("unload","hoist2","crate6","truck1","distributor1")),7) occurs(action(("drop","hoist2","crate6","pallet2","distributor1")),8) occurs(action(("drive","truck1","distributor1","depot0")),8) occurs(action(("load","hoist1","crate0","truck0","distributor0")),8) occurs(action(("drop","hoist0","crate2","pallet0","depot0")),8) occurs(action(("unload","hoist0","crate9","truck1","depot0")),9) occurs(action(("unload","hoist1","crate7","truck0","distributor0")),9) occurs(action(("lift","hoist2","crate4","pallet3","distributor1")),9) occurs(action(("drop","hoist1","crate7","pallet1","distributor0")),10) occurs(action(("load","hoist0","crate9","truck1","depot0")),10) occurs(action(("drive","truck0","distributor0","distributor1")),10) occurs(action(("drop","hoist2","crate4","crate6","distributor1")),10) occurs(action(("lift","hoist0","crate2","pallet0","depot0")),11) occurs(action(("lift","hoist1","crate8","crate3","distributor0")),11) occurs(action(("unload","hoist2","crate0","truck0","distributor1")),11) occurs(action(("drop","hoist1","crate8","pallet4","distributor0")),12) occurs(action(("drop","hoist2","crate0","pallet3","distributor1")),12) occurs(action(("load","hoist0","crate2","truck1","depot0")),12) occurs(action(("unload","hoist0","crate9","truck1","depot0")),13) occurs(action(("lift","hoist1","crate3","pallet5","distributor0")),13) occurs(action(("unload","hoist2","crate1","truck0","distributor1")),13) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),14) occurs(action(("drop","hoist1","crate3","crate8","distributor0")),14) occurs(action(("drop","hoist2","crate1","crate0","distributor1")),14) occurs(action(("drive","truck0","distributor1","depot0")),14) occurs(action(("drive","truck1","depot0","distributor0")),14) Solving Time: 0.16s Memory: 88MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 1.140s (Solving: 0.17s 1st Model: 0.16s Unsat: 0.01s) CPU Time : 1.110s Choices : 1702 Conflicts : 584 (Analyzed: 581) Restarts : 6 (Average: 96.83 Last: 66) Model-Level : 59.0 Problems : 4 (Average Length: 10.75 Splits: 0) Lemmas : 581 (Deleted: 0) Binary : 47 (Ratio: 8.09%) Ternary : 36 (Ratio: 6.20%) Conflict : 581 (Average Length: 45.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 581 (Average: 4.01 Max: 43 Sum: 2332) Executed : 532 (Average: 2.85 Max: 43 Sum: 1657 Ratio: 71.05%) Bounded : 49 (Average: 13.78 Max: 16 Sum: 675 Ratio: 28.95%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 24448 (Eliminated: 0 Frozen: 14345) Constraints : 173694 (Binary: 95.2% Ternary: 2.6% Other: 2.1%) Memory Peak : 89MB Max. Length : 14 steps Sol. Length : 14 steps