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.030s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 42 rules.
Computing model... [0.270s CPU, 0.278s wall-clock]
2016 relevant atoms
1407 auxiliary atoms
3423 final queue length
6590 total queue pushes
Completing instantiation... [0.660s CPU, 0.662s wall-clock]
Instantiating: [0.990s CPU, 0.995s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.028s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.016s 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.003s wall-clock]
Computing fact groups: [0.070s CPU, 0.063s 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.030s CPU, 0.028s wall-clock]
Translating task: [0.490s CPU, 0.486s 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.270s CPU, 0.271s 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.080s CPU, 0.082s 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: 42700 KB
Writing output... [0.180s CPU, 0.189s wall-clock]
Done! [2.130s CPU, 2.137s wall-clock]
planner.py version 0.0.1

Time:	 0.41s
Memory: 77MB

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:		 77MB (+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.10s
Memory:		 77MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.01s
Memory:		 79MB (+2MB)
SAT
Testing...
SERIALIZABLE
Testing Time:	 0.33s
Memory:		 94MB (+15MB)
Answer: 1
occurs(action(("feast","love","orange","chocolate","guanabara","bavaria")),1) occurs(action(("overcome","laceration","entertainment","pepper","vulcan","venus")),2) occurs(action(("overcome","hangover","love","chocolate","venus","neptune")),2) occurs(action(("feast","love","chocolate","ham","goias","guanabara")),2) occurs(action(("succumb","hangover","love","ham","venus","neptune")),3) occurs(action(("feast","satisfaction","mutton","melon","goias","guanabara")),4) occurs(action(("feast","love","ham","melon","arizona","manitoba")),5)
SATISFIABLE

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

Choices      : 60       (Domain: 46)
Conflicts    : 6        (Analyzed: 6)
Restarts     : 0       
Model-Level  : 51.0    
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 6        (Deleted: 0)
  Binary     : 0        (Ratio:   0.00%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 6        (Average Length:  556.7 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 6        (Average:  3.83 Max:  15 Sum:     23)
  Executed   : 5        (Average:  2.67 Max:  15 Sum:     16 Ratio:  69.57%)
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:  30.43%)

Rules        : 30598   
Atoms        : 30598   
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 8709     (Eliminated:    0 Frozen:  670)
Constraints  : 26457    (Binary:  95.7% Ternary:   2.1% Other:   2.2%)

Memory Peak  : 94MB
Max. Length  : 5 steps
Sol. Length  : 5 steps
Models       : 1