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-26.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-26.pddl Parsing... Parsing: [0.020s CPU, 0.023s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.032s wall-clock] Preparing model... [0.020s CPU, 0.017s wall-clock] Generated 42 rules. Computing model... [0.260s CPU, 0.259s wall-clock] 1849 relevant atoms 1334 auxiliary atoms 3183 final queue length 6104 total queue pushes Completing instantiation... [0.600s CPU, 0.607s wall-clock] Instantiating: [0.920s CPU, 0.924s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.040s CPU, 0.029s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.010s CPU, 0.014s wall-clock] Collecting mutex groups... [0.010s CPU, 0.001s wall-clock] Choosing groups... 3 uncovered facts Choosing groups: [0.000s CPU, 0.003s wall-clock] Building translation key... [0.000s CPU, 0.002s wall-clock] Computing fact groups: [0.060s CPU, 0.058s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.002s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.001s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.020s CPU, 0.026s wall-clock] Translating task: [0.450s CPU, 0.446s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 29 propositions removed Detecting unreachable propositions: [0.240s CPU, 0.248s wall-clock] Reordering and filtering variables... 23 of 23 variables necessary. 0 of 23 mutex groups necessary. 1536 of 1536 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.080s CPU, 0.072s wall-clock] Translator variables: 23 Translator derived variables: 0 Translator facts: 174 Translator goal facts: 1 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 1536 Translator axioms: 0 Translator task size: 9030 Translator peak memory: 42188 KB Writing output... [0.150s CPU, 0.173s wall-clock] Done! [1.950s CPU, 1.972s wall-clock] planner.py version 0.0.1 Time: 0.37s Memory: 74MB 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: 75MB (+1MB) 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.10s Memory: 75MB (+0MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 75MB (+0MB) SAT Testing... NOT SERIALIZABLE Testing Time: 5.23s Memory: 304MB (+229MB) Solving... Solving Time: 0.09s Memory: 304MB (+0MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 304MB (+0MB) Answer: 2 occurs(action(("overcome","boils","entertainment","haroset","earth","neptune")),1) occurs(action(("overcome","jealousy","satisfaction","snickers","venus","saturn")),1) occurs(action(("feast","entertainment","haroset","endive","oregon","bavaria")),1) occurs(action(("feast","satisfaction","snickers","pepper","moravia","kentucky")),1) occurs(action(("feast","understanding","papaya","flounder","moravia","kentucky")),1) occurs(action(("overcome","depression","learning","marzipan","earth","neptune")),1) occurs(action(("feast","entertainment","endive","pistachio","moravia","kentucky")),2) occurs(action(("feast","understanding","flounder","pepper","kentucky","quebec")),2) occurs(action(("succumb","jealousy","satisfaction","pepper","venus","saturn")),2) occurs(action(("overcome","jealousy","understanding","pepper","earth","neptune")),3) occurs(action(("feast","entertainment","pistachio","turkey","moravia","kentucky")),3) occurs(action(("feast","entertainment","turkey","papaya","manitoba","oregon")),4) occurs(action(("succumb","boils","entertainment","papaya","earth","neptune")),5) SATISFIABLE Models : 1+ Calls : 3 Time : 5.559s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 5.548s Choices : 151 (Domain: 137) Conflicts : 16 (Analyzed: 16) Restarts : 0 Model-Level : 47.5 Problems : 3 (Average Length: 5.33 Splits: 0) Lemmas : 16 (Deleted: 0) Binary : 5 (Ratio: 31.25%) Ternary : 5 (Ratio: 31.25%) Conflict : 16 (Average Length: 3.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 16 (Average: 4.81 Max: 15 Sum: 77) Executed : 15 (Average: 4.38 Max: 15 Sum: 70 Ratio: 90.91%) Bounded : 1 (Average: 7.00 Max: 7 Sum: 7 Ratio: 9.09%) Rules : 2044414 Atoms : 2039786 Bodies : 14385 (Original: 14384) Equivalences : 53386 (Atom=Atom: 13631 Body=Body: 8144 Other: 31611) Tight : No (SCCs: 502 Non-Hcfs: 0 Nodes: 9347 Gammas: 0) Variables : 11836 (Eliminated: 0 Frozen: 6467) Constraints : 21375 (Binary: 95.9% Ternary: 2.0% Other: 2.1%) Memory Peak : 320MB Max. Length : 5 steps Sol. Length : 5 steps Models : 2