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-29.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-29.pddl
Parsing...
Parsing: [0.020s CPU, 0.021s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.033s wall-clock]
Preparing model... [0.010s CPU, 0.016s wall-clock]
Generated 42 rules.
Computing model... [0.210s CPU, 0.208s wall-clock]
1534 relevant atoms
892 auxiliary atoms
2426 final queue length
4719 total queue pushes
Completing instantiation... [0.480s CPU, 0.483s wall-clock]
Instantiating: [0.750s CPU, 0.749s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.030s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.061s 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.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.020s wall-clock]
Translating task: [0.360s CPU, 0.358s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
24 propositions removed
Detecting unreachable propositions: [0.170s CPU, 0.175s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
0 of 22 mutex groups necessary.
1224 of 1224 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.060s CPU, 0.061s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 177
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1224
Translator axioms: 0
Translator task size: 7377
Translator peak memory: 41164 KB
Writing output... [0.130s CPU, 0.138s wall-clock]
Done! [1.570s CPU, 1.585s wall-clock]
planner.py version 0.0.1

Time:	 0.30s
Memory: 69MB

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:		 70MB (+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
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.08s
Memory:		 70MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 71MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.30s
Memory:		 83MB (+12MB)
Solving...
Solving Time:	 0.01s
Memory:		 83MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 83MB (+0MB)
Answer: 2
occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","broccoli","manitoba","bavaria")),1) occurs(action(("overcome","jealousy","achievement","pork","neptune","uranus")),2) occurs(action(("feast","excitement","broccoli","pork","pennsylvania","alsace")),2) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),3) occurs(action(("feast","achievement","broccoli","shrimp","arizona","pennsylvania")),4) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),5)
SATISFIABLE

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

Choices      : 102      (Domain: 76)
Conflicts    : 14       (Analyzed: 14)
Restarts     : 0       
Model-Level  : 34.0    
Problems     : 3        (Average Length: 5.33 Splits: 0)
Lemmas       : 14       (Deleted: 0)
  Binary     : 2        (Ratio:  14.29%)
  Ternary    : 1        (Ratio:   7.14%)
  Conflict   : 14       (Average Length:   11.6 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 14       (Average:  3.93 Max:  18 Sum:     55)
  Executed   : 13       (Average:  3.43 Max:  18 Sum:     48 Ratio:  87.27%)
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:  12.73%)

Rules        : 31548    (Original: 31478)
Atoms        : 25187   
Bodies       : 4390     (Original: 4322)
  Count      : 65       (Original: 73)
Equivalences : 2292     (Atom=Atom: 10 Body=Body: 0 Other: 2282)
Tight        : Yes
Variables    : 6823     (Eliminated:    0 Frozen: 2856)
Constraints  : 27434    (Binary:  96.0% Ternary:   1.7% Other:   2.3%)

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