INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-18.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-18.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-18.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-18.pddl
Parsing...
Parsing: [0.080s CPU, 0.083s wall-clock]
Normalizing task... [0.020s CPU, 0.009s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 123 rules.
Computing model... [0.010s CPU, 0.009s wall-clock]
103 relevant atoms
0 auxiliary atoms
103 final queue length
144 total queue pushes
Completing instantiation... [0.020s CPU, 0.013s wall-clock]
Instantiating: [0.060s CPU, 0.063s wall-clock]
Computing fact groups...
Finding invariants...
47 initial candidates
Finding invariants: [0.090s CPU, 0.095s 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...
6 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.100s CPU, 0.101s 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.010s CPU, 0.016s wall-clock]
15 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
19 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.009s wall-clock]
Reordering and filtering variables...
13 of 25 variables necessary.
0 of 19 mutex groups necessary.
31 of 55 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 29
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 31
Translator axioms: 0
Translator task size: 227
Translator peak memory: 36556 KB
Writing output... [0.000s CPU, 0.006s wall-clock]
Done! [0.290s CPU, 0.294s wall-clock]
planner.py version 0.0.1

Time:	 0.01s
Memory: 49MB

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 (+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: 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:		 50MB (+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: 50MB
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.01s
Memory:		 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 51MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.01s
Memory:		 51MB (+0MB)
Solving...
Solving Time:	 0.00s
Memory:		 51MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 51MB (+0MB)
Answer: 2
occurs(action("wait_cb2"),1) occurs(action("wait_cb2-condeff1-yes"),2) occurs(action("wait_cb2-condeff0-yes"),2) occurs(action("wait_cb2-endof-condeffs"),3) occurs(action("wait_cb1"),4) occurs(action("open-sd13"),5) occurs(action("open-sd10"),5) occurs(action("close_cb2"),6) occurs(action("wait_cb2"),7) occurs(action("wait_cb2-condeff1-no-0"),8) occurs(action("wait_cb2-condeff0-no-0"),8) occurs(action("wait_cb2-condeff1-no-0"),9) occurs(action("wait_cb2-condeff0-no-0"),9) occurs(action("wait_cb2-endof-condeffs"),10)
SATISFIABLE

Models       : 1+
Calls        : 4
Time         : 0.045s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.044s

Choices      : 49       (Domain: 47)
Conflicts    : 12       (Analyzed: 11)
Restarts     : 0       
Model-Level  : 24.5    
Problems     : 4        (Average Length: 8.25 Splits: 0)
Lemmas       : 11       (Deleted: 0)
  Binary     : 2        (Ratio:  18.18%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 11       (Average Length:   19.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 11       (Average:  4.18 Max:  17 Sum:     46)
  Executed   : 8        (Average:  2.18 Max:  17 Sum:     24 Ratio:  52.17%)
  Bounded    : 3        (Average:  7.33 Max:  12 Sum:     22 Ratio:  47.83%)

Rules        : 1735     (Original: 1640)
Atoms        : 995     
Bodies       : 855      (Original: 801)
  Count      : 21       (Original: 53)
Equivalences : 350      (Atom=Atom: 62 Body=Body: 0 Other: 288)
Tight        : Yes
Variables    : 963      (Eliminated:    0 Frozen:  168)
Constraints  : 3702     (Binary:  86.0% Ternary:  10.6% Other:   3.3%)

Memory Peak  : 51MB
Max. Length  : 10 steps
Sol. Length  : 10 steps
Models       : 2