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-40.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-40.pddl Parsing... Parsing: [0.010s CPU, 0.015s 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.011s wall-clock] Preparing model... [0.010s CPU, 0.008s wall-clock] Generated 21 rules. Computing model... [0.150s CPU, 0.152s wall-clock] 1237 relevant atoms 817 auxiliary atoms 2054 final queue length 3539 total queue pushes Completing instantiation... [0.220s CPU, 0.217s wall-clock] Instantiating: [0.390s CPU, 0.394s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.022s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.020s CPU, 0.012s wall-clock] Collecting mutex groups... [0.010s CPU, 0.003s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.010s CPU, 0.016s wall-clock] Building translation key... [0.010s CPU, 0.005s wall-clock] Computing fact groups: [0.090s CPU, 0.090s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.005s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.008s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s 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.139s 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.077s 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.100s CPU, 0.105s wall-clock] Done! [1.090s CPU, 1.103s 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.05s 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: 75MB (+6MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 77MB (+2MB) 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.12s Memory: 81MB (+4MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 84MB (+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.19s Memory: 94MB (+10MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 100MB (+6MB) 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: 119MB (+19MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 124MB (+5MB) UNSAT Iteration Time: 0.47s 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: 143MB (+19MB) Unblocking actions... Solving... Solving Time: 0.23s Memory: 153MB (+10MB) UNSAT Iteration Time: 0.76s 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: 190MB (+37MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","a","h")),1) occurs(action(("put-down","a")),2) occurs(action(("unstack","h","l")),3) occurs(action(("put-down","h")),4) occurs(action(("unstack","l","c")),5) occurs(action(("put-down","l")),6) occurs(action(("unstack","c","s")),7) occurs(action(("put-down","c")),8) occurs(action(("unstack","s","f")),9) occurs(action(("stack","s","h")),10) occurs(action(("unstack","f","p")),11) occurs(action(("stack","f","a")),12) occurs(action(("unstack","p","m")),13) occurs(action(("stack","p","q")),14) occurs(action(("unstack","m","g")),15) occurs(action(("put-down","m")),16) occurs(action(("unstack","g","j")),17) occurs(action(("stack","g","m")),18) occurs(action(("unstack","j","n")),19) occurs(action(("stack","j","p")),20) occurs(action(("unstack","n","i")),21) occurs(action(("stack","n","g")),22) occurs(action(("unstack","i","r")),23) occurs(action(("put-down","i")),24) occurs(action(("unstack","j","p")),25) occurs(action(("stack","j","i")),26) occurs(action(("unstack","p","q")),27) occurs(action(("stack","p","j")),28) occurs(action(("unstack","r","e")),29) occurs(action(("stack","r","n")),30) occurs(action(("unstack","o","b")),31) occurs(action(("stack","o","p")),32) occurs(action(("unstack","s","h")),33) occurs(action(("stack","s","e")),34) occurs(action(("unstack","r","n")),35) occurs(action(("put-down","r")),36) occurs(action(("unstack","n","g")),37) occurs(action(("put-down","n")),38) occurs(action(("unstack","f","a")),39) occurs(action(("stack","f","g")),40) occurs(action(("unstack","q","d")),41) occurs(action(("stack","q","f")),42) occurs(action(("pick-up","r")),43) occurs(action(("stack","r","q")),44) occurs(action(("unstack","o","p")),45) occurs(action(("stack","o","r")),46) occurs(action(("unstack","p","j")),47) occurs(action(("stack","p","c")),48) occurs(action(("unstack","j","i")),49) occurs(action(("put-down","j")),50) occurs(action(("pick-up","n")),51) occurs(action(("stack","n","o")),52) occurs(action(("unstack","p","c")),53) occurs(action(("stack","p","n")),54) occurs(action(("pick-up","d")),55) occurs(action(("stack","d","p")),56) occurs(action(("pick-up","a")),57) occurs(action(("stack","a","d")),58) occurs(action(("pick-up","h")),59) occurs(action(("stack","h","a")),60) occurs(action(("unstack","s","e")),61) occurs(action(("put-down","s")),62) occurs(action(("unstack","b","k")),63) occurs(action(("stack","b","h")),64) occurs(action(("pick-up","e")),65) occurs(action(("stack","e","b")),66) occurs(action(("pick-up","k")),67) occurs(action(("stack","k","e")),68) occurs(action(("pick-up","j")),69) occurs(action(("stack","j","k")),70) occurs(action(("pick-up","i")),71) occurs(action(("stack","i","j")),72) occurs(action(("pick-up","s")),73) occurs(action(("stack","s","i")),74) occurs(action(("pick-up","c")),75) occurs(action(("stack","c","s")),76) occurs(action(("pick-up","l")),77) occurs(action(("stack","l","c")),78) Solving Time: 0.73s Memory: 203MB (+13MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 4.057s (Solving: 0.94s 1st Model: 0.69s Unsat: 0.24s) CPU Time : 4.040s Choices : 67751 Conflicts : 1394 (Analyzed: 1390) Restarts : 15 (Average: 92.67 Last: 27) Model-Level : 297.0 Problems : 9 (Average Length: 30.11 Splits: 0) Lemmas : 1390 (Deleted: 0) Binary : 171 (Ratio: 12.30%) Ternary : 67 (Ratio: 4.82%) Conflict : 1390 (Average Length: 346.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1390 (Average: 50.09 Max: 1850 Sum: 69623) Executed : 1313 (Average: 47.36 Max: 1850 Sum: 65836 Ratio: 94.56%) Bounded : 77 (Average: 49.18 Max: 80 Sum: 3787 Ratio: 5.44%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 106222 (Eliminated: 0 Frozen: 85153) Constraints : 715773 (Binary: 94.3% Ternary: 3.8% Other: 1.9%) Memory Peak : 205MB Max. Length : 78 steps Sol. Length : 78 steps