INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/domains/domain-38.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-38.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-38.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2004/domains/psr-small-strips/instances/instance-38.pddl
Parsing...
Parsing: [0.080s CPU, 0.078s wall-clock]
Normalizing task... [0.010s CPU, 0.008s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 148 rules.
Computing model... [0.010s CPU, 0.008s wall-clock]
113 relevant atoms
0 auxiliary atoms
113 final queue length
168 total queue pushes
Completing instantiation... [0.010s CPU, 0.015s wall-clock]
Instantiating: [0.060s CPU, 0.066s wall-clock]
Computing fact groups...
Finding invariants...
48 initial candidates
Finding invariants: [0.200s CPU, 0.195s 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...
8 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.200s CPU, 0.201s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.019s wall-clock]
23 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
17 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.011s wall-clock]
Reordering and filtering variables...
17 of 25 variables necessary.
0 of 17 mutex groups necessary.
48 of 64 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
Translator variables: 17
Translator derived variables: 0
Translator facts: 40
Translator goal facts: 8
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 48
Translator axioms: 0
Translator task size: 354
Translator peak memory: 36556 KB
Writing output... [0.010s CPU, 0.009s wall-clock]
Done! [0.400s CPU, 0.402s 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.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.00s
Memory:		 51MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time:	 0.01s
Memory:		 51MB (+0MB)
Answer: 1
occurs(action("wait_cb1"),1) occurs(action("wait_cb3"),1) occurs(action("wait_cb1-condeff0-yes"),2) occurs(action("wait_cb1-endof-condeffs"),3) occurs(action("close_cb1"),4) occurs(action("open-sd13"),4) occurs(action("open-sd1"),4) occurs(action("wait_cb1"),5) occurs(action("wait_cb1-condeff0-no-0"),6) occurs(action("wait_cb1-endof-condeffs"),7) occurs(action("close_sd12"),8) occurs(action("close_sd12-condeff0-no-0"),9) occurs(action("close_sd12-endof-condeffs"),10)
SATISFIABLE

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

Choices      : 29       (Domain: 29)
Conflicts    : 5        (Analyzed: 4)
Restarts     : 0       
Model-Level  : 31.0    
Problems     : 3        (Average Length: 7.00 Splits: 0)
Lemmas       : 4        (Deleted: 0)
  Binary     : 0        (Ratio:   0.00%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 4        (Average Length:    6.0 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 4        (Average:  4.25 Max:   8 Sum:     17)
  Executed   : 3        (Average:  2.50 Max:   5 Sum:     10 Ratio:  58.82%)
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:  41.18%)

Rules        : 1101    
Atoms        : 1101    
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 1068     (Eliminated:    0 Frozen:   72)
Constraints  : 3621     (Binary:  89.3% Ternary:   8.9% Other:   1.8%)

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


