INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-42.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-42.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-42.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-42.pddl Parsing... Parsing: [0.120s CPU, 0.126s 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.028s wall-clock] Preparing model... [0.020s CPU, 0.022s wall-clock] Generated 220 rules. Computing model... [0.010s CPU, 0.011s wall-clock] 142 relevant atoms 0 auxiliary atoms 142 final queue length 238 total queue pushes Completing instantiation... [0.020s CPU, 0.017s wall-clock] Instantiating: [0.090s CPU, 0.089s wall-clock] Computing fact groups... Finding invariants... 47 initial candidates Finding invariants: [0.380s CPU, 0.382s 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... 11 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.390s CPU, 0.388s 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.030s CPU, 0.028s wall-clock] 47 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 15 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.018s wall-clock] Reordering and filtering variables... 20 of 26 variables necessary. 0 of 15 mutex groups necessary. 82 of 94 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.000s CPU, 0.009s wall-clock] Translator variables: 20 Translator derived variables: 0 Translator facts: 46 Translator goal facts: 2 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 82 Translator axioms: 0 Translator task size: 564 Translator peak memory: 37324 KB Writing output... [0.020s CPU, 0.013s wall-clock] Done! [0.680s CPU, 0.686s 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.01s 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: 53MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.02s Memory: 53MB (+0MB) Solving... Solving Time: 0.11s Memory: 54MB (+1MB) UNSAT Iteration Time: 0.17s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 55.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.02s Memory: 55MB (+1MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 55MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 55MB (+0MB) Answer: 2 occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff3-no-0"),2) occurs(action("wait_cb2-condeff2-yes"),2) occurs(action("wait_cb2-condeff1-no-1"),2) occurs(action("wait_cb2-condeff0-no-1"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb1"),4) occurs(action("wait_cb1-condeff3-yes"),5) occurs(action("wait_cb1-condeff2-yes"),5) occurs(action("wait_cb1-condeff1-no-0"),5) occurs(action("wait_cb1-condeff1-no-1"),5) occurs(action("wait_cb1-condeff0-no-1"),5) occurs(action("wait_cb1-endof-condeffs"),6) occurs(action("wait_cb3"),7) occurs(action("open-sd5"),8) occurs(action("open-sd7"),8) occurs(action("open-sd2"),8) occurs(action("close_cb1"),9) occurs(action("wait_cb1"),10) occurs(action("wait_cb1-condeff3-no-0"),11) occurs(action("wait_cb1-condeff2-no-0"),11) occurs(action("wait_cb1-condeff1-no-0"),11) occurs(action("wait_cb1-condeff1-no-1"),11) occurs(action("wait_cb1-condeff0-no-0"),11) occurs(action("wait_cb1-condeff0-no-1"),11) occurs(action("wait_cb1-endof-condeffs"),12) occurs(action("close_sd1"),13) occurs(action("close_sd1-condeff3-no-0"),14) occurs(action("close_sd1-condeff3-no-1"),14) occurs(action("close_sd1-condeff2-no-0"),14) occurs(action("close_sd1-condeff2-no-1"),14) occurs(action("close_sd1-condeff1-no-0"),14) occurs(action("close_sd1-condeff0-no-0"),14) occurs(action("close_sd1-endof-condeffs"),15) occurs(action("reach-goal-0"),16) occurs(action("reach-goal-0"),17) occurs(action("reach-goal-0"),18) occurs(action("reach-goal-0"),19) occurs(action("close_cb3"),20) SATISFIABLE Models : 1+ Calls : 6 Time : 0.292s (Solving: 0.19s 1st Model: 0.08s Unsat: 0.11s) CPU Time : 0.292s Choices : 6216 (Domain: 6132) Conflicts : 3026 (Analyzed: 3023) Restarts : 34 (Average: 88.91 Last: 59) Model-Level : 65.5 Problems : 6 (Average Length: 12.83 Splits: 0) Lemmas : 3023 (Deleted: 0) Binary : 54 (Ratio: 1.79%) Ternary : 26 (Ratio: 0.86%) Conflict : 3023 (Average Length: 120.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 3023 (Average: 1.95 Max: 31 Sum: 5901) Executed : 3018 (Average: 1.95 Max: 31 Sum: 5880 Ratio: 99.64%) Bounded : 5 (Average: 4.20 Max: 7 Sum: 21 Ratio: 0.36%) Rules : 5755 (Original: 5688) Atoms : 2403 Bodies : 3461 (Original: 3452) Count : 91 (Original: 123) Equivalences : 932 (Atom=Atom: 108 Body=Body: 0 Other: 824) Tight : Yes Variables : 3752 (Eliminated: 0 Frozen: 1523) Constraints : 19926 (Binary: 91.4% Ternary: 5.9% Other: 2.6%) Memory Peak : 55MB Max. Length : 20 steps Sol. Length : 20 steps Models : 2