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.017s 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.015s wall-clock] Generated 43 rules. Computing model... [0.360s CPU, 0.360s wall-clock] 2763 relevant atoms 2328 auxiliary atoms 5091 final queue length 10383 total queue pushes Completing instantiation... [0.820s CPU, 0.826s wall-clock] Instantiating: [1.240s CPU, 1.232s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.040s CPU, 0.043s 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.160s CPU, 0.161s 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.930s CPU, 0.927s 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.463s 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.220s CPU, 0.225s 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.350s CPU, 0.374s wall-clock] Done! [3.430s CPU, 3.455s wall-clock] planner.py version 0.0.1 Time: 0.67s Memory: 92MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.34s Memory: 98MB (+6MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 106MB (+8MB) UNSAT Iteration Time: 0.49s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.16s Memory: 107MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 111MB (+4MB) UNSAT Iteration Time: 0.21s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.19s Memory: 118MB (+7MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 118MB (+0MB) UNSAT Iteration Time: 0.25s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.37s Memory: 128MB (+10MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist3","crate9","crate2","distributor0")),1) occurs(action(("lift","hoist1","crate8","pallet1","depot1")),1) occurs(action(("lift","hoist4","crate0","pallet8","distributor1")),1) occurs(action(("drive","truck1","depot2","distributor0")),1) occurs(action(("drive","truck0","depot1","distributor1")),1) occurs(action(("load","hoist3","crate9","truck1","distributor0")),2) occurs(action(("lift","hoist5","crate3","pallet6","distributor2")),2) occurs(action(("lift","hoist0","crate5","crate1","depot0")),2) occurs(action(("drop","hoist1","crate8","pallet1","depot1")),2) occurs(action(("load","hoist4","crate0","truck0","distributor1")),2) occurs(action(("drive","truck1","distributor0","depot0")),3) occurs(action(("drive","truck0","distributor1","distributor0")),3) occurs(action(("lift","hoist4","crate7","crate6","distributor1")),3) occurs(action(("lift","hoist1","crate8","pallet1","depot1")),4) occurs(action(("drop","hoist4","crate7","pallet8","distributor1")),4) occurs(action(("load","hoist0","crate5","truck1","depot0")),4) occurs(action(("unload","hoist3","crate0","truck0","distributor0")),4) occurs(action(("drive","truck0","distributor0","depot0")),5) occurs(action(("lift","hoist0","crate1","pallet9","depot0")),5) occurs(action(("drive","truck1","depot0","distributor1")),5) occurs(action(("drop","hoist3","crate0","crate2","distributor0")),5) occurs(action(("lift","hoist4","crate6","pallet4","distributor1")),5) occurs(action(("load","hoist4","crate6","truck1","distributor1")),6) occurs(action(("lift","hoist3","crate0","crate2","distributor0")),6) occurs(action(("drop","hoist5","crate3","pallet5","distributor2")),6) occurs(action(("drive","truck1","distributor1","distributor2")),7) occurs(action(("load","hoist0","crate1","truck0","depot0")),7) occurs(action(("drop","hoist3","crate0","crate2","distributor0")),7) occurs(action(("drop","hoist1","crate8","pallet7","depot1")),7) occurs(action(("lift","hoist4","crate7","pallet8","distributor1")),8) occurs(action(("lift","hoist5","crate3","pallet5","distributor2")),8) occurs(action(("lift","hoist0","crate4","pallet0","depot0")),8) occurs(action(("drive","truck1","distributor2","depot1")),8) occurs(action(("drive","truck0","depot0","distributor1")),8) occurs(action(("unload","hoist1","crate6","truck1","depot1")),9) occurs(action(("load","hoist4","crate7","truck0","distributor1")),9) occurs(action(("drop","hoist5","crate3","pallet6","distributor2")),9) occurs(action(("drop","hoist1","crate6","pallet1","depot1")),10) occurs(action(("drive","truck1","depot1","distributor2")),10) occurs(action(("drive","truck0","distributor1","depot1")),10) occurs(action(("unload","hoist5","crate5","truck1","distributor2")),11) occurs(action(("unload","hoist1","crate7","truck0","depot1")),11) occurs(action(("drop","hoist1","crate7","crate6","depot1")),12) occurs(action(("drive","truck1","distributor2","depot1")),12) occurs(action(("drop","hoist5","crate5","crate3","distributor2")),12) occurs(action(("drive","truck0","depot1","distributor1")),12) occurs(action(("drop","hoist0","crate4","pallet0","depot0")),12) occurs(action(("unload","hoist1","crate9","truck1","depot1")),13) occurs(action(("lift","hoist5","crate5","crate3","distributor2")),13) occurs(action(("unload","hoist4","crate1","truck0","distributor1")),13) occurs(action(("drop","hoist1","crate9","crate7","depot1")),14) occurs(action(("drop","hoist5","crate5","pallet5","distributor2")),14) occurs(action(("drop","hoist4","crate1","pallet8","distributor1")),14) occurs(action(("drive","truck1","depot1","depot0")),14) occurs(action(("drive","truck0","distributor1","depot2")),14) Solving Time: 0.49s Memory: 137MB (+9MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 2.665s (Solving: 0.49s 1st Model: 0.48s Unsat: 0.01s) CPU Time : 2.620s Choices : 3546 Conflicts : 876 (Analyzed: 873) Restarts : 11 (Average: 79.36 Last: 76) Model-Level : 93.0 Problems : 4 (Average Length: 10.75 Splits: 0) Lemmas : 873 (Deleted: 0) Binary : 83 (Ratio: 9.51%) Ternary : 49 (Ratio: 5.61%) Conflict : 873 (Average Length: 68.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 873 (Average: 4.84 Max: 88 Sum: 4228) Executed : 809 (Average: 3.97 Max: 88 Sum: 3469 Ratio: 82.05%) Bounded : 64 (Average: 11.86 Max: 16 Sum: 759 Ratio: 17.95%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 44694 (Eliminated: 0 Frozen: 30958) Constraints : 396628 (Binary: 97.1% Ternary: 1.6% Other: 1.3%) Memory Peak : 137MB Max. Length : 14 steps Sol. Length : 14 steps