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-38.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-38.pddl Parsing... Parsing: [0.010s CPU, 0.012s 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.008s wall-clock] Preparing model... [0.010s CPU, 0.007s wall-clock] Generated 21 rules. Computing model... [0.120s CPU, 0.123s wall-clock] 1118 relevant atoms 738 auxiliary atoms 1856 final queue length 3191 total queue pushes Completing instantiation... [0.190s CPU, 0.195s wall-clock] Instantiating: [0.330s CPU, 0.337s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.023s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.010s CPU, 0.011s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 19 uncovered facts Choosing groups: [0.010s CPU, 0.013s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.090s CPU, 0.082s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.007s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.010s wall-clock] Translating task: [0.220s CPU, 0.227s wall-clock] 954 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 36 propositions removed Detecting unreachable propositions: [0.130s CPU, 0.126s wall-clock] Reordering and filtering variables... 37 of 37 variables necessary. 19 of 37 mutex groups necessary. 648 of 648 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.070s CPU, 0.069s wall-clock] Translator variables: 37 Translator derived variables: 0 Translator facts: 380 Translator goal facts: 17 Translator mutex groups: 19 Translator total mutex groups size: 361 Translator operators: 648 Translator axioms: 0 Translator task size: 5601 Translator peak memory: 36440 KB Writing output... [0.090s CPU, 0.096s wall-clock] Done! [0.960s CPU, 0.976s wall-clock] planner.py version 0.0.1 Time: 1.38s Memory: 125MB 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: 125MB (+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.38s Memory: 145MB (+20MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 148MB (+3MB) UNSAT Iteration Time: 0.46s 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.55s Memory: 166MB (+18MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 181MB (+15MB) UNSAT Iteration Time: 0.65s 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.37s Memory: 186MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 198MB (+12MB) UNSAT Iteration Time: 0.48s 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.37s Memory: 206MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 224MB (+18MB) UNSAT Iteration Time: 0.49s 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.38s Memory: 232MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 256MB (+24MB) UNSAT Iteration Time: 0.51s 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.38s Memory: 264MB (+8MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 296MB (+32MB) UNSAT Iteration Time: 0.52s 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.37s Memory: 296MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 318MB (+22MB) UNSAT Iteration Time: 0.51s 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.37s Memory: 318MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 344MB (+26MB) UNSAT Iteration Time: 0.52s 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.38s Memory: 344MB (+0MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 334MB (+-10MB) UNSAT Iteration Time: 0.57s 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.39s Memory: 354MB (+20MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 364MB (+10MB) UNSAT Iteration Time: 0.57s 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.39s Memory: 376MB (+12MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 380MB (+4MB) UNSAT Iteration Time: 0.58s 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.38s Memory: 393MB (+13MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 405MB (+12MB) UNSAT Iteration Time: 0.62s 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.38s Memory: 413MB (+8MB) Unblocking actions... Solving... Solving Time: 3.37s Memory: 455MB (+42MB) UNSAT Iteration Time: 3.93s 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.38s Memory: 478MB (+23MB) Unblocking actions... Solving... Answer: 1 occurs(action(("unstack","g","p")),1) occurs(action(("put-down","g")),2) occurs(action(("unstack","p","n")),3) occurs(action(("put-down","p")),4) occurs(action(("unstack","n","e")),5) occurs(action(("put-down","n")),6) occurs(action(("unstack","e","r")),7) occurs(action(("stack","e","n")),8) occurs(action(("unstack","r","i")),9) occurs(action(("put-down","r")),10) occurs(action(("unstack","i","f")),11) occurs(action(("stack","i","r")),12) occurs(action(("unstack","f","o")),13) occurs(action(("put-down","f")),14) occurs(action(("unstack","o","l")),15) occurs(action(("put-down","o")),16) occurs(action(("unstack","l","b")),17) occurs(action(("stack","l","o")),18) occurs(action(("unstack","b","d")),19) occurs(action(("stack","b","g")),20) occurs(action(("unstack","j","h")),21) occurs(action(("stack","j","b")),22) occurs(action(("unstack","d","q")),23) occurs(action(("put-down","d")),24) occurs(action(("unstack","q","m")),25) occurs(action(("stack","q","d")),26) occurs(action(("unstack","h","a")),27) occurs(action(("stack","h","f")),28) occurs(action(("unstack","m","c")),29) occurs(action(("put-down","m")),30) occurs(action(("pick-up","c")),31) occurs(action(("stack","c","a")),32) occurs(action(("unstack","h","f")),33) occurs(action(("put-down","h")),34) occurs(action(("unstack","l","o")),35) occurs(action(("stack","l","c")),36) occurs(action(("pick-up","p")),37) occurs(action(("stack","p","l")),38) occurs(action(("pick-up","k")),39) occurs(action(("stack","k","j")),40) occurs(action(("unstack","i","r")),41) occurs(action(("stack","i","p")),42) occurs(action(("unstack","k","j")),43) occurs(action(("stack","k","e")),44) occurs(action(("unstack","j","b")),45) occurs(action(("stack","j","i")),46) occurs(action(("unstack","k","e")),47) occurs(action(("stack","k","j")),48) occurs(action(("pick-up","o")),49) occurs(action(("stack","o","k")),50) occurs(action(("unstack","q","d")),51) occurs(action(("stack","q","o")),52) occurs(action(("pick-up","r")),53) occurs(action(("stack","r","q")),54) occurs(action(("pick-up","f")),55) occurs(action(("stack","f","r")),56) occurs(action(("unstack","e","n")),57) occurs(action(("stack","e","f")),58) occurs(action(("pick-up","n")),59) occurs(action(("stack","n","e")),60) occurs(action(("unstack","b","g")),61) occurs(action(("stack","b","n")),62) occurs(action(("pick-up","d")),63) occurs(action(("stack","d","b")),64) occurs(action(("pick-up","m")),65) occurs(action(("stack","m","d")),66) occurs(action(("pick-up","g")),67) occurs(action(("stack","g","m")),68) occurs(action(("pick-up","h")),69) occurs(action(("stack","h","g")),70) Solving Time: 0.21s Memory: 490MB (+12MB) SAT SATISFIABLE Models : 1+ Calls : 15 Time : 12.563s (Solving: 3.71s 1st Model: 0.18s Unsat: 3.53s) CPU Time : 12.560s Choices : 121581 Conflicts : 7106 (Analyzed: 7095) Restarts : 70 (Average: 101.36 Last: 65) Model-Level : 1082.0 Problems : 15 (Average Length: 37.00 Splits: 0) Lemmas : 7095 (Deleted: 2537) Binary : 319 (Ratio: 4.50%) Ternary : 170 (Ratio: 2.40%) Conflict : 7095 (Average Length: 1195.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 7095 (Average: 16.72 Max: 1760 Sum: 118662) Executed : 6955 (Average: 16.14 Max: 1760 Sum: 114531 Ratio: 96.52%) Bounded : 140 (Average: 29.51 Max: 67 Sum: 4131 Ratio: 3.48%) Rules : 635815 Atoms : 635815 Bodies : 1 (Original: 0) Tight : Yes Variables : 77099 (Eliminated: 0 Frozen: 66476) Constraints : 449161 (Binary: 93.9% Ternary: 4.7% Other: 1.5%) Memory Peak : 534MB Max. Length : 70 steps Sol. Length : 70 steps