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-10.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-10.pddl Parsing... Parsing: [0.030s CPU, 0.030s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.010s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.030s wall-clock] Preparing model... [0.030s CPU, 0.029s wall-clock] Generated 42 rules. Computing model... [3.980s CPU, 3.981s wall-clock] 38374 relevant atoms 11225 auxiliary atoms 49599 final queue length 121803 total queue pushes Completing instantiation... [16.040s CPU, 16.040s wall-clock] Instantiating: [20.140s CPU, 20.138s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.250s CPU, 0.246s wall-clock] Checking invariant weight... [0.000s CPU, 0.004s wall-clock] Instantiating groups... [0.130s CPU, 0.128s wall-clock] Collecting mutex groups... [0.010s CPU, 0.009s wall-clock] Choosing groups... 2 uncovered facts Choosing groups: [0.020s CPU, 0.025s wall-clock] Building translation key... [0.010s CPU, 0.017s wall-clock] Computing fact groups: [0.500s CPU, 0.500s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.008s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.008s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.600s CPU, 0.609s wall-clock] Translating task: [11.820s CPU, 11.818s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 78 propositions removed Detecting unreachable propositions: [5.930s CPU, 5.928s wall-clock] Reordering and filtering variables... 74 of 74 variables necessary. 0 of 74 mutex groups necessary. 36738 of 36738 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [1.720s CPU, 1.725s wall-clock] Translator variables: 74 Translator derived variables: 0 Translator facts: 1346 Translator goal facts: 1 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 36738 Translator axioms: 0 Translator task size: 220679 Translator peak memory: 180696 KB Writing output... [3.730s CPU, 4.074s wall-clock] Done! [44.390s CPU, 44.726s wall-clock] planner.py version 0.0.1 Time: 9.50s Memory: 632MB 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.04s Memory: 632MB (+0MB) UNSAT Iteration Time: 0.05s 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: 3.45s Memory: 632MB (+0MB) Unblocking actions... Solving... Solving Time: 0.99s Memory: 659MB (+27MB) UNSAT Iteration Time: 6.77s 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: 3.02s Memory: 714MB (+55MB) Unblocking actions... Solving... Solving Time: 0.32s Memory: 800MB (+86MB) SAT Testing... NOT SERIALIZABLE Testing Time: 10.77s Memory: 1155MB (+355MB) Solving... Solving Time: 0.99s Memory: 1112MB (+-43MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 1112MB (+0MB) Answer: 2 occurs(action(("overcome","grief-2","rest","pork","mercury","mars")),1) occurs(action(("feast","aesthetics","flounder","kale","surrey","moravia")),1) occurs(action(("feast","intoxication","grapefruit","pepper","quebec","oregon")),1) occurs(action(("feast","learning","pepper","grapefruit","quebec","oregon")),1) occurs(action(("feast","love","orange","pork","moravia","quebec")),1) occurs(action(("feast","satisfaction","ham","pork","oregon","alsace")),1) occurs(action(("overcome","jealousy-16","aesthetics","kale","mars","neptune")),2) occurs(action(("overcome","laceration-27","learning","grapefruit","mercury","mars")),2) occurs(action(("overcome","loneliness-1","love","pork","mercury","mars")),2) occurs(action(("feast","intoxication","pepper","cantelope","moravia","quebec")),2) occurs(action(("feast","satisfaction","pork","bacon","alsace","kentucky")),2) occurs(action(("overcome","angina-30","intoxication","cantelope","mars","neptune")),3) occurs(action(("feast","aesthetics","kale","arugula","moravia","quebec")),3) occurs(action(("overcome","boils-32","intoxication","cantelope","mercury","mars")),4) occurs(action(("feast","aesthetics","arugula","beef","surrey","moravia")),4) occurs(action(("feast","aesthetics","beef","snickers","surrey","moravia")),5) occurs(action(("feast","stimulation","melon","potato","oregon","alsace")),5) occurs(action(("feast","aesthetics","snickers","lamb","oregon","alsace")),6) occurs(action(("feast","stimulation","potato","snickers","moravia","quebec")),6) occurs(action(("feast","aesthetics","lamb","tofu","surrey","moravia")),7) occurs(action(("feast","stimulation","snickers","lamb","quebec","oregon")),7) occurs(action(("succumb","jealousy-16","aesthetics","tofu","mars","neptune")),8) occurs(action(("feast","learning","grapefruit","pepper","moravia","quebec")),8) occurs(action(("feast","learning","pepper","cantelope","surrey","moravia")),9) occurs(action(("feast","learning","cantelope","arugula","moravia","quebec")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 26.101s (Solving: 0.66s 1st Model: 0.57s Unsat: 0.01s) CPU Time : 25.784s Choices : 6686 (Domain: 1787) Conflicts : 353 (Analyzed: 352) Restarts : 3 (Average: 117.33 Last: 69) Model-Level : 1647.0 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 352 (Deleted: 0) Binary : 47 (Ratio: 13.35%) Ternary : 8 (Ratio: 2.27%) Conflict : 352 (Average Length: 360.4 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 352 (Average: 10.24 Max: 1056 Sum: 3604) Executed : 334 (Average: 9.68 Max: 1056 Sum: 3408 Ratio: 94.56%) Bounded : 18 (Average: 10.89 Max: 12 Sum: 196 Ratio: 5.44%) Rules : 1362973 (Original: 1362855) Atoms : 739655 Bodies : 414618 (Original: 414511) Count : 621 (Original: 644) Equivalences : 210904 (Atom=Atom: 35 Body=Body: 0 Other: 210869) Tight : Yes Variables : 353701 (Eliminated: 0 Frozen: 221972) Constraints : 2532101 (Binary: 99.2% Ternary: 0.4% Other: 0.5%) Memory Peak : 1218MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2