INFO Running translator. INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-2.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-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-2.pddl Parsing... Parsing: [0.020s CPU, 0.018s wall-clock] Normalizing task... [0.000s CPU, 0.001s wall-clock] Instantiating... Generating Datalog program... [0.010s CPU, 0.004s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock] Preparing model... [0.010s CPU, 0.011s wall-clock] Generated 35 rules. Computing model... [0.040s CPU, 0.036s wall-clock] 215 relevant atoms 172 auxiliary atoms 387 final queue length 477 total queue pushes Completing instantiation... [0.030s CPU, 0.026s wall-clock] Instantiating: [0.100s CPU, 0.099s wall-clock] Computing fact groups... Finding invariants... 11 initial candidates Finding invariants: [0.010s CPU, 0.018s wall-clock] Checking invariant weight... [0.010s CPU, 0.001s wall-clock] Instantiating groups... [0.000s CPU, 0.005s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 2 uncovered facts Choosing groups: [0.000s CPU, 0.001s wall-clock] Building translation key... [0.000s CPU, 0.001s wall-clock] Computing fact groups: [0.030s CPU, 0.027s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.001s wall-clock] Translating task: [0.020s CPU, 0.024s wall-clock] 12 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 7 propositions removed Detecting unreachable propositions: [0.010s CPU, 0.013s wall-clock] Reordering and filtering variables... 9 of 9 variables necessary. 2 of 9 mutex groups necessary. 108 of 108 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock] Translator variables: 9 Translator derived variables: 0 Translator facts: 41 Translator goal facts: 7 Translator mutex groups: 2 Translator total mutex groups size: 6 Translator operators: 108 Translator axioms: 0 Translator task size: 507 Translator peak memory: 33112 KB Writing output... [0.010s CPU, 0.012s wall-clock] Done! [0.200s CPU, 0.203s wall-clock] planner.py version 0.0.1 Time: 0.03s Memory: 46MB 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: 46MB (+0MB) UNSAT Iteration Time: 0.00s 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.01s Memory: 47MB (+1MB) Unblocking actions... Solving... Solving Time: 0.00s Memory: 47MB (+0MB) UNSAT Iteration Time: 0.02s 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.01s Memory: 48MB (+1MB) Unblocking actions... Solving... Solving Time: 0.01s Memory: 48MB (+0MB) UNSAT Iteration Time: 0.03s 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.01s Memory: 48MB (+0MB) Unblocking actions... Solving... Solving Time: 0.27s Memory: 49MB (+1MB) UNKNOWN Iteration Time: 0.28s 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.01s Memory: 50MB (+1MB) Unblocking actions... Solving... Solving Time: 0.31s Memory: 50MB (+0MB) UNKNOWN Iteration Time: 0.32s 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.01s Memory: 51MB (+1MB) Unblocking actions... Solving... Solving Time: 0.36s Memory: 51MB (+0MB) UNKNOWN Iteration Time: 0.38s 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.01s Memory: 52MB (+1MB) Unblocking actions... Solving... Answer: 1 occurs(action(("walk","driver2","s0","p0-1")),1) occurs(action(("walk","driver2","p0-1","s1")),2) occurs(action(("board-truck","driver1","truck1","s0")),3) occurs(action(("board-truck","driver2","truck2","s1")),4) occurs(action(("load-truck","package2","truck2","s1")),5) occurs(action(("drive-truck","truck1","s0","s2","driver1")),6) occurs(action(("load-truck","package1","truck1","s2")),7) occurs(action(("drive-truck","truck1","s2","s1","driver1")),8) occurs(action(("drive-truck","truck2","s1","s2","driver2")),9) occurs(action(("unload-truck","package2","truck2","s2")),10) occurs(action(("drive-truck","truck2","s2","s0","driver2")),11) occurs(action(("drive-truck","truck2","s0","s2","driver2")),12) occurs(action(("disembark-truck","driver2","truck2","s2")),13) occurs(action(("load-truck","package3","truck1","s1")),14) occurs(action(("drive-truck","truck1","s1","s0","driver1")),15) occurs(action(("unload-truck","package1","truck1","s0")),16) occurs(action(("unload-truck","package3","truck1","s0")),17) occurs(action(("walk","driver2","s2","p2-1")),18) occurs(action(("drive-truck","truck1","s0","s2","driver1")),19) occurs(action(("drive-truck","truck1","s2","s1","driver1")),20) occurs(action(("disembark-truck","driver1","truck1","s1")),21) occurs(action(("board-truck","driver1","truck1","s1")),22) occurs(action(("drive-truck","truck1","s1","s2","driver1")),23) occurs(action(("disembark-truck","driver1","truck1","s2")),24) occurs(action(("board-truck","driver1","truck2","s2")),25) occurs(action(("walk","driver2","p2-1","s1")),26) occurs(action(("drive-truck","truck2","s2","s0","driver1")),27) occurs(action(("disembark-truck","driver1","truck2","s0")),28) occurs(action(("walk","driver1","s0","p0-1")),29) occurs(action(("walk","driver1","p0-1","s1")),30) Solving Time: 0.17s Memory: 53MB (+1MB) SAT SATISFIABLE Models : 1+ Calls : 7 Time : 1.250s (Solving: 1.11s 1st Model: 0.17s Unsat: 0.01s) CPU Time : 1.250s Choices : 62482 Conflicts : 34959 (Analyzed: 34957) Restarts : 345 (Average: 101.32 Last: 207) Model-Level : 62.0 Problems : 7 (Average Length: 17.00 Splits: 0) Lemmas : 34957 (Deleted: 22129) Binary : 1755 (Ratio: 5.02%) Ternary : 1650 (Ratio: 4.72%) Conflict : 34957 (Average Length: 19.9 Ratio: 100.00%) Loop : 0 (Average Length: 0.0 Ratio: 0.00%) Other : 0 (Average Length: 0.0 Ratio: 0.00%) Backjumps : 34957 (Average: 1.68 Max: 62 Sum: 58879) Executed : 34918 (Average: 1.68 Max: 62 Sum: 58575 Ratio: 99.48%) Bounded : 39 (Average: 7.79 Max: 32 Sum: 304 Ratio: 0.52%) Rules : 1683 Atoms : 1683 Bodies : 1 (Original: 0) Tight : Yes Variables : 5892 (Eliminated: 0 Frozen: 3612) Constraints : 22451 (Binary: 88.7% Ternary: 7.1% Other: 4.2%) Memory Peak : 53MB Max. Length : 30 steps Sol. Length : 30 steps