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-47.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-47.pddl Parsing... Parsing: [0.020s CPU, 0.020s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock] Preparing model... [0.010s CPU, 0.012s wall-clock] Generated 21 rules. Computing model... [0.230s CPU, 0.239s wall-clock] 1773 relevant atoms 1173 auxiliary atoms 2946 final queue length 5113 total queue pushes Completing instantiation... [0.350s CPU, 0.355s wall-clock] Instantiating: [0.630s CPU, 0.628s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.019s wall-clock] Checking invariant weight... [0.000s CPU, 0.004s wall-clock] Instantiating groups... [0.030s CPU, 0.023s wall-clock] Collecting mutex groups... [0.000s CPU, 0.005s wall-clock] Choosing groups... 24 uncovered facts Choosing groups: [0.020s CPU, 0.022s wall-clock] Building translation key... [0.010s CPU, 0.008s wall-clock] Computing fact groups: [0.130s CPU, 0.128s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.008s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.012s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s CPU, 0.018s wall-clock] Translating task: [0.420s CPU, 0.419s wall-clock] 1564 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 46 propositions removed Detecting unreachable propositions: [0.230s CPU, 0.226s wall-clock] Reordering and filtering variables... 47 of 47 variables necessary. 24 of 47 mutex groups necessary. 1058 of 1058 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.150s CPU, 0.157s wall-clock] Translator variables: 47 Translator derived variables: 0 Translator facts: 600 Translator goal facts: 22 Translator mutex groups: 24 Translator total mutex groups size: 576 Translator operators: 1058 Translator axioms: 0 Translator task size: 9111 Translator peak memory: 41676 KB Writing output... [0.160s CPU, 0.165s wall-clock] Done! [1.780s CPU, 1.790s wall-clock] planner.py version 0.0.1 Time: 0.30s Memory: 68MB Iteration 1 Queue: [(0,80,0,True)] Grounded Until: 0 Expected Memory: 68MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('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]), ('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]), ('step', [79]), ('step', [80]), ('check', [80])] Grounding Time: 2.44s Memory: 300MB (+232MB) Unblocking actions... Solving... [start: stats after solve call] Models : 1+ Calls : 1 Time : 4.619s (Solving: 0.69s 1st Model: 0.68s Unsat: 0.00s) CPU Time : 4.568s Choices : 34911 (Domain: 34911) Conflicts : 194 (Analyzed: 194) Restarts : 2 (Average: 97.00 Last: 71) Model-Level : 858.0 Problems : 1 (Average Length: 82.00 Splits: 0) Lemmas : 194 (Deleted: 0) Binary : 1 (Ratio: 0.52%) Ternary : 0 (Ratio: 0.00%) Conflict : 194 (Average Length: 506.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 194 (Average: 185.25 Max: 1259 Sum: 35939) Executed : 171 (Average: 175.95 Max: 1259 Sum: 34135 Ratio: 94.98%) Bounded : 23 (Average: 78.43 Max: 82 Sum: 1804 Ratio: 5.02%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 141085 (Eliminated: 0 Frozen: 45697) Constraints : 958022 (Binary: 94.4% Ternary: 4.5% Other: 1.1%) Memory Peak : 480MB Max. Length : 0 steps Models : 1 [endof: stats after solve call] Solving Time: 0.79s Memory: 416MB (+116MB) SAT Testing... SERIALIZABLE Testing Time: 0.29s Memory: 416MB (+0MB) Answer: 1 occurs(action(("unstack","v","a")),1) occurs(action(("put-down","v")),2) occurs(action(("pick-up","b")),3) occurs(action(("stack","b","q")),4) occurs(action(("pick-up","v")),5) occurs(action(("put-down","v")),6) occurs(action(("unstack","a","k")),7) occurs(action(("put-down","a")),8) occurs(action(("unstack","k","n")),9) occurs(action(("put-down","k")),10) occurs(action(("unstack","f","h")),11) occurs(action(("put-down","f")),12) occurs(action(("unstack","h","s")),13) occurs(action(("stack","h","a")),14) occurs(action(("unstack","n","d")),15) occurs(action(("stack","n","k")),16) occurs(action(("unstack","d","i")),17) occurs(action(("put-down","d")),18) occurs(action(("unstack","i","m")),19) occurs(action(("put-down","i")),20) occurs(action(("unstack","m","j")),21) occurs(action(("put-down","m")),22) occurs(action(("unstack","j","o")),23) occurs(action(("put-down","j")),24) occurs(action(("unstack","o","t")),25) occurs(action(("stack","o","i")),26) occurs(action(("unstack","t","l")),27) occurs(action(("put-down","t")),28) occurs(action(("unstack","l","c")),29) occurs(action(("stack","l","v")),30) occurs(action(("unstack","c","p")),31) occurs(action(("stack","c","n")),32) occurs(action(("unstack","p","e")),33) occurs(action(("stack","p","f")),34) occurs(action(("unstack","e","g")),35) occurs(action(("put-down","e")),36) occurs(action(("pick-up","g")),37) occurs(action(("stack","g","m")),38) occurs(action(("unstack","o","i")),39) occurs(action(("stack","o","g")),40) occurs(action(("unstack","l","v")),41) occurs(action(("stack","l","o")),42) occurs(action(("unstack","u","r")),43) occurs(action(("stack","u","l")),44) occurs(action(("unstack","b","q")),45) occurs(action(("stack","b","u")),46) occurs(action(("pick-up","v")),47) occurs(action(("stack","v","b")),48) occurs(action(("pick-up","s")),49) occurs(action(("stack","s","v")),50) occurs(action(("pick-up","t")),51) occurs(action(("stack","t","s")),52) occurs(action(("unstack","r","w")),53) occurs(action(("stack","r","t")),54) occurs(action(("unstack","p","f")),55) occurs(action(("stack","p","r")),56) occurs(action(("unstack","h","a")),57) occurs(action(("stack","h","p")),58) occurs(action(("unstack","c","n")),59) occurs(action(("stack","c","h")),60) occurs(action(("pick-up","w")),61) occurs(action(("stack","w","c")),62) occurs(action(("pick-up","d")),63) occurs(action(("stack","d","w")),64) occurs(action(("unstack","n","k")),65) occurs(action(("stack","n","d")),66) occurs(action(("pick-up","f")),67) occurs(action(("stack","f","n")),68) occurs(action(("pick-up","q")),69) occurs(action(("stack","q","f")),70) occurs(action(("pick-up","a")),71) occurs(action(("stack","a","q")),72) occurs(action(("pick-up","j")),73) occurs(action(("stack","j","a")),74) occurs(action(("pick-up","i")),75) occurs(action(("stack","i","j")),76) occurs(action(("pick-up","k")),77) occurs(action(("stack","k","i")),78) occurs(action(("pick-up","e")),79) occurs(action(("stack","e","k")),80) SATISFIABLE Models : 1+ Calls : 1 Time : 4.619s (Solving: 0.69s 1st Model: 0.68s Unsat: 0.00s) CPU Time : 4.568s Choices : 34911 (Domain: 34911) Conflicts : 194 (Analyzed: 194) Restarts : 2 (Average: 97.00 Last: 71) Model-Level : 858.0 Problems : 1 (Average Length: 82.00 Splits: 0) Lemmas : 194 (Deleted: 0) Binary : 1 (Ratio: 0.52%) Ternary : 0 (Ratio: 0.00%) Conflict : 194 (Average Length: 506.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 194 (Average: 185.25 Max: 1259 Sum: 35939) Executed : 171 (Average: 175.95 Max: 1259 Sum: 34135 Ratio: 94.98%) Bounded : 23 (Average: 78.43 Max: 82 Sum: 1804 Ratio: 5.02%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 141085 (Eliminated: 0 Frozen: 45697) Constraints : 958022 (Binary: 94.4% Ternary: 4.5% Other: 1.1%) Memory Peak : 480MB Max. Length : 80 steps Sol. Length : 80 steps Models : 1