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-6.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-6.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 42 rules.
Computing model... [1.280s CPU, 1.282s wall-clock]
11303 relevant atoms
5116 auxiliary atoms
16419 final queue length
36991 total queue pushes
Completing instantiation... [4.330s CPU, 4.322s wall-clock]
Instantiating: [5.680s CPU, 5.673s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.080s CPU, 0.083s wall-clock]
Checking invariant weight... [0.010s CPU, 0.003s wall-clock]
Instantiating groups... [0.040s CPU, 0.045s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.010s CPU, 0.014s wall-clock]
Building translation key... [0.000s CPU, 0.007s wall-clock]
Computing fact groups: [0.180s CPU, 0.185s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s 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.010s CPU, 0.000s wall-clock]
Processing axioms: [0.180s CPU, 0.170s wall-clock]
Translating task: [3.220s CPU, 3.209s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
54 propositions removed
Detecting unreachable propositions: [1.660s CPU, 1.667s wall-clock]
Reordering and filtering variables...
46 of 46 variables necessary.
0 of 46 mutex groups necessary.
10539 of 10539 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.500s CPU, 0.495s wall-clock]
Translator variables: 46
Translator derived variables: 0
Translator facts: 552
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 10539
Translator axioms: 0
Translator task size: 62529
Translator peak memory: 77004 KB
Writing output... [1.070s CPU, 1.171s wall-clock]
Done! [12.480s CPU, 12.574s wall-clock]
planner.py version 0.0.1

Time:	 2.61s
Memory: 228MB

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.01s
Memory:		 228MB (+0MB)
UNSAT
Iteration Time:	 0.01s

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.85s
Memory:		 228MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.11s
Memory:		 237MB (+9MB)
UNSAT
Iteration Time:	 1.44s

Iteration 3
Queue:		 [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until:	 5
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time:	 0.78s
Memory:		 237MB (+0MB)
Unblocking actions...
Solving...
Solving Time:	 0.10s
Memory:		 262MB (+25MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.11s
Memory:		 264MB (+2MB)
Solving...
Solving Time:	 0.08s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.12s
Memory:		 378MB (+114MB)
Solving...
Solving Time:	 0.05s
Memory:		 263MB (+-115MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.12s
Memory:		 264MB (+1MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.78s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.04s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.39s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.12s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.12s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 378MB (+114MB)
Solving...
Solving Time:	 0.03s
Memory:		 378MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 264MB (+-114MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.12s
Memory:		 378MB (+114MB)
Solving...
Solving Time:	 0.03s
Memory:		 378MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 264MB (+-114MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.13s
Memory:		 264MB (+0MB)
Solving...
Solving Time:	 0.03s
Memory:		 264MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time:	 2.14s
Memory:		 378MB (+114MB)
Solving...
Solving Time:	 0.03s
Memory:		 378MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time:	 2.12s
Memory:		 264MB (+-114MB)
Answer: 16
occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),1) occurs(action(("feast","aesthetics","cantelope","tomato","alsace","goias")),1) occurs(action(("feast","curiosity","potato","snickers","kentucky","alsace")),1) occurs(action(("feast","love","tomato","tuna","kentucky","alsace")),1) occurs(action(("feast","lubricity","wonderbread","marzipan","goias","quebec")),1) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),1) occurs(action(("feast","satisfaction","pistachio","onion","kentucky","alsace")),1) occurs(action(("feast","triumph","turkey","onion","kentucky","alsace")),1) occurs(action(("feast","curiosity","snickers","turkey","alsace","goias")),2) occurs(action(("overcome","boils","satisfaction","onion","neptune","mars")),2) occurs(action(("feast","aesthetics","tomato","tuna","surrey","kentucky")),2) occurs(action(("feast","love","tuna","rice","kentucky","alsace")),2) occurs(action(("feast","rest","cantelope","tomato","kentucky","alsace")),2) occurs(action(("feast","satisfaction","onion","mutton","alsace","goias")),2) occurs(action(("feast","aesthetics","tuna","beef","surrey","kentucky")),3) occurs(action(("feast","curiosity","turkey","onion","surrey","kentucky")),3) occurs(action(("feast","rest","tomato","tuna","bosnia","surrey")),3) occurs(action(("feast","triumph","onion","turkey","kentucky","alsace")),3) occurs(action(("overcome","abrasion","aesthetics","beef","mars","saturn")),4) occurs(action(("feast","aesthetics","beef","scallop","surrey","kentucky")),4) occurs(action(("feast","rest","tuna","beef","bosnia","surrey")),4) occurs(action(("feast","satisfaction","mutton","turkey","surrey","kentucky")),5) occurs(action(("feast","aesthetics","scallop","chicken","bosnia","surrey")),5) occurs(action(("feast","rest","beef","papaya","bosnia","surrey")),5) occurs(action(("feast","aesthetics","chicken","turkey","surrey","kentucky")),6) occurs(action(("feast","rest","papaya","chicken","bosnia","surrey")),6) occurs(action(("succumb","abrasion","aesthetics","turkey","mars","saturn")),7) occurs(action(("feast","rest","chicken","turkey","bosnia","surrey")),7) occurs(action(("feast","aesthetics","turkey","snickers","bosnia","surrey")),7) occurs(action(("succumb","anger","rest","turkey","mars","saturn")),8) occurs(action(("feast","aesthetics","snickers","turkey","kentucky","alsace")),9) occurs(action(("feast","curiosity","onion","mutton","surrey","kentucky")),9) occurs(action(("succumb","boils","satisfaction","turkey","neptune","mars")),10)
SATISFIABLE

Models       : 1+
Calls        : 18
Time         : 6.531s (Solving: 0.35s 1st Model: 0.21s Unsat: 0.00s)
CPU Time     : 6.400s

Choices      : 11412    (Domain: 9240)
Conflicts    : 554      (Analyzed: 553)
Restarts     : 3        (Average: 184.33 Last: 80)
Model-Level  : 351.8   
Problems     : 18       (Average Length: 11.17 Splits: 0)
Lemmas       : 553      (Deleted: 0)
  Binary     : 54       (Ratio:   9.76%)
  Ternary    : 15       (Ratio:   2.71%)
  Conflict   : 553      (Average Length:   64.1 Ratio: 100.00%) 
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
Backjumps    : 553      (Average: 10.62 Max: 285 Sum:   5874)
  Executed   : 544      (Average: 10.52 Max: 285 Sum:   5820 Ratio:  99.08%)
  Bounded    : 9        (Average:  6.00 Max:  12 Sum:     54 Ratio:   0.92%)

Rules        : 189842  
Atoms        : 189811  
Bodies       : 182      (Original: 181)
Equivalences : 450      (Atom=Atom: 150 Body=Body: 0 Other: 300)
Tight        : Yes
Variables    : 102651   (Eliminated:    0 Frozen: 4028)
Constraints  : 493371   (Binary:  98.4% Ternary:   0.7% Other:   0.8%)

Memory Peak  : 378MB
Max. Length  : 10 steps
Sol. Length  : 10 steps
Models       : 16