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-31.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-31.pddl Parsing... Parsing: [0.010s CPU, 0.012s wall-clock] Normalizing task... [0.010s 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] 797 relevant atoms 525 auxiliary atoms 1322 final queue length 2257 total queue pushes Completing instantiation... [0.140s CPU, 0.139s wall-clock] Instantiating: [0.250s CPU, 0.252s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.024s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.008s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 16 uncovered facts Choosing groups: [0.010s CPU, 0.009s wall-clock] Building translation key... [0.000s CPU, 0.003s wall-clock] Computing fact groups: [0.060s CPU, 0.064s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.005s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.007s wall-clock] Translating task: [0.160s CPU, 0.156s wall-clock] 660 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 30 propositions removed Detecting unreachable propositions: [0.080s CPU, 0.087s wall-clock] Reordering and filtering variables... 31 of 31 variables necessary. 16 of 31 mutex groups necessary. 450 of 450 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.049s wall-clock] Translator variables: 31 Translator derived variables: 0 Translator facts: 272 Translator goal facts: 14 Translator mutex groups: 16 Translator total mutex groups size: 256 Translator operators: 450 Translator axioms: 0 Translator task size: 3903 Translator peak memory: 35416 KB Writing output... [0.060s CPU, 0.068s wall-clock] Done! [0.700s CPU, 0.707s wall-clock] planner.py version 0.0.1 Time: 0.16s Memory: 53MB 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: 56MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 59MB (+3MB) UNSAT Iteration Time: 0.10s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.03s Memory: 59MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+1MB) UNSAT Iteration Time: 0.04s Iteration 3 Queue: [9] Grounded Until: 7 Grounding... [('step', [8]), ('step', [9]), ('check', [9])] Grounding Time: 0.03s Memory: 60MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 60MB (+0MB) UNSAT Iteration Time: 0.04s Iteration 4 Queue: [14] Grounded Until: 9 Grounding... [('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('check', [14])] Grounding Time: 0.08s Memory: 64MB (+4MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 66MB (+2MB) UNSAT Iteration Time: 0.10s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.07s Memory: 69MB (+3MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 71MB (+2MB) UNSAT Iteration Time: 0.10s 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.13s Memory: 79MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 82MB (+3MB) UNSAT Iteration Time: 0.18s 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.18s Memory: 92MB (+10MB) Unblocking actions... Solving... Solving Time: 0.08s Memory: 95MB (+3MB) UNSAT Iteration Time: 0.31s 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.28s Memory: 111MB (+16MB) Unblocking actions... Solving... Solving Time: 1.13s Memory: 119MB (+8MB) UNSAT Iteration Time: 1.49s 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.43s Memory: 144MB (+25MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","e","j")),1) occurs(action(("stack","e","m")),2) occurs(action(("unstack","j","d")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","d","l")),5) occurs(action(("stack","d","l")),6) occurs(action(("unstack","e","m")),7) occurs(action(("stack","e","i")),8) occurs(action(("unstack","f","k")),9) occurs(action(("put-down","f")),10) occurs(action(("unstack","d","l")),11) occurs(action(("stack","d","f")),12) occurs(action(("unstack","m","n")),13) occurs(action(("stack","m","k")),14) occurs(action(("unstack","e","i")),15) occurs(action(("put-down","e")),16) occurs(action(("pick-up","n")),17) occurs(action(("stack","n","d")),18) occurs(action(("unstack","l","c")),19) occurs(action(("stack","l","e")),20) occurs(action(("unstack","c","g")),21) occurs(action(("put-down","c")),22) occurs(action(("pick-up","g")),23) occurs(action(("stack","g","m")),24) occurs(action(("unstack","i","h")),25) occurs(action(("put-down","i")),26) occurs(action(("pick-up","h")),27) occurs(action(("stack","h","l")),28) occurs(action(("unstack","n","d")),29) occurs(action(("put-down","n")),30) occurs(action(("unstack","d","f")),31) occurs(action(("stack","d","n")),32) occurs(action(("unstack","b","a")),33) occurs(action(("stack","b","d")),34) occurs(action(("unstack","a","o")),35) occurs(action(("put-down","a")),36) occurs(action(("unstack","h","l")),37) occurs(action(("stack","h","o")),38) occurs(action(("unstack","b","d")),39) occurs(action(("stack","b","l")),40) occurs(action(("unstack","g","m")),41) occurs(action(("put-down","g")),42) occurs(action(("unstack","b","l")),43) occurs(action(("stack","b","f")),44) occurs(action(("unstack","m","k")),45) occurs(action(("put-down","m")),46) occurs(action(("pick-up","i")),47) occurs(action(("stack","i","k")),48) occurs(action(("unstack","i","k")),49) occurs(action(("stack","i","c")),50) occurs(action(("unstack","d","n")),51) occurs(action(("stack","d","a")),52) occurs(action(("pick-up","n")),53) occurs(action(("stack","n","i")),54) occurs(action(("unstack","d","a")),55) occurs(action(("stack","d","n")),56) occurs(action(("pick-up","j")),57) occurs(action(("stack","j","d")),58) occurs(action(("unstack","l","e")),59) occurs(action(("stack","l","j")),60) occurs(action(("unstack","b","f")),61) occurs(action(("stack","b","l")),62) occurs(action(("pick-up","a")),63) occurs(action(("stack","a","b")),64) occurs(action(("pick-up","e")),65) occurs(action(("stack","e","a")),66) occurs(action(("pick-up","f")),67) occurs(action(("stack","f","e")),68) occurs(action(("pick-up","m")),69) occurs(action(("stack","m","f")),70) occurs(action(("pick-up","k")),71) occurs(action(("stack","k","m")),72) occurs(action(("unstack","h","o")),73) occurs(action(("stack","h","k")),74) occurs(action(("pick-up","o")),75) occurs(action(("stack","o","h")),76) occurs(action(("pick-up","g")),77) occurs(action(("stack","g","o")),78) Solving Time: 0.35s Memory: 154MB (+10MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 3.425s (Solving: 1.52s 1st Model: 0.33s Unsat: 1.19s) CPU Time : 3.420s Choices : 90614 Conflicts : 4218 (Analyzed: 4211) Restarts : 41 (Average: 102.71 Last: 75) Model-Level : 631.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 4211 (Deleted: 942) Binary : 269 (Ratio: 6.39%) Ternary : 125 (Ratio: 2.97%) Conflict : 4211 (Average Length: 470.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 4211 (Average: 20.84 Max: 1207 Sum: 87754) Executed : 4149 (Average: 20.40 Max: 1207 Sum: 85910 Ratio: 97.90%) Bounded : 62 (Average: 29.74 Max: 80 Sum: 1844 Ratio: 2.10%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 70342 (Eliminated: 0 Frozen: 55667) Constraints : 512412 (Binary: 93.7% Ternary: 4.0% Other: 2.3%) Memory Peak : 155MB Max. Length : 78 steps Sol. Length : 78 steps