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-14.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-14.pddl Parsing... Parsing: [0.010s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock] Preparing model... [0.010s CPU, 0.016s wall-clock] Generated 43 rules. Computing model... [0.370s CPU, 0.363s wall-clock] 2763 relevant atoms 2328 auxiliary atoms 5091 final queue length 10383 total queue pushes Completing instantiation... [0.820s CPU, 0.822s wall-clock] Instantiating: [1.240s CPU, 1.233s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.030s CPU, 0.039s wall-clock] Checking invariant weight... [0.010s CPU, 0.005s wall-clock] Instantiating groups... [0.070s CPU, 0.070s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 42 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.150s CPU, 0.156s 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.920s CPU, 0.923s wall-clock] 3040 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 54 propositions removed Detecting unreachable propositions: [0.470s CPU, 0.464s wall-clock] Reordering and filtering variables... 48 of 48 variables necessary. 36 of 48 mutex groups necessary. 2080 of 2080 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.230s CPU, 0.224s wall-clock] Translator variables: 48 Translator derived variables: 0 Translator facts: 404 Translator goal facts: 7 Translator mutex groups: 36 Translator total mutex groups size: 496 Translator operators: 2080 Translator axioms: 0 Translator task size: 19515 Translator peak memory: 45400 KB Writing output... [0.300s CPU, 0.320s wall-clock] Done! [3.360s CPU, 3.393s wall-clock] planner.py version 0.0.1 Time: 0.68s Memory: 92MB Iteration 1 Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 92MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.35s Memory: 93MB (+1MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 98MB (+5MB) UNSAT Iteration Time: 0.48s Iteration 3 Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.40s Memory: 113MB (+15MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 120MB (+7MB) UNSAT Iteration Time: 0.54s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.38s Memory: 131MB (+11MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist3","crate9","crate2","distributor0")),1) occurs(action(("lift","hoist1","crate8","pallet1","depot1")),1) occurs(action(("drive","truck1","depot2","distributor0")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("lift","hoist0","crate5","crate1","depot0")),1) occurs(action(("lift","hoist4","crate7","crate6","distributor1")),1) occurs(action(("load","hoist3","crate9","truck1","distributor0")),2) occurs(action(("drop","hoist0","crate5","crate4","depot0")),2) occurs(action(("drop","hoist1","crate8","pallet7","depot1")),2) occurs(action(("load","hoist4","crate7","truck0","distributor1")),2) occurs(action(("lift","hoist0","crate1","pallet9","depot0")),3) occurs(action(("drive","truck1","distributor0","depot1")),3) occurs(action(("lift","hoist4","crate6","pallet4","distributor1")),3) occurs(action(("load","hoist4","crate6","truck0","distributor1")),4) occurs(action(("lift","hoist4","crate0","pallet8","distributor1")),5) occurs(action(("drive","truck0","distributor1","depot1")),5) occurs(action(("unload","hoist1","crate6","truck0","depot1")),6) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),6) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),7) occurs(action(("unload","hoist1","crate7","truck0","depot1")),8) occurs(action(("drop","hoist1","crate7","crate6","depot1")),9) occurs(action(("drive","truck0","depot1","depot0")),9) occurs(action(("unload","hoist1","crate9","truck1","depot1")),10) occurs(action(("load","hoist0","crate1","truck0","depot0")),10) occurs(action(("drop","hoist1","crate9","crate7","depot1")),11) occurs(action(("drive","truck1","depot1","depot0")),11) occurs(action(("drive","truck0","depot0","distributor1")),11) occurs(action(("lift","hoist0","crate5","crate4","depot0")),11) occurs(action(("unload","hoist4","crate1","truck0","distributor1")),12) occurs(action(("load","hoist0","crate5","truck1","depot0")),12) occurs(action(("lift","hoist1","crate8","pallet7","depot1")),12) occurs(action(("drop","hoist4","crate1","pallet8","distributor1")),13) occurs(action(("drive","truck1","depot0","distributor2")),13) occurs(action(("drive","truck0","distributor1","depot1")),13) occurs(action(("unload","hoist5","crate5","truck1","distributor2")),14) occurs(action(("lift","hoist4","crate0","pallet4","distributor1")),14) occurs(action(("drop","hoist5","crate5","pallet5","distributor2")),15) occurs(action(("drive","truck1","distributor2","depot0")),15) occurs(action(("load","hoist1","crate8","truck0","depot1")),15) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),15) Solving Time: 0.04s Memory: 142MB (+11MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 2.328s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.01s) CPU Time : 2.250s Choices : 274 (Domain: 259) Conflicts : 20 (Analyzed: 18) Restarts : 0 Model-Level : 215.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 18 (Deleted: 0) Binary : 4 (Ratio: 22.22%) Ternary : 0 (Ratio: 0.00%) Conflict : 18 (Average Length: 53.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 18 (Average: 6.28 Max: 24 Sum: 113) Executed : 14 (Average: 4.22 Max: 24 Sum: 76 Ratio: 67.26%) Bounded : 4 (Average: 9.25 Max: 12 Sum: 37 Ratio: 32.74%) Rules : 63832 Atoms : 63832 Bodies : 1 (Original: 0) Tight : Yes Variables : 41567 (Eliminated: 0 Frozen: 34173) Constraints : 415605 (Binary: 97.4% Ternary: 1.2% Other: 1.4%) Memory Peak : 142MB Max. Length : 15 steps Sol. Length : 15 steps