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.019s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.005s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock] Preparing model... [0.010s CPU, 0.015s wall-clock] Generated 42 rules. Computing model... [0.260s CPU, 0.254s wall-clock] 1849 relevant atoms 1334 auxiliary atoms 3183 final queue length 6104 total queue pushes Completing instantiation... [0.600s CPU, 0.604s wall-clock] Instantiating: [0.900s CPU, 0.909s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.040s CPU, 0.030s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s 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.059s 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.024s wall-clock] Translating task: [0.440s CPU, 0.445s 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.250s 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.073s 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: 41932 KB Writing output... [0.150s CPU, 0.171s wall-clock] Done! [1.930s CPU, 1.950s wall-clock] planner.py version 0.0.1 Time: 0.36s 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: 76MB (+1MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.31s Memory: 76MB (+0MB) Solving... Solving Time: 0.00s Memory: 76MB (+0MB) UNSAT Iteration Time: 0.46s 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.13s Memory: 81MB (+5MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 85MB (+4MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 85MB (+0MB) Answer: 2 occurs(action(("feast","empathy","scallop","hamburger","manitoba","oregon")),1) occurs(action(("feast","empathy","hamburger","haroset","oregon","bavaria")),2) occurs(action(("overcome","boils","empathy","haroset","neptune","venus")),3) occurs(action(("feast","empathy","haroset","endive","oregon","bavaria")),4) occurs(action(("feast","empathy","endive","pistachio","moravia","kentucky")),5) occurs(action(("feast","empathy","pistachio","turkey","moravia","kentucky")),6) occurs(action(("feast","empathy","turkey","papaya","manitoba","oregon")),7) occurs(action(("succumb","boils","empathy","papaya","neptune","venus")),8) occurs(action(("feast","entertainment","haroset","marzipan","manitoba","oregon")),9) occurs(action(("overcome","depression","entertainment","marzipan","earth","neptune")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 0.742s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.728s Choices : 181 (Domain: 170) Conflicts : 42 (Analyzed: 41) Restarts : 0 Model-Level : 47.5 Problems : 4 (Average Length: 7.00 Splits: 0) Lemmas : 41 (Deleted: 0) Binary : 6 (Ratio: 14.63%) Ternary : 2 (Ratio: 4.88%) Conflict : 41 (Average Length: 29.8 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 41 (Average: 2.59 Max: 10 Sum: 106) Executed : 40 (Average: 2.56 Max: 10 Sum: 105 Ratio: 99.06%) Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.94%) Rules : 27700 Atoms : 27695 Bodies : 11 (Original: 10) Count : 5 Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10) Tight : Yes Variables : 17182 (Eliminated: 0 Frozen: 10971) Constraints : 89921 (Binary: 97.1% Ternary: 1.4% Other: 1.5%) Memory Peak : 90MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2