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-17.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-17.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s 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.023s wall-clock]
Preparing model... [0.010s CPU, 0.019s wall-clock]
Generated 42 rules.
Computing model... [1.720s CPU, 1.709s wall-clock]
17564 relevant atoms
6015 auxiliary atoms
23579 final queue length
56133 total queue pushes
Completing instantiation... [6.240s CPU, 6.239s wall-clock]
Instantiating: [8.010s CPU, 8.016s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.120s CPU, 0.113s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.050s CPU, 0.052s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.010s CPU, 0.015s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.230s CPU, 0.229s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.250s CPU, 0.242s wall-clock]
Translating task: [4.720s CPU, 4.716s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
56 propositions removed
Detecting unreachable propositions: [2.420s CPU, 2.411s wall-clock]
Reordering and filtering variables...
52 of 52 variables necessary.
0 of 52 mutex groups necessary.
16616 of 16616 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.700s CPU, 0.699s wall-clock]
Translator variables: 52
Translator derived variables: 0
Translator facts: 730
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 16616
Translator axioms: 0
Translator task size: 99223
Translator peak memory: 97680 KB
Writing output... [1.540s CPU, 1.698s wall-clock]
Done! [17.850s CPU, 18.001s wall-clock]
planner.py version 0.0.1

Time:	 4.17s
Memory: 312MB

Iteration 1
Queue:		 [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
Grounded Until:	 0
Solving...
Solving Time:	 0.02s
Memory:		 312MB (+0MB)
UNSAT
Iteration Time:	 0.02s

Iteration 2
Queue:		 [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
Grounded Until:	 0
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time:	 2.47s
Memory:		 312MB (+0MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","depression","achievement","endive","saturn","earth")),1) occurs(action(("overcome","loneliness-3","rest","ham","mercury","saturn")),1) occurs(action(("overcome","laceration","satiety","cherry","mercury","saturn")),1) occurs(action(("feast","satisfaction","potato","yogurt","guanabara","bosnia")),1) occurs(action(("overcome","grief","achievement","endive","mercury","saturn")),2) occurs(action(("overcome","abrasion","satisfaction","yogurt","mercury","saturn")),2) occurs(action(("feast","satisfaction","yogurt","wonderbread","guanabara","bosnia")),3) occurs(action(("feast","achievement","endive","cherry","bosnia","alsace")),4) occurs(action(("succumb","abrasion","satisfaction","wonderbread","mercury","saturn")),5)
Solving Time:	 0.27s
Memory:		 323MB (+11MB)
SAT
SATISFIABLE

Models       : 1+
Calls        : 2
Time         : 8.223s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
CPU Time     : 7.880s

Choices      : 132     
Conflicts    : 3        (Analyzed: 3)
Restarts     : 0       
Model-Level  : 113.0   
Problems     : 2        (Average Length: 4.50 Splits: 0)
Lemmas       : 3        (Deleted: 0)
  Binary     : 0        (Ratio:   0.00%)
  Ternary    : 1        (Ratio:  33.33%)
  Conflict   : 3        (Average Length: 2689.0 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 3        (Average:  8.67 Max:  17 Sum:     26)
  Executed   : 3        (Average:  8.67 Max:  17 Sum:     26 Ratio: 100.00%)
  Bounded    : 0        (Average:  0.00 Max:   0 Sum:      0 Ratio:   0.00%)

Rules        : 332975  
Atoms        : 332975  
Bodies       : 1        (Original: 0)
Tight        : Yes
Variables    : 73740    (Eliminated:    0 Frozen: 69213)
Constraints  : 258066   (Binary:  98.5% Ternary:   0.6% Other:   0.9%)

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


