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.020s CPU, 0.021s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.006s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.040s CPU, 0.039s wall-clock] Preparing model... [0.030s CPU, 0.029s wall-clock] Generated 42 rules. Computing model... [1.190s CPU, 1.190s wall-clock] 11303 relevant atoms 5116 auxiliary atoms 16419 final queue length 36991 total queue pushes Completing instantiation... [3.880s CPU, 3.881s wall-clock] Instantiating: [5.160s CPU, 5.159s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.080s CPU, 0.079s wall-clock] Checking invariant weight... [0.000s CPU, 0.002s wall-clock] Instantiating groups... [0.040s CPU, 0.039s wall-clock] Collecting mutex groups... [0.000s CPU, 0.003s wall-clock] Choosing groups... 4 uncovered facts Choosing groups: [0.010s CPU, 0.012s wall-clock] Building translation key... [0.010s CPU, 0.006s wall-clock] Computing fact groups: [0.170s CPU, 0.168s 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.003s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.150s CPU, 0.154s wall-clock] Translating task: [2.860s CPU, 2.860s 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.500s CPU, 1.504s 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.440s CPU, 0.442s 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: 73816 KB Writing output... [0.970s CPU, 1.074s wall-clock] Done! [11.260s CPU, 11.367s wall-clock] planner.py version 0.0.1 Time: 2.25s Memory: 213MB 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: 213MB (+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.93s Memory: 213MB (+0MB) Unblocking actions... Solving... Solving Time: 0.12s Memory: 221MB (+8MB) UNSAT Iteration Time: 1.54s 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.87s Memory: 230MB (+9MB) Unblocking actions... Solving... Solving Time: 4.35s Memory: 261MB (+31MB) UNKNOWN Iteration Time: 5.70s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 1.07s Memory: 299MB (+38MB) Unblocking actions... Solving... Solving Time: 6.15s Memory: 340MB (+41MB) UNKNOWN Iteration Time: 7.71s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.90s Memory: 364MB (+24MB) Unblocking actions... Solving... Solving Time: 8.04s Memory: 387MB (+23MB) UNKNOWN Iteration Time: 9.43s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.91s Memory: 422MB (+35MB) Unblocking actions... Solving... Solving Time: 10.66s Memory: 468MB (+46MB) UNKNOWN Iteration Time: 12.10s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.95s Memory: 490MB (+22MB) Unblocking actions... Solving... Solving Time: 12.73s Memory: 513MB (+23MB) UNKNOWN Iteration Time: 14.22s Iteration 8 Queue: [(2,10,1,True), (3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)] Grounded Until: 30 Blocking actions... Solving... Solving Time: 4.04s Memory: 514MB (+1MB) UNKNOWN Iteration Time: 4.07s Iteration 9 Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)] Grounded Until: 30 Unblocking actions... Solving... Answer: 1 occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),2) occurs(action(("feast","rest","cantelope","tomato","alsace","goias")),3) occurs(action(("feast","rest","tomato","tuna","kentucky","alsace")),4) occurs(action(("feast","rest","tuna","beef","kentucky","alsace")),5) occurs(action(("overcome","abrasion","rest","beef","neptune","mars")),6) occurs(action(("feast","rest","beef","scallop","surrey","kentucky")),7) occurs(action(("feast","rest","scallop","chicken","bosnia","surrey")),8) occurs(action(("overcome","grief","rest","chicken","venus","neptune")),9) occurs(action(("succumb","anger","rest","chicken","venus","neptune")),10) occurs(action(("overcome","anger","achievement","chicken","venus","neptune")),11) occurs(action(("feast","achievement","chicken","turkey","surrey","kentucky")),12) occurs(action(("succumb","anger","achievement","turkey","venus","neptune")),13) occurs(action(("feast","rest","chicken","turkey","bosnia","surrey")),14) occurs(action(("succumb","abrasion","rest","turkey","neptune","mars")),15) Solving Time: 5.43s Memory: 514MB (+0MB) SAT SATISFIABLE Models : 1+ Calls : 9 Time : 62.603s (Solving: 51.03s 1st Model: 5.38s Unsat: 0.01s) CPU Time : 62.480s Choices : 111998 Conflicts : 66298 (Analyzed: 66297) Restarts : 678 (Average: 97.78 Last: 160) Model-Level : 41.0 Problems : 9 (Average Length: 20.33 Splits: 0) Lemmas : 66297 (Deleted: 43084) Binary : 3622 (Ratio: 5.46%) Ternary : 2083 (Ratio: 3.14%) Conflict : 66297 (Average Length: 261.2 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 66297 (Average: 1.77 Max: 98 Sum: 117437) Executed : 65730 (Average: 1.61 Max: 98 Sum: 106744 Ratio: 90.89%) Bounded : 567 (Average: 18.86 Max: 32 Sum: 10693 Ratio: 9.11%) Rules : 189516 Atoms : 189516 Bodies : 1 (Original: 0) Tight : Yes Variables : 336153 (Eliminated: 0 Frozen: 315669) Constraints : 2362399 (Binary: 98.7% Ternary: 0.6% Other: 0.7%) Memory Peak : 545MB Max. Length : 30 steps Sol. Length : 15 steps