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.010s CPU, 0.020s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 42 rules.
Computing model... [0.200s CPU, 0.197s wall-clock]
1534 relevant atoms
892 auxiliary atoms
2426 final queue length
4719 total queue pushes
Completing instantiation... [0.430s CPU, 0.433s wall-clock]
Instantiating: [0.690s CPU, 0.685s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.020s CPU, 0.023s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.014s 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.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.051s 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.018s wall-clock]
Translating task: [0.320s CPU, 0.319s 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.160s CPU, 0.159s 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.050s CPU, 0.052s 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: 37976 KB
Writing output... [0.110s CPU, 0.127s wall-clock]
Done! [1.420s CPU, 1.433s wall-clock]
planner.py version 0.0.1

Time:	 0.30s
Memory: 64MB

Iteration 1
Queue:		 [5]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 0.11s
Memory:		 66MB (+2MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","hangover","achievement","scallop","neptune","uranus")),1) occurs(action(("overcome","jealousy","excitement","pork","neptune","uranus")),1) occurs(action(("overcome","sciatica","excitement","pork","pluto","neptune")),2) occurs(action(("overcome","anger","achievement","scallop","pluto","neptune")),3) occurs(action(("feast","excitement","pork","broccoli","manitoba","bavaria")),3) occurs(action(("succumb","anger","achievement","scallop","pluto","neptune")),4) occurs(action(("feast","excitement","broccoli","shrimp","pennsylvania","alsace")),4) occurs(action(("succumb","jealousy","excitement","shrimp","pluto","neptune")),5) occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),5)
Solving Time:	 0.01s
Memory:		 69MB (+3MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 1
Time         : 0.487s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.470s

Choices      : 109     
Conflicts    : 40       (Analyzed: 40)
Restarts     : 0       
Model-Level  : 25.0    
Problems     : 1        (Average Length: 7.00 Splits: 0)
Lemmas       : 40       (Deleted: 0)
  Binary     : 8        (Ratio:  20.00%)
  Ternary    : 1        (Ratio:   2.50%)
  Conflict   : 40       (Average Length:   35.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 40       (Average:  3.05 Max:  22 Sum:    122)
  Executed   : 33       (Average:  2.27 Max:  22 Sum:     91 Ratio:  74.59%)
  Bounded    : 7        (Average:  4.43 Max:   7 Sum:     31 Ratio:  25.41%)

Rules        : 0       
Atoms        : 0       
Bodies       : 0       
Tight        : Yes
Variables    : 7704     (Eliminated:    0 Frozen: 4984)
Constraints  : 29397    (Binary:  95.7% Ternary:   2.3% Other:   1.9%)

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


