1
0
Fork 0
tplp-planning-benchmark/fd-pb-e4/ipc-2002_driverlog-strips-a...

143 lines
8.6 KiB
Plaintext

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-15.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-15.pddl
Parsing...
Parsing: [0.020s CPU, 0.021s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 35 rules.
Computing model... [0.310s CPU, 0.305s wall-clock]
3250 relevant atoms
1604 auxiliary atoms
4854 final queue length
7326 total queue pushes
Completing instantiation... [0.460s CPU, 0.456s wall-clock]
Instantiating: [0.810s CPU, 0.806s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.023s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.030s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.010s CPU, 0.006s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.080s CPU, 0.080s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.026s wall-clock]
Translating task: [0.520s CPU, 0.518s wall-clock]
192 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [0.260s CPU, 0.265s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
4 of 20 mutex groups necessary.
2592 of 2592 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.070s CPU, 0.068s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 336
Translator goal facts: 10
Translator mutex groups: 4
Translator total mutex groups size: 20
Translator operators: 2592
Translator axioms: 0
Translator task size: 10978
Translator peak memory: 40792 KB
Writing output... [0.200s CPU, 0.217s wall-clock]
Done! [1.990s CPU, 2.005s wall-clock]
planner.py version 0.0.1
Time: 5.48s
Memory: 310MB
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.03s
Memory: 310MB (+0MB)
UNSAT
Iteration Time: 0.03s
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.24s
Memory: 323MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 330MB (+7MB)
UNSAT
Iteration Time: 0.38s
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.24s
Memory: 339MB (+9MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p5-9")),1) occurs(action(("walk","driver3","s5","p1-5")),1) occurs(action(("walk","driver1","p8-3","s3")),2) occurs(action(("walk","driver2","p5-9","s9")),2) occurs(action(("walk","driver3","p1-5","s1")),2) occurs(action(("walk","driver4","s10","p10-0")),2) occurs(action(("walk","driver3","s1","p8-1")),3) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver4","p10-0","s0")),3) occurs(action(("walk","driver3","p8-1","s8")),4) occurs(action(("drive-truck","truck2","s9","s8","driver2")),4) occurs(action(("drive-truck","truck3","s3","s10","driver1")),4) occurs(action(("walk","driver4","s0","p0-6")),4) occurs(action(("load-truck","package3","truck2","s8")),5) occurs(action(("drive-truck","truck3","s10","s1","driver1")),5) occurs(action(("load-truck","package6","truck2","s8")),5) occurs(action(("load-truck","package8","truck3","s10")),5) occurs(action(("walk","driver3","s8","p8-3")),5) occurs(action(("drive-truck","truck2","s8","s6","driver2")),5) occurs(action(("walk","driver4","p0-6","s6")),5) occurs(action(("load-truck","package5","truck3","s1")),6) occurs(action(("drive-truck","truck3","s1","s0","driver1")),6) occurs(action(("unload-truck","package3","truck2","s6")),6) occurs(action(("unload-truck","package6","truck2","s6")),6) occurs(action(("unload-truck","package8","truck3","s1")),6) occurs(action(("board-truck","driver4","truck4","s6")),6) occurs(action(("walk","driver3","p8-3","s3")),6) occurs(action(("drive-truck","truck2","s6","s9","driver2")),6) occurs(action(("unload-truck","package5","truck3","s0")),7) occurs(action(("load-truck","package3","truck4","s6")),7) occurs(action(("drive-truck","truck4","s6","s1","driver4")),7) occurs(action(("drive-truck","truck3","s0","s11","driver1")),7) occurs(action(("load-truck","package6","truck4","s6")),7) occurs(action(("load-truck","package7","truck2","s9")),7) occurs(action(("board-truck","driver3","truck1","s3")),7) occurs(action(("drive-truck","truck2","s9","s8","driver2")),7) occurs(action(("unload-truck","package3","truck4","s1")),8) occurs(action(("load-truck","package1","truck1","s3")),8) occurs(action(("load-truck","package4","truck3","s11")),8) occurs(action(("drive-truck","truck3","s11","s7","driver1")),8) occurs(action(("drive-truck","truck1","s3","s2","driver3")),8) occurs(action(("drive-truck","truck2","s8","s2","driver2")),8) occurs(action(("load-truck","package8","truck4","s1")),8) occurs(action(("drive-truck","truck4","s1","s0","driver4")),8) occurs(action(("unload-truck","package1","truck1","s2")),9) occurs(action(("unload-truck","package4","truck3","s7")),9) occurs(action(("unload-truck","package7","truck2","s2")),9) occurs(action(("unload-truck","package8","truck4","s0")),9) occurs(action(("load-truck","package2","truck2","s2")),9) occurs(action(("drive-truck","truck2","s2","s5","driver2")),9) occurs(action(("drive-truck","truck4","s0","s11","driver4")),9) occurs(action(("drive-truck","truck1","s2","s8","driver3")),9) occurs(action(("drive-truck","truck3","s7","s9","driver1")),9) occurs(action(("unload-truck","package2","truck2","s5")),10) occurs(action(("unload-truck","package6","truck4","s11")),10) occurs(action(("disembark-truck","driver3","truck1","s8")),10) occurs(action(("drive-truck","truck3","s9","s8","driver1")),10) occurs(action(("drive-truck","truck2","s5","s4","driver2")),10)
Solving Time: 0.06s
Memory: 352MB (+13MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 6.363s (Solving: 0.05s 1st Model: 0.05s Unsat: 0.00s)
CPU Time : 6.330s
Choices : 2052
Conflicts : 571 (Analyzed: 571)
Restarts : 6 (Average: 95.17 Last: 47)
Model-Level : 66.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 707 (Deleted: 0)
Binary : 179 (Ratio: 25.32%)
Ternary : 16 (Ratio: 2.26%)
Conflict : 571 (Average Length: 49.5 Ratio: 80.76%)
Loop : 136 (Average Length: 2.0 Ratio: 19.24%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 571 (Average: 3.54 Max: 77 Sum: 2022)
Executed : 562 (Average: 3.41 Max: 77 Sum: 1947 Ratio: 96.29%)
Bounded : 9 (Average: 8.33 Max: 12 Sum: 75 Ratio: 3.71%)
Rules : 2928467
Atoms : 2928467
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 29060 (Eliminated: 0 Frozen: 14896)
Constraints : 84866 (Binary: 95.3% Ternary: 2.9% Other: 1.8%)
Memory Peak : 352MB
Max. Length : 10 steps
Sol. Length : 10 steps