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-43.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-43.pddl Parsing... Parsing: [0.010s CPU, 0.017s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s 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.210s CPU, 0.214s wall-clock] 1493 relevant atoms 987 auxiliary atoms 2480 final queue length 4288 total queue pushes Completing instantiation... [0.370s CPU, 0.369s wall-clock] Instantiating: [0.620s CPU, 0.615s wall-clock] Computing fact groups... Finding invariants... 10 initial candidates Finding invariants: [0.020s CPU, 0.026s wall-clock] Checking invariant weight... [0.000s CPU, 0.004s wall-clock] Instantiating groups... [0.030s CPU, 0.021s wall-clock] Collecting mutex groups... [0.000s CPU, 0.005s wall-clock] Choosing groups... 22 uncovered facts Choosing groups: [0.030s CPU, 0.026s wall-clock] Building translation key... [0.010s CPU, 0.008s wall-clock] Computing fact groups: [0.140s CPU, 0.139s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.008s wall-clock] Building mutex information... Building mutex information: [0.020s CPU, 0.013s 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.450s CPU, 0.448s wall-clock] 1302 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 42 propositions removed Detecting unreachable propositions: [0.230s CPU, 0.239s wall-clock] Reordering and filtering variables... 43 of 43 variables necessary. 22 of 43 mutex groups necessary. 882 of 882 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.130s CPU, 0.138s wall-clock] Translator variables: 43 Translator derived variables: 0 Translator facts: 506 Translator goal facts: 20 Translator mutex groups: 22 Translator total mutex groups size: 484 Translator operators: 882 Translator axioms: 0 Translator task size: 7605 Translator peak memory: 40908 KB Writing output... [0.170s CPU, 0.180s wall-clock] Done! [1.800s CPU, 1.820s wall-clock] planner.py version 0.0.1 Time: 0.27s Memory: 65MB Iteration 1 Queue: [(0,80,0,True)] Grounded Until: 0 Expected Memory: 65MB 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.05s Memory: 259MB (+194MB) Unblocking actions... Solving... [start: stats after solve call] Models : 1+ Calls : 1 Time : 3.689s (Solving: 0.38s 1st Model: 0.37s Unsat: 0.00s) CPU Time : 3.644s Choices : 11920 (Domain: 11920) Conflicts : 202 (Analyzed: 202) Restarts : 2 (Average: 101.00 Last: 82) Model-Level : 1309.0 Problems : 1 (Average Length: 82.00 Splits: 0) Lemmas : 202 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 202 (Average Length: 9.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 202 (Average: 130.47 Max: 161 Sum: 26355) Executed : 11 (Average: 52.94 Max: 161 Sum: 10693 Ratio: 40.57%) Bounded : 191 (Average: 82.00 Max: 82 Sum: 15662 Ratio: 59.43%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 118860 (Eliminated: 0 Frozen: 38303) Constraints : 743136 (Binary: 94.2% Ternary: 4.5% Other: 1.2%) Memory Peak : 437MB Max. Length : 0 steps Models : 1 [endof: stats after solve call] Solving Time: 0.47s Memory: 373MB (+114MB) SAT Testing... SERIALIZABLE Testing Time: 0.25s Memory: 373MB (+0MB) Answer: 1 occurs(action(("unstack","k","i")),1) occurs(action(("put-down","k")),2) occurs(action(("unstack","i","p")),3) occurs(action(("put-down","i")),4) occurs(action(("unstack","p","m")),5) occurs(action(("put-down","p")),6) occurs(action(("unstack","m","r")),7) occurs(action(("stack","m","i")),8) occurs(action(("unstack","r","c")),9) occurs(action(("put-down","r")),10) occurs(action(("unstack","c","s")),11) occurs(action(("put-down","c")),12) occurs(action(("unstack","s","e")),13) occurs(action(("put-down","s")),14) occurs(action(("unstack","e","q")),15) occurs(action(("put-down","e")),16) occurs(action(("unstack","q","n")),17) occurs(action(("put-down","q")),18) occurs(action(("unstack","n","b")),19) occurs(action(("stack","n","r")),20) occurs(action(("unstack","b","g")),21) occurs(action(("put-down","b")),22) occurs(action(("unstack","g","j")),23) occurs(action(("stack","g","q")),24) occurs(action(("unstack","j","a")),25) occurs(action(("stack","j","p")),26) occurs(action(("unstack","a","u")),27) occurs(action(("stack","a","e")),28) occurs(action(("unstack","u","d")),29) occurs(action(("stack","u","h")),30) occurs(action(("unstack","d","o")),31) occurs(action(("stack","d","s")),32) occurs(action(("unstack","o","t")),33) occurs(action(("put-down","o")),34) occurs(action(("unstack","t","l")),35) occurs(action(("stack","t","b")),36) occurs(action(("unstack","l","f")),37) occurs(action(("put-down","l")),38) occurs(action(("unstack","m","i")),39) occurs(action(("stack","m","f")),40) occurs(action(("unstack","a","e")),41) occurs(action(("stack","a","m")),42) occurs(action(("unstack","d","s")),43) occurs(action(("stack","d","a")),44) occurs(action(("pick-up","i")),45) occurs(action(("stack","i","d")),46) occurs(action(("unstack","g","q")),47) occurs(action(("stack","g","i")),48) occurs(action(("unstack","n","r")),49) occurs(action(("stack","n","g")),50) occurs(action(("unstack","j","p")),51) occurs(action(("stack","j","n")),52) occurs(action(("pick-up","q")),53) occurs(action(("stack","q","j")),54) occurs(action(("unstack","u","h")),55) occurs(action(("stack","u","q")),56) occurs(action(("unstack","t","b")),57) occurs(action(("stack","t","u")),58) occurs(action(("pick-up","k")),59) occurs(action(("stack","k","t")),60) occurs(action(("pick-up","r")),61) occurs(action(("stack","r","k")),62) occurs(action(("pick-up","o")),63) occurs(action(("stack","o","r")),64) occurs(action(("pick-up","p")),65) occurs(action(("stack","p","o")),66) occurs(action(("pick-up","s")),67) occurs(action(("stack","s","p")),68) occurs(action(("pick-up","c")),69) occurs(action(("stack","c","s")),70) occurs(action(("pick-up","e")),71) occurs(action(("stack","e","c")),72) occurs(action(("pick-up","b")),73) occurs(action(("stack","b","e")),74) occurs(action(("pick-up","l")),75) occurs(action(("stack","l","b")),76) occurs(action(("pick-up","h")),77) occurs(action(("put-down","h")),78) occurs(action(("pick-up","h")),79) occurs(action(("stack","h","l")),80) SATISFIABLE Models : 1+ Calls : 1 Time : 3.689s (Solving: 0.38s 1st Model: 0.37s Unsat: 0.00s) CPU Time : 3.644s Choices : 11920 (Domain: 11920) Conflicts : 202 (Analyzed: 202) Restarts : 2 (Average: 101.00 Last: 82) Model-Level : 1309.0 Problems : 1 (Average Length: 82.00 Splits: 0) Lemmas : 202 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 202 (Average Length: 9.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 202 (Average: 130.47 Max: 161 Sum: 26355) Executed : 11 (Average: 52.94 Max: 161 Sum: 10693 Ratio: 40.57%) Bounded : 191 (Average: 82.00 Max: 82 Sum: 15662 Ratio: 59.43%) Rules : 0 Atoms : 0 Bodies : 0 Tight : Yes Variables : 118860 (Eliminated: 0 Frozen: 38303) Constraints : 743136 (Binary: 94.2% Ternary: 4.5% Other: 1.2%) Memory Peak : 437MB Max. Length : 80 steps Sol. Length : 80 steps Models : 1