INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-22.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-22.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-2004/domains/psr-small-strips/domains/domain-22.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-22.pddl Parsing... Parsing: [0.100s CPU, 0.111s wall-clock] Normalizing task... [0.010s CPU, 0.013s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock] Preparing model... [0.030s CPU, 0.022s wall-clock] Generated 259 rules. Computing model... [0.010s CPU, 0.013s wall-clock] 169 relevant atoms 0 auxiliary atoms 169 final queue length 279 total queue pushes Completing instantiation... [0.020s CPU, 0.020s wall-clock] Instantiating: [0.100s CPU, 0.098s wall-clock] Computing fact groups... Finding invariants... 56 initial candidates Finding invariants: [1.050s CPU, 1.055s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 9 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [1.060s CPU, 1.062s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.010s CPU, 0.002s wall-clock] Translating task: [0.030s CPU, 0.030s wall-clock] 40 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 17 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.019s wall-clock] Reordering and filtering variables... 24 of 26 variables necessary. 0 of 17 mutex groups necessary. 108 of 112 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock] Translator variables: 24 Translator derived variables: 0 Translator facts: 61 Translator goal facts: 13 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 108 Translator axioms: 0 Translator task size: 720 Translator peak memory: 37580 KB Writing output... [0.010s CPU, 0.016s wall-clock] Done! [1.350s CPU, 1.364s wall-clock] planner.py version 0.0.1 Time: 0.03s Memory: 50MB 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: 50MB (+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: 50MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+0MB) UNSAT Iteration Time: 0.02s 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: 52.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.01s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.02s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 53.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.01s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 53MB (+0MB) UNSAT Iteration Time: 0.04s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 54.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.01s Memory: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.17s Memory: 55MB (+1MB) UNSAT Iteration Time: 0.19s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Expected Memory: 57.0MB Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.01s Memory: 56MB (+1MB) Unblocking actions... Solving... Solving Time: 0.12s Memory: 57MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.03s Memory: 59MB (+2MB) Solving... Solving Time: 0.03s Memory: 59MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 59MB (+0MB) Answer: 2 occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff0-yes"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb3"),4) occurs(action("wait_cb3-condeff2-yes"),5) occurs(action("wait_cb3-condeff1-yes"),5) occurs(action("wait_cb3-condeff0-no-1"),5) occurs(action("wait_cb3-endof-condeffs"),6) occurs(action("wait_cb1"),7) occurs(action("wait_cb1-condeff0-yes"),8) occurs(action("wait_cb1-endof-condeffs"),9) occurs(action("open-sd12"),10) occurs(action("open-sd11"),10) occurs(action("open-sd1"),10) occurs(action("open-sd6"),10) occurs(action("open-sd2"),10) occurs(action("close_cb2"),11) occurs(action("wait_cb2"),12) occurs(action("wait_cb2-condeff0-no-0"),13) occurs(action("wait_cb2-endof-condeffs"),14) occurs(action("close_cb1"),15) occurs(action("wait_cb1"),16) occurs(action("wait_cb1-condeff0-no-0"),17) occurs(action("wait_cb1-endof-condeffs"),18) occurs(action("close_cb3"),19) occurs(action("wait_cb3"),20) occurs(action("wait_cb3-condeff2-no-0"),21) occurs(action("wait_cb3-condeff1-no-0"),21) occurs(action("wait_cb3-condeff0-no-0"),21) occurs(action("wait_cb3-endof-condeffs"),22) occurs(action("close_sd3"),23) occurs(action("close_sd3-condeff0-no-0"),24) occurs(action("close_sd3-endof-condeffs"),25) SATISFIABLE Models : 1+ Calls : 7 Time : 0.468s (Solving: 0.33s 1st Model: 0.13s Unsat: 0.19s) CPU Time : 0.468s Choices : 9629 (Domain: 9617) Conflicts : 4381 (Analyzed: 4377) Restarts : 49 (Average: 89.33 Last: 67) Model-Level : 119.0 Problems : 7 (Average Length: 16.29 Splits: 0) Lemmas : 4377 (Deleted: 1149) Binary : 64 (Ratio: 1.46%) Ternary : 69 (Ratio: 1.58%) Conflict : 4377 (Average Length: 191.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 4377 (Average: 2.09 Max: 98 Sum: 9164) Executed : 4347 (Average: 2.01 Max: 98 Sum: 8804 Ratio: 96.07%) Bounded : 30 (Average: 12.00 Max: 22 Sum: 360 Ratio: 3.93%) Rules : 12075 (Original: 11088) Atoms : 3541 Bodies : 8485 (Original: 7972) Count : 90 (Original: 209) Equivalences : 2075 (Atom=Atom: 166 Body=Body: 0 Other: 1909) Tight : Yes Variables : 6564 (Eliminated: 0 Frozen: 2489) Constraints : 34334 (Binary: 90.5% Ternary: 7.9% Other: 1.6%) Memory Peak : 60MB Max. Length : 25 steps Sol. Length : 25 steps Models : 2