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-3.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-3.pddl
Parsing...
Parsing: [0.010s CPU, 0.019s 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.010s CPU, 0.015s wall-clock]
Generated 42 rules.
Computing model... [0.260s CPU, 0.254s wall-clock]
2016 relevant atoms
1407 auxiliary atoms
3423 final queue length
6590 total queue pushes
Completing instantiation... [0.580s CPU, 0.588s wall-clock]
Instantiating: [0.900s CPU, 0.895s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.030s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.014s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.010s CPU, 0.004s 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.004s 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.024s wall-clock]
Translating task: [0.430s CPU, 0.431s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
28 propositions removed
Detecting unreachable propositions: [0.250s CPU, 0.245s wall-clock]
Reordering and filtering variables...
26 of 26 variables necessary.
0 of 26 mutex groups necessary.
1676 of 1676 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.070s CPU, 0.073s wall-clock]
Translator variables: 26
Translator derived variables: 0
Translator facts: 211
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1676
Translator axioms: 0
Translator task size: 10026
Translator peak memory: 39512 KB
Writing output... [0.160s CPU, 0.172s wall-clock]
Done! [1.900s CPU, 1.925s wall-clock]
planner.py version 0.0.1

Time:	 0.38s
Memory: 71MB

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:		 71MB (+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.16s
Memory:		 71MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("feast","entertainment","pepper","melon","arizona","manitoba")),1) occurs(action(("feast","satisfaction","mutton","orange","goias","guanabara")),1) occurs(action(("feast","triumph","popover","pepper","bavaria","arizona")),1) occurs(action(("overcome","boils","entertainment","melon","vulcan","venus")),2) occurs(action(("feast","satisfaction","orange","chocolate","guanabara","bavaria")),2) occurs(action(("feast","triumph","pepper","melon","bavaria","arizona")),2) occurs(action(("overcome","hangover","satisfaction","chocolate","venus","neptune")),3) occurs(action(("feast","triumph","melon","pepper","arizona","manitoba")),3) occurs(action(("feast","satisfaction","chocolate","ham","goias","guanabara")),4) occurs(action(("feast","triumph","pepper","popover","guanabara","bavaria")),4) occurs(action(("succumb","hangover","satisfaction","ham","venus","neptune")),5)
Solving Time:	 0.01s
Memory:		 74MB (+3MB)
SAT
SATISFIABLE

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

Choices      : 71       (Domain: 56)
Conflicts    : 15       (Analyzed: 15)
Restarts     : 0       
Model-Level  : 48.0    
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 15       (Deleted: 0)
  Binary     : 2        (Ratio:  13.33%)
  Ternary    : 2        (Ratio:  13.33%)
  Conflict   : 15       (Average Length:    9.6 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 15       (Average:  2.00 Max:   6 Sum:     30)
  Executed   : 15       (Average:  2.00 Max:   6 Sum:     30 Ratio: 100.00%)
  Bounded    : 0        (Average:  0.00 Max:   0 Sum:      0 Ratio:   0.00%)

Rules        : 33950   
Atoms        : 33950   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 8937     (Eliminated:    0 Frozen: 7478)
Constraints  : 34700    (Binary:  96.1% Ternary:   1.7% Other:   2.2%)

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