INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-13.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-13.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-2006/domains/trucks-propositional-strips/domains/domain-13.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-13.pddl Parsing... Parsing: [5.640s CPU, 5.647s wall-clock] Normalizing task... [1.030s CPU, 1.027s wall-clock] Instantiating... Generating Datalog program... [0.810s CPU, 0.807s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [1.790s CPU, 1.793s wall-clock] Preparing model... [1.590s CPU, 1.584s wall-clock] Generated 18001 rules. Computing model... [0.600s CPU, 0.604s wall-clock] 6888 relevant atoms 0 auxiliary atoms 6888 final queue length 18017 total queue pushes Completing instantiation... [1.390s CPU, 1.388s wall-clock] Instantiating: [6.260s CPU, 6.260s wall-clock] Computing fact groups... Finding invariants... 826 initial candidates Time limit reached, aborting invariant generation Finding invariants: [300.500s CPU, 300.369s wall-clock] Checking invariant weight... [0.180s CPU, 0.177s wall-clock] Instantiating groups... [0.060s CPU, 0.055s wall-clock] Collecting mutex groups... [0.010s CPU, 0.018s wall-clock] Choosing groups... 711 uncovered facts Choosing groups: [0.130s CPU, 0.122s wall-clock] Building translation key... [0.030s CPU, 0.023s wall-clock] Computing fact groups: [301.150s CPU, 301.011s wall-clock] Building STRIPS to SAS dictionary... [0.010s CPU, 0.007s wall-clock] Building dictionary for full mutex groups... [0.060s CPU, 0.065s wall-clock] Building mutex information... Building mutex information: [0.110s CPU, 0.110s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.080s CPU, 0.077s wall-clock] Translating task: [5.520s CPU, 5.515s wall-clock] 0 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 6 propositions removed Detecting unreachable propositions: [1.280s CPU, 1.280s wall-clock] Reordering and filtering variables... 24 of 726 variables necessary. 729 of 749 mutex groups necessary. 6060 of 6060 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.340s CPU, 0.345s wall-clock] Translator variables: 24 Translator derived variables: 0 Translator facts: 142 Translator goal facts: 9 Translator mutex groups: 729 Translator total mutex groups size: 6579 Translator operators: 6060 Translator axioms: 0 Translator task size: 32449 Translator peak memory: 264456 KB Writing output... [0.590s CPU, 0.632s wall-clock] Done! [322.060s CPU, 321.972s wall-clock] planner.py version 0.0.1 Time: 0.72s Memory: 80MB 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.00s Memory: 81MB (+1MB) 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 Expected Memory: 81MB Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])] Grounding Time: 0.11s Memory: 82MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 83MB (+1MB) UNSAT Iteration Time: 0.13s 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 Expected Memory: 85.0MB Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])] Grounding Time: 0.11s Memory: 86MB (+3MB) Unblocking actions... Solving... Solving Time: 0.89s Memory: 90MB (+4MB) UNKNOWN Iteration Time: 1.02s Iteration 4 Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 10 Expected Memory: 97.0MB Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])] Grounding Time: 0.11s Memory: 95MB (+5MB) Unblocking actions... Solving... Solving Time: 1.43s Memory: 106MB (+11MB) UNKNOWN Iteration Time: 1.57s Iteration 5 Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)] Grounded Until: 15 Expected Memory: 122.0MB Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])] Grounding Time: 0.11s Memory: 108MB (+2MB) Unblocking actions... Solving... Solving Time: 2.04s Memory: 127MB (+19MB) UNKNOWN Iteration Time: 2.19s Iteration 6 Queue: [(5,25,0,True), (6,30,0,True)] Grounded Until: 20 Expected Memory: 148.0MB Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])] Grounding Time: 0.15s Memory: 130MB (+3MB) Unblocking actions... Solving... Solving Time: 2.40s Memory: 143MB (+13MB) UNKNOWN Iteration Time: 2.59s Iteration 7 Queue: [(6,30,0,True)] Grounded Until: 25 Expected Memory: 164.0MB Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])] Grounding Time: 0.11s Memory: 143MB (+0MB) Unblocking actions... Solving... Solving Time: 2.61s Memory: 149MB (+6MB) UNKNOWN Iteration Time: 2.75s 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: 1.39s Memory: 149MB (+0MB) UNKNOWN Iteration Time: 1.40s 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... Solving Time: 1.32s Memory: 149MB (+0MB) UNKNOWN Iteration Time: 1.32s Iteration 10 Queue: [(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... Solving Time: 0.07s Memory: 149MB (+0MB) SAT Testing... SERIALIZABLE Testing Time: 0.48s Memory: 149MB (+0MB) Answer: 1 occurs(action("drive_truck1_l5_l1_t0_t1"),1) occurs(action("drive_truck1_l1_l2_t1_t2"),2) occurs(action("load_package1_truck1_a4_l1"),2) occurs(action("load_package3_truck1_a3_l1"),2) occurs(action("load_package4_truck1_a1_l1"),2) occurs(action("unload_package4_truck1_a1_l2"),3) occurs(action("deliver_package4_l2_t2_t5"),4) occurs(action("unload_package3_truck1_a3_l2"),4) occurs(action("drive_truck1_l2_l1_t2_t3"),4) occurs(action("load_package7_truck1_a1_l2"),4) occurs(action("deliver_package3_l2_t3_t5"),5) occurs(action("unload_package7_truck1_a1_l1"),5) occurs(action("deliver_package7_l1_t3_t10"),6) occurs(action("drive_truck1_l1_l4_t3_t4"),6) occurs(action("load_package2_truck1_a1_l1"),6) occurs(action("unload_package2_truck1_a1_l4"),7) occurs(action("drive_truck1_l4_l5_t4_t5"),7) occurs(action("deliver_package2_l4_t5_t5"),8) occurs(action("unload_package1_truck1_a4_l5"),8) occurs(action("deliver_package1_l5_t5_t5"),9) occurs(action("drive_truck1_l5_l2_t5_t6"),9) occurs(action("drive_truck1_l2_l4_t6_t7"),10) occurs(action("load_package5_truck1_a1_l2"),10) occurs(action("load_package8_truck1_a3_l2"),10) occurs(action("unload_package5_truck1_a1_l4"),11) occurs(action("drive_truck1_l4_l1_t7_t8"),11) occurs(action("deliver_package5_l4_t8_t10"),12) occurs(action("unload_package8_truck1_a3_l1"),12) occurs(action("deliver_package8_l1_t8_t10"),13) occurs(action("drive_truck1_l1_l2_t8_t9"),13) occurs(action("load_package9_truck1_a3_l1"),13) occurs(action("unload_package9_truck1_a3_l2"),14) occurs(action("deliver_package9_l2_t9_t15"),15) occurs(action("drive_truck1_l2_l1_t9_t10"),15) occurs(action("load_package6_truck1_a3_l2"),15) occurs(action("unload_package6_truck1_a3_l1"),16) occurs(action("deliver_package6_l1_t10_t10"),17) occurs(action("drive_truck1_l1_l5_t10_t11"),17) occurs(action("drive_truck1_l5_l3_t11_t12"),18) occurs(action("drive_truck1_l3_l1_t12_t13"),19) occurs(action("drive_truck1_l1_l3_t13_t14"),20) SATISFIABLE Models : 1+ Calls : 10 Time : 13.804s (Solving: 12.09s 1st Model: 0.07s Unsat: 0.00s) CPU Time : 13.768s Choices : 186834 (Domain: 186833) Conflicts : 57074 (Analyzed: 57073) Restarts : 706 (Average: 80.84 Last: 122) Model-Level : 602.0 Problems : 10 (Average Length: 21.50 Splits: 0) Lemmas : 57073 (Deleted: 51963) Binary : 311 (Ratio: 0.54%) Ternary : 36 (Ratio: 0.06%) Conflict : 57073 (Average Length: 885.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 57073 (Average: 1.49 Max: 163 Sum: 85026) Executed : 57070 (Average: 1.49 Max: 163 Sum: 85003 Ratio: 99.97%) Bounded : 3 (Average: 7.67 Max: 11 Sum: 23 Ratio: 0.03%) Rules : 89447 Atoms : 89447 Bodies : 1 (Original: 0) Tight : Yes Variables : 29423 (Eliminated: 0 Frozen: 3351) Constraints : 180286 (Binary: 95.6% Ternary: 1.9% Other: 2.6%) Memory Peak : 149MB Max. Length : 30 steps Sol. Length : 20 steps Models : 1