182 lines
15 KiB
Plaintext
182 lines
15 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-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.030s CPU, 0.032s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
|
||
|
|
Preparing model... [0.030s CPU, 0.033s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.640s CPU, 0.637s wall-clock]
|
||
|
|
7293 relevant atoms
|
||
|
|
2871 auxiliary atoms
|
||
|
|
10164 final queue length
|
||
|
|
16104 total queue pushes
|
||
|
|
Completing instantiation... [1.100s CPU, 1.101s wall-clock]
|
||
|
|
Instantiating: [1.800s CPU, 1.811s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.040s CPU, 0.029s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.070s CPU, 0.066s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
5 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.007s wall-clock]
|
||
|
|
Computing fact groups: [0.160s CPU, 0.154s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s 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.061s wall-clock]
|
||
|
|
Translating task: [1.230s CPU, 1.226s 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.630s CPU, 0.626s 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.160s 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.515s wall-clock]
|
||
|
|
Done! [4.540s CPU, 4.590s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.90s
|
||
|
|
Memory: 109MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75]
|
||
|
|
Grounded Until: 0
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.00s
|
||
|
|
Memory: 109MB (+0MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.00s
|
||
|
|
|
||
|
|
Iteration 2
|
||
|
|
Queue: [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80]
|
||
|
|
Grounded Until: 0
|
||
|
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||
|
|
Grounding Time: 0.46s
|
||
|
|
Memory: 109MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.05s
|
||
|
|
Memory: 124MB (+15MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.73s
|
||
|
|
|
||
|
|
Iteration 3
|
||
|
|
Queue: [10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85]
|
||
|
|
Grounded Until: 5
|
||
|
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||
|
|
Grounding Time: 0.45s
|
||
|
|
Memory: 136MB (+12MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.45s
|
||
|
|
Memory: 151MB (+15MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 1.13s
|
||
|
|
|
||
|
|
Iteration 4
|
||
|
|
Queue: [15, 20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90]
|
||
|
|
Grounded Until: 10
|
||
|
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||
|
|
Grounding Time: 0.47s
|
||
|
|
Memory: 166MB (+15MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.86s
|
||
|
|
Memory: 190MB (+24MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 7.59s
|
||
|
|
|
||
|
|
Iteration 5
|
||
|
|
Queue: [20, 25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15]
|
||
|
|
Grounded Until: 15
|
||
|
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||
|
|
Grounding Time: 0.54s
|
||
|
|
Memory: 207MB (+17MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 8.57s
|
||
|
|
Memory: 220MB (+13MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 9.38s
|
||
|
|
|
||
|
|
Iteration 6
|
||
|
|
Queue: [25, 30, 35, 40, 45, 50, 55, 60, 65, 70, 75, 80, 85, 90, 15, 20]
|
||
|
|
Grounded Until: 20
|
||
|
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||
|
|
Grounding Time: 0.47s
|
||
|
|
Memory: 238MB (+18MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("load-truck","package5","truck1","s2")),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(("drive-truck","truck1","s2","s6","driver5")),2) occurs(action(("drive-truck","truck5","s10","s12","driver3")),2) occurs(action(("walk","driver1","p2-10","s2")),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","package3","truck4","s3")),3) occurs(action(("drive-truck","truck5","s12","s3","driver3")),3) occurs(action(("board-truck","driver2","truck4","s3")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("walk","driver1","s2","p2-12")),3) occurs(action(("drive-truck","truck2","s8","s11","driver4")),4) occurs(action(("load-truck","package15","truck1","s14")),4) occurs(action(("load-truck","package2","truck1","s14")),4) occurs(action(("load-truck","package8","truck3","s12")),4) occurs(action(("drive-truck","truck4","s3","s11","driver2")),4) occurs(action(("drive-truck","truck5","s3","s0","driver3")),4) occurs(action(("walk","driver1","p2-12","s12")),4) occurs(action(("load-truck","package9","truck3","s12")),5) occurs(action(("drive-truck","truck5","s0","s2","driver3")),5) occurs(action(("board-truck","driver1","truck3","s12")),5) occurs(action(("drive-truck","truck1","s14","s11","driver5")),5) occurs(action(("drive-truck","truck4","s11","s2","driver2")),5) occurs(action(("drive-truck","truck5","s2","s6","driver3")),6) occurs(action(("load-truck","package13","truck4","s2")),6) occurs(action(("drive-truck","truck1","s11","s15","driver5")),6) occurs(action(("drive-truck","truck3","s12","s15","driver1")),6) occurs(action(("disembark-truck","driver4","truck2","s11")),6) occurs(action(("unload-truck","package2","truck1","s15")),7) occurs(action(("disembark-truck","driver5","truck1","s15")),7) occurs(action(("load-truck","package4","truck5","s6")),7) occurs(action(("unload-truck","package1","truck3","s15")),7) occurs(action(("unload-truck","package15","truck1","s15")),7) occurs(action(("unload-truck","package5","truck1","s15")),7) occurs(action(("drive-truck","truck4","s2","s0","driver2")),7) occurs(action(("disembark-truck","driver1","truck3","s15")),7) occurs(action(("disembark-truck","driver3","truck5","s6")),7) occurs(action(("walk","driver4","s11","p6-11")),7) occurs(action(("load-truck","package15","truck3","s15")),8) occurs(action(("load-truck","package5","truck3","s15")),8) occurs(action(("drive-truck","truck4","s0","s10","driver2")),8) occurs(action(("board-truck","driver5","truck3","s15")),8) occurs(action(("unload-truck","package9","truck3","s15")),8) occurs(action(("walk","driver4","p6-11","s6")),8) occurs(action(("walk","driver1","s15","p15-4")),8) occurs(action(("walk","driver3","s6","p6-11")),8) occurs(action(("unload-truck","package13","truck4","s10")),9) occurs(action(("unload-truck","package3","truck4","s10")),9) occurs(action(("board-truck","driver4","truck5","s6")),9) occurs(action(("drive-truck","truck3","s15","s3","driver5")),9) occurs(action(("walk","driver1","p15-4","s4")),9) occurs(action(("drive-truck","truck3","s3","s15","driver5")),10) occurs(action(("drive-truck","truck5","s6","s2","driver4")),10) occurs(action(("drive-truck","truck4","s10","s14","driver2")),10) occurs(action(("walk","driver3","p6-11","s11")),10) occurs(action(("walk","driver1","s4","p15-4")),10) occurs(action(("disembark-truck","driver5","truck3","s15")),11) occurs(action(("load-truck","package1","truck3","s15")),11) occurs(action(("load-truck","package9","truck3","s15")),11) occurs(action(("board-truck","driver3","truck2","s11")),11) occurs(action(("unload-truck","package15","truck3","s15")),11) occurs(action(("drive-truck","truck5","s2","s5","driver4")),11) occurs(action
|
||
|
|
Solving Time: 5.34s
|
||
|
|
Memory: 267MB (+29MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 6
|
||
|
|
Time : 25.887s (Solving: 21.11s 1st Model: 5.29s Unsat: 0.43s)
|
||
|
|
CPU Time : 25.830s
|
||
|
|
|
||
|
|
Choices : 272200
|
||
|
|
Conflicts : 23972 (Analyzed: 23970)
|
||
|
|
Restarts : 254 (Average: 94.37 Last: 67)
|
||
|
|
Model-Level : 1484.0
|
||
|
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
||
|
|
Lemmas : 23970 (Deleted: 16791)
|
||
|
|
Binary : 1042 (Ratio: 4.35%)
|
||
|
|
Ternary : 384 (Ratio: 1.60%)
|
||
|
|
Conflict : 23970 (Average Length: 86.6 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 23970 (Average: 11.03 Max: 2005 Sum: 264346)
|
||
|
|
Executed : 23465 (Average: 10.77 Max: 2005 Sum: 258043 Ratio: 97.62%)
|
||
|
|
Bounded : 505 (Average: 12.48 Max: 27 Sum: 6303 Ratio: 2.38%)
|
||
|
|
|
||
|
|
Rules : 91278
|
||
|
|
Atoms : 91278
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 177946 (Eliminated: 0 Frozen: 158993)
|
||
|
|
Constraints : 1057920 (Binary: 97.2% Ternary: 1.6% Other: 1.2%)
|
||
|
|
|
||
|
|
Memory Peak : 268MB
|
||
|
|
Max. Length : 25 steps
|
||
|
|
Sol. Length : 25 steps
|
||
|
|
|
||
|
|
|