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-6.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-6.pddl Parsing... Parsing: [0.030s CPU, 0.024s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.007s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.030s CPU, 0.029s wall-clock] Preparing model... [0.020s CPU, 0.022s wall-clock] Generated 42 rules. Computing model... [1.300s CPU, 1.292s wall-clock] 11303 relevant atoms 5116 auxiliary atoms 16419 final queue length 36991 total queue pushes Completing instantiation... [4.320s CPU, 4.324s wall-clock] Instantiating: [5.690s CPU, 5.690s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.080s CPU, 0.081s wall-clock] Checking invariant weight... [0.000s CPU, 0.003s wall-clock] Instantiating groups... [0.050s CPU, 0.047s wall-clock] Collecting mutex groups... [0.010s CPU, 0.004s wall-clock] Choosing groups... 4 uncovered facts Choosing groups: [0.010s CPU, 0.014s wall-clock] Building translation key... [0.000s CPU, 0.007s wall-clock] Computing fact groups: [0.180s CPU, 0.183s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock] Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.004s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.170s CPU, 0.171s wall-clock] Translating task: [3.220s CPU, 3.210s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 54 propositions removed Detecting unreachable propositions: [1.670s CPU, 1.671s wall-clock] Reordering and filtering variables... 46 of 46 variables necessary. 0 of 46 mutex groups necessary. 10539 of 10539 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.500s CPU, 0.496s wall-clock] Translator variables: 46 Translator derived variables: 0 Translator facts: 552 Translator goal facts: 2 Translator mutex groups: 0 Translator total mutex groups size: 0 Translator operators: 10539 Translator axioms: 0 Translator task size: 62529 Translator peak memory: 77004 KB Writing output... [1.070s CPU, 1.164s wall-clock] Done! [12.510s CPU, 12.590s wall-clock] planner.py version 0.0.1 Time: 2.63s Memory: 228MB 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.01s Memory: 228MB (+0MB) UNSAT Iteration Time: 0.01s 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.86s Memory: 228MB (+0MB) Unblocking actions... Solving... Solving Time: 0.11s Memory: 237MB (+9MB) UNSAT Iteration Time: 1.45s 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.79s Memory: 237MB (+0MB) Unblocking actions... Solving... Solving Time: 0.10s Memory: 262MB (+25MB) SAT Testing... NOT SERIALIZABLE Testing Time: 3.28s Memory: 376MB (+114MB) Solving... Solving Time: 0.63s Memory: 364MB (+-12MB) SAT Testing... SERIALIZABLE? Testing Time: 0.00s Memory: 364MB (+0MB) Answer: 2 occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),1) occurs(action(("feast","aesthetics","cantelope","tomato","alsace","goias")),1) occurs(action(("feast","love","tomato","tuna","kentucky","alsace")),1) occurs(action(("feast","lubricity","wonderbread","marzipan","goias","quebec")),1) occurs(action(("feast","satisfaction","pistachio","onion","kentucky","alsace")),1) occurs(action(("feast","triumph","turkey","onion","kentucky","alsace")),1) occurs(action(("feast","satisfaction","onion","turkey","alsace","goias")),2) occurs(action(("feast","aesthetics","tomato","tuna","surrey","kentucky")),2) occurs(action(("feast","love","tuna","beef","kentucky","alsace")),2) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),2) occurs(action(("overcome","abrasion","love","beef","venus","neptune")),3) occurs(action(("feast","rest","cantelope","tomato","kentucky","alsace")),3) occurs(action(("feast","love","beef","scallop","surrey","kentucky")),4) occurs(action(("feast","rest","tomato","tuna","bosnia","surrey")),4) occurs(action(("feast","love","scallop","chicken","bosnia","surrey")),5) occurs(action(("feast","rest","tuna","beef","surrey","kentucky")),5) occurs(action(("feast","love","chicken","turkey","surrey","kentucky")),6) occurs(action(("feast","aesthetics","tuna","tomato","bosnia","surrey")),6) occurs(action(("feast","rest","beef","papaya","bosnia","surrey")),6) occurs(action(("succumb","abrasion","love","turkey","venus","neptune")),7) occurs(action(("feast","rest","papaya","chicken","bosnia","surrey")),7) occurs(action(("feast","rest","chicken","turkey","bosnia","surrey")),8) occurs(action(("feast","love","turkey","onion","surrey","kentucky")),8) occurs(action(("succumb","anger","rest","turkey","mars","saturn")),9) occurs(action(("feast","triumph","onion","mutton","kentucky","alsace")),9) occurs(action(("feast","triumph","mutton","bacon","surrey","kentucky")),10) SATISFIABLE Models : 1+ Calls : 4 Time : 7.190s (Solving: 0.55s 1st Model: 0.53s Unsat: 0.00s) CPU Time : 7.052s Choices : 9992 (Domain: 9661) Conflicts : 1773 (Analyzed: 1772) Restarts : 17 (Average: 104.24 Last: 80) Model-Level : 320.0 Problems : 4 (Average Length: 8.25 Splits: 0) Lemmas : 1772 (Deleted: 0) Binary : 133 (Ratio: 7.51%) Ternary : 40 (Ratio: 2.26%) Conflict : 1772 (Average Length: 158.1 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 1772 (Average: 4.96 Max: 163 Sum: 8796) Executed : 1754 (Average: 4.87 Max: 163 Sum: 8634 Ratio: 98.16%) Bounded : 18 (Average: 9.00 Max: 12 Sum: 162 Ratio: 1.84%) Rules : 368193 (Original: 368001) Atoms : 211538 Bodies : 102873 (Original: 102704) Count : 377 (Original: 403) Equivalences : 55142 (Atom=Atom: 30 Body=Body: 0 Other: 55112) Tight : Yes Variables : 103681 (Eliminated: 0 Frozen: 59047) Constraints : 652853 (Binary: 98.7% Ternary: 0.6% Other: 0.8%) Memory Peak : 376MB Max. Length : 10 steps Sol. Length : 10 steps Models : 2