184 lines
12 KiB
Plaintext
184 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-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.020s CPU, 0.013s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
|
||
|
Preparing model... [0.030s CPU, 0.033s wall-clock]
|
||
|
Generated 35 rules.
|
||
|
Computing model... [0.720s CPU, 0.712s wall-clock]
|
||
|
7293 relevant atoms
|
||
|
2871 auxiliary atoms
|
||
|
10164 final queue length
|
||
|
16104 total queue pushes
|
||
|
Completing instantiation... [1.220s CPU, 1.223s wall-clock]
|
||
|
Instantiating: [2.010s CPU, 2.007s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
11 initial candidates
|
||
|
Finding invariants: [0.030s CPU, 0.031s wall-clock]
|
||
|
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||
|
Instantiating groups... [0.080s CPU, 0.077s wall-clock]
|
||
|
Collecting mutex groups... [0.000s CPU, 0.004s wall-clock]
|
||
|
Choosing groups...
|
||
|
5 uncovered facts
|
||
|
Choosing groups: [0.020s CPU, 0.013s wall-clock]
|
||
|
Building translation key... [0.000s CPU, 0.008s wall-clock]
|
||
|
Computing fact groups: [0.170s CPU, 0.171s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.000s 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.010s CPU, 0.005s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [0.070s CPU, 0.070s wall-clock]
|
||
|
Translating task: [1.390s CPU, 1.383s 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.690s CPU, 0.692s 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.180s CPU, 0.180s 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: 54476 KB
|
||
|
Writing output... [0.510s CPU, 0.557s wall-clock]
|
||
|
Done! [5.050s CPU, 5.095s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 0.98s
|
||
|
Memory: 116MB
|
||
|
|
||
|
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: 116MB (+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.31s
|
||
|
Memory: 116MB (+0MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.04s
|
||
|
Memory: 120MB (+4MB)
|
||
|
UNSAT
|
||
|
Iteration Time: 0.54s
|
||
|
|
||
|
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.35s
|
||
|
Memory: 135MB (+15MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 2.45s
|
||
|
Memory: 154MB (+19MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 3.00s
|
||
|
|
||
|
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.33s
|
||
|
Memory: 174MB (+20MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.11s
|
||
|
Memory: 197MB (+23MB)
|
||
|
SAT
|
||
|
Testing...
|
||
|
NOT SERIALIZABLE
|
||
|
Testing Time: 1.18s
|
||
|
Memory: 235MB (+38MB)
|
||
|
Solving...
|
||
|
Solving Time: 6.09s
|
||
|
Memory: 223MB (+-12MB)
|
||
|
UNKNOWN
|
||
|
Iteration Time: 7.93s
|
||
|
|
||
|
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.60s
|
||
|
Memory: 242MB (+19MB)
|
||
|
Unblocking actions...
|
||
|
Solving...
|
||
|
Solving Time: 0.30s
|
||
|
Memory: 267MB (+25MB)
|
||
|
SAT
|
||
|
Testing...
|
||
|
SERIALIZABLE?
|
||
|
Testing Time: 0.00s
|
||
|
Memory: 267MB (+0MB)
|
||
|
Answer: 2
|
||
|
occurs(action(("load-truck","package3","truck4","s3")),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","truck5","s10","s14","driver3")),2) occurs(action(("drive-truck","truck1","s2","s5","driver5")),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(("load-truck","package10","truck1","s5")),3) occurs(action(("load-truck","package15","truck5","s14")),3) occurs(action(("load-truck","package2","truck5","s14")),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","truck5","s14","s4","driver3")),4) occurs(action(("drive-truck","truck1","s5","s3","driver5")),4) occurs(action(("drive-truck","truck4","s3","s10","driver2")),4) occurs(action(("drive-truck","truck2","s8","s9","driver4")),4) occurs(action(("walk","driver1","p2-12","s12")),4) occurs(action(("unload-truck","package15","truck5","s4")),5) occurs(action(("unload-truck","package3","truck4","s10")),5) occurs(action(("board-truck","driver1","truck3","s12")),5) occurs(action(("drive-truck","truck1","s3","s11","driver5")),5) occurs(action(("drive-truck","truck2","s9","s2","driver4")),5) occurs(action(("unload-truck","package10","truck1","s11")),6) occurs(action(("load-truck","package13","truck2","s2")),6) occurs(action(("drive-truck","truck3","s12","s15","driver1")),6) occurs(action(("drive-truck","truck5","s4","s15","driver3")),6) occurs(action(("drive-truck","truck4","s10","s12","driver2")),6) occurs(action(("unload-truck","package2","truck5","s15")),7) occurs(action(("load-truck","package1","truck4","s12")),7) occurs(action(("load-truck","package8","truck4","s12")),7) occurs(action(("load-truck","package9","truck4","s12")),7) occurs(action(("drive-truck","truck3","s15","s2","driver1")),7) occurs(action(("drive-truck","truck2","s2","s0","driver4")),7) occurs(action(("drive-truck","truck1","s11","s2","driver5")),7) occurs(action(("drive-truck","truck3","s2","s6","driver1")),8) occurs(action(("drive-truck","truck5","s15","s2","driver3")),8) occurs(action(("drive-truck","truck4","s12","s13","driver2")),8) occurs(action(("drive-truck","truck2","s0","s10","driver4")),8) occurs(action(("drive-truck","truck1","s2","s9","driver5")),8) occurs(action(("unload-truck","package13","truck2","s10")),9) occurs(action(("unload-truck","package8","truck4","s13")),9) occurs(action(("drive-truck","truck5","s2","s6","driver3")),9) occurs(action(("load-truck","package12","truck1","s9")),9) occurs(action(("load-truck","package4","truck3","s6")),9) occurs(action(("drive-truck","truck4","s13","s8","driver2")),10) occurs(action(("drive-truck","truck2","s10","s1","driver4")),10) occurs(action(("drive-truck","truck3","s6","s2","driver1")),10) occurs(action(("drive-truck","truck1","s9","s2","driver5")),10) occurs(action(("load-truck","package11","truck2","s1")),11) occurs(action(("load-truck","package6","truck2","s1")),11) occurs(action(("drive-truck","truck3","s2","s15","driver1")),11) occurs(action(("drive-truck","truck1","s2","s6","driver5")),11) occurs(action(("unload-truck","package1","truck4","s8")),11) occurs(action(("unload-truck","package9","truck4","s8")),11) occurs(action(("disembark-truck","driver2","truck4","s8")),11) occurs(action(("unload-truck","package12","truck1","s6")),12) occurs(action(("unload-truck","package5","truck1","s6")),12) occurs(action(("drive-truck","truck3","s15","s3","driver1")),12) occurs(action(("drive-truck","truck2","s1","s13","driver4")),12) occurs(action(("walk","driver2","s8","p8-9")),12) occurs(action(("unload-truck","package4","truck3","s3")),13) occurs(action(("drive-truck","truck1","s6","s14","driver
|
||
|
SATISFIABLE
|
||
|
|
||
|
Models : 1+
|
||
|
Calls : 6
|
||
|
Time : 12.882s (Solving: 8.74s 1st Model: 0.32s Unsat: 0.00s)
|
||
|
CPU Time : 12.852s
|
||
|
|
||
|
Choices : 242884 (Domain: 242650)
|
||
|
Conflicts : 19204 (Analyzed: 19203)
|
||
|
Restarts : 203 (Average: 94.60 Last: 90)
|
||
|
Model-Level : 1007.5
|
||
|
Problems : 6 (Average Length: 12.83 Splits: 0)
|
||
|
Lemmas : 19203 (Deleted: 15530)
|
||
|
Binary : 109 (Ratio: 0.57%)
|
||
|
Ternary : 26 (Ratio: 0.14%)
|
||
|
Conflict : 19203 (Average Length: 1057.5 Ratio: 100.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 19203 (Average: 9.49 Max: 1079 Sum: 182161)
|
||
|
Executed : 19112 (Average: 9.46 Max: 1079 Sum: 181686 Ratio: 99.74%)
|
||
|
Bounded : 91 (Average: 5.22 Max: 22 Sum: 475 Ratio: 0.26%)
|
||
|
|
||
|
Rules : 221098 (Original: 221029)
|
||
|
Atoms : 92171
|
||
|
Bodies : 125425 (Original: 125355)
|
||
|
Count : 363 (Original: 376)
|
||
|
Equivalences : 66388 (Atom=Atom: 33 Body=Body: 0 Other: 66355)
|
||
|
Tight : Yes
|
||
|
Variables : 141010 (Eliminated: 0 Frozen: 108509)
|
||
|
Constraints : 811461 (Binary: 97.1% Ternary: 1.7% Other: 1.2%)
|
||
|
|
||
|
Memory Peak : 267MB
|
||
|
Max. Length : 20 steps
|
||
|
Sol. Length : 20 steps
|
||
|
Models : 2
|
||
|
|
||
|
|