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.020s CPU, 0.025s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.025s wall-clock] Preparing model... [0.020s CPU, 0.025s wall-clock] Generated 42 rules. Computing model... [4.010s CPU, 4.010s wall-clock] 38374 relevant atoms 11225 auxiliary atoms 49599 final queue length 121803 total queue pushes Completing instantiation... [16.020s CPU, 16.010s wall-clock] Instantiating: [20.140s CPU, 20.124s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.240s CPU, 0.245s wall-clock] Checking invariant weight... [0.010s CPU, 0.004s wall-clock] Instantiating groups... [0.130s CPU, 0.127s wall-clock] Collecting mutex groups... [0.010s CPU, 0.008s wall-clock] Choosing groups... 2 uncovered facts Choosing groups: [0.030s CPU, 0.026s wall-clock] Building translation key... [0.020s CPU, 0.016s wall-clock] Computing fact groups: [0.500s CPU, 0.498s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.007s 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.610s CPU, 0.606s wall-clock] Translating task: [11.820s CPU, 11.824s 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.940s CPU, 5.926s 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.740s CPU, 1.739s 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: 180952 KB Writing output... [3.740s CPU, 4.092s wall-clock] Done! [44.400s CPU, 44.737s wall-clock] planner.py version 0.0.1 Time: 9.54s 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.40s Memory: 632MB (+0MB) Unblocking actions... Solving... Solving Time: 0.99s Memory: 660MB (+28MB) UNSAT Iteration Time: 6.87s 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: 2.97s Memory: 714MB (+54MB) Unblocking actions... Solving... Solving Time: 0.25s Memory: 801MB (+87MB) SAT Testing... NOT SERIALIZABLE Testing Time: 8.22s Memory: 1155MB (+354MB) Solving... Solving Time: 0.63s Memory: 1112MB (+-43MB) SAT Testing... SERIALIZABLE Testing Time: 7.34s Memory: 1110MB (+-2MB) Answer: 2 occurs(action(("overcome","jealousy-28","intoxication","grapefruit","mars","neptune")),1) occurs(action(("overcome","anxiety-12","learning","pepper","mercury","mars")),1) occurs(action(("overcome","loneliness-1","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","bacon","moravia","quebec")),1) occurs(action(("feast","satisfaction","ham","pork","oregon","alsace")),1) occurs(action(("overcome","jealousy-16","aesthetics","kale","mars","neptune")),2) occurs(action(("feast","aesthetics","kale","arugula","moravia","quebec")),2) occurs(action(("feast","intoxication","pepper","cantelope","moravia","quebec")),2) occurs(action(("feast","love","bacon","pork","oregon","alsace")),2) occurs(action(("feast","satisfaction","pork","bacon","alsace","kentucky")),2) occurs(action(("feast","aesthetics","arugula","beef","surrey","moravia")),3) occurs(action(("overcome","angina-30","intoxication","cantelope","mercury","mars")),4) occurs(action(("feast","aesthetics","beef","snickers","surrey","moravia")),4) occurs(action(("overcome","abrasion","love","pork","mercury","mars")),5) occurs(action(("feast","aesthetics","snickers","lamb","oregon","alsace")),5) occurs(action(("feast","stimulation","melon","potato","oregon","alsace")),5) occurs(action(("feast","aesthetics","lamb","tofu","surrey","moravia")),6) occurs(action(("feast","satisfaction","bacon","pork","quebec","oregon")),6) occurs(action(("feast","stimulation","potato","snickers","moravia","quebec")),6) occurs(action(("succumb","jealousy-16","aesthetics","tofu","mars","neptune")),7) occurs(action(("feast","stimulation","snickers","potato","quebec","oregon")),7) 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 : 23.187s (Solving: 0.56s 1st Model: 0.49s Unsat: 0.01s) CPU Time : 22.852s Choices : 9630 (Domain: 2025) Conflicts : 515 (Analyzed: 514) Restarts : 4 (Average: 128.50 Last: 56) Model-Level : 2490.0 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 514 (Deleted: 0) Binary : 61 (Ratio: 11.87%) Ternary : 13 (Ratio: 2.53%) Conflict : 514 (Average Length: 266.7 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 514 (Average: 9.19 Max: 1547 Sum: 4724) Executed : 506 (Average: 9.04 Max: 1547 Sum: 4648 Ratio: 98.39%) Bounded : 8 (Average: 9.50 Max: 12 Sum: 76 Ratio: 1.61%) Rules : 871877 (Original: 871863) Atoms : 738473 Bodies : 88704 (Original: 88689) Count : 147 (Original: 148) Equivalences : 45184 (Atom=Atom: 10 Body=Body: 0 Other: 45174) Tight : Yes Variables : 352532 (Eliminated: 0 Frozen: 56372) Constraints : 2040138 (Binary: 99.0% Ternary: 0.4% Other: 0.5%) Memory Peak : 1248MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2