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-1.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-1.pddl Parsing... Parsing: [0.010s CPU, 0.014s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.003s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.027s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 42 rules. Computing model... [0.050s CPU, 0.050s wall-clock] 295 relevant atoms 285 auxiliary atoms 580 final queue length 835 total queue pushes Completing instantiation... [0.060s CPU, 0.061s wall-clock] Instantiating: [0.160s CPU, 0.154s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.020s CPU, 0.020s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.004s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.020s CPU, 0.030s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.002s wall-clock] Translating task: [0.040s CPU, 0.045s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 11 propositions removed Detecting unreachable propositions: [0.020s CPU, 0.022s wall-clock] Reordering and filtering variables... 11 of 11 variables necessary. 0 of 11 mutex groups necessary. 151 of 151 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.008s wall-clock] Translator variables: 11 Translator derived variables: 0 Translator facts: 58 Translator goal facts: 1 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 151 Translator axioms: 0 Translator task size: 932 Translator peak memory: 36812 KB Writing output... [0.020s CPU, 0.019s wall-clock] Done! [0.290s CPU, 0.296s wall-clock] planner.py version 0.0.1 Time: 0.06s Memory: 51MB 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: 51MB (+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.02s Memory: 52MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 52MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.03s Memory: 53MB (+1MB) Answer: 1 occurs(action(("overcome","abrasion","rest","pork","uranus","venus")),1) occurs(action(("feast","rest","pork","lamb","alsace","quebec")),1) occurs(action(("feast","rest","lamb","flounder","surrey","pennsylvania")),2) occurs(action(("overcome","depression","rest","flounder","earth","uranus")),3) occurs(action(("feast","rest","flounder","rice","pennsylvania","alsace")),3) occurs(action(("succumb","abrasion","rest","rice","earth","uranus")),4) occurs(action(("succumb","depression","rest","rice","uranus","venus")),5) occurs(action(("feast","rest","rice","flounder","kentucky","bosnia")),5) SATISFIABLE Models : 1+ Calls : 2 Time : 0.091s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.084s Choices : 11 (Domain: 6) Conflicts : 1 (Analyzed: 1) Restarts : 0 Model-Level : 17.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 1 (Deleted: 0) Binary : 1 (Ratio: 100.00%) Ternary : 0 (Ratio: 0.00%) Conflict : 1 (Average Length: 2.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1 (Average: 1.00 Max: 1 Sum: 1) Executed : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 100.00%) Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%) Rules : 2911 Atoms : 2911 Bodies : 1 (Original: 0) Tight : Yes Variables : 1161 (Eliminated: 0 Frozen: 112) Constraints : 2826 (Binary: 90.6% Ternary: 5.6% Other: 3.8%) Memory Peak : 53MB Max. Length : 5 steps Sol. Length : 5 steps Models : 1