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.030s CPU, 0.029s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.009s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.033s wall-clock] Preparing model... [0.020s CPU, 0.025s wall-clock] Generated 42 rules. Computing model... [1.300s CPU, 1.294s wall-clock] 11303 relevant atoms 5116 auxiliary atoms 16419 final queue length 36991 total queue pushes Completing instantiation... [4.330s CPU, 4.332s wall-clock] Instantiating: [5.710s CPU, 5.710s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.080s CPU, 0.085s wall-clock] Checking invariant weight... [0.010s CPU, 0.003s wall-clock] Instantiating groups... [0.040s CPU, 0.047s wall-clock] Collecting mutex groups... [0.000s CPU, 0.004s wall-clock] Choosing groups... 4 uncovered facts Choosing groups: [0.010s CPU, 0.013s wall-clock] Building translation key... [0.000s CPU, 0.007s wall-clock] Computing fact groups: [0.180s CPU, 0.187s wall-clock] Building STRIPS to SAS dictionary... [0.010s 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.000s CPU, 0.000s wall-clock] Processing axioms: [0.170s CPU, 0.171s wall-clock] Translating task: [3.630s CPU, 3.628s 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.670s 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.490s CPU, 0.493s 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.060s CPU, 1.157s wall-clock] Done! [12.930s CPU, 13.023s wall-clock] planner.py version 0.0.1 Time: 2.62s 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.86s Memory: 228MB (+0MB) Unblocking actions... Solving... Solving Time: 0.11s Memory: 237MB (+9MB) UNSAT Iteration Time: 1.45s 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.79s Memory: 237MB (+0MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 266MB (+29MB) SAT Testing... NOT SERIALIZABLE Testing Time: 2.22s Memory: 268MB (+2MB) Solving... Solving Time: 3.60s Memory: 268MB (+0MB) UNKNOWN Iteration Time: 7.19s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 1.06s Memory: 318MB (+50MB) Unblocking actions... Solving... Solving Time: 5.84s Memory: 363MB (+45MB) UNKNOWN Iteration Time: 7.39s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.89s Memory: 387MB (+24MB) Unblocking actions... Solving... Solving Time: 0.58s Memory: 409MB (+22MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 409MB (+0MB) Answer: 2 occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),2) occurs(action(("feast","rest","cantelope","tomato","alsace","goias")),3) occurs(action(("feast","rest","tomato","tuna","kentucky","alsace")),4) occurs(action(("feast","rest","tuna","beef","kentucky","alsace")),5) occurs(action(("feast","rest","beef","scallop","surrey","kentucky")),6) occurs(action(("feast","rest","scallop","chicken","bosnia","surrey")),7) occurs(action(("feast","rest","chicken","turkey","surrey","kentucky")),8) occurs(action(("succumb","anger","rest","turkey","mars","saturn")),9) occurs(action(("feast","love","tomato","tuna","surrey","kentucky")),10) occurs(action(("feast","love","tuna","beef","surrey","kentucky")),11) occurs(action(("overcome","abrasion","love","beef","venus","neptune")),12) occurs(action(("feast","love","beef","papaya","bosnia","surrey")),13) occurs(action(("feast","love","papaya","chicken","bosnia","surrey")),14) occurs(action(("feast","love","chicken","turkey","bosnia","surrey")),15) occurs(action(("succumb","abrasion","love","turkey","venus","neptune")),16) occurs(action(("feast","satisfaction","pistachio","muffin","kentucky","alsace")),17) occurs(action(("overcome","prostatitis","satisfaction","muffin","neptune","mars")),18) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),19) occurs(action(("feast","satisfaction","muffin","bacon","kentucky","alsace")),20) SATISFIABLE Models : 1+ Calls : 6 Time : 18.663s (Solving: 9.95s 1st Model: 0.55s Unsat: 0.00s) CPU Time : 18.572s Choices : 83646 (Domain: 82592) Conflicts : 17515 (Analyzed: 17514) Restarts : 209 (Average: 83.80 Last: 89) Model-Level : 251.0 Problems : 6 (Average Length: 12.00 Splits: 0) Lemmas : 17514 (Deleted: 12153) Binary : 580 (Ratio: 3.31%) Ternary : 229 (Ratio: 1.31%) Conflict : 17514 (Average Length: 462.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 17514 (Average: 3.85 Max: 252 Sum: 67403) Executed : 17479 (Average: 3.83 Max: 252 Sum: 67033 Ratio: 99.45%) Bounded : 35 (Average: 10.57 Max: 17 Sum: 370 Ratio: 0.55%) Rules : 189560 Atoms : 189550 Bodies : 21 (Original: 20) Count : 10 Equivalences : 30 (Atom=Atom: 10 Body=Body: 0 Other: 20) Tight : Yes Variables : 219393 (Eliminated: 0 Frozen: 168581) Constraints : 1430052 (Binary: 98.7% Ternary: 0.6% Other: 0.7%) Memory Peak : 423MB Max. Length : 20 steps Sol. Length : 20 steps Models : 2