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-29.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-29.pddl Parsing... Parsing: [0.020s CPU, 0.016s 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.027s wall-clock] Preparing model... [0.010s CPU, 0.014s wall-clock] Generated 42 rules. Computing model... [0.190s CPU, 0.187s wall-clock] 1534 relevant atoms 892 auxiliary atoms 2426 final queue length 4719 total queue pushes Completing instantiation... [0.440s CPU, 0.436s wall-clock] Instantiating: [0.670s CPU, 0.671s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.020s CPU, 0.024s wall-clock] Checking invariant weight... [0.000s CPU, 0.001s wall-clock] Instantiating groups... [0.020s CPU, 0.014s wall-clock] Collecting mutex groups... [0.000s CPU, 0.001s wall-clock] Choosing groups... 1 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.050s CPU, 0.052s 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.010s CPU, 0.018s wall-clock] Translating task: [0.320s CPU, 0.322s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 24 propositions removed Detecting unreachable propositions: [0.160s CPU, 0.160s wall-clock] Reordering and filtering variables... 22 of 22 variables necessary. 0 of 22 mutex groups necessary. 1224 of 1224 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.050s CPU, 0.053s wall-clock] Translator variables: 22 Translator derived variables: 0 Translator facts: 177 Translator goal facts: 2 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 1224 Translator axioms: 0 Translator task size: 7377 Translator peak memory: 37976 KB Writing output... [0.110s CPU, 0.127s wall-clock] Done! [1.400s CPU, 1.421s wall-clock] planner.py version 0.0.1 Time: 0.31s Memory: 64MB Iteration 1 Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75] Grounded Until: 0 Solving... Solving Time: 0.00s Memory: 64MB (+0MB) UNSAT Iteration Time: 0.00s Iteration 2 Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80] Grounded Until: 0 Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.11s Memory: 64MB (+0MB) Unblocking actions... Solving... Answer: 1 occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","scallop","manitoba","bavaria")),1) occurs(action(("overcome","jealousy","achievement","pork","neptune","uranus")),2) occurs(action(("overcome","hangover","excitement","scallop","neptune","uranus")),2) occurs(action(("overcome","anger","excitement","scallop","pluto","neptune")),3) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),3) occurs(action(("feast","achievement","broccoli","shrimp","pennsylvania","alsace")),4) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),5) Solving Time: 0.01s Memory: 67MB (+3MB) SAT SATISFIABLE Models : 1+ Calls : 2 Time : 0.492s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s) CPU Time : 0.470s Choices : 68 Conflicts : 22 (Analyzed: 22) Restarts : 0 Model-Level : 18.0 Problems : 2 (Average Length: 4.50 Splits: 0) Lemmas : 22 (Deleted: 0) Binary : 0 (Ratio: 0.00%) Ternary : 3 (Ratio: 13.64%) Conflict : 22 (Average Length: 18.0 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 22 (Average: 3.23 Max: 17 Sum: 71) Executed : 20 (Average: 2.59 Max: 17 Sum: 57 Ratio: 80.28%) Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 19.72%) Rules : 24958 Atoms : 24958 Bodies : 1 (Original: 0) Tight : Yes Variables : 6773 (Eliminated: 0 Frozen: 5591) Constraints : 27134 (Binary: 96.2% Ternary: 1.4% Other: 2.3%) Memory Peak : 67MB Max. Length : 5 steps Sol. Length : 5 steps