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-39.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-39.pddl Parsing... Parsing: [0.010s CPU, 0.016s wall-clock] Normalizing task... [0.000s CPU, 0.002s 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.009s wall-clock] Generated 21 rules. Computing model... [0.160s CPU, 0.164s wall-clock] 1237 relevant atoms 817 auxiliary atoms 2054 final queue length 3539 total queue pushes Completing instantiation... [0.220s CPU, 0.216s wall-clock] Instantiating: [0.400s CPU, 0.407s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.018s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.020s CPU, 0.013s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.010s CPU, 0.015s wall-clock] Building translation key... [0.010s CPU, 0.005s wall-clock] Computing fact groups: [0.090s CPU, 0.086s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s 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.008s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.011s wall-clock] Translating task: [0.260s CPU, 0.254s wall-clock] 1064 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 38 propositions removed Detecting unreachable propositions: [0.140s CPU, 0.141s wall-clock] Reordering and filtering variables... 39 of 39 variables necessary. 20 of 39 mutex groups necessary. 722 of 722 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.080s CPU, 0.078s wall-clock] Translator variables: 39 Translator derived variables: 0 Translator facts: 420 Translator goal facts: 18 Translator mutex groups: 20 Translator total mutex groups size: 400 Translator operators: 722 Translator axioms: 0 Translator task size: 6235 Translator peak memory: 36696 KB Writing output... [0.090s CPU, 0.103s wall-clock] Done! [1.090s CPU, 1.114s wall-clock] planner.py version 0.0.1 Time: 0.21s Memory: 57MB Iteration 1 Queue: [5] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.11s Memory: 64MB (+7MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 68MB (+4MB) UNSAT Iteration Time: 0.15s Iteration 2 Queue: [7] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('check', [7])] Grounding Time: 0.05s Memory: 68MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 69MB (+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: 69MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 69MB (+0MB) 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.13s Memory: 74MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 77MB (+3MB) UNSAT Iteration Time: 0.17s Iteration 5 Queue: [19] Grounded Until: 14 Grounding... [('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('check', [19])] Grounding Time: 0.11s Memory: 80MB (+3MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 84MB (+4MB) 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.19s Memory: 93MB (+9MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 98MB (+5MB) UNSAT Iteration Time: 0.26s 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.33s Memory: 118MB (+20MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 123MB (+5MB) UNSAT Iteration Time: 0.45s 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.39s Memory: 142MB (+19MB) Unblocking actions... Solving... Solving Time: 0.17s Memory: 152MB (+10MB) UNSAT Iteration Time: 0.70s 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.79s Memory: 188MB (+36MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","n","j")),1) occurs(action(("put-down","n")),2) occurs(action(("unstack","j","k")),3) occurs(action(("put-down","j")),4) occurs(action(("unstack","k","g")),5) occurs(action(("stack","k","s")),6) occurs(action(("unstack","g","a")),7) occurs(action(("put-down","g")),8) occurs(action(("unstack","a","r")),9) occurs(action(("stack","a","l")),10) occurs(action(("unstack","r","i")),11) occurs(action(("put-down","r")),12) occurs(action(("unstack","i","p")),13) occurs(action(("stack","i","a")),14) occurs(action(("unstack","p","m")),15) occurs(action(("put-down","p")),16) occurs(action(("unstack","k","s")),17) occurs(action(("stack","k","g")),18) occurs(action(("unstack","m","q")),19) occurs(action(("put-down","m")),20) occurs(action(("unstack","q","c")),21) occurs(action(("put-down","q")),22) occurs(action(("unstack","c","d")),23) occurs(action(("stack","c","k")),24) occurs(action(("unstack","i","a")),25) occurs(action(("stack","i","c")),26) occurs(action(("unstack","d","h")),27) occurs(action(("stack","d","q")),28) occurs(action(("unstack","h","o")),29) occurs(action(("put-down","h")),30) occurs(action(("unstack","o","e")),31) occurs(action(("stack","o","s")),32) occurs(action(("unstack","e","f")),33) occurs(action(("stack","e","o")),34) occurs(action(("unstack","f","b")),35) occurs(action(("stack","f","d")),36) occurs(action(("unstack","i","c")),37) occurs(action(("stack","i","a")),38) occurs(action(("unstack","e","o")),39) occurs(action(("stack","e","c")),40) occurs(action(("pick-up","n")),41) occurs(action(("stack","n","j")),42) occurs(action(("unstack","o","s")),43) occurs(action(("stack","o","e")),44) occurs(action(("pick-up","m")),45) occurs(action(("stack","m","o")),46) occurs(action(("pick-up","s")),47) occurs(action(("stack","s","m")),48) occurs(action(("unstack","i","a")),49) occurs(action(("stack","i","p")),50) occurs(action(("pick-up","b")),51) occurs(action(("stack","b","h")),52) occurs(action(("unstack","f","d")),53) occurs(action(("stack","f","s")),54) occurs(action(("unstack","n","j")),55) occurs(action(("stack","n","f")),56) occurs(action(("unstack","b","h")),57) occurs(action(("stack","b","n")),58) occurs(action(("pick-up","j")),59) occurs(action(("stack","j","b")),60) occurs(action(("unstack","a","l")),61) occurs(action(("stack","a","h")),62) occurs(action(("unstack","d","q")),63) occurs(action(("stack","d","j")),64) occurs(action(("unstack","i","p")),65) occurs(action(("stack","i","d")),66) occurs(action(("pick-up","r")),67) occurs(action(("stack","r","i")),68) occurs(action(("pick-up","l")),69) occurs(action(("stack","l","r")),70) occurs(action(("unstack","a","h")),71) occurs(action(("stack","a","l")),72) occurs(action(("pick-up","p")),73) occurs(action(("stack","p","a")),74) occurs(action(("pick-up","q")),75) occurs(action(("stack","q","p")),76) occurs(action(("pick-up","h")),77) occurs(action(("stack","h","q")),78) Solving Time: 1.18s Memory: 203MB (+15MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.433s (Solving: 1.31s 1st Model: 1.14s Unsat: 0.16s) CPU Time : 4.410s Choices : 55566 Conflicts : 2571 (Analyzed: 2567) Restarts : 25 (Average: 102.68 Last: 47) Model-Level : 297.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 2567 (Deleted: 957) Binary : 257 (Ratio: 10.01%) Ternary : 85 (Ratio: 3.31%) Conflict : 2567 (Average Length: 413.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2567 (Average: 19.55 Max: 1474 Sum: 50189) Executed : 2519 (Average: 18.71 Max: 1474 Sum: 48029 Ratio: 95.70%) Bounded : 48 (Average: 45.00 Max: 80 Sum: 2160 Ratio: 4.30%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 105498 (Eliminated: 0 Frozen: 83817) Constraints : 687402 (Binary: 94.3% Ternary: 3.8% Other: 1.9%) Memory Peak : 203MB Max. Length : 78 steps Sol. Length : 78 steps