INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-35.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-35.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-35.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-35.pddl Parsing... Parsing: [0.170s CPU, 0.176s wall-clock] Normalizing task... [0.020s CPU, 0.017s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.014s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.034s wall-clock] Preparing model... [0.020s CPU, 0.030s wall-clock] Generated 299 rules. Computing model... [0.020s CPU, 0.017s wall-clock] 198 relevant atoms 0 auxiliary atoms 198 final queue length 324 total queue pushes Completing instantiation... [0.030s CPU, 0.028s wall-clock] Instantiating: [0.120s CPU, 0.125s wall-clock] Computing fact groups... Finding invariants... 68 initial candidates Finding invariants: [1.600s CPU, 1.594s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.000s CPU, 0.000s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 14 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.610s CPU, 1.602s 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.003s wall-clock] Translating task: [0.040s CPU, 0.044s wall-clock] 49 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.022s wall-clock] Reordering and filtering variables... 31 of 34 variables necessary. 0 of 20 mutex groups necessary. 123 of 129 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.020s CPU, 0.015s wall-clock] Translator variables: 31 Translator derived variables: 0 Translator facts: 76 Translator goal facts: 2 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 123 Translator axioms: 0 Translator task size: 987 Translator peak memory: 38604 KB Writing output... [0.020s CPU, 0.020s wall-clock] Done! [2.020s CPU, 2.024s wall-clock] planner.py version 0.0.1 Time: 0.04s 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: 51MB (+1MB) 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: 51MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.02s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+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: 53.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.02s Memory: 53MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 53MB (+0MB) UNSAT Iteration Time: 0.03s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 54.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.02s Memory: 54MB (+1MB) Unblocking actions... Solving... Solving Time: 0.02s Memory: 54MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.03s Memory: 55MB (+1MB) Solving... Solving Time: 0.13s Memory: 56MB (+1MB) UNSAT Iteration Time: 0.21s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 57.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.02s Memory: 58MB (+2MB) Unblocking actions... Solving... Solving Time: 0.07s Memory: 58MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 58MB (+0MB) Answer: 2 occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb5"),4) occurs(action("wait_cb3"),5) occurs(action("wait_cb3-condeff2-yes"),6) occurs(action("wait_cb3-condeff1-yes"),6) occurs(action("wait_cb3-condeff0-no-0"),6) occurs(action("wait_cb3-endof-condeffs"),7) occurs(action("open-sd8"),8) occurs(action("open-sd10"),8) occurs(action("open-sd1"),8) occurs(action("close_cb3"),9) occurs(action("wait_cb3"),10) occurs(action("wait_cb3-condeff2-no-0"),11) occurs(action("wait_cb3-condeff1-no-0"),11) occurs(action("wait_cb3-condeff0-no-0"),11) occurs(action("wait_cb3-endof-condeffs"),12) occurs(action("close_sd5"),13) occurs(action("close_sd5-condeff0-no-0"),14) occurs(action("close_sd5-endof-condeffs"),15) occurs(action("reach-goal-7"),16) occurs(action("open-sd5"),17) occurs(action("open-sd9"),17) occurs(action("open-sd7"),17) occurs(action("open-sd12"),17) occurs(action("open-sd6"),18) occurs(action("open-sd11"),19) occurs(action("open-cb3"),20) SATISFIABLE Models : 1+ Calls : 6 Time : 0.375s (Solving: 0.22s 1st Model: 0.09s Unsat: 0.13s) CPU Time : 0.372s Choices : 5218 (Domain: 5118) Conflicts : 2718 (Analyzed: 2715) Restarts : 30 (Average: 90.50 Last: 74) Model-Level : 73.5 Problems : 6 (Average Length: 12.83 Splits: 0) Lemmas : 2715 (Deleted: 0) Binary : 56 (Ratio: 2.06%) Ternary : 23 (Ratio: 0.85%) Conflict : 2715 (Average Length: 155.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 2715 (Average: 1.80 Max: 58 Sum: 4900) Executed : 2710 (Average: 1.80 Max: 58 Sum: 4879 Ratio: 99.57%) Bounded : 5 (Average: 4.20 Max: 7 Sum: 21 Ratio: 0.43%) Rules : 11717 (Original: 10766) Atoms : 3925 Bodies : 7691 (Original: 7244) Count : 50 (Original: 175) Equivalences : 1409 (Atom=Atom: 145 Body=Body: 0 Other: 1264) Tight : Yes Variables : 6487 (Eliminated: 0 Frozen: 1982) Constraints : 38327 (Binary: 91.2% Ternary: 7.2% Other: 1.6%) Memory Peak : 59MB Max. Length : 20 steps Sol. Length : 20 steps Models : 2