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.020s CPU, 0.018s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock] Preparing model... [0.000s CPU, 0.011s wall-clock] Generated 21 rules. Computing model... [0.180s CPU, 0.175s wall-clock] 1237 relevant atoms 817 auxiliary atoms 2054 final queue length 3539 total queue pushes Completing instantiation... [0.220s CPU, 0.218s wall-clock] Instantiating: [0.420s CPU, 0.424s 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.000s CPU, 0.003s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.020s CPU, 0.016s wall-clock] Building translation key... [0.010s CPU, 0.005s wall-clock] Computing fact groups: [0.090s CPU, 0.089s 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.253s 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.140s 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.100s CPU, 0.106s wall-clock] Done! [1.130s CPU, 1.138s wall-clock] planner.py version 0.0.1 Time: 1.82s Memory: 157MB 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.01s Memory: 157MB (+0MB) UNSAT Iteration Time: 0.01s 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.44s Memory: 185MB (+28MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 191MB (+6MB) UNSAT Iteration Time: 0.55s 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.45s Memory: 199MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 211MB (+12MB) UNSAT Iteration Time: 0.57s 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.46s Memory: 219MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 237MB (+18MB) UNSAT Iteration Time: 0.59s 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.46s Memory: 237MB (+0MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 254MB (+17MB) UNSAT Iteration Time: 0.63s 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.47s Memory: 260MB (+6MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 276MB (+16MB) UNSAT Iteration Time: 0.63s 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.47s Memory: 284MB (+8MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 320MB (+36MB) UNSAT Iteration Time: 0.64s 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.47s Memory: 320MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 347MB (+27MB) UNSAT Iteration Time: 0.64s 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.48s Memory: 347MB (+0MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 398MB (+51MB) UNSAT Iteration Time: 0.67s 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.48s Memory: 398MB (+0MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 403MB (+5MB) UNSAT Iteration Time: 0.68s 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.49s Memory: 403MB (+0MB) Unblocking actions... Solving... Solving Time: 0.09s Memory: 407MB (+4MB) UNSAT Iteration Time: 0.75s 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.49s Memory: 414MB (+7MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 449MB (+35MB) UNSAT Iteration Time: 0.75s 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.48s Memory: 451MB (+2MB) Unblocking actions... Solving... Solving Time: 0.13s Memory: 462MB (+11MB) UNSAT Iteration Time: 0.79s 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.49s Memory: 467MB (+5MB) Unblocking actions... Solving... Solving Time: 4.09s Memory: 517MB (+50MB) UNSAT Iteration Time: 4.76s 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.49s Memory: 541MB (+24MB) 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(("put-down","a")),10) occurs(action(("unstack","r","i")),11) occurs(action(("stack","r","l")),12) occurs(action(("unstack","i","p")),13) occurs(action(("put-down","i")),14) occurs(action(("unstack","p","m")),15) occurs(action(("put-down","p")),16) occurs(action(("unstack","m","q")),17) occurs(action(("stack","m","a")),18) occurs(action(("unstack","k","s")),19) occurs(action(("stack","k","g")),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","d","h")),25) occurs(action(("stack","d","q")),26) occurs(action(("unstack","h","o")),27) occurs(action(("put-down","h")),28) occurs(action(("unstack","o","e")),29) occurs(action(("stack","o","d")),30) occurs(action(("unstack","e","f")),31) occurs(action(("stack","e","c")),32) occurs(action(("unstack","o","d")),33) occurs(action(("stack","o","e")),34) occurs(action(("unstack","m","a")),35) occurs(action(("stack","m","o")),36) occurs(action(("pick-up","s")),37) occurs(action(("stack","s","m")),38) occurs(action(("unstack","f","b")),39) occurs(action(("stack","f","s")),40) occurs(action(("pick-up","n")),41) occurs(action(("stack","n","f")),42) occurs(action(("pick-up","b")),43) occurs(action(("stack","b","n")),44) occurs(action(("pick-up","j")),45) occurs(action(("stack","j","b")),46) occurs(action(("unstack","d","q")),47) occurs(action(("stack","d","j")),48) occurs(action(("pick-up","i")),49) occurs(action(("stack","i","d")),50) occurs(action(("unstack","r","l")),51) occurs(action(("stack","r","i")),52) occurs(action(("pick-up","l")),53) occurs(action(("stack","l","r")),54) occurs(action(("pick-up","a")),55) occurs(action(("stack","a","l")),56) occurs(action(("pick-up","p")),57) occurs(action(("stack","p","a")),58) occurs(action(("unstack","p","a")),59) occurs(action(("stack","p","a")),60) occurs(action(("unstack","p","a")),61) occurs(action(("stack","p","a")),62) occurs(action(("pick-up","q")),63) occurs(action(("stack","q","p")),64) occurs(action(("pick-up","h")),65) occurs(action(("stack","h","q")),66) occurs(action(("unstack","h","q")),67) occurs(action(("stack","h","q")),68) occurs(action(("unstack","h","q")),69) occurs(action(("stack","h","q")),70) Solving Time: 0.21s Memory: 556MB (+15MB) SAT SATISFIABLE Models : 1+ Calls : 15 Time : 15.390s (Solving: 4.51s 1st Model: 0.17s Unsat: 4.34s) CPU Time : 15.360s Choices : 113627 Conflicts : 6293 (Analyzed: 6283) Restarts : 65 (Average: 96.66 Last: 73) Model-Level : 303.0 Problems : 15 (Average Length: 37.00 Splits: 0) Lemmas : 6283 (Deleted: 2519) Binary : 376 (Ratio: 5.98%) Ternary : 174 (Ratio: 2.77%) Conflict : 6283 (Average Length: 3184.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 6283 (Average: 18.23 Max: 1554 Sum: 114550) Executed : 6101 (Average: 17.22 Max: 1554 Sum: 108163 Ratio: 94.42%) Bounded : 182 (Average: 35.09 Max: 72 Sum: 6387 Ratio: 5.58%) Rules : 781318 Atoms : 781318 Bodies : 1 (Original: 0) Tight : Yes Variables : 84854 (Eliminated: 0 Frozen: 73177) Constraints : 461840 (Binary: 93.9% Ternary: 4.6% Other: 1.4%) Memory Peak : 609MB Max. Length : 70 steps Sol. Length : 70 steps