INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-4.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-prime-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-prime-round-1-strips/instances/instance-4.pddl Parsing... Parsing: [0.020s CPU, 0.024s wall-clock] Normalizing task... [0.000s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.038s wall-clock] Preparing model... [0.020s CPU, 0.017s wall-clock] Generated 55 rules. Computing model... [0.240s CPU, 0.239s wall-clock] 1700 relevant atoms 815 auxiliary atoms 2515 final queue length 5299 total queue pushes Completing instantiation... [0.500s CPU, 0.495s wall-clock] Instantiating: [0.800s CPU, 0.799s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.040s CPU, 0.037s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.010s CPU, 0.009s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 0 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.000s CPU, 0.001s 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.020s wall-clock] Translating task: [0.360s CPU, 0.355s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 19 propositions removed Detecting unreachable propositions: [0.180s CPU, 0.185s wall-clock] Reordering and filtering variables... 19 of 19 variables necessary. 0 of 19 mutex groups necessary. 1332 of 1332 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.060s CPU, 0.057s wall-clock] Translator variables: 19 Translator derived variables: 0 Translator facts: 139 Translator goal facts: 1 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 1332 Translator axioms: 0 Translator task size: 6959 Translator peak memory: 41164 KB Writing output... [0.120s CPU, 0.139s wall-clock] Done! [1.620s CPU, 1.638s wall-clock] planner.py version 0.0.1 Time: 0.32s Memory: 70MB 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: 70MB (+0MB) 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.08s Memory: 70MB (+0MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 71MB (+1MB) UNSAT Iteration Time: 0.12s 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.08s Memory: 73MB (+2MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 76MB (+3MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.32s Memory: 90MB (+14MB) Solving... Solving Time: 0.02s Memory: 88MB (+-2MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 88MB (+0MB) Answer: 2 occurs(action(("feast","aesthetics","shrimp","cherry","quebec","bosnia")),1) occurs(action(("drink","arugula","wurst","kentucky","oregon","bosnia","surrey","quebec")),1) occurs(action(("drink","muffin","bacon","kentucky","oregon","bosnia","quebec","bosnia")),1) occurs(action(("drink","scallop","scallion","oregon","bosnia","quebec","quebec","bosnia")),1) occurs(action(("feast","aesthetics","cherry","arugula","oregon","kentucky")),2) occurs(action(("drink","scallop","bacon","bosnia","quebec","surrey","bosnia","oregon")),2) occurs(action(("drink","muffin","grapefruit","oregon","bosnia","quebec","surrey","quebec")),2) occurs(action(("drink","ham","wurst","bosnia","quebec","surrey","quebec","bosnia")),2) occurs(action(("feast","aesthetics","arugula","wurst","bosnia","oregon")),3) occurs(action(("drink","bacon","scallop","oregon","bosnia","quebec","quebec","bosnia")),3) occurs(action(("drink","muffin","grapefruit","bosnia","quebec","surrey","quebec","bosnia")),3) occurs(action(("drink","grapefruit","scallop","bosnia","quebec","surrey","bosnia","oregon")),4) occurs(action(("feast","aesthetics","wurst","grapefruit","quebec","bosnia")),4) occurs(action(("overcome","sciatica","aesthetics","grapefruit","mars","vulcan")),5) occurs(action(("feast","aesthetics","grapefruit","wurst","surrey","quebec")),6) occurs(action(("succumb","sciatica","aesthetics","wurst","mars","vulcan")),7) occurs(action(("overcome","anger","aesthetics","wurst","mars","vulcan")),8) occurs(action(("succumb","anger","aesthetics","wurst","mars","vulcan")),9) occurs(action(("overcome","anger","aesthetics","wurst","mars","vulcan")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 0.680s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s) CPU Time : 0.664s Choices : 579 (Domain: 142) Conflicts : 60 (Analyzed: 60) Restarts : 0 Model-Level : 121.0 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 60 (Deleted: 0) Binary : 3 (Ratio: 5.00%) Ternary : 3 (Ratio: 5.00%) Conflict : 60 (Average Length: 16.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 60 (Average: 6.22 Max: 71 Sum: 373) Executed : 59 (Average: 6.02 Max: 71 Sum: 361 Ratio: 96.78%) Bounded : 1 (Average: 12.00 Max: 12 Sum: 12 Ratio: 3.22%) Rules : 46069 (Original: 46011) Atoms : 25303 Bodies : 11198 (Original: 11139) Count : 156 (Original: 161) Equivalences : 10160 (Atom=Atom: 17 Body=Body: 0 Other: 10143) Tight : Yes Variables : 14634 (Eliminated: 0 Frozen: 10898) Constraints : 104137 (Binary: 98.0% Ternary: 1.0% Other: 1.0%) Memory Peak : 90MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2