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-16.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-16.pddl Parsing... Parsing: [0.750s CPU, 0.750s wall-clock] Normalizing task... [0.020s CPU, 0.017s wall-clock] Instantiating... Generating Datalog program... [0.180s CPU, 0.182s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock] Preparing model... [1.420s CPU, 1.416s wall-clock] Generated 23 rules. Computing model... [3.520s CPU, 3.522s wall-clock] 19976 relevant atoms 35172 auxiliary atoms 55148 final queue length 64934 total queue pushes Completing instantiation... [2.130s CPU, 2.125s wall-clock] Instantiating: [7.320s CPU, 7.320s wall-clock] Computing fact groups... Finding invariants... 9 initial candidates Finding invariants: [0.060s CPU, 0.055s wall-clock] Checking invariant weight... [0.040s CPU, 0.047s wall-clock] Instantiating groups... [0.060s CPU, 0.059s 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.000s CPU, 0.004s wall-clock] Computing fact groups: [0.190s CPU, 0.188s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.004s 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.070s CPU, 0.073s wall-clock] Translating task: [1.470s CPU, 1.468s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 13 propositions removed Detecting unreachable propositions: [0.690s CPU, 0.691s wall-clock] Reordering and filtering variables... 13 of 13 variables necessary. 0 of 13 mutex groups necessary. 5162 of 5162 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.200s CPU, 0.206s wall-clock] Translator variables: 13 Translator derived variables: 0 Translator facts: 309 Translator goal facts: 11 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 5162 Translator axioms: 0 Translator task size: 25901 Translator peak memory: 64060 KB Writing output... [0.470s CPU, 0.515s wall-clock] Done! [11.190s CPU, 11.227s wall-clock] planner.py version 0.0.1 Time: 1.10s 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.00s Memory: 125MB (+0MB) UNSAT Iteration Time: 0.00s 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: 125MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.36s Memory: 125MB (+0MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 130MB (+5MB) UNSAT Iteration Time: 0.58s 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: 135.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.32s Memory: 135MB (+5MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 150MB (+15MB) UNSAT Iteration Time: 0.56s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 170.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.36s Memory: 158MB (+8MB) Unblocking actions... Solving... Solving Time: 0.12s Memory: 178MB (+20MB) SAT Testing... SERIALIZABLE Testing Time: 0.97s Memory: 200MB (+22MB) Answer: 1 occurs(action(("drive","t0","l1","l2","level155","level10","level165")),1) occurs(action(("load","p2","t0","l2")),2) occurs(action(("drive","t0","l2","l5","level133","level22","level155")),2) occurs(action(("load","p7","t0","l5")),3) occurs(action(("load","p8","t0","l5")),3) occurs(action(("drive","t0","l5","l2","level111","level22","level133")),3) occurs(action(("drive","t0","l2","l6","level92","level19","level111")),4) occurs(action(("load","p4","t0","l6")),5) occurs(action(("drive","t0","l6","l9","level79","level13","level92")),5) occurs(action(("unload","p7","t0","l9")),6) occurs(action(("unload","p8","t0","l9")),6) occurs(action(("drive","t0","l9","l10","level60","level19","level79")),6) occurs(action(("load","p5","t0","l9")),6) occurs(action(("load","p6","t0","l9")),6) occurs(action(("unload","p2","t0","l10")),7) occurs(action(("drive","t0","l10","l8","level58","level2","level60")),7) occurs(action(("unload","p4","t0","l8")),8) occurs(action(("unload","p5","t0","l8")),8) occurs(action(("load","p10","t0","l8")),8) occurs(action(("drive","t0","l8","l10","level56","level2","level58")),8) occurs(action(("load","p9","t0","l8")),8) occurs(action(("drive","t0","l10","l0","level38","level18","level56")),9) occurs(action(("drive","t0","l0","l4","level32","level6","level38")),10) occurs(action(("unload","p6","t0","l4")),11) occurs(action(("load","p0","t0","l4")),11) occurs(action(("drive","t0","l4","l3","level20","level12","level32")),11) occurs(action(("unload","p9","t0","l3")),12) occurs(action(("load","p1","t0","l3")),12) occurs(action(("load","p3","t0","l3")),12) occurs(action(("drive","t0","l3","l7","level18","level2","level20")),12) occurs(action(("unload","p10","t0","l7")),13) occurs(action(("unload","p3","t0","l7")),13) occurs(action(("drive","t0","l7","l4","level17","level1","level18")),13) occurs(action(("drive","t0","l4","l9","level2","level15","level17")),14) occurs(action(("unload","p0","t0","l9")),15) occurs(action(("unload","p1","t0","l9")),15) SATISFIABLE Models : 1+ Calls : 4 Time : 2.955s (Solving: 0.13s 1st Model: 0.10s Unsat: 0.03s) CPU Time : 2.908s Choices : 718 (Domain: 718) Conflicts : 247 (Analyzed: 245) Restarts : 2 (Average: 122.50 Last: 52) Model-Level : 103.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 245 (Deleted: 0) Binary : 2 (Ratio: 0.82%) Ternary : 4 (Ratio: 1.63%) Conflict : 245 (Average Length: 2266.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 245 (Average: 2.67 Max: 56 Sum: 654) Executed : 237 (Average: 2.30 Max: 56 Sum: 563 Ratio: 86.09%) Bounded : 8 (Average: 11.38 Max: 15 Sum: 91 Ratio: 13.91%) Rules : 83179 Atoms : 83179 Bodies : 1 (Original: 0) Tight : Yes Variables : 78042 (Eliminated: 0 Frozen: 4290) Constraints : 431560 (Binary: 98.7% Ternary: 0.8% Other: 0.6%) Memory Peak : 227MB Max. Length : 15 steps Sol. Length : 15 steps Models : 1