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-15.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-15.pddl Parsing... Parsing: [0.030s CPU, 0.028s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.008s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock] Preparing model... [0.020s CPU, 0.024s wall-clock] Generated 42 rules. Computing model... [1.930s CPU, 1.931s wall-clock] 17570 relevant atoms 6412 auxiliary atoms 23982 final queue length 56683 total queue pushes Completing instantiation... [7.660s CPU, 7.657s wall-clock] Instantiating: [9.680s CPU, 9.673s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.120s CPU, 0.124s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.060s CPU, 0.058s wall-clock] Collecting mutex groups... [0.000s CPU, 0.005s wall-clock] Choosing groups... 0 uncovered facts Choosing groups: [0.020s CPU, 0.014s wall-clock] Building translation key... [0.010s CPU, 0.008s wall-clock] Computing fact groups: [0.240s CPU, 0.246s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.005s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.280s CPU, 0.272s wall-clock] Translating task: [5.310s CPU, 5.306s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 52 propositions removed Detecting unreachable propositions: [2.670s CPU, 2.674s wall-clock] Reordering and filtering variables... 52 of 52 variables necessary. 0 of 52 mutex groups necessary. 16665 of 16665 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.790s CPU, 0.785s wall-clock] Translator variables: 52 Translator derived variables: 0 Translator facts: 681 Translator goal facts: 1 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 16665 Translator axioms: 0 Translator task size: 98645 Translator peak memory: 100988 KB Writing output... [1.690s CPU, 1.848s wall-clock] Done! [20.640s CPU, 20.794s wall-clock] planner.py version 0.0.1 Time: 4.28s Memory: 332MB 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.02s Memory: 332MB (+0MB) UNSAT Iteration Time: 0.02s 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: 1.28s Memory: 332MB (+0MB) Unblocking actions... Solving... Solving Time: 0.24s Memory: 346MB (+14MB) SAT Testing... NOT SERIALIZABLE Testing Time: 3.35s Memory: 353MB (+7MB) Solving... Solving Time: 0.02s Memory: 353MB (+0MB) UNSAT Iteration Time: 5.71s 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: 1.62s Memory: 375MB (+22MB) Unblocking actions... Solving... Solving Time: 0.09s Memory: 422MB (+47MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 422MB (+0MB) Answer: 2 occurs(action(("feast","learning","broccoli","pistachio","surrey","moravia")),1) occurs(action(("overcome","jealousy","learning","pistachio","mars","neptune")),2) occurs(action(("feast","learning","pistachio","broccoli","surrey","moravia")),3) occurs(action(("feast","learning","broccoli","lemon","goias","surrey")),4) occurs(action(("feast","learning","lemon","cod","bavaria","alsace")),5) occurs(action(("feast","learning","cod","chicken","pennsylvania","quebec")),6) occurs(action(("succumb","jealousy","learning","chicken","mars","neptune")),7) occurs(action(("overcome","anxiety","curiosity","turkey","uranus","mars")),8) occurs(action(("overcome","dread","empathy","onion","uranus","mars")),9) occurs(action(("overcome","prostatitis","learning","chicken","mars","neptune")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 9.554s (Solving: 0.05s 1st Model: 0.03s Unsat: 0.01s) CPU Time : 9.288s Choices : 729 (Domain: 627) Conflicts : 142 (Analyzed: 141) Restarts : 1 (Average: 141.00 Last: 62) Model-Level : 127.5 Problems : 4 (Average Length: 7.00 Splits: 0) Lemmas : 141 (Deleted: 0) Binary : 21 (Ratio: 14.89%) Ternary : 4 (Ratio: 2.84%) Conflict : 141 (Average Length: 17.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 141 (Average: 3.85 Max: 70 Sum: 543) Executed : 133 (Average: 3.50 Max: 70 Sum: 493 Ratio: 90.79%) Bounded : 8 (Average: 6.25 Max: 7 Sum: 50 Ratio: 9.21%) Rules : 298800 Atoms : 298795 Bodies : 11 (Original: 10) Count : 5 Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10) Tight : Yes Variables : 161389 (Eliminated: 0 Frozen: 104012) Constraints : 879392 (Binary: 98.9% Ternary: 0.5% Other: 0.6%) Memory Peak : 486MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2