INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.pddl
Parsing...
Parsing: [0.010s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.030s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 42 rules.
Computing model... [0.180s CPU, 0.189s wall-clock]
1446 relevant atoms
813 auxiliary atoms
2259 final queue length
4448 total queue pushes
Completing instantiation... [0.460s CPU, 0.454s wall-clock]
Instantiating: [0.700s CPU, 0.696s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.025s wall-clock]
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.051s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.019s wall-clock]
Translating task: [0.330s CPU, 0.333s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
19 propositions removed
Detecting unreachable propositions: [0.160s CPU, 0.165s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
1161 of 1161 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.057s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 152
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1161
Translator axioms: 0
Translator task size: 6734
Translator peak memory: 40908 KB
Writing output... [0.120s CPU, 0.128s wall-clock]
Done! [1.450s CPU, 1.471s wall-clock]
planner.py version 0.0.1

Time:	 0.28s
Memory: 68MB

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:		 68MB (+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
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.07s
Memory:		 68MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 69MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.23s
Memory:		 80MB (+11MB)
Solving...
Solving Time:	 0.01s
Memory:		 80MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 80MB (+0MB)
Answer: 2
occurs(action(("overcome","grief","satisfaction","scallion","mars","uranus")),1) occurs(action(("overcome","boils","satisfaction","scallion","mercury","mars")),2) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),3) occurs(action(("succumb","grief","satisfaction","guava","mercury","mars")),4) occurs(action(("succumb","boils","satisfaction","guava","mars","uranus")),5)
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 0.432s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time     : 0.416s

Choices      : 477      (Domain: 423)
Conflicts    : 154      (Analyzed: 154)
Restarts     : 2        (Average: 77.00 Last: 16)
Model-Level  : 44.5    
Problems     : 3        (Average Length: 5.33 Splits: 0)
Lemmas       : 154      (Deleted: 0)
  Binary     : 9        (Ratio:   5.84%)
  Ternary    : 1        (Ratio:   0.65%)
  Conflict   : 154      (Average Length:   26.9 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 154      (Average:  2.67 Max:  26 Sum:    411)
  Executed   : 152      (Average:  2.58 Max:  26 Sum:    397 Ratio:  96.59%)
  Bounded    : 2        (Average:  7.00 Max:   7 Sum:     14 Ratio:   3.41%)

Rules        : 20805   
Atoms        : 20800   
Bodies       : 11       (Original: 10)
  Count      : 5       
Equivalences : 15       (Atom=Atom: 5 Body=Body: 0 Other: 10)
Tight        : Yes
Variables    : 6097     (Eliminated:    0 Frozen: 2853)
Constraints  : 21550    (Binary:  96.2% Ternary:   1.7% Other:   2.2%)

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


