INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-34.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-34.pddl Parsing... Parsing: [0.020s CPU, 0.014s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock] Preparing model... [0.010s CPU, 0.008s wall-clock] Generated 21 rules. Computing model... [0.110s CPU, 0.113s wall-clock] 898 relevant atoms 592 auxiliary atoms 1490 final queue length 2548 total queue pushes Completing instantiation... [0.160s CPU, 0.157s wall-clock] Instantiating: [0.290s CPU, 0.294s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.020s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.009s wall-clock] Collecting mutex groups... [0.010s CPU, 0.002s wall-clock] Choosing groups... 17 uncovered facts Choosing groups: [0.000s CPU, 0.010s wall-clock] Building translation key... [0.010s CPU, 0.003s wall-clock] Computing fact groups: [0.070s CPU, 0.066s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.006s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.008s wall-clock] Translating task: [0.180s CPU, 0.182s wall-clock] 752 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 32 propositions removed Detecting unreachable propositions: [0.100s CPU, 0.098s wall-clock] Reordering and filtering variables... 33 of 33 variables necessary. 17 of 33 mutex groups necessary. 512 of 512 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.057s wall-clock] Translator variables: 33 Translator derived variables: 0 Translator facts: 306 Translator goal facts: 15 Translator mutex groups: 17 Translator total mutex groups size: 289 Translator operators: 512 Translator axioms: 0 Translator task size: 4435 Translator peak memory: 35672 KB Writing output... [0.070s CPU, 0.074s wall-clock] Done! [0.800s CPU, 0.806s wall-clock] planner.py version 0.0.1 Time: 0.16s Memory: 54MB Iteration 1 Queue: [0] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 54MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 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 3 Queue: [10] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.08s Memory: 61MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 62MB (+1MB) UNSAT Iteration Time: 0.11s Iteration 4 Queue: [15] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.08s Memory: 65MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 67MB (+2MB) UNSAT Iteration Time: 0.11s Iteration 5 Queue: [20] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.08s Memory: 70MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 72MB (+2MB) UNSAT Iteration Time: 0.12s Iteration 6 Queue: [25] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.10s Memory: 76MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 79MB (+3MB) UNSAT Iteration Time: 0.13s Iteration 7 Queue: [30] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.08s Memory: 82MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 84MB (+2MB) UNSAT Iteration Time: 0.13s Iteration 8 Queue: [35] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.08s Memory: 87MB (+3MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 90MB (+3MB) UNSAT Iteration Time: 0.15s Iteration 9 Queue: [40] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.09s Memory: 92MB (+2MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 94MB (+2MB) UNSAT Iteration Time: 0.16s Iteration 10 Queue: [45] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.09s Memory: 97MB (+3MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 99MB (+2MB) UNSAT Iteration Time: 0.16s Iteration 11 Queue: [50] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 0.12s Memory: 104MB (+5MB) Unblocking actions... Solving... Solving Time: 0.60s Memory: 117MB (+13MB) UNSAT Iteration Time: 0.76s Iteration 12 Queue: [55] Grounded Until: 50 Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.09s Memory: 123MB (+6MB) Unblocking actions... Solving... Solving Time: 1.53s Memory: 136MB (+13MB) UNSAT Iteration Time: 1.66s Iteration 13 Queue: [60] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])] Grounding Time: 0.09s Memory: 141MB (+5MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","e","f")),1) occurs(action(("put-down","e")),2) occurs(action(("unstack","l","o")),3) occurs(action(("stack","l","e")),4) occurs(action(("unstack","f","h")),5) occurs(action(("put-down","f")),6) occurs(action(("unstack","h","b")),7) occurs(action(("put-down","h")),8) occurs(action(("unstack","b","c")),9) occurs(action(("put-down","b")),10) occurs(action(("unstack","c","m")),11) occurs(action(("stack","c","f")),12) occurs(action(("unstack","m","d")),13) occurs(action(("stack","m","c")),14) occurs(action(("unstack","d","a")),15) occurs(action(("put-down","d")),16) occurs(action(("unstack","a","p")),17) occurs(action(("put-down","a")),18) occurs(action(("unstack","p","n")),19) occurs(action(("stack","p","o")),20) occurs(action(("pick-up","a")),21) occurs(action(("stack","a","p")),22) occurs(action(("unstack","n","g")),23) occurs(action(("stack","n","a")),24) occurs(action(("unstack","g","i")),25) occurs(action(("put-down","g")),26) occurs(action(("unstack","m","c")),27) occurs(action(("stack","m","n")),28) occurs(action(("unstack","i","k")),29) occurs(action(("stack","i","b")),30) occurs(action(("unstack","k","j")),31) occurs(action(("stack","k","h")),32) occurs(action(("unstack","m","n")),33) occurs(action(("stack","m","n")),34) occurs(action(("unstack","l","e")),35) occurs(action(("stack","l","m")),36) occurs(action(("unstack","c","f")),37) occurs(action(("stack","c","l")),38) occurs(action(("pick-up","e")),39) occurs(action(("stack","e","g")),40) occurs(action(("unstack","i","b")),41) occurs(action(("put-down","i")),42) occurs(action(("unstack","e","g")),43) occurs(action(("stack","e","c")),44) occurs(action(("pick-up","g")),45) occurs(action(("stack","g","e")),46) occurs(action(("pick-up","j")),47) occurs(action(("stack","j","g")),48) occurs(action(("unstack","k","h")),49) occurs(action(("stack","k","j")),50) occurs(action(("pick-up","b")),51) occurs(action(("stack","b","k")),52) occurs(action(("pick-up","f")),53) occurs(action(("stack","f","b")),54) occurs(action(("pick-up","h")),55) occurs(action(("stack","h","f")),56) occurs(action(("pick-up","d")),57) occurs(action(("stack","d","h")),58) occurs(action(("pick-up","i")),59) occurs(action(("stack","i","d")),60) Solving Time: 0.19s Memory: 143MB (+2MB) SAT SATISFIABLE Models : 1+ Calls : 13 Time : 4.087s (Solving: 2.35s 1st Model: 0.16s Unsat: 2.18s) CPU Time : 4.070s Choices : 66260 Conflicts : 5266 (Analyzed: 5257) Restarts : 55 (Average: 95.58 Last: 53) Model-Level : 1001.0 Problems : 13 (Average Length: 32.00 Splits: 0) Lemmas : 5257 (Deleted: 1475) Binary : 301 (Ratio: 5.73%) Ternary : 189 (Ratio: 3.60%) Conflict : 5257 (Average Length: 1891.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 5257 (Average: 12.31 Max: 711 Sum: 64713) Executed : 5153 (Average: 11.86 Max: 711 Sum: 62327 Ratio: 96.31%) Bounded : 104 (Average: 22.94 Max: 62 Sum: 2386 Ratio: 3.69%) Rules : 14898 Atoms : 14898 Bodies : 1 (Original: 0) Tight : Yes Variables : 56762 (Eliminated: 0 Frozen: 47481) Constraints : 342599 (Binary: 93.7% Ternary: 3.9% Other: 2.4%) Memory Peak : 149MB Max. Length : 60 steps Sol. Length : 60 steps