INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-45.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-45.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-45.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-45.pddl Parsing... Parsing: [0.090s CPU, 0.094s wall-clock] Normalizing task... [0.010s CPU, 0.009s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock] Preparing model... [0.010s CPU, 0.016s wall-clock] Generated 142 rules. Computing model... [0.010s CPU, 0.008s wall-clock] 113 relevant atoms 0 auxiliary atoms 113 final queue length 164 total queue pushes Completing instantiation... [0.020s CPU, 0.014s wall-clock] Instantiating: [0.070s CPU, 0.066s wall-clock] Computing fact groups... Finding invariants... 51 initial candidates Finding invariants: [0.230s CPU, 0.231s 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... 10 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.230s CPU, 0.238s 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.001s wall-clock] Translating task: [0.020s CPU, 0.020s wall-clock] 24 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 18 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.011s wall-clock] Reordering and filtering variables... 19 of 28 variables necessary. 0 of 18 mutex groups necessary. 43 of 61 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.008s wall-clock] Translator variables: 19 Translator derived variables: 0 Translator facts: 43 Translator goal facts: 8 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 43 Translator axioms: 0 Translator task size: 353 Translator peak memory: 36556 KB Writing output... [0.000s CPU, 0.009s wall-clock] Done! [0.450s CPU, 0.458s 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: 50MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+1MB) 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: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 51MB (+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: 52.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.01s Memory: 51MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.02s Memory: 52MB (+0MB) Solving... Solving Time: 0.01s Memory: 52MB (+0MB) UNSAT Iteration Time: 0.05s 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.02s Memory: 53MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 53MB (+0MB) Answer: 2 occurs(action("wait_cb1"),1) occurs(action("wait_cb1-condeff1-yes"),2) occurs(action("wait_cb1-condeff0-no-0"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("wait_cb2"),4) occurs(action("wait_cb2-condeff0-yes"),5) occurs(action("wait_cb2-endof-condeffs"),6) occurs(action("wait_cb4"),7) occurs(action("wait_cb3"),7) occurs(action("open-sd2"),8) occurs(action("open-sd6"),8) occurs(action("close_cb1"),9) occurs(action("wait_cb1"),10) occurs(action("wait_cb1-condeff1-no-0"),11) occurs(action("wait_cb1-condeff0-no-0"),11) occurs(action("wait_cb1-endof-condeffs"),12) occurs(action("close_cb2"),13) occurs(action("wait_cb2"),14) occurs(action("wait_cb2-condeff0-no-0"),15) occurs(action("wait_cb2-endof-condeffs"),16) occurs(action("close_cb4"),17) occurs(action("wait_cb4"),18) occurs(action("close_cb4"),19) occurs(action("wait_cb4"),20) SATISFIABLE Models : 1+ Calls : 6 Time : 0.133s (Solving: 0.03s 1st Model: 0.02s Unsat: 0.01s) CPU Time : 0.136s Choices : 1050 (Domain: 1050) Conflicts : 408 (Analyzed: 405) Restarts : 2 (Average: 202.50 Last: 94) Model-Level : 57.0 Problems : 6 (Average Length: 12.83 Splits: 0) Lemmas : 405 (Deleted: 0) Binary : 8 (Ratio: 1.98%) Ternary : 7 (Ratio: 1.73%) Conflict : 405 (Average Length: 63.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 405 (Average: 3.02 Max: 45 Sum: 1225) Executed : 385 (Average: 2.37 Max: 45 Sum: 961 Ratio: 78.45%) Bounded : 20 (Average: 13.20 Max: 22 Sum: 264 Ratio: 21.55%) Rules : 4412 (Original: 3726) Atoms : 1718 Bodies : 2646 (Original: 2369) Count : 26 (Original: 146) Equivalences : 798 (Atom=Atom: 126 Body=Body: 0 Other: 672) Tight : Yes Variables : 3392 (Eliminated: 0 Frozen: 647) Constraints : 15369 (Binary: 86.1% Ternary: 11.0% Other: 2.9%) Memory Peak : 53MB Max. Length : 20 steps Sol. Length : 20 steps Models : 2