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-29.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-29.pddl Parsing... Parsing: [0.010s CPU, 0.013s 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.010s wall-clock] Preparing model... [0.000s CPU, 0.006s wall-clock] Generated 21 rules. Computing model... [0.100s CPU, 0.093s wall-clock] 702 relevant atoms 462 auxiliary atoms 1164 final queue length 1979 total queue pushes Completing instantiation... [0.120s CPU, 0.120s wall-clock] Instantiating: [0.230s CPU, 0.233s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.027s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.020s CPU, 0.010s wall-clock] Collecting mutex groups... [0.010s CPU, 0.002s wall-clock] Choosing groups... 15 uncovered facts Choosing groups: [0.010s CPU, 0.008s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [0.060s CPU, 0.067s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.004s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.006s wall-clock] Translating task: [0.140s CPU, 0.136s wall-clock] 574 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 28 propositions removed Detecting unreachable propositions: [0.070s CPU, 0.078s wall-clock] Reordering and filtering variables... 29 of 29 variables necessary. 15 of 29 mutex groups necessary. 392 of 392 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.044s wall-clock] Translator variables: 29 Translator derived variables: 0 Translator facts: 240 Translator goal facts: 13 Translator mutex groups: 15 Translator total mutex groups size: 225 Translator operators: 392 Translator axioms: 0 Translator task size: 3405 Translator peak memory: 34904 KB Writing output... [0.050s CPU, 0.057s wall-clock] Done! [0.630s CPU, 0.645s wall-clock] planner.py version 0.0.1 Time: 0.15s Memory: 52MB 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: 55MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 57MB (+2MB) UNSAT Iteration Time: 0.09s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.02s Memory: 57MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 58MB (+1MB) UNSAT Iteration Time: 0.03s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.03s Memory: 58MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 58MB (+0MB) UNSAT Iteration Time: 0.03s 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: 62MB (+4MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 63MB (+1MB) UNSAT Iteration Time: 0.09s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.06s Memory: 66MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 68MB (+2MB) UNSAT Iteration Time: 0.09s 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.10s Memory: 73MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 76MB (+3MB) UNSAT Iteration Time: 0.15s 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.17s Memory: 86MB (+10MB) Unblocking actions... Solving... Solving Time: 0.73s Memory: 94MB (+8MB) UNSAT Iteration Time: 0.95s 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.22s Memory: 108MB (+14MB) Unblocking actions... Solving... Solving Time: 1.49s Memory: 111MB (+3MB) UNSAT Iteration Time: 1.79s 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.40s Memory: 130MB (+19MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","g","d")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","a","j")),3) occurs(action(("put-down","a")),4) occurs(action(("unstack","j","h")),5) occurs(action(("put-down","j")),6) occurs(action(("unstack","h","m")),7) occurs(action(("put-down","h")),8) occurs(action(("unstack","m","k")),9) occurs(action(("stack","m","f")),10) occurs(action(("unstack","k","c")),11) occurs(action(("put-down","k")),12) occurs(action(("unstack","d","i")),13) occurs(action(("stack","d","g")),14) occurs(action(("unstack","i","n")),15) occurs(action(("stack","i","k")),16) occurs(action(("pick-up","a")),17) occurs(action(("stack","a","n")),18) occurs(action(("unstack","a","n")),19) occurs(action(("put-down","a")),20) occurs(action(("unstack","i","k")),21) occurs(action(("stack","i","k")),22) occurs(action(("unstack","c","l")),23) occurs(action(("stack","c","n")),24) occurs(action(("unstack","i","k")),25) occurs(action(("stack","i","m")),26) occurs(action(("unstack","i","m")),27) occurs(action(("stack","i","j")),28) occurs(action(("unstack","l","b")),29) occurs(action(("stack","l","a")),30) occurs(action(("unstack","b","e")),31) occurs(action(("put-down","b")),32) occurs(action(("unstack","l","a")),33) occurs(action(("stack","l","e")),34) occurs(action(("unstack","i","j")),35) occurs(action(("stack","i","j")),36) occurs(action(("unstack","m","f")),37) occurs(action(("stack","m","k")),38) occurs(action(("unstack","i","j")),39) occurs(action(("stack","i","j")),40) occurs(action(("unstack","c","n")),41) occurs(action(("stack","c","f")),42) occurs(action(("pick-up","n")),43) occurs(action(("stack","n","c")),44) occurs(action(("pick-up","h")),45) occurs(action(("put-down","h")),46) occurs(action(("unstack","n","c")),47) occurs(action(("stack","n","d")),48) occurs(action(("unstack","n","d")),49) occurs(action(("stack","n","l")),50) occurs(action(("pick-up","h")),51) occurs(action(("put-down","h")),52) occurs(action(("pick-up","a")),53) occurs(action(("stack","a","h")),54) occurs(action(("unstack","m","k")),55) occurs(action(("stack","m","a")),56) occurs(action(("unstack","d","g")),57) occurs(action(("stack","d","m")),58) occurs(action(("pick-up","g")),59) occurs(action(("stack","g","d")),60) occurs(action(("pick-up","k")),61) occurs(action(("stack","k","g")),62) occurs(action(("unstack","c","f")),63) occurs(action(("stack","c","k")),64) occurs(action(("unstack","n","l")),65) occurs(action(("stack","n","c")),66) occurs(action(("unstack","i","j")),67) occurs(action(("stack","i","n")),68) occurs(action(("pick-up","j")),69) occurs(action(("stack","j","i")),70) occurs(action(("pick-up","b")),71) occurs(action(("stack","b","j")),72) occurs(action(("pick-up","f")),73) occurs(action(("stack","f","b")),74) occurs(action(("unstack","l","e")),75) occurs(action(("stack","l","f")),76) occurs(action(("pick-up","e")),77) occurs(action(("stack","e","l")),78) Solving Time: 0.70s Memory: 139MB (+9MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.572s (Solving: 2.90s 1st Model: 0.68s Unsat: 2.22s) CPU Time : 4.560s Choices : 19394 Conflicts : 9504 (Analyzed: 9499) Restarts : 108 (Average: 87.95 Last: 54) Model-Level : 124.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 9499 (Deleted: 6111) Binary : 637 (Ratio: 6.71%) Ternary : 409 (Ratio: 4.31%) Conflict : 9499 (Average Length: 514.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 9499 (Average: 2.46 Max: 123 Sum: 23413) Executed : 9379 (Average: 1.98 Max: 123 Sum: 18803 Ratio: 80.31%) Bounded : 120 (Average: 38.42 Max: 80 Sum: 4610 Ratio: 19.69%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 61816 (Eliminated: 0 Frozen: 48386) Constraints : 416868 (Binary: 93.5% Ternary: 4.0% Other: 2.5%) Memory Peak : 139MB Max. Length : 78 steps Sol. Length : 78 steps