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-12.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-12.pddl Parsing... Parsing: [0.020s 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.018s wall-clock] Preparing model... [0.010s CPU, 0.016s wall-clock] Generated 43 rules. Computing model... [0.580s CPU, 0.579s wall-clock] 4500 relevant atoms 3459 auxiliary atoms 7959 final queue length 17591 total queue pushes Completing instantiation... [1.380s CPU, 1.384s wall-clock] Instantiating: [2.010s CPU, 2.012s wall-clock] Computing fact groups... Finding invariants... 16 initial candidates Finding invariants: [0.040s CPU, 0.047s wall-clock] Checking invariant weight... [0.010s CPU, 0.005s wall-clock] Instantiating groups... [0.080s CPU, 0.082s wall-clock] Collecting mutex groups... [0.010s CPU, 0.004s wall-clock] Choosing groups... 39 uncovered facts Choosing groups: [0.020s CPU, 0.021s wall-clock] Building translation key... [0.010s CPU, 0.007s wall-clock] Computing fact groups: [0.200s CPU, 0.199s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.007s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.012s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.080s CPU, 0.076s wall-clock] Translating task: [1.660s CPU, 1.657s wall-clock] 5130 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 56 propositions removed Detecting unreachable propositions: [0.880s CPU, 0.878s wall-clock] Reordering and filtering variables... 59 of 59 variables necessary. 42 of 59 mutex groups necessary. 3570 of 3570 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.390s CPU, 0.393s wall-clock] Translator variables: 59 Translator derived variables: 0 Translator facts: 591 Translator goal facts: 11 Translator mutex groups: 42 Translator total mutex groups size: 747 Translator operators: 3570 Translator axioms: 0 Translator task size: 33628 Translator peak memory: 53848 KB Writing output... [0.510s CPU, 0.551s wall-clock] Done! [5.760s CPU, 5.798s wall-clock] planner.py version 0.0.1 Time: 1.15s Memory: 128MB 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: 128MB (+0MB) UNSAT Iteration Time: 0.01s 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.65s Memory: 128MB (+0MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 137MB (+9MB) UNSAT Iteration Time: 0.90s 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.73s Memory: 160MB (+23MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 170MB (+10MB) UNSAT Iteration Time: 1.01s 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.68s Memory: 188MB (+18MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 202MB (+14MB) UNSAT Iteration Time: 0.95s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.71s Memory: 221MB (+19MB) Unblocking actions... Solving... Solving Time: 0.11s Memory: 236MB (+15MB) UNSAT Iteration Time: 1.07s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.88s Memory: 263MB (+27MB) Unblocking actions... Solving... Solving Time: 16.91s Memory: 365MB (+102MB) UNKNOWN Iteration Time: 18.08s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.69s Memory: 365MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("lift","hoist3","crate4","crate2","distributor0")),1) occurs(action(("lift","hoist5","crate13","crate9","distributor2")),1) occurs(action(("lift","hoist4","crate14","crate11","distributor1")),1) occurs(action(("lift","hoist1","crate12","crate10","depot1")),1) occurs(action(("drive","truck0","distributor1","depot1")),1) occurs(action(("drive","truck1","depot1","distributor2")),1) occurs(action(("load","hoist5","crate13","truck1","distributor2")),2) occurs(action(("load","hoist1","crate12","truck0","depot1")),2) occurs(action(("lift","hoist1","crate10","crate5","depot1")),3) occurs(action(("lift","hoist5","crate9","crate8","distributor2")),3) occurs(action(("drive","truck0","depot1","distributor1")),3) occurs(action(("drive","truck1","distributor2","depot1")),3) occurs(action(("load","hoist4","crate14","truck0","distributor1")),4) occurs(action(("load","hoist1","crate10","truck1","depot1")),4) occurs(action(("lift","hoist4","crate11","pallet4","distributor1")),5) occurs(action(("drive","truck0","distributor1","distributor2")),5) occurs(action(("lift","hoist1","crate5","crate1","depot1")),5) occurs(action(("load","hoist5","crate9","truck0","distributor2")),6) occurs(action(("load","hoist1","crate5","truck1","depot1")),6) occurs(action(("lift","hoist1","crate1","pallet1","depot1")),7) occurs(action(("lift","hoist5","crate8","crate7","distributor2")),7) occurs(action(("load","hoist1","crate1","truck1","depot1")),8) occurs(action(("load","hoist5","crate8","truck0","distributor2")),8) occurs(action(("unload","hoist1","crate13","truck1","depot1")),9) occurs(action(("lift","hoist5","crate7","crate6","distributor2")),9) occurs(action(("drop","hoist1","crate13","pallet1","depot1")),10) occurs(action(("drive","truck1","depot1","distributor1")),10) occurs(action(("load","hoist5","crate7","truck0","distributor2")),10) occurs(action(("lift","hoist5","crate6","crate3","distributor2")),11) occurs(action(("load","hoist4","crate11","truck1","distributor1")),11) occurs(action(("load","hoist5","crate6","truck0","distributor2")),12) occurs(action(("drive","truck1","distributor1","distributor2")),12) occurs(action(("lift","hoist5","crate3","crate0","distributor2")),13) occurs(action(("drive","truck0","distributor2","distributor0")),13) occurs(action(("load","hoist5","crate3","truck1","distributor2")),14) occurs(action(("load","hoist3","crate4","truck0","distributor0")),14) occurs(action(("lift","hoist3","crate2","pallet3","distributor0")),15) occurs(action(("lift","hoist5","crate0","pallet5","distributor2")),15) occurs(action(("load","hoist3","crate2","truck0","distributor0")),16) occurs(action(("load","hoist5","crate0","truck1","distributor2")),16) occurs(action(("drive","truck1","distributor2","distributor1")),17) occurs(action(("drive","truck0","distributor0","distributor1")),17) occurs(action(("unload","hoist4","crate0","truck1","distributor1")),18) occurs(action(("drop","hoist4","crate0","pallet4","distributor1")),19) occurs(action(("drive","truck1","distributor1","depot1")),19) occurs(action(("unload","hoist4","crate2","truck0","distributor1")),20) occurs(action(("unload","hoist1","crate10","truck1","depot1")),20) occurs(action(("drop","hoist4","crate2","crate0","distributor1")),21) occurs(action(("drop","hoist1","crate10","crate13","depot1")),21) occurs(action(("drive","truck1","depot1","depot0")),21) occurs(action(("drive","truck0","distributor1","depot2")),21) occurs(action(("unload","hoist2","crate9","truck0","depot2")),22) occurs(action(("unload","hoist0","crate5","truck1","depot0")),22) occurs(action(("drop","hoist2","crate9","pallet2","depot2")),23) occurs(action(("drop","hoist0","crate5","pallet0","depot0")),23) occurs(action(("drive","truck0","depot2","distributor2")),23) occurs(action(("drive","truck1","depot0","distributor2")),23) occurs(action(("unload","hoist5","crate12","truck0","distributor2")),24) occurs(action(("drop","hoist5","crate12","pallet5","distributor2")),25) occurs(action(("drive","truck0","distributor2","depot1")),25) occurs(action(("unload","hoist1","crate14","truck0","depot1")),26) occurs(action(("unload","hoist5","crate1","truck1","distributor2")),26) occurs(action(("drop","hoist1","crate14","crate10","depot1")),27) occurs(action(("drop","hoist5","crate1","crate12","distributor2")),27) occurs(action(("drive","truck1","distributor2","depot2")),27) occurs(action(("drive","truck0","depot1","distributor1")),27) occurs(action(("unload","hoist4","crate6","truck0","distributor1")),28) occurs(action(("unload","hoist2","crate3","truck1","depot2")),28) occurs(action(("drop","hoist4","crate6","crate2","distributor1")),29) occurs(action(("drop","hoist2","crate3","crate9","depot2")),29) occurs(action(("drive","truck1","depot2","distributor2")),29) occurs(action(("drive","truck0","distributor1","depot1")),30) Solving Time: 0.26s Memory: 376MB (+11MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 24.470s (Solving: 17.15s 1st Model: 0.19s Unsat: 0.09s) CPU Time : 24.400s Choices : 77454 (Domain: 77442) Conflicts : 9405 (Analyzed: 9402) Restarts : 100 (Average: 94.02 Last: 77) Model-Level : 584.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 9402 (Deleted: 6475) Binary : 29 (Ratio: 0.31%) Ternary : 8 (Ratio: 0.09%) Conflict : 9402 (Average Length: 5881.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 9402 (Average: 4.74 Max: 479 Sum: 44595) Executed : 9354 (Average: 4.64 Max: 479 Sum: 43630 Ratio: 97.84%) Bounded : 48 (Average: 20.10 Max: 32 Sum: 965 Ratio: 2.16%) Rules : 109657 Atoms : 109657 Bodies : 1 (Original: 0) Tight : Yes Variables : 139009 (Eliminated: 0 Frozen: 116017) Constraints : 1413565 (Binary: 97.8% Ternary: 1.0% Other: 1.2%) Memory Peak : 386MB Max. Length : 30 steps Sol. Length : 30 steps