INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-1.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-1.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-2006/domains/pathways-propositional-strips/domains/domain-1.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-1.pddl
Parsing...
Parsing: [0.090s CPU, 0.094s wall-clock]
Normalizing task... [0.020s CPU, 0.012s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.024s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 205 rules.
Computing model... [0.010s CPU, 0.008s wall-clock]
143 relevant atoms
0 auxiliary atoms
143 final queue length
223 total queue pushes
Completing instantiation... [0.020s CPU, 0.017s wall-clock]
Instantiating: [0.070s CPU, 0.075s wall-clock]
Computing fact groups...
Finding invariants...
63 initial candidates
Finding invariants: [11.380s CPU, 11.380s wall-clock]
Checking invariant weight... [0.060s CPU, 0.059s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
27 uncovered facts
Choosing groups: [0.010s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [11.450s CPU, 11.448s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s 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]
19 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
17 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.013s wall-clock]
Reordering and filtering variables...
27 of 44 variables necessary.
0 of 19 mutex groups necessary.
61 of 78 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
Translator variables: 27
Translator derived variables: 0
Translator facts: 56
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 61
Translator axioms: 0
Translator task size: 375
Translator peak memory: 39628 KB
Writing output... [0.010s CPU, 0.010s wall-clock]
Done! [11.680s CPU, 11.682s wall-clock]
planner.py version 0.0.1

Time:	 0.02s
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:		 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("choose_p300_l1_l0"),1) occurs(action("initialize_p300"),2) occurs(action("choose_pcaf_l2_l1"),2) occurs(action("initialize_pcaf"),3) occurs(action("associate_pcaf_p300_pcaf-p300"),4) occurs(action("dummy-action-1-2"),5) occurs(action("initialize_pcaf"),5) occurs(action("initialize_p300"),5)
SATISFIABLE

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

Choices      : 73       (Domain: 40)
Conflicts    : 8        (Analyzed: 8)
Restarts     : 0       
Model-Level  : 35.5    
Problems     : 3        (Average Length: 5.33 Splits: 0)
Lemmas       : 8        (Deleted: 0)
  Binary     : 1        (Ratio:  12.50%)
  Ternary    : 1        (Ratio:  12.50%)
  Conflict   : 8        (Average Length:    4.9 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 8        (Average:  3.62 Max:   8 Sum:     29)
  Executed   : 6        (Average:  2.00 Max:   8 Sum:     16 Ratio:  55.17%)
  Bounded    : 2        (Average:  6.50 Max:   7 Sum:     13 Ratio:  44.83%)

Rules        : 1974     (Original: 1928)
Atoms        : 1582    
Bodies       : 448      (Original: 404)
  Count      : 5        (Original: 28)
Equivalences : 300      (Atom=Atom: 31 Body=Body: 0 Other: 269)
Tight        : Yes
Variables    : 938      (Eliminated:    0 Frozen:  167)
Constraints  : 2962     (Binary:  85.8% Ternary:  11.2% Other:   3.0%)

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