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-37.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-37.pddl Parsing... Parsing: [0.020s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.004s 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.140s CPU, 0.139s wall-clock] 1118 relevant atoms 738 auxiliary atoms 1856 final queue length 3191 total queue pushes Completing instantiation... [0.200s CPU, 0.196s wall-clock] Instantiating: [0.360s CPU, 0.360s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.028s wall-clock] Checking invariant weight... [0.010s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.011s wall-clock] Collecting mutex groups... [0.010s CPU, 0.003s wall-clock] Choosing groups... 19 uncovered facts Choosing groups: [0.010s CPU, 0.013s wall-clock] Building translation key... [0.000s CPU, 0.004s wall-clock] Computing fact groups: [0.080s CPU, 0.086s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.007s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.010s wall-clock] Translating task: [0.220s CPU, 0.226s wall-clock] 954 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 36 propositions removed Detecting unreachable propositions: [0.130s CPU, 0.126s wall-clock] Reordering and filtering variables... 37 of 37 variables necessary. 19 of 37 mutex groups necessary. 648 of 648 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.070s CPU, 0.069s wall-clock] Translator variables: 37 Translator derived variables: 0 Translator facts: 380 Translator goal facts: 17 Translator mutex groups: 19 Translator total mutex groups size: 361 Translator operators: 648 Translator axioms: 0 Translator task size: 5601 Translator peak memory: 36440 KB Writing output... [0.090s CPU, 0.095s wall-clock] Done! [1.000s CPU, 1.006s wall-clock] planner.py version 0.0.1 Time: 0.22s Memory: 56MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.09s Memory: 61MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 65MB (+4MB) UNSAT Iteration Time: 0.13s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.04s Memory: 66MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 67MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.04s Memory: 67MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 68MB (+1MB) UNSAT Iteration Time: 0.06s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.10s Memory: 71MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 73MB (+2MB) UNSAT Iteration Time: 0.14s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.12s Memory: 79MB (+6MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 82MB (+3MB) UNSAT Iteration Time: 0.16s 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.17s Memory: 91MB (+9MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 96MB (+5MB) UNSAT Iteration Time: 0.23s 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.30s Memory: 113MB (+17MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 118MB (+5MB) UNSAT Iteration Time: 0.42s 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.35s Memory: 136MB (+18MB) Unblocking actions... Solving... Solving Time: 1.66s Memory: 144MB (+8MB) UNSAT Iteration Time: 2.13s 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.72s Memory: 183MB (+39MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","b","l")),1) occurs(action(("put-down","b")),2) occurs(action(("unstack","l","m")),3) occurs(action(("put-down","l")),4) occurs(action(("unstack","m","f")),5) occurs(action(("put-down","m")),6) occurs(action(("unstack","f","j")),7) occurs(action(("stack","f","b")),8) occurs(action(("unstack","j","n")),9) occurs(action(("stack","j","l")),10) occurs(action(("unstack","n","i")),11) occurs(action(("stack","n","f")),12) occurs(action(("unstack","i","a")),13) occurs(action(("stack","i","j")),14) occurs(action(("unstack","a","e")),15) occurs(action(("stack","a","n")),16) occurs(action(("unstack","k","o")),17) occurs(action(("stack","k","i")),18) occurs(action(("unstack","o","g")),19) occurs(action(("put-down","o")),20) occurs(action(("unstack","e","d")),21) occurs(action(("put-down","e")),22) occurs(action(("pick-up","g")),23) occurs(action(("stack","g","e")),24) occurs(action(("unstack","k","i")),25) occurs(action(("put-down","k")),26) occurs(action(("unstack","a","n")),27) occurs(action(("stack","a","d")),28) occurs(action(("unstack","q","p")),29) occurs(action(("stack","q","i")),30) occurs(action(("unstack","p","c")),31) occurs(action(("stack","p","g")),32) occurs(action(("unstack","a","d")),33) occurs(action(("stack","a","o")),34) occurs(action(("unstack","q","i")),35) occurs(action(("stack","q","p")),36) occurs(action(("unstack","a","o")),37) occurs(action(("stack","a","m")),38) occurs(action(("pick-up","o")),39) occurs(action(("stack","o","q")),40) occurs(action(("unstack","a","m")),41) occurs(action(("stack","a","o")),42) occurs(action(("unstack","d","r")),43) occurs(action(("stack","d","a")),44) occurs(action(("unstack","c","h")),45) occurs(action(("stack","c","d")),46) occurs(action(("pick-up","k")),47) occurs(action(("stack","k","r")),48) occurs(action(("pick-up","h")),49) occurs(action(("put-down","h")),50) occurs(action(("unstack","n","f")),51) occurs(action(("stack","n","h")),52) occurs(action(("unstack","n","h")),53) occurs(action(("put-down","n")),54) occurs(action(("pick-up","m")),55) occurs(action(("stack","m","c")),56) occurs(action(("unstack","f","b")),57) occurs(action(("stack","f","h")),58) occurs(action(("pick-up","b")),59) occurs(action(("stack","b","m")),60) occurs(action(("unstack","i","j")),61) occurs(action(("stack","i","b")),62) occurs(action(("unstack","j","l")),63) occurs(action(("put-down","j")),64) occurs(action(("pick-up","l")),65) occurs(action(("stack","l","i")),66) occurs(action(("unstack","k","r")),67) occurs(action(("stack","k","l")),68) occurs(action(("unstack","f","h")),69) occurs(action(("stack","f","k")),70) occurs(action(("pick-up","r")),71) occurs(action(("stack","r","f")),72) occurs(action(("pick-up","n")),73) occurs(action(("stack","n","r")),74) occurs(action(("pick-up","j")),75) occurs(action(("stack","j","n")),76) occurs(action(("pick-up","h")),77) occurs(action(("stack","h","j")),78) Solving Time: 1.36s Memory: 198MB (+15MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 5.839s (Solving: 3.00s 1st Model: 1.32s Unsat: 1.67s) CPU Time : 5.820s Choices : 153235 Conflicts : 6250 (Analyzed: 6245) Restarts : 61 (Average: 102.38 Last: 188) Model-Level : 846.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 6245 (Deleted: 2881) Binary : 335 (Ratio: 5.36%) Ternary : 135 (Ratio: 2.16%) Conflict : 6245 (Average Length: 457.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6245 (Average: 22.65 Max: 1711 Sum: 141460) Executed : 6154 (Average: 21.99 Max: 1711 Sum: 137323 Ratio: 97.08%) Bounded : 91 (Average: 45.46 Max: 80 Sum: 4137 Ratio: 2.92%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 96761 (Eliminated: 0 Frozen: 77808) Constraints : 669608 (Binary: 94.2% Ternary: 3.9% Other: 2.0%) Memory Peak : 198MB Max. Length : 78 steps Sol. Length : 78 steps