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-4.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-4.pddl Parsing... Parsing: [1.630s CPU, 1.630s wall-clock] Normalizing task... [0.040s CPU, 0.037s wall-clock] Instantiating... Generating Datalog program... [0.370s CPU, 0.369s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock] Preparing model... [3.240s CPU, 3.241s wall-clock] Generated 23 rules. Computing model... [6.570s CPU, 6.569s wall-clock] 36431 relevant atoms 67527 auxiliary atoms 103958 final queue length 115169 total queue pushes Completing instantiation... [2.930s CPU, 2.931s wall-clock] Instantiating: [13.250s CPU, 13.241s wall-clock] Computing fact groups... Finding invariants... 9 initial candidates Finding invariants: [0.060s CPU, 0.062s wall-clock] Checking invariant weight... [0.100s CPU, 0.099s wall-clock] Instantiating groups... [0.070s CPU, 0.068s wall-clock] Collecting mutex groups... [0.000s CPU, 0.002s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.010s CPU, 0.008s wall-clock] Building translation key... [0.010s CPU, 0.004s wall-clock] Computing fact groups: [0.260s 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.010s CPU, 0.002s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.080s CPU, 0.081s wall-clock] Translating task: [1.620s CPU, 1.623s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.930s CPU, 0.930s wall-clock] Reordering and filtering variables... 11 of 11 variables necessary. 0 of 11 mutex groups necessary. 5848 of 5848 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.230s CPU, 0.234s wall-clock] Translator variables: 11 Translator derived variables: 0 Translator facts: 334 Translator goal facts: 9 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 5848 Translator axioms: 0 Translator task size: 29432 Translator peak memory: 86880 KB Writing output... [0.530s CPU, 0.583s wall-clock] Done! [18.580s CPU, 18.619s wall-clock] planner.py version 0.0.1 Time: 1.28s Memory: 136MB 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: 136MB (+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: 136MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.40s Memory: 136MB (+0MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 141MB (+5MB) UNSAT Iteration Time: 0.67s 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: 146.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.38s Memory: 144MB (+3MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 161MB (+17MB) UNSAT Iteration Time: 0.68s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 181.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.47s Memory: 176MB (+15MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 190MB (+14MB) SAT Testing... SERIALIZABLE Testing Time: 1.01s Memory: 190MB (+0MB) Answer: 1 occurs(action(("drive","t0","l7","l5","level227","level14","level241")),1) occurs(action(("drive","t0","l5","l0","level206","level21","level227")),2) occurs(action(("load","p4","t0","l5")),2) occurs(action(("load","p5","t0","l5")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("load","p2","t0","l0")),3) occurs(action(("drive","t0","l0","l6","level196","level10","level206")),3) occurs(action(("unload","p4","t0","l6")),4) occurs(action(("load","p3","t0","l6")),4) occurs(action(("load","p6","t0","l6")),4) occurs(action(("load","p8","t0","l6")),4) occurs(action(("drive","t0","l6","l2","level190","level6","level196")),4) occurs(action(("unload","p2","t0","l2")),5) occurs(action(("unload","p3","t0","l2")),5) occurs(action(("unload","p8","t0","l2")),5) occurs(action(("load","p1","t0","l2")),5) occurs(action(("drive","t0","l2","l3","level176","level14","level190")),5) occurs(action(("unload","p7","t0","l3")),6) occurs(action(("load","p0","t0","l3")),6) occurs(action(("drive","t0","l3","l1","level151","level25","level176")),6) occurs(action(("drive","t0","l1","l5","level148","level3","level151")),7) occurs(action(("drive","t0","l5","l4","level123","level25","level148")),8) occurs(action(("unload","p0","t0","l4")),9) occurs(action(("drive","t0","l4","l8","level105","level18","level123")),9) occurs(action(("unload","p6","t0","l8")),10) occurs(action(("drive","t0","l8","l7","level86","level19","level105")),10) occurs(action(("unload","p5","t0","l7")),11) occurs(action(("drive","t0","l7","l5","level72","level14","level86")),11) occurs(action(("drive","t0","l5","l0","level51","level21","level72")),12) occurs(action(("unload","p1","t0","l0")),13) occurs(action(("drive","t0","l0","l1","level28","level23","level51")),13) occurs(action(("drive","t0","l1","l5","level25","level3","level28")),14) occurs(action(("drive","t0","l5","l4","level0","level25","level25")),15) SATISFIABLE Models : 1+ Calls : 4 Time : 3.470s (Solving: 0.09s 1st Model: 0.03s Unsat: 0.05s) CPU Time : 3.372s Choices : 282 (Domain: 275) Conflicts : 133 (Analyzed: 131) Restarts : 1 (Average: 131.00 Last: 35) Model-Level : 66.0 Problems : 4 (Average Length: 9.50 Splits: 0) Lemmas : 131 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 2 (Ratio: 1.53%) Conflict : 131 (Average Length: 1852.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 131 (Average: 1.96 Max: 17 Sum: 257) Executed : 127 (Average: 1.78 Max: 17 Sum: 233 Ratio: 90.66%) Bounded : 4 (Average: 6.00 Max: 12 Sum: 24 Ratio: 9.34%) Rules : 94481 Atoms : 94481 Bodies : 1 (Original: 0) Tight : Yes Variables : 87756 (Eliminated: 0 Frozen: 4585) Constraints : 445506 (Binary: 98.6% Ternary: 0.7% Other: 0.6%) Memory Peak : 250MB Max. Length : 15 steps Sol. Length : 15 steps Models : 1