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-30.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-30.pddl Parsing... Parsing: [0.020s CPU, 0.017s 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.025s wall-clock] Preparing model... [0.010s CPU, 0.016s wall-clock] Generated 42 rules. Computing model... [0.530s CPU, 0.526s wall-clock] 4582 relevant atoms 2124 auxiliary atoms 6706 final queue length 14587 total queue pushes Completing instantiation... [1.630s CPU, 1.626s wall-clock] Instantiating: [2.210s CPU, 2.205s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.050s CPU, 0.046s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.020s CPU, 0.023s wall-clock] Collecting mutex groups... [0.010s CPU, 0.002s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.010s CPU, 0.007s wall-clock] Building translation key... [0.000s CPU, 0.004s wall-clock] Computing fact groups: [0.090s CPU, 0.097s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.002s 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.002s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.070s CPU, 0.065s wall-clock] Translating task: [1.230s CPU, 1.230s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 30 propositions removed Detecting unreachable propositions: [0.570s CPU, 0.576s wall-clock] Reordering and filtering variables... 30 of 30 variables necessary. 0 of 30 mutex groups necessary. 4085 of 4085 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.200s CPU, 0.186s wall-clock] Translator variables: 30 Translator derived variables: 0 Translator facts: 319 Translator goal facts: 3 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 4085 Translator axioms: 0 Translator task size: 23507 Translator peak memory: 51916 KB Writing output... [0.400s CPU, 0.446s wall-clock] Done! [4.780s CPU, 4.819s wall-clock] planner.py version 0.0.1 Time: 0.98s Memory: 116MB 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: 116MB (+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.26s Memory: 116MB (+0MB) Unblocking actions... Solving... Solving Time: 0.03s Memory: 120MB (+4MB) SAT Testing... NOT SERIALIZABLE Testing Time: 0.80s Memory: 119MB (+-1MB) Solving... Solving Time: 0.01s Memory: 119MB (+0MB) UNSAT Iteration Time: 1.26s 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.35s Memory: 129MB (+10MB) Unblocking actions... Solving... Solving Time: 0.16s Memory: 140MB (+11MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 140MB (+0MB) Answer: 2 occurs(action(("feast","intoxication","beef","baguette","bosnia","bavaria")),1) occurs(action(("overcome","dread","intoxication","baguette","neptune","venus")),2) occurs(action(("feast","intoxication","baguette","beef","alsace","guanabara")),3) occurs(action(("feast","intoxication","beef","hotdog","oregon","bosnia")),4) occurs(action(("feast","intoxication","hotdog","mutton","moravia","kentucky")),5) occurs(action(("succumb","dread","intoxication","mutton","neptune","venus")),6) occurs(action(("overcome","boils","expectation","hamburger","neptune","venus")),7) occurs(action(("feast","expectation","hamburger","hotdog","bosnia","bavaria")),8) occurs(action(("feast","expectation","hotdog","mutton","bavaria","moravia")),9) occurs(action(("succumb","boils","expectation","mutton","neptune","venus")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 2.201s (Solving: 0.15s 1st Model: 0.14s Unsat: 0.00s) CPU Time : 2.160s Choices : 4239 (Domain: 4183) Conflicts : 675 (Analyzed: 674) Restarts : 6 (Average: 112.33 Last: 42) Model-Level : 79.5 Problems : 4 (Average Length: 7.00 Splits: 0) Lemmas : 674 (Deleted: 0) Binary : 36 (Ratio: 5.34%) Ternary : 22 (Ratio: 3.26%) Conflict : 674 (Average Length: 405.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 674 (Average: 5.78 Max: 114 Sum: 3898) Executed : 671 (Average: 5.76 Max: 114 Sum: 3883 Ratio: 99.62%) Bounded : 3 (Average: 5.00 Max: 7 Sum: 15 Ratio: 0.38%) Rules : 72254 Atoms : 72249 Bodies : 11 (Original: 10) Count : 5 Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10) Tight : Yes Variables : 42414 (Eliminated: 0 Frozen: 27229) Constraints : 212711 (Binary: 97.9% Ternary: 1.0% Other: 1.2%) Memory Peak : 154MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2