182 lines
12 KiB
Plaintext
182 lines
12 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-16.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-16.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.040s CPU, 0.038s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.019s wall-clock]
|
||
|
|
Preparing model... [0.040s CPU, 0.035s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.540s CPU, 0.542s wall-clock]
|
||
|
|
5963 relevant atoms
|
||
|
|
2481 auxiliary atoms
|
||
|
|
8444 final queue length
|
||
|
|
13369 total queue pushes
|
||
|
|
Completing instantiation... [0.910s CPU, 0.913s wall-clock]
|
||
|
|
Instantiating: [1.540s CPU, 1.531s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.030s CPU, 0.029s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Instantiating groups... [0.050s CPU, 0.046s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
5 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.005s wall-clock]
|
||
|
|
Computing fact groups: [0.120s CPU, 0.119s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||
|
|
Building mutex information...
|
||
|
|
Building mutex information: [0.010s CPU, 0.003s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [0.050s CPU, 0.053s wall-clock]
|
||
|
|
Translating task: [0.960s CPU, 0.968s wall-clock]
|
||
|
|
375 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
20 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.560s CPU, 0.565s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
24 of 25 variables necessary.
|
||
|
|
5 of 25 mutex groups necessary.
|
||
|
|
4890 of 5040 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.140s CPU, 0.131s wall-clock]
|
||
|
|
Translator variables: 24
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 500
|
||
|
|
Translator goal facts: 19
|
||
|
|
Translator mutex groups: 5
|
||
|
|
Translator total mutex groups size: 30
|
||
|
|
Translator operators: 4890
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 20718
|
||
|
|
Translator peak memory: 47704 KB
|
||
|
|
Writing output... [0.370s CPU, 0.409s wall-clock]
|
||
|
|
Done! [3.780s CPU, 3.815s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.75s
|
||
|
|
Memory: 96MB
|
||
|
|
|
||
|
|
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: 96MB (+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.35s
|
||
|
|
Memory: 96MB (+0MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.03s
|
||
|
|
Memory: 108MB (+12MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.56s
|
||
|
|
|
||
|
|
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.39s
|
||
|
|
Memory: 121MB (+13MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.11s
|
||
|
|
Memory: 135MB (+14MB)
|
||
|
|
UNSAT
|
||
|
|
Iteration Time: 0.69s
|
||
|
|
|
||
|
|
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.38s
|
||
|
|
Memory: 146MB (+11MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 5.38s
|
||
|
|
Memory: 191MB (+45MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 5.96s
|
||
|
|
|
||
|
|
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.39s
|
||
|
|
Memory: 201MB (+10MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 6.36s
|
||
|
|
Memory: 211MB (+10MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 6.97s
|
||
|
|
|
||
|
|
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.46s
|
||
|
|
Memory: 218MB (+7MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Answer: 1
|
||
|
|
occurs(action(("walk","driver1","s14","p13-14")),1) occurs(action(("walk","driver2","s1","p1-2")),1) occurs(action(("walk","driver3","s0","p0-1")),1) occurs(action(("walk","driver4","s10","p3-10")),1) occurs(action(("walk","driver5","s12","p12-14")),1) occurs(action(("walk","driver1","p13-14","s13")),2) occurs(action(("walk","driver2","p1-2","s2")),2) occurs(action(("walk","driver3","p0-1","s1")),2) occurs(action(("walk","driver4","p3-10","s3")),2) occurs(action(("walk","driver5","p12-14","s14")),2) occurs(action(("board-truck","driver4","truck5","s3")),3) occurs(action(("board-truck","driver1","truck4","s13")),3) occurs(action(("board-truck","driver2","truck3","s2")),3) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("walk","driver5","s14","p13-14")),3) occurs(action(("drive-truck","truck2","s1","s2","driver3")),4) occurs(action(("drive-truck","truck4","s13","s2","driver1")),4) occurs(action(("drive-truck","truck5","s3","s12","driver4")),4) occurs(action(("drive-truck","truck3","s2","s5","driver2")),4) occurs(action(("walk","driver5","p13-14","s13")),4) occurs(action(("drive-truck","truck5","s12","s14","driver4")),5) occurs(action(("load-truck","package9","truck4","s2")),5) occurs(action(("drive-truck","truck2","s2","s11","driver3")),5) occurs(action(("drive-truck","truck3","s5","s3","driver2")),5) occurs(action(("walk","driver5","s13","p7-13")),5) occurs(action(("load-truck","package2","truck5","s14")),6) occurs(action(("load-truck","package4","truck3","s3")),6) occurs(action(("load-truck","package5","truck2","s11")),6) occurs(action(("drive-truck","truck4","s2","s10","driver1")),6) occurs(action(("walk","driver5","p7-13","s7")),6) occurs(action(("drive-truck","truck4","s10","s4","driver1")),7) occurs(action(("drive-truck","truck3","s3","s11","driver2")),7) occurs(action(("drive-truck","truck5","s14","s0","driver4")),7) occurs(action(("drive-truck","truck2","s11","s7","driver3")),7) occurs(action(("board-truck","driver5","truck1","s7")),7) occurs(action(("unload-truck","package2","truck5","s0")),8) occurs(action(("unload-truck","package4","truck3","s11")),8) occurs(action(("unload-truck","package9","truck4","s4")),8) occurs(action(("drive-truck","truck1","s7","s5","driver5")),8) occurs(action(("drive-truck","truck2","s7","s9","driver3")),8) occurs(action(("unload-truck","package5","truck2","s9")),9) occurs(action(("drive-truck","truck5","s0","s14","driver4")),9) occurs(action(("drive-truck","truck3","s11","s0","driver2")),9) occurs(action(("drive-truck","truck1","s5","s0","driver5")),9) occurs(action(("drive-truck","truck4","s4","s7","driver1")),9) occurs(action(("load-truck","package1","truck1","s0")),10) occurs(action(("load-truck","package10","truck4","s7")),10) occurs(action(("load-truck","package6","truck4","s7")),10) occurs(action(("drive-truck","truck3","s0","s12","driver2")),10) occurs(action(("drive-truck","truck2","s9","s7","driver3")),10) occurs(action(("disembark-truck","driver4","truck5","s14")),10) occurs(action(("drive-truck","truck2","s7","s6","driver3")),11) occurs(action(("drive-truck","truck1","s0","s13","driver5")),11) occurs(action(("drive-truck","truck4","s7","s2","driver1")),11) occurs(action(("load-truck","package7","truck3","s12")),11) occurs(action(("walk","driver4","s14","p14-8")),11) occurs(action(("unload-truck","package1","truck1","s13")),12) occurs(action(("unload-truck","package6","truck4","s2")),12) occurs(action(("drive-truck","truck3","s12","s3","driver2")),12) occurs(action(("disembark-truck","driver3","truck2","s6")),12) occurs(action(("walk","driver4","p14-8","s8")),12) occurs(action(("unload-truck","package7","truck3","s3")),13) occurs(action(("drive-truck","truck1","s13","s2","driver5")),13) occurs(action(("drive-truck","truck4","s2","s1","driver1")),13) occurs(action(("walk","driver3","s6","p2-6")),13) occurs(action(("drive-truck","truck3","s3","s8","driver2")),14) occurs(action(("drive-truck","truck1","s2","s5","driver5")),14) occurs(action(("drive-truck","truck4","s1","s8","driver1")),14) occurs(action(("walk","driver3","p2-6","s2")),14) occurs(action
|
||
|
|
Solving Time: 0.21s
|
||
|
|
Memory: 244MB (+26MB)
|
||
|
|
SAT
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 6
|
||
|
|
Time : 15.900s (Solving: 11.96s 1st Model: 0.17s Unsat: 0.10s)
|
||
|
|
CPU Time : 15.830s
|
||
|
|
|
||
|
|
Choices : 257676 (Domain: 257676)
|
||
|
|
Conflicts : 19228 (Analyzed: 19227)
|
||
|
|
Restarts : 207 (Average: 92.88 Last: 144)
|
||
|
|
Model-Level : 1518.0
|
||
|
|
Problems : 6 (Average Length: 14.50 Splits: 0)
|
||
|
|
Lemmas : 19227 (Deleted: 15352)
|
||
|
|
Binary : 169 (Ratio: 0.88%)
|
||
|
|
Ternary : 51 (Ratio: 0.27%)
|
||
|
|
Conflict : 19227 (Average Length: 1532.7 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 19227 (Average: 10.53 Max: 814 Sum: 202370)
|
||
|
|
Executed : 19052 (Average: 10.45 Max: 814 Sum: 200990 Ratio: 99.32%)
|
||
|
|
Bounded : 175 (Average: 7.89 Max: 22 Sum: 1380 Ratio: 0.68%)
|
||
|
|
|
||
|
|
Rules : 72960
|
||
|
|
Atoms : 72960
|
||
|
|
Bodies : 1 (Original: 0)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 142708 (Eliminated: 0 Frozen: 127157)
|
||
|
|
Constraints : 840749 (Binary: 97.3% Ternary: 1.6% Other: 1.1%)
|
||
|
|
|
||
|
|
Memory Peak : 244MB
|
||
|
|
Max. Length : 25 steps
|
||
|
|
Sol. Length : 25 steps
|
||
|
|
|
||
|
|
|