INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-19.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-19.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-19.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-19.pddl
Parsing...
Parsing: [0.160s CPU, 0.157s wall-clock]
Normalizing task... [0.020s CPU, 0.020s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.041s wall-clock]
Preparing model... [0.040s CPU, 0.038s wall-clock]
Generated 363 rules.
Computing model... [0.020s CPU, 0.021s wall-clock]
205 relevant atoms
0 auxiliary atoms
205 final queue length
377 total queue pushes
Completing instantiation... [0.030s CPU, 0.029s wall-clock]
Instantiating: [0.140s CPU, 0.145s wall-clock]
Computing fact groups...
Finding invariants...
41 initial candidates
Finding invariants: [0.410s CPU, 0.404s 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.410s CPU, 0.409s 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.050s CPU, 0.049s wall-clock]
53 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.027s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
0 of 11 mutex groups necessary.
163 of 163 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.013s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 52
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 163
Translator axioms: 0
Translator task size: 1197
Translator peak memory: 37836 KB
Writing output... [0.020s CPU, 0.024s wall-clock]
Done! [0.850s CPU, 0.849s wall-clock]
planner.py version 0.0.1

Time:	 0.05s
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.00s
Memory:		 53MB (+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: 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.01s
Memory:		 55MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.04s
Memory:		 55MB (+0MB)
Solving...
Solving Time:	 0.02s
Memory:		 55MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 55MB (+0MB)
Answer: 2
occurs(action("wait_cb3"),1) occurs(action("wait_cb3-condeff2-yes"),2) occurs(action("wait_cb3-condeff1-no-1"),2) occurs(action("wait_cb3-condeff0-no-2"),2) occurs(action("wait_cb3-endof-condeffs"),3) occurs(action("wait_cb2"),4) occurs(action("open-sd7"),5) occurs(action("open-sd6"),5) occurs(action("open-sd3"),5) occurs(action("close_sd2"),6) occurs(action("close_sd2-condeff3-no-0"),7) occurs(action("close_sd2-condeff3-no-1"),7) occurs(action("close_sd2-condeff3-no-3"),7) occurs(action("close_sd2-condeff3-no-4"),7) occurs(action("close_sd2-condeff2-no-0"),7) occurs(action("close_sd2-condeff2-no-1"),7) occurs(action("close_sd2-condeff2-no-2"),7) occurs(action("close_sd2-condeff1-no-0"),7) occurs(action("close_sd2-condeff1-no-1"),7) occurs(action("close_sd2-condeff0-no-0"),7) occurs(action("close_sd2-endof-condeffs"),8) occurs(action("close_sd5"),9) occurs(action("close_sd5-condeff1-no-0"),10) occurs(action("close_sd5-condeff1-no-3"),10) occurs(action("close_sd5-condeff1-no-4"),10) occurs(action("close_sd5-condeff0-no-0"),10) occurs(action("close_sd5-endof-condeffs"),11) occurs(action("close_sd1"),12) occurs(action("close_sd1-condeff2-no-0"),13) occurs(action("close_sd1-condeff2-no-4"),13) occurs(action("close_sd1-condeff1-no-0"),13) occurs(action("close_sd1-condeff1-no-2"),13) occurs(action("close_sd1-condeff0-no-0"),13) occurs(action("close_sd1-endof-condeffs"),14) occurs(action("reach-goal-0"),15)
SATISFIABLE

Models       : 1+
Calls        : 5
Time         : 0.161s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time     : 0.156s

Choices      : 948      (Domain: 830)
Conflicts    : 370      (Analyzed: 368)
Restarts     : 1        (Average: 368.00 Last: 97)
Model-Level  : 56.5    
Problems     : 5        (Average Length: 11.00 Splits: 0)
Lemmas       : 368      (Deleted: 0)
  Binary     : 40       (Ratio:  10.87%)
  Ternary    : 9        (Ratio:   2.45%)
  Conflict   : 368      (Average Length:   87.8 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 368      (Average:  2.77 Max:  30 Sum:   1019)
  Executed   : 355      (Average:  2.35 Max:  30 Sum:    865 Ratio:  84.89%)
  Bounded    : 13       (Average: 11.85 Max:  17 Sum:    154 Ratio:  15.11%)

Rules        : 10488    (Original: 10392)
Atoms        : 4182    
Bodies       : 6432     (Original: 6406)
  Count      : 84       (Original: 120)
Equivalences : 1065     (Atom=Atom: 118 Body=Body: 0 Other: 947)
Tight        : Yes
Variables    : 4063     (Eliminated:    0 Frozen: 1642)
Constraints  : 23148    (Binary:  94.3% Ternary:   4.2% Other:   1.4%)

Memory Peak  : 55MB
Max. Length  : 15 steps
Sol. Length  : 15 steps
Models       : 2