INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-3.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/grid-round-2-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/grid-round-2-strips/instances/instance-3.pddl Parsing... Parsing: [0.030s CPU, 0.041s wall-clock] Normalizing task... [0.010s CPU, 0.002s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.011s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock] Preparing model... [0.030s CPU, 0.034s wall-clock] Generated 46 rules. Computing model... [0.860s CPU, 0.866s wall-clock] 8296 relevant atoms 3303 auxiliary atoms 11599 final queue length 24725 total queue pushes Completing instantiation... [2.490s CPU, 2.487s wall-clock] Instantiating: [3.420s CPU, 3.435s wall-clock] Computing fact groups... Finding invariants... 12 initial candidates Finding invariants: [0.030s CPU, 0.024s wall-clock] Checking invariant weight... [0.000s CPU, 0.005s wall-clock] Instantiating groups... [0.020s CPU, 0.014s wall-clock] Collecting mutex groups... [0.010s CPU, 0.004s wall-clock] Choosing groups... 1 uncovered facts Choosing groups: [0.010s CPU, 0.014s wall-clock] Building translation key... [0.010s CPU, 0.009s wall-clock] Computing fact groups: [0.100s CPU, 0.101s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.004s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.004s wall-clock] Building mutex information... Building mutex information: [0.010s CPU, 0.005s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.110s CPU, 0.115s wall-clock] Translating task: [2.120s CPU, 2.120s wall-clock] 539 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 139 propositions removed Detecting unreachable propositions: [0.970s CPU, 0.973s wall-clock] Reordering and filtering variables... 23 of 23 variables necessary. 1 of 23 mutex groups necessary. 6716 of 6716 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.310s CPU, 0.312s wall-clock] Translator variables: 23 Translator derived variables: 0 Translator facts: 621 Translator goal facts: 5 Translator mutex groups: 1 Translator total mutex groups size: 12 Translator operators: 6716 Translator axioms: 0 Translator task size: 39874 Translator peak memory: 62668 KB Writing output... [0.680s CPU, 0.736s wall-clock] Done! [7.750s CPU, 7.824s wall-clock] planner.py version 0.0.1 Time: 1.46s Memory: 148MB 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: 148MB (+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.50s Memory: 148MB (+0MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 151MB (+3MB) UNSAT Iteration Time: 0.84s 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.57s Memory: 172MB (+21MB) Unblocking actions... Solving... Solving Time: 0.06s Memory: 191MB (+19MB) UNSAT Iteration Time: 0.95s 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: 0.52s Memory: 201MB (+10MB) Unblocking actions... Solving... Solving Time: 2.47s Memory: 222MB (+21MB) UNSAT Iteration Time: 3.29s 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.54s Memory: 253MB (+31MB) Unblocking actions... Solving... Solving Time: 10.34s Memory: 322MB (+69MB) UNSAT Iteration Time: 11.19s 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.56s Memory: 341MB (+19MB) Unblocking actions... Solving... Solving Time: 22.74s Memory: 466MB (+125MB) UNKNOWN Iteration Time: 23.64s 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.68s Memory: 478MB (+12MB) Unblocking actions... Solving... Solving Time: 25.17s Memory: 514MB (+36MB) UNKNOWN Iteration Time: 26.21s Iteration 8 Queue: [(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), (16,80,0,True), (17,85,0,True), (18,90,0,True)] Grounded Until: 30 Blocking actions... Solving... Solving Time: 26.59s Memory: 528MB (+14MB) UNKNOWN Iteration Time: 26.64s Iteration 9 Queue: [(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), (16,80,0,True), (17,85,0,True), (18,90,0,True)] Grounded Until: 30 Unblocking actions... Solving... Solving Time: 27.10s Memory: 528MB (+0MB) UNKNOWN Iteration Time: 27.13s Iteration 10 Queue: [(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), (16,80,0,True), (17,85,0,True), (18,90,0,True)] Grounded Until: 30 Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])] Grounding Time: 0.53s Memory: 528MB (+0MB) Unblocking actions... Solving... Solving Time: 21.43s Memory: 538MB (+10MB) UNKNOWN Iteration Time: 22.34s Iteration 11 Queue: [(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), (16,80,0,True), (17,85,0,True), (18,90,0,True)] Grounded Until: 35 Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])] Grounding Time: 0.53s Memory: 538MB (+0MB) Unblocking actions... Solving... Solving Time: 22.97s Memory: 543MB (+5MB) UNKNOWN Iteration Time: 23.89s Iteration 12 Queue: [(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), (16,80,0,True), (17,85,0,True), (18,90,0,True)] Grounded Until: 40 Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])] Grounding Time: 0.56s Memory: 543MB (+0MB) Unblocking actions... Solving... Solving Time: 3.10s Memory: 548MB (+5MB) SAT Testing... SERIALIZABLE Testing Time: 1.19s Memory: 597MB (+49MB) Answer: 1 occurs(action(("move","node3-4","node2-4")),1) occurs(action(("pickup","node2-4","key1")),2) occurs(action(("move","node2-4","node3-4")),2) occurs(action(("move","node3-4","node3-5")),3) occurs(action(("move","node3-5","node3-6")),4) occurs(action(("move","node3-6","node4-6")),5) occurs(action(("putdown","node4-6","key1")),6) occurs(action(("move","node4-6","node3-6")),6) occurs(action(("move","node3-6","node2-6")),7) occurs(action(("move","node2-6","node1-6")),8) occurs(action(("move","node1-6","node1-5")),9) occurs(action(("move","node1-5","node1-4")),10) occurs(action(("pickup","node1-5","key6")),10) occurs(action(("pickup-and-loose","node1-4","key0","key6")),11) occurs(action(("move","node1-4","node1-3")),11) occurs(action(("move","node1-3","node1-2")),12) occurs(action(("unlock","node1-3","node2-3","key0","diamond")),12) occurs(action(("move","node1-2","node1-3")),13) occurs(action(("unlock","node1-2","node2-2","key0","diamond")),13) occurs(action(("move","node1-3","node1-4")),14) occurs(action(("move","node1-4","node0-4")),15) occurs(action(("move","node0-4","node0-5")),16) occurs(action(("putdown","node0-5","key0")),17) occurs(action(("move","node0-5","node0-4")),17) occurs(action(("move","node0-4","node1-4")),18) occurs(action(("pickup","node1-4","key9")),19) occurs(action(("move","node1-4","node1-3")),19) occurs(action(("move","node1-3","node1-2")),20) occurs(action(("move","node1-2","node1-1")),21) occurs(action(("move","node1-1","node1-0")),22) occurs(action(("putdown","node1-0","key9")),23) occurs(action(("move","node1-0","node1-1")),23) occurs(action(("move","node1-1","node1-2")),24) occurs(action(("pickup","node1-1","key10")),24) occurs(action(("move","node1-2","node2-2")),25) occurs(action(("pickup-and-loose","node2-2","key8","key10")),26) occurs(action(("putdown","node2-2","key8")),27) occurs(action(("unlock","node2-2","node3-2","key8","diamond")),27) occurs(action(("move","node2-2","node3-2")),28) occurs(action(("pickup","node3-2","key2")),29) occurs(action(("move","node3-2","node2-2")),29) occurs(action(("move","node2-2","node1-2")),30) occurs(action(("move","node1-2","node1-3")),31) occurs(action(("move","node1-3","node1-4")),32) occurs(action(("move","node1-4","node1-5")),33) occurs(action(("move","node1-5","node0-5")),34) occurs(action(("putdown","node0-5","key2")),35) occurs(action(("move","node0-5","node1-5")),35) occurs(action(("move","node1-5","node1-4")),36) occurs(action(("move","node1-4","node2-4")),37) occurs(action(("pickup","node2-4","key4")),38) occurs(action(("move","node2-4","node3-4")),38) occurs(action(("move","node3-4","node3-5")),39) occurs(action(("move","node3-5","node4-5")),40) occurs(action(("move","node4-5","node5-5")),41) occurs(action(("move","node5-5","node5-6")),42) occurs(action(("putdown","node5-6","key4")),43) occurs(action(("move","node5-6","node5-5")),43) occurs(action(("move","node5-5","node4-5")),44) occurs(action(("move","node4-5","node5-5")),45) SATISFIABLE Models : 1+ Calls : 12 Time : 171.601s (Solving: 161.41s 1st Model: 3.00s Unsat: 12.75s) CPU Time : 171.628s Choices : 977850 (Domain: 977845) Conflicts : 66985 (Analyzed: 66982) Restarts : 717 (Average: 93.42 Last: 100) Model-Level : 3568.0 Problems : 12 (Average Length: 25.75 Splits: 0) Lemmas : 66982 (Deleted: 59431) Binary : 1062 (Ratio: 1.59%) Ternary : 751 (Ratio: 1.12%) Conflict : 66982 (Average Length: 10368.3 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 66982 (Average: 4.86 Max: 1780 Sum: 325507) Executed : 66879 (Average: 4.83 Max: 1780 Sum: 323654 Ratio: 99.43%) Bounded : 103 (Average: 17.99 Max: 32 Sum: 1853 Ratio: 0.57%) Rules : 121104 Atoms : 121104 Bodies : 1 (Original: 0) Tight : Yes Variables : 344868 (Eliminated: 0 Frozen: 25988) Constraints : 2232564 (Binary: 97.9% Ternary: 1.0% Other: 1.1%) Memory Peak : 597MB Max. Length : 45 steps Sol. Length : 45 steps Models : 1