INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-47.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-47.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-47.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-47.pddl Parsing... Parsing: [0.110s CPU, 0.111s wall-clock] Normalizing task... [0.010s CPU, 0.011s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.023s wall-clock] Preparing model... [0.020s CPU, 0.022s wall-clock] Generated 184 rules. Computing model... [0.010s CPU, 0.011s wall-clock] 140 relevant atoms 0 auxiliary atoms 140 final queue length 209 total queue pushes Completing instantiation... [0.020s CPU, 0.017s wall-clock] Instantiating: [0.080s CPU, 0.083s wall-clock] Computing fact groups... Finding invariants... 61 initial candidates Finding invariants: [0.490s CPU, 0.491s wall-clock] Checking invariant weight... [0.000s 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... 12 uncovered facts Choosing groups: [0.010s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.500s CPU, 0.498s 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.000s CPU, 0.002s wall-clock] Translating task: [0.020s CPU, 0.026s wall-clock] 33 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 20 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.015s wall-clock] Reordering and filtering variables... 24 of 32 variables necessary. 0 of 20 mutex groups necessary. 62 of 78 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: 57 Translator goal facts: 11 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 62 Translator axioms: 0 Translator task size: 514 Translator peak memory: 37324 KB Writing output... [0.010s CPU, 0.011s wall-clock] Done! [0.760s CPU, 0.769s wall-clock] planner.py version 0.0.1 Time: 0.02s 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.01s 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: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) 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: 52MB (+0MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 52MB (+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: 53.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.01s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.04s Memory: 53MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.02s Memory: 54MB (+1MB) Solving... Solving Time: 0.09s Memory: 55MB (+1MB) UNSAT Iteration Time: 0.16s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Expected Memory: 56.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.07s Memory: 56MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 56MB (+0MB) Answer: 2 occurs(action("wait_cb3"),1) occurs(action("wait_cb3-condeff1-yes"),2) occurs(action("wait_cb3-condeff0-no-0"),2) occurs(action("wait_cb3-endof-condeffs"),3) occurs(action("wait_cb5"),4) occurs(action("wait_cb5-condeff0-yes"),5) occurs(action("wait_cb5-endof-condeffs"),6) occurs(action("wait_cb1"),7) occurs(action("wait_cb1-condeff0-yes"),8) occurs(action("wait_cb1-endof-condeffs"),9) occurs(action("wait_cb4"),10) occurs(action("open-sd6"),11) occurs(action("open-sd1"),11) occurs(action("open-sd12"),11) occurs(action("close_cb1"),12) occurs(action("wait_cb1"),13) occurs(action("wait_cb1-condeff0-no-0"),14) occurs(action("wait_cb1-endof-condeffs"),15) occurs(action("close_cb5"),16) occurs(action("wait_cb5"),17) occurs(action("wait_cb5-condeff0-no-0"),18) occurs(action("wait_cb5-endof-condeffs"),19) occurs(action("close_cb3"),20) occurs(action("wait_cb3"),21) occurs(action("wait_cb3-condeff1-no-0"),22) occurs(action("wait_cb3-condeff0-no-0"),22) occurs(action("wait_cb3-endof-condeffs"),23) occurs(action("close_cb4"),24) occurs(action("wait_cb4"),25) SATISFIABLE Models : 1+ Calls : 7 Time : 0.330s (Solving: 0.21s 1st Model: 0.10s Unsat: 0.11s) CPU Time : 0.328s Choices : 6243 (Domain: 6243) Conflicts : 2808 (Analyzed: 2804) Restarts : 31 (Average: 90.45 Last: 54) Model-Level : 81.0 Problems : 7 (Average Length: 15.57 Splits: 0) Lemmas : 2804 (Deleted: 0) Binary : 28 (Ratio: 1.00%) Ternary : 35 (Ratio: 1.25%) Conflict : 2804 (Average Length: 106.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2804 (Average: 2.17 Max: 53 Sum: 6084) Executed : 2775 (Average: 2.06 Max: 53 Sum: 5778 Ratio: 94.97%) Bounded : 29 (Average: 10.55 Max: 22 Sum: 306 Ratio: 5.03%) Rules : 8008 (Original: 6793) Atoms : 2608 Bodies : 5226 (Original: 4702) Count : 36 (Original: 237) Equivalences : 1352 (Atom=Atom: 166 Body=Body: 0 Other: 1186) Tight : Yes Variables : 5670 (Eliminated: 0 Frozen: 1275) Constraints : 27286 (Binary: 87.3% Ternary: 10.3% Other: 2.4%) Memory Peak : 56MB Max. Length : 25 steps Sol. Length : 25 steps Models : 2