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.020s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.035s wall-clock]
Preparing model... [0.020s CPU, 0.017s wall-clock]
Generated 42 rules.
Computing model... [0.260s CPU, 0.262s wall-clock]
2016 relevant atoms
1407 auxiliary atoms
3423 final queue length
6590 total queue pushes
Completing instantiation... [0.600s CPU, 0.587s wall-clock]
Instantiating: [0.920s CPU, 0.910s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.026s 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.010s CPU, 0.001s wall-clock]
Choosing groups...
1 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.058s 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.024s wall-clock]
Translating task: [0.440s 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.240s CPU, 0.244s 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.071s 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.174s wall-clock]
Done! [1.930s CPU, 1.939s wall-clock]
planner.py version 0.0.1

Time:	 3.89s
Memory: 235MB

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.02s
Memory:		 235MB (+0MB)
UNSAT
Iteration Time:	 0.02s

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.19s
Memory:		 246MB (+11MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","laceration","entertainment","pepper","vulcan","venus")),1) occurs(action(("feast","satisfaction","mutton","orange","goias","guanabara")),1) occurs(action(("feast","satisfaction","orange","chocolate","guanabara","bavaria")),2) occurs(action(("overcome","hangover","satisfaction","chocolate","venus","neptune")),3) occurs(action(("feast","satisfaction","chocolate","ham","goias","guanabara")),3) occurs(action(("feast","love","orange","chocolate","goias","guanabara")),3) occurs(action(("succumb","hangover","satisfaction","ham","venus","neptune")),4) occurs(action(("feast","satisfaction","ham","chocolate","arizona","manitoba")),5)
Solving Time:	 0.01s
Memory:		 251MB (+5MB)
SAT
SATISFIABLE

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

Choices      : 84      
Conflicts    : 5        (Analyzed: 5)
Restarts     : 0       
Model-Level  : 46.0    
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 12       (Deleted: 0)
  Binary     : 9        (Ratio:  75.00%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 5        (Average Length:  309.2 Ratio:  41.67%) 
  Loop       : 7        (Average Length:    2.0 Ratio:  58.33%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 5        (Average: 10.40 Max:  24 Sum:     52)
  Executed   : 4        (Average:  9.00 Max:  24 Sum:     45 Ratio:  86.54%)
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:  13.46%)

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

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


