tplp-planning-benchmark/fd-pb-e3/ipc-2002_driverlog-strips-automatic_17.out

235 lines
18 KiB
Plaintext
Raw Normal View History

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-17.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-17.pddl
Parsing...
Parsing: [0.040s CPU, 0.035s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.015s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.018s wall-clock]
Preparing model... [0.030s CPU, 0.036s wall-clock]
Generated 35 rules.
Computing model... [0.640s CPU, 0.639s wall-clock]
7293 relevant atoms
2871 auxiliary atoms
10164 final queue length
16104 total queue pushes
Completing instantiation... [1.090s CPU, 1.094s wall-clock]
Instantiating: [1.800s CPU, 1.811s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.035s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.070s CPU, 0.067s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
Choosing groups...
5 uncovered facts
Choosing groups: [0.010s CPU, 0.011s wall-clock]
Building translation key... [0.000s CPU, 0.007s wall-clock]
Computing fact groups: [0.160s CPU, 0.159s 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.070s CPU, 0.062s wall-clock]
Translating task: [1.230s CPU, 1.228s wall-clock]
400 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
25 propositions removed
Detecting unreachable propositions: [0.620s CPU, 0.623s wall-clock]
Reordering and filtering variables...
30 of 30 variables necessary.
5 of 30 mutex groups necessary.
6170 of 6170 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.160s CPU, 0.162s wall-clock]
Translator variables: 30
Translator derived variables: 0
Translator facts: 665
Translator goal facts: 23
Translator mutex groups: 5
Translator total mutex groups size: 30
Translator operators: 6170
Translator axioms: 0
Translator task size: 26008
Translator peak memory: 51288 KB
Writing output... [0.470s CPU, 0.516s wall-clock]
Done! [4.550s CPU, 4.601s wall-clock]
planner.py version 0.0.1
Time: 24.59s
Memory: 1124MB
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.13s
Memory: 1124MB (+0MB)
UNSAT
Iteration Time: 0.13s
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: 2.01s
Memory: 1308MB (+184MB)
Unblocking actions...
Solving...
Solving Time: 0.13s
Memory: 1320MB (+12MB)
UNSAT
Iteration Time: 2.67s
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: 2.20s
Memory: 1408MB (+88MB)
Unblocking actions...
Solving...
Solving Time: 1.69s
Memory: 1432MB (+24MB)
UNKNOWN
Iteration Time: 4.43s
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: 2.29s
Memory: 1511MB (+79MB)
Unblocking actions...
Solving...
Solving Time: 3.09s
Memory: 1546MB (+35MB)
UNKNOWN
Iteration Time: 5.94s
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: 2.40s
Memory: 1612MB (+66MB)
Unblocking actions...
Solving...
Solving Time: 3.92s
Memory: 1659MB (+47MB)
UNKNOWN
Iteration Time: 6.91s
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: 5.75s
Memory: 1922MB (+263MB)
Unblocking actions...
Solving...
Solving Time: 4.74s
Memory: 1964MB (+42MB)
UNKNOWN
Iteration Time: 11.12s
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: 2.15s
Memory: 2029MB (+65MB)
Unblocking actions...
Solving...
Solving Time: 5.89s
Memory: 2052MB (+23MB)
UNKNOWN
Iteration Time: 8.69s
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: 2.51s
Memory: 2052MB (+0MB)
UNKNOWN
Iteration Time: 2.61s
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: 3.15s
Memory: 2052MB (+0MB)
UNKNOWN
Iteration Time: 3.25s
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: 4.02s
Memory: 2052MB (+0MB)
UNKNOWN
Iteration Time: 4.12s
Iteration 11
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)]
Grounded Until: 30
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board-truck","driver3","truck5","s10")),1) occurs(action(("board-truck","driver5","truck1","s2")),1) occurs(action(("walk","driver1","s10","p2-10")),1) occurs(action(("walk","driver2","s13","p3-13")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("load-truck","package13","truck1","s2")),2) occurs(action(("drive-truck","truck5","s10","s3","driver3")),2) occurs(action(("load-truck","package5","truck1","s2")),2) occurs(action(("load-truck","package8","truck3","s12")),2) occurs(action(("drive-truck","truck1","s2","s6","driver5")),2) occurs(action(("walk","driver2","p3-13","s3")),2) occurs(action(("walk","driver4","p8-9","s8")),2) occurs(action(("drive-truck","truck1","s6","s14","driver5")),3) occurs(action(("load-truck","package1","truck3","s12")),3) occurs(action(("load-truck","package4","truck1","s6")),3) occurs(action(("load-truck","package9","truck3","s12")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("walk","driver1","p2-10","s2")),3) occurs(action(("disembark-truck","driver3","truck5","s3")),3) occurs(action(("unload-truck","package8","truck3","s12")),3) occurs(action(("load-truck","package3","truck4","s3")),4) occurs(action(("board-truck","driver3","truck4","s3")),4) occurs(action(("unload-truck","package13","truck1","s14")),4) occurs(action(("unload-truck","package4","truck1","s14")),4) occurs(action(("drive-truck","truck2","s8","s14","driver4")),4) occurs(action(("disembark-truck","driver5","truck1","s14")),4) occurs(action(("walk","driver1","s2","p2-1")),4) occurs(action(("load-truck","package13","truck2","s14")),5) occurs(action(("load-truck","package2","truck2","s14")),5) occurs(action(("load-truck","package4","truck2","s14")),5) occurs(action(("board-truck","driver2","truck5","s3")),5) occurs(action(("drive-truck","truck4","s3","s12","driver3")),5) occurs(action(("drive-truck","truck2","s14","s5","driver4")),5) occurs(action(("walk","driver1","p2-1","s1")),5) occurs(action(("walk","driver5","s14","p0-14")),5) occurs(action(("load-truck","package10","truck2","s5")),6) occurs(action(("drive-truck","truck5","s3","s13","driver2")),6) occurs(action(("unload-truck","package5","truck1","s14")),6) occurs(action(("drive-truck","truck2","s5","s12","driver4")),6) occurs(action(("disembark-truck","driver3","truck4","s12")),6) occurs(action(("walk","driver5","p0-14","s0")),6) occurs(action(("unload-truck","package9","truck3","s12")),6) occurs(action(("unload-truck","package1","truck3","s12")),6) occurs(action(("walk","driver1","s1","p1-13")),6) occurs(action(("load-truck","package1","truck2","s12")),7) occurs(action(("load-truck","package8","truck2","s12")),7) occurs(action(("load-truck","package9","truck2","s12")),7) occurs(action(("drive-truck","truck2","s12","s13","driver4")),7) occurs(action(("unload-truck","package13","truck2","s12")),7) occurs(action(("unload-truck","package2","truck2","s12")),7) occurs(action(("unload-truck","package4","truck2","s12")),7) occurs(action(("disembark-truck","driver2","truck5","s13")),7) occurs(action(("walk","driver3","s12","p12-3")),7) occurs(action(("walk","driver5","s0","p0-14")),7) occurs(action(("unload-truck","package8","truck2","s13")),8) occurs(action(("load-truck","package13","truck4","s12")),8) occurs(action(("load-truck","package4","truck4","s12")),8) occurs(action(("unload-truck","package1","truck2","s13")),8) occurs(action(("unload-truck","package3","truck4","s12")),8) occurs(action(("walk","driver1","p1-13","s13")),8) occurs(action(("walk","driver5","p0-14","s14")),8) occurs(action(("walk","driver2","s13","p13-4")),8) occurs(action(("load-truck","package1","truck5","s13")),9) occurs(action(("load-truck","package3","truck4","s12")),9) occurs(action(("load-truck","package5","truck1","s14")),9) occurs(action(("board-truck","driver5","truck1","s14")),9) occurs(action(("unload-truck","package10","truck2","s13")),9) occurs(action(("walk","driver2","p13-4","s4")),9) occurs(action(("walk","driver3","p12-3","s12")),9) occurs(action(("disembark-truck","driver4","truck2","s13")),9) occurs(action(("board-truck","drive
Solving Time: 4.24s
Memory: 2052MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 78.819s (Solving: 32.10s 1st Model: 4.14s Unsat: 0.00s)
CPU Time : 78.790s
Choices : 1975919
Conflicts : 103316 (Analyzed: 103315)
Restarts : 883 (Average: 117.00 Last: 233)
Model-Level : 1040.0
Problems : 11 (Average Length: 22.45 Splits: 0)
Lemmas : 103315 (Deleted: 83870)
Binary : 6679 (Ratio: 6.46%)
Ternary : 1078 (Ratio: 1.04%)
Conflict : 103315 (Average Length: 124.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 103315 (Average: 16.78 Max: 2946 Sum: 1733184)
Executed : 102912 (Average: 16.70 Max: 2946 Sum: 1725425 Ratio: 99.55%)
Bounded : 403 (Average: 19.25 Max: 32 Sum: 7759 Ratio: 0.45%)
Rules : 11980388
Atoms : 11980388
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 400772 (Eliminated: 0 Frozen: 289784)
Constraints : 1016796 (Binary: 96.4% Ternary: 2.2% Other: 1.4%)
Memory Peak : 2078MB
Max. Length : 30 steps
Sol. Length : 25 steps