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-64.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-64.pddl Parsing... Parsing: [0.020s CPU, 0.014s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock] Preparing model... [0.010s CPU, 0.010s wall-clock] Generated 21 rules. Computing model... [0.360s CPU, 0.363s wall-clock] 3133 relevant atoms 2077 auxiliary atoms 5210 final queue length 9121 total queue pushes Completing instantiation... [0.640s CPU, 0.634s wall-clock] Instantiating: [1.020s CPU, 1.026s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.023s wall-clock] Checking invariant weight... [0.010s CPU, 0.005s wall-clock] Instantiating groups... [0.040s CPU, 0.039s wall-clock] Collecting mutex groups... [0.020s CPU, 0.009s wall-clock] Choosing groups... 32 uncovered facts Choosing groups: [0.060s CPU, 0.070s wall-clock] Building translation key... [0.010s CPU, 0.013s wall-clock] Computing fact groups: [0.250s CPU, 0.248s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock] Building dictionary for full mutex groups... [0.020s CPU, 0.014s wall-clock] Building mutex information... Building mutex information: [0.020s CPU, 0.023s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.030s CPU, 0.032s wall-clock] Translating task: [0.750s CPU, 0.754s wall-clock] 2852 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 62 propositions removed Detecting unreachable propositions: [0.420s CPU, 0.414s wall-clock] Reordering and filtering variables... 63 of 63 variables necessary. 32 of 63 mutex groups necessary. 1922 of 1922 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.230s CPU, 0.233s wall-clock] Translator variables: 63 Translator derived variables: 0 Translator facts: 1056 Translator goal facts: 30 Translator mutex groups: 32 Translator total mutex groups size: 1024 Translator operators: 1922 Translator axioms: 0 Translator task size: 16495 Translator peak memory: 46284 KB Writing output... [0.270s CPU, 0.294s wall-clock] Done! [3.040s CPU, 3.063s wall-clock] planner.py version 0.0.1 Time: 0.54s Memory: 83MB Iteration 1 Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 83MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.22s Memory: 88MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 92MB (+4MB) UNSAT Iteration Time: 0.32s Iteration 3 Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 5 Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.27s Memory: 105MB (+13MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 109MB (+4MB) UNSAT Iteration Time: 0.38s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.25s Memory: 118MB (+9MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 124MB (+6MB) UNSAT Iteration Time: 0.38s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.26s Memory: 132MB (+8MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 140MB (+8MB) UNSAT Iteration Time: 0.40s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.33s Memory: 154MB (+14MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 165MB (+11MB) UNSAT Iteration Time: 0.47s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.25s Memory: 171MB (+6MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 175MB (+4MB) UNSAT Iteration Time: 0.40s Iteration 8 Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.26s Memory: 187MB (+12MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 203MB (+16MB) UNSAT Iteration Time: 0.42s Iteration 9 Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.26s Memory: 205MB (+2MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 210MB (+5MB) UNSAT Iteration Time: 0.44s Iteration 10 Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.27s Memory: 219MB (+9MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 223MB (+4MB) UNSAT Iteration Time: 0.46s Iteration 11 Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 45 Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])] Grounding Time: 0.27s Memory: 233MB (+10MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 238MB (+5MB) UNSAT Iteration Time: 0.48s Iteration 12 Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True)] Grounded Until: 50 Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])] Grounding Time: 0.44s Memory: 259MB (+21MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 280MB (+21MB) UNSAT Iteration Time: 0.68s Iteration 13 Queue: [(12,60,0,True), (13,65,0,True)] Grounded Until: 55 Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])] Grounding Time: 0.29s Memory: 280MB (+0MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 285MB (+5MB) UNSAT Iteration Time: 0.57s Iteration 14 Queue: [(13,65,0,True)] Grounded Until: 60 Grounding... [('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('check', [65])] Grounding Time: 0.27s Memory: 295MB (+10MB) Unblocking actions... Solving... Solving Time: 0.15s Memory: 301MB (+6MB) UNSAT Iteration Time: 0.61s Iteration 15 Queue: [(14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)] Grounded Until: 65 Grounding... [('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('check', [70])] Grounding Time: 0.27s Memory: 309MB (+8MB) Unblocking actions... Solving... Solving Time: 0.55s Memory: 316MB (+7MB) UNSAT Iteration Time: 1.01s Iteration 16 Queue: [(15,75,0,True), (16,80,0,True), (17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)] Grounded Until: 70 Grounding... [('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('check', [75])] Grounding Time: 0.27s Memory: 325MB (+9MB) Unblocking actions... Solving... Solving Time: 0.39s Memory: 336MB (+11MB) UNSAT Iteration Time: 0.86s Iteration 17 Queue: [(16,80,0,True), (17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)] Grounded Until: 75 Grounding... [('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('check', [80])] Grounding Time: 0.30s Memory: 341MB (+5MB) Unblocking actions... Solving... Solving Time: 0.93s Memory: 370MB (+29MB) UNSAT Iteration Time: 1.44s Iteration 18 Queue: [(17,85,0,True), (18,90,0,True), (19,95,0,True), (20,100,0,True)] Grounded Until: 80 Grounding... [('step', [81]), ('step', [82]), ('step', [83]), ('step', [84]), ('step', [85]), ('check', [85])] Grounding Time: 0.30s Memory: 370MB (+0MB) Unblocking actions... Solving... Solving Time: 1.62s Memory: 374MB (+4MB) UNSAT Iteration Time: 2.12s Iteration 19 Queue: [(18,90,0,True), (19,95,0,True), (20,100,0,True)] Grounded Until: 85 Grounding... [('step', [86]), ('step', [87]), ('step', [88]), ('step', [89]), ('step', [90]), ('check', [90])] Grounding Time: 0.27s Memory: 386MB (+12MB) Unblocking actions... Solving... Solving Time: 2.01s Memory: 395MB (+9MB) UNSAT Iteration Time: 2.50s Iteration 20 Queue: [(19,95,0,True), (20,100,0,True)] Grounded Until: 90 Grounding... [('step', [91]), ('step', [92]), ('step', [93]), ('step', [94]), ('step', [95]), ('check', [95])] Grounding Time: 0.27s Memory: 408MB (+13MB) Unblocking actions... Solving... Solving Time: 1.97s Memory: 419MB (+11MB) UNSAT Iteration Time: 2.46s Iteration 21 Queue: [(20,100,0,True)] Grounded Until: 95 Grounding... [('step', [96]), ('step', [97]), ('step', [98]), ('step', [99]), ('step', [100]), ('check', [100])] Grounding Time: 0.28s Memory: 426MB (+7MB) Unblocking actions... Solving... Solving Time: 3.97s Memory: 436MB (+10MB) UNSAT Iteration Time: 4.48s Iteration 22 Queue: [(21,105,0,True), (22,110,0,True), (23,115,0,True), (24,120,0,True), (25,125,0,True), (26,130,0,True), (27,135,0,True)] Grounded Until: 100 Grounding... [('step', [101]), ('step', [102]), ('step', [103]), ('step', [104]), ('step', [105]), ('check', [105])] Grounding Time: 0.28s Memory: 436MB (+0MB) Unblocking actions... Solving... Solving Time: 13.64s Memory: 458MB (+22MB) UNKNOWN Iteration Time: 14.15s Iteration 23 Queue: [(22,110,0,True), (23,115,0,True), (24,120,0,True), (25,125,0,True), (26,130,0,True), (27,135,0,True)] Grounded Until: 105 Grounding... [('step', [106]), ('step', [107]), ('step', [108]), ('step', [109]), ('step', [110]), ('check', [110])] Grounding Time: 0.61s Memory: 501MB (+43MB) Unblocking actions... Solving... Solving Time: 0.19s Memory: 510MB (+9MB) SAT Testing... SERIALIZABLE Testing Time: 0.45s Memory: 522MB (+12MB) Answer: 1 occurs(action(("unstack","z","w")),1) occurs(action(("put-down","z")),2) occurs(action(("unstack","p","c")),3) occurs(action(("put-down","p")),4) occurs(action(("unstack","c","a")),5) occurs(action(("put-down","c")),6) occurs(action(("unstack","a","v")),7) occurs(action(("put-down","a")),8) occurs(action(("unstack","v","e")),9) occurs(action(("put-down","v")),10) occurs(action(("unstack","e","a1")),11) occurs(action(("put-down","e")),12) occurs(action(("unstack","a1","o")),13) occurs(action(("put-down","a1")),14) occurs(action(("unstack","o","g")),15) occurs(action(("stack","o","p")),16) occurs(action(("unstack","g","d")),17) occurs(action(("put-down","g")),18) occurs(action(("unstack","d","b")),19) occurs(action(("put-down","d")),20) occurs(action(("unstack","b","m")),21) occurs(action(("stack","b","e")),22) occurs(action(("unstack","m","l")),23) occurs(action(("put-down","m")),24) occurs(action(("unstack","l","y")),25) occurs(action(("put-down","l")),26) occurs(action(("unstack","n","j")),27) occurs(action(("put-down","n")),28) occurs(action(("unstack","j","s")),29) occurs(action(("put-down","j")),30) occurs(action(("pick-up","s")),31) occurs(action(("stack","s","l")),32) occurs(action(("unstack","w","t")),33) occurs(action(("stack","w","j")),34) occurs(action(("unstack","t","i")),35) occurs(action(("put-down","t")),36) occurs(action(("unstack","y","d1")),37) occurs(action(("put-down","y")),38) occurs(action(("unstack","d1","c1")),39) occurs(action(("put-down","d1")),40) occurs(action(("unstack","c1","e1")),41) occurs(action(("put-down","c1")),42) occurs(action(("unstack","e1","x")),43) occurs(action(("put-down","e1")),44) occurs(action(("unstack","x","q")),45) occurs(action(("put-down","x")),46) occurs(action(("unstack","q","b1")),47) occurs(action(("stack","q","r")),48) occurs(action(("unstack","b1","h")),49) occurs(action(("stack","b1","n")),50) occurs(action(("pick-up","h")),51) occurs(action(("stack","h","s")),52) occurs(action(("pick-up","a")),53) occurs(action(("stack","a","h")),54) occurs(action(("pick-up","v")),55) occurs(action(("stack","v","a")),56) occurs(action(("unstack","o","p")),57) occurs(action(("stack","o","v")),58) occurs(action(("pick-up","i")),59) occurs(action(("stack","i","o")),60) occurs(action(("pick-up","y")),61) occurs(action(("stack","y","i")),62) occurs(action(("unstack","k","u")),63) occurs(action(("stack","k","x")),64) occurs(action(("pick-up","u")),65) occurs(action(("stack","u","y")),66) occurs(action(("unstack","b","e")),67) occurs(action(("stack","b","u")),68) occurs(action(("pick-up","z")),69) occurs(action(("stack","z","b")),70) occurs(action(("pick-up","d1")),71) occurs(action(("stack","d1","z")),72) occurs(action(("unstack","k","x")),73) occurs(action(("stack","k","d1")),74) occurs(action(("pick-up","p")),75) occurs(action(("stack","p","k")),76) occurs(action(("unstack","w","j")),77) occurs(action(("stack","w","p")),78) occurs(action(("pick-up","x")),79) occurs(action(("stack","x","w")),80) occurs(action(("unstack","b1","n")),81) occurs(action(("stack","b1","x")),82) occurs(action(("pick-up","d")),83) occurs(action(("stack","d","b1")),84) occurs(action(("pick-up","e")),85) occurs(action(("stack","e","d")),86) occurs(action(("unstack","q","r")),87) occurs(action(("stack","q","e")),88) occurs(action(("pick-up","m")),89) occurs(action(("stack","m","q")),90) occurs(action(("pick-up","t")),91) occurs(action(("stack","t","m")),92) occurs(action(("pick-up","c")),93) occurs(action(("stack","c","t")),94) occurs(action(("pick-up","e1")),95) occurs(action(("stack","e1","c")),96) occurs(action(("pick-up","a1")),97) occurs(action(("stack","a1","e1")),98) occurs(action(("unstack","r","f")),99) occurs(action(("stack","r","a1")),100) occurs(action(("pick-up","f")),101) occurs(action(("stack","f","r")),102) occurs(action(("pick-up","n")),103) occurs(action(("stack","n","f")),104) occurs(action(("pick-up","c1")),105) occurs(action(("stack","c1","n")),106) occurs(action(("pick-up","g")),107) occurs(action(("stack","g","c1")),108) occurs(action(("pick-up","j")),109) occurs(action(("stack","j","g")),110) SATISFIABLE Models : 1+ Calls : 23 Time : 36.596s (Solving: 24.92s 1st Model: 0.08s Unsat: 11.25s) CPU Time : 36.592s Choices : 377425 (Domain: 377425) Conflicts : 14084 (Analyzed: 14068) Restarts : 161 (Average: 87.38 Last: 87) Model-Level : 5046.0 Problems : 23 (Average Length: 57.00 Splits: 0) Lemmas : 14068 (Deleted: 8793) Binary : 566 (Ratio: 4.02%) Ternary : 18 (Ratio: 0.13%) Conflict : 14068 (Average Length: 1958.6 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 14068 (Average: 25.24 Max: 4684 Sum: 355038) Executed : 13896 (Average: 24.86 Max: 4684 Sum: 349759 Ratio: 98.51%) Bounded : 172 (Average: 30.69 Max: 102 Sum: 5279 Ratio: 1.49%) Rules : 50582 Atoms : 50582 Bodies : 1 (Original: 0) Tight : Yes Variables : 339958 (Eliminated: 0 Frozen: 111183) Constraints : 2179706 (Binary: 94.8% Ternary: 4.4% Other: 0.8%) Memory Peak : 550MB Max. Length : 110 steps Sol. Length : 110 steps Models : 1