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-42.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-42.pddl Parsing... Parsing: [0.020s CPU, 0.018s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.012s wall-clock] Preparing model... [0.020s CPU, 0.010s wall-clock] Generated 21 rules. Computing model... [0.170s CPU, 0.177s wall-clock] 1362 relevant atoms 900 auxiliary atoms 2262 final queue length 3904 total queue pushes Completing instantiation... [0.230s CPU, 0.238s wall-clock] Instantiating: [0.440s CPU, 0.444s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.023s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.020s CPU, 0.014s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 21 uncovered facts Choosing groups: [0.020s CPU, 0.016s wall-clock] Building translation key... [0.010s CPU, 0.005s wall-clock] Computing fact groups: [0.100s CPU, 0.097s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.005s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.009s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.012s wall-clock] Translating task: [0.280s CPU, 0.278s wall-clock] 1180 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 40 propositions removed Detecting unreachable propositions: [0.150s CPU, 0.154s wall-clock] Reordering and filtering variables... 41 of 41 variables necessary. 21 of 41 mutex groups necessary. 800 of 800 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.090s CPU, 0.088s wall-clock] Translator variables: 41 Translator derived variables: 0 Translator facts: 462 Translator goal facts: 19 Translator mutex groups: 21 Translator total mutex groups size: 441 Translator operators: 800 Translator axioms: 0 Translator task size: 6903 Translator peak memory: 37208 KB Writing output... [0.110s CPU, 0.116s wall-clock] Done! [1.220s CPU, 1.230s wall-clock] planner.py version 0.0.1 Time: 0.25s Memory: 59MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.12s Memory: 65MB (+6MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 69MB (+4MB) UNSAT Iteration Time: 0.16s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.05s Memory: 69MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 71MB (+2MB) UNSAT Iteration Time: 0.07s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.05s Memory: 71MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 71MB (+0MB) UNSAT Iteration Time: 0.07s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.14s Memory: 76MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 79MB (+3MB) UNSAT Iteration Time: 0.19s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.13s Memory: 83MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 86MB (+3MB) UNSAT Iteration Time: 0.18s Iteration 6 Queue: [27] Grounded Until: 19 Grounding... [('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('check', [27])] Grounding Time: 0.22s Memory: 99MB (+13MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 102MB (+3MB) UNSAT Iteration Time: 0.29s Iteration 7 Queue: [39] Grounded Until: 27 Grounding... [('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('check', [39])] Grounding Time: 0.35s Memory: 123MB (+21MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 129MB (+6MB) UNSAT Iteration Time: 0.48s Iteration 8 Queue: [55] Grounded Until: 39 Grounding... [('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.45s Memory: 152MB (+23MB) Unblocking actions... Solving... Solving Time: 0.20s Memory: 163MB (+11MB) UNSAT Iteration Time: 0.80s Iteration 9 Queue: [78] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('check', [78])] Grounding Time: 0.73s Memory: 203MB (+40MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","a","h")),1) occurs(action(("put-down","a")),2) occurs(action(("unstack","h","k")),3) occurs(action(("put-down","h")),4) occurs(action(("unstack","k","q")),5) occurs(action(("put-down","k")),6) occurs(action(("unstack","q","t")),7) occurs(action(("put-down","q")),8) occurs(action(("unstack","g","m")),9) occurs(action(("put-down","g")),10) occurs(action(("unstack","t","e")),11) occurs(action(("put-down","t")),12) occurs(action(("pick-up","m")),13) occurs(action(("stack","m","q")),14) occurs(action(("unstack","m","q")),15) occurs(action(("stack","m","t")),16) occurs(action(("unstack","e","i")),17) occurs(action(("put-down","e")),18) occurs(action(("unstack","i","b")),19) occurs(action(("put-down","i")),20) occurs(action(("unstack","b","p")),21) occurs(action(("stack","b","g")),22) occurs(action(("unstack","p","l")),23) occurs(action(("stack","p","k")),24) occurs(action(("unstack","l","d")),25) occurs(action(("stack","l","q")),26) occurs(action(("unstack","d","o")),27) occurs(action(("stack","d","e")),28) occurs(action(("unstack","o","j")),29) occurs(action(("put-down","o")),30) occurs(action(("unstack","d","e")),31) occurs(action(("stack","d","h")),32) occurs(action(("unstack","j","s")),33) occurs(action(("stack","j","o")),34) occurs(action(("unstack","s","c")),35) occurs(action(("stack","s","a")),36) occurs(action(("unstack","c","f")),37) occurs(action(("stack","c","d")),38) occurs(action(("unstack","f","r")),39) occurs(action(("stack","f","p")),40) occurs(action(("unstack","r","n")),41) occurs(action(("stack","r","e")),42) occurs(action(("unstack","b","g")),43) occurs(action(("stack","b","r")),44) occurs(action(("unstack","f","p")),45) occurs(action(("stack","f","b")),46) occurs(action(("unstack","m","t")),47) occurs(action(("stack","m","f")),48) occurs(action(("pick-up","g")),49) occurs(action(("stack","g","m")),50) occurs(action(("pick-up","t")),51) occurs(action(("stack","t","g")),52) occurs(action(("unstack","j","o")),53) occurs(action(("stack","j","t")),54) occurs(action(("unstack","l","q")),55) occurs(action(("stack","l","j")),56) occurs(action(("unstack","p","k")),57) occurs(action(("stack","p","l")),58) occurs(action(("pick-up","k")),59) occurs(action(("stack","k","p")),60) occurs(action(("unstack","c","d")),61) occurs(action(("stack","c","k")),62) occurs(action(("unstack","d","h")),63) occurs(action(("stack","d","c")),64) occurs(action(("unstack","s","a")),65) occurs(action(("stack","s","d")),66) occurs(action(("pick-up","o")),67) occurs(action(("stack","o","s")),68) occurs(action(("pick-up","i")),69) occurs(action(("stack","i","o")),70) occurs(action(("pick-up","q")),71) occurs(action(("stack","q","i")),72) occurs(action(("pick-up","a")),73) occurs(action(("stack","a","q")),74) occurs(action(("pick-up","n")),75) occurs(action(("stack","n","a")),76) occurs(action(("pick-up","h")),77) occurs(action(("stack","h","n")),78) Solving Time: 1.08s Memory: 216MB (+13MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.553s (Solving: 1.23s 1st Model: 1.04s Unsat: 0.18s) CPU Time : 4.530s Choices : 121569 Conflicts : 1812 (Analyzed: 1808) Restarts : 19 (Average: 95.16 Last: 57) Model-Level : 284.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 1808 (Deleted: 0) Binary : 194 (Ratio: 10.73%) Ternary : 57 (Ratio: 3.15%) Conflict : 1808 (Average Length: 580.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1808 (Average: 65.89 Max: 1771 Sum: 119135) Executed : 1775 (Average: 65.33 Max: 1771 Sum: 118124 Ratio: 99.15%) Bounded : 33 (Average: 30.64 Max: 78 Sum: 1011 Ratio: 0.85%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 115733 (Eliminated: 0 Frozen: 92221) Constraints : 813961 (Binary: 94.4% Ternary: 3.8% Other: 1.8%) Memory Peak : 219MB Max. Length : 78 steps Sol. Length : 78 steps