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.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.028s wall-clock]
Preparing model... [0.010s CPU, 0.014s wall-clock]
Generated 42 rules.
Computing model... [0.170s CPU, 0.168s wall-clock]
1446 relevant atoms
813 auxiliary atoms
2259 final queue length
4448 total queue pushes
Completing instantiation... [0.400s CPU, 0.404s wall-clock]
Instantiating: [0.620s CPU, 0.620s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.025s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.010s 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.047s 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.016s wall-clock]
Translating task: [0.300s CPU, 0.294s 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.150s CPU, 0.150s 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.050s CPU, 0.049s 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: 37720 KB
Writing output... [0.100s CPU, 0.116s wall-clock]
Done! [1.300s CPU, 1.313s wall-clock]
planner.py version 0.0.1

Time:	 0.26s
Memory: 63MB

Iteration 1
Queue:		 [0]
Grounded Until:	 0
Solving...
Solving Time:	 0.00s
Memory:		 63MB (+0MB)
UNSAT
Iteration Time:	 0.00s

Iteration 2
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.10s
Memory:		 63MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("overcome","boils","love","scallion","mars","uranus")),2) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),2) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("overcome","grief","triumph","scallion","uranus","earth")),3) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),3) occurs(action(("feast","satisfaction","wurst","guava","oregon","bavaria")),3) occurs(action(("succumb","boils","love","guava","mars","uranus")),4) occurs(action(("feast","triumph","scallion","guava","guanabara","manitoba")),4) occurs(action(("feast","satisfaction","guava","scallion","quebec","kentucky")),4) occurs(action(("succumb","grief","triumph","guava","uranus","earth")),5)
Solving Time:	 0.01s
Memory:		 66MB (+3MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 2
Time         : 0.444s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.420s

Choices      : 184     
Conflicts    : 54       (Analyzed: 54)
Restarts     : 0       
Model-Level  : 26.0    
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 54       (Deleted: 0)
  Binary     : 4        (Ratio:   7.41%)
  Ternary    : 3        (Ratio:   5.56%)
  Conflict   : 54       (Average Length:   25.6 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 54       (Average:  4.09 Max:  25 Sum:    221)
  Executed   : 46       (Average:  3.06 Max:  25 Sum:    165 Ratio:  74.66%)
  Bounded    : 8        (Average:  7.00 Max:   7 Sum:     56 Ratio:  25.34%)

Rules        : 23109   
Atoms        : 23109   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 6274     (Eliminated:    0 Frozen: 5232)
Constraints  : 28265    (Binary:  96.5% Ternary:   1.3% Other:   2.2%)

Memory Peak  : 66MB
Max. Length  : 5 steps
Sol. Length  : 5 steps