INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-5.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-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-5.pddl Parsing... Parsing: [1.450s CPU, 1.448s wall-clock] Normalizing task... [0.030s CPU, 0.032s wall-clock] Instantiating... Generating Datalog program... [0.330s CPU, 0.327s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock] Preparing model... [2.730s CPU, 2.726s wall-clock] Generated 23 rules. Computing model... [6.140s CPU, 6.141s wall-clock] 33381 relevant atoms 60724 auxiliary atoms 94105 final queue length 106716 total queue pushes Completing instantiation... [2.900s CPU, 2.899s wall-clock] Instantiating: [12.210s CPU, 12.213s wall-clock] Computing fact groups... Finding invariants... 9 initial candidates Finding invariants: [0.080s CPU, 0.072s wall-clock] Checking invariant weight... [0.080s CPU, 0.088s wall-clock] Instantiating groups... [0.080s CPU, 0.071s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.010s CPU, 0.007s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.270s CPU, 0.263s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.002s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.090s CPU, 0.092s wall-clock] Translating task: [1.910s CPU, 1.907s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 12 propositions removed Detecting unreachable propositions: [1.040s CPU, 1.035s wall-clock] Reordering and filtering variables... 12 of 12 variables necessary. 0 of 12 mutex groups necessary. 6572 of 6572 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.260s CPU, 0.263s wall-clock] Translator variables: 12 Translator derived variables: 0 Translator facts: 345 Translator goal facts: 10 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 6572 Translator axioms: 0 Translator task size: 33027 Translator peak memory: 83124 KB Writing output... [0.600s CPU, 0.652s wall-clock] Done! [17.850s CPU, 17.902s wall-clock] planner.py version 0.0.1 Time: 1.41s Memory: 147MB 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: 147MB (+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 Expected Memory: 147MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.45s Memory: 147MB (+0MB) Unblocking actions... Solving... Solving Time: 0.05s Memory: 149MB (+2MB) UNSAT Iteration Time: 0.75s 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 Expected Memory: 151.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.44s Memory: 153MB (+4MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 172MB (+19MB) UNSAT Iteration Time: 0.75s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 195.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.52s Memory: 187MB (+15MB) Unblocking actions... Solving... Solving Time: 0.08s Memory: 205MB (+18MB) SAT Testing... SERIALIZABLE Testing Time: 1.14s Memory: 205MB (+0MB) Answer: 1 occurs(action(("drive","t0","l9","l3","level215","level10","level225")),1) occurs(action(("load","p0","t0","l3")),2) occurs(action(("load","p8","t0","l3")),2) occurs(action(("drive","t0","l3","l2","level194","level21","level215")),2) occurs(action(("load","p2","t0","l2")),3) occurs(action(("drive","t0","l2","l8","level174","level20","level194")),3) occurs(action(("load","p6","t0","l8")),4) occurs(action(("load","p7","t0","l8")),4) occurs(action(("drive","t0","l8","l2","level154","level20","level174")),4) occurs(action(("drive","t0","l2","l6","level142","level12","level154")),5) occurs(action(("unload","p6","t0","l6")),6) occurs(action(("drive","t0","l6","l5","level120","level22","level142")),6) occurs(action(("unload","p2","t0","l5")),7) occurs(action(("drive","t0","l5","l4","level117","level3","level120")),7) occurs(action(("unload","p7","t0","l4")),8) occurs(action(("load","p1","t0","l4")),8) occurs(action(("drive","t0","l4","l5","level114","level3","level117")),8) occurs(action(("load","p3","t0","l4")),8) occurs(action(("load","p4","t0","l4")),8) occurs(action(("load","p9","t0","l4")),8) occurs(action(("unload","p1","t0","l5")),9) occurs(action(("drive","t0","l5","l3","level102","level12","level114")),9) occurs(action(("unload","p4","t0","l3")),10) occurs(action(("drive","t0","l3","l0","level100","level2","level102")),10) occurs(action(("load","p5","t0","l0")),11) occurs(action(("drive","t0","l0","l1","level93","level7","level100")),11) occurs(action(("unload","p8","t0","l1")),12) occurs(action(("drive","t0","l1","l7","level75","level18","level93")),12) occurs(action(("unload","p0","t0","l7")),13) occurs(action(("unload","p3","t0","l7")),13) occurs(action(("unload","p5","t0","l7")),13) occurs(action(("drive","t0","l7","l3","level64","level11","level75")),13) occurs(action(("drive","t0","l3","l9","level54","level10","level64")),14) occurs(action(("unload","p9","t0","l9")),15) SATISFIABLE Models : 1+ Calls : 4 Time : 3.832s (Solving: 0.09s 1st Model: 0.05s Unsat: 0.03s) CPU Time : 3.772s Choices : 429 (Domain: 428) Conflicts : 145 (Analyzed: 143) Restarts : 1 (Average: 143.00 Last: 62) Model-Level : 53.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 143 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 143 (Average Length: 1271.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 143 (Average: 3.03 Max: 26 Sum: 433) Executed : 138 (Average: 2.61 Max: 26 Sum: 373 Ratio: 86.14%) Bounded : 5 (Average: 12.00 Max: 16 Sum: 60 Ratio: 13.86%) Rules : 106002 Atoms : 106002 Bodies : 1 (Original: 0) Tight : Yes Variables : 97054 (Eliminated: 0 Frozen: 4724) Constraints : 473678 (Binary: 98.7% Ternary: 0.7% Other: 0.6%) Memory Peak : 270MB Max. Length : 15 steps Sol. Length : 15 steps Models : 1