INFO     Running translator.
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-1.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-prime-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-1.pddl
Parsing...
Parsing: [0.010s CPU, 0.019s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.036s wall-clock]
Preparing model... [0.020s CPU, 0.014s wall-clock]
Generated 55 rules.
Computing model... [0.180s CPU, 0.186s wall-clock]
1425 relevant atoms
531 auxiliary atoms
1956 final queue length
4426 total queue pushes
Completing instantiation... [0.410s CPU, 0.408s wall-clock]
Instantiating: [0.640s CPU, 0.651s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.040s CPU, 0.035s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.050s CPU, 0.046s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.010s CPU, 0.000s wall-clock]
Processing axioms: [0.020s CPU, 0.015s wall-clock]
Translating task: [0.290s CPU, 0.287s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.150s CPU, 0.148s wall-clock]
Reordering and filtering variables...
11 of 11 variables necessary.
0 of 11 mutex groups necessary.
1086 of 1086 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.045s wall-clock]
Translator variables: 11
Translator derived variables: 0
Translator facts: 73
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1086
Translator axioms: 0
Translator task size: 5617
Translator peak memory: 40140 KB
Writing output... [0.110s CPU, 0.115s wall-clock]
Done! [1.310s CPU, 1.329s wall-clock]
planner.py version 0.0.1

Time:	 0.28s
Memory: 66MB

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:		 66MB (+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.06s
Memory:		 66MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.00s
Memory:		 67MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 0.25s
Memory:		 76MB (+9MB)
Solving...
Solving Time:	 0.00s
Memory:		 76MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time:	 0.00s
Memory:		 76MB (+0MB)
Answer: 2
occurs(action(("overcome","abrasion","rest","pork","uranus","venus")),1) occurs(action(("drink","flounder","lamb","alsace","pennsylvania","surrey","pennsylvania","alsace")),1) occurs(action(("feast","rest","pork","lamb","alsace","quebec")),2) occurs(action(("drink","flounder","lamb","pennsylvania","surrey","bosnia","alsace","quebec")),2) occurs(action(("feast","rest","lamb","flounder","alsace","quebec")),3) occurs(action(("feast","rest","flounder","rice","bosnia","surrey")),4) occurs(action(("succumb","abrasion","rest","rice","uranus","venus")),5)
SATISFIABLE

Models       : 1+
Calls        : 3
Time         : 0.435s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time     : 0.420s

Choices      : 156      (Domain: 62)
Conflicts    : 13       (Analyzed: 13)
Restarts     : 0       
Model-Level  : 45.0    
Problems     : 3        (Average Length: 5.33 Splits: 0)
Lemmas       : 13       (Deleted: 0)
  Binary     : 8        (Ratio:  61.54%)
  Ternary    : 0        (Ratio:   0.00%)
  Conflict   : 13       (Average Length:    4.5 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 13       (Average:  6.69 Max:  38 Sum:     87)
  Executed   : 12       (Average:  6.15 Max:  38 Sum:     80 Ratio:  91.95%)
  Bounded    : 1        (Average:  7.00 Max:   7 Sum:      7 Ratio:   8.05%)

Rules        : 25069    (Original: 25029)
Atoms        : 20206   
Bodies       : 2652     (Original: 2621)
  Count      : 41       (Original: 47)
Equivalences : 2387     (Atom=Atom: 7 Body=Body: 0 Other: 2380)
Tight        : Yes
Variables    : 5231     (Eliminated:    0 Frozen: 2624)
Constraints  : 24482    (Binary:  97.5% Ternary:   1.0% Other:   1.6%)

Memory Peak  : 76MB
Max. Length  : 5 steps
Sol. Length  : 5 steps
Models       : 2