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-7.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-7.pddl Parsing... Parsing: [0.010s CPU, 0.015s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock] Preparing model... [0.010s CPU, 0.010s wall-clock] Generated 43 rules. Computing model... [0.090s CPU, 0.090s wall-clock] 693 relevant atoms 630 auxiliary atoms 1323 final queue length 2339 total queue pushes Completing instantiation... [0.160s CPU, 0.159s wall-clock] Instantiating: [0.280s CPU, 0.283s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.040s CPU, 0.041s wall-clock] Checking invariant weight... [0.010s CPU, 0.003s wall-clock] Instantiating groups... [0.020s CPU, 0.024s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 24 uncovered facts Choosing groups: [0.000s CPU, 0.006s wall-clock] Building translation key... [0.010s CPU, 0.002s wall-clock] Computing fact groups: [0.090s CPU, 0.084s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.003s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.009s wall-clock] Translating task: [0.190s CPU, 0.181s wall-clock] 558 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 32 propositions removed Detecting unreachable propositions: [0.080s CPU, 0.088s wall-clock] Reordering and filtering variables... 29 of 29 variables necessary. 21 of 29 mutex groups necessary. 408 of 408 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.050s wall-clock] Translator variables: 29 Translator derived variables: 0 Translator facts: 156 Translator goal facts: 5 Translator mutex groups: 21 Translator total mutex groups size: 177 Translator operators: 408 Translator axioms: 0 Translator task size: 3877 Translator peak memory: 35416 KB Writing output... [0.060s CPU, 0.065s wall-clock] Done! [0.770s CPU, 0.782s wall-clock] planner.py version 0.0.1 Time: 0.18s Memory: 54MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.07s Memory: 56MB (+2MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 58MB (+2MB) UNSAT Iteration Time: 0.09s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.03s Memory: 58MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 59MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.03s Memory: 59MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+1MB) UNSAT Iteration Time: 0.05s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.07s Memory: 64MB (+4MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist0","crate5","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate4","crate0","distributor0")),1) occurs(action(("drive","truck0","distributor1","distributor0")),1) occurs(action(("lift","hoist2","crate1","pallet5","distributor1")),2) occurs(action(("load","hoist1","crate4","truck0","distributor0")),2) occurs(action(("drive","truck1","depot0","distributor1")),2) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),3) occurs(action(("load","hoist2","crate1","truck1","distributor1")),3) occurs(action(("drive","truck0","distributor0","distributor1")),3) occurs(action(("unload","hoist2","crate4","truck0","distributor1")),4) occurs(action(("drive","truck1","distributor1","depot0")),4) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),5) occurs(action(("load","hoist0","crate5","truck1","depot0")),5) occurs(action(("unload","hoist0","crate5","truck1","depot0")),6) occurs(action(("lift","hoist2","crate4","pallet5","distributor1")),6) occurs(action(("drop","hoist2","crate4","pallet5","distributor1")),7) occurs(action(("drive","truck0","distributor1","depot0")),7) occurs(action(("load","hoist0","crate5","truck0","depot0")),8) occurs(action(("drive","truck1","depot0","distributor1")),8) occurs(action(("lift","hoist2","crate3","crate2","distributor1")),8) occurs(action(("drop","hoist1","crate0","pallet1","distributor0")),8) occurs(action(("load","hoist2","crate3","truck1","distributor1")),9) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),10) occurs(action(("lift","hoist1","crate0","pallet1","distributor0")),10) occurs(action(("drop","hoist2","crate1","crate4","distributor1")),11) occurs(action(("drop","hoist1","crate0","pallet3","distributor0")),11) occurs(action(("drive","truck1","distributor1","distributor0")),11) occurs(action(("drive","truck0","depot0","distributor1")),11) occurs(action(("unload","hoist2","crate5","truck0","distributor1")),12) occurs(action(("unload","hoist1","crate3","truck1","distributor0")),12) occurs(action(("drop","hoist2","crate5","crate1","distributor1")),13) occurs(action(("drop","hoist1","crate3","pallet1","distributor0")),13) occurs(action(("drive","truck1","distributor0","distributor1")),14) Solving Time: 0.01s Memory: 65MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 4 Time : 0.474s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 0.460s Choices : 290 Conflicts : 81 (Analyzed: 78) Restarts : 0 Model-Level : 85.0 Problems : 4 (Average Length: 10.75 Splits: 0) Lemmas : 78 (Deleted: 0) Binary : 9 (Ratio: 11.54%) Ternary : 4 (Ratio: 5.13%) Conflict : 78 (Average Length: 30.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 78 (Average: 4.28 Max: 38 Sum: 334) Executed : 65 (Average: 2.83 Max: 38 Sum: 221 Ratio: 66.17%) Bounded : 13 (Average: 8.69 Max: 16 Sum: 113 Ratio: 33.83%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 12419 (Eliminated: 0 Frozen: 6660) Constraints : 83351 (Binary: 93.7% Ternary: 3.5% Other: 2.8%) Memory Peak : 66MB Max. Length : 14 steps Sol. Length : 14 steps