211 lines
12 KiB
Plaintext
211 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.050s CPU, 0.046s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.018s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.021s wall-clock]
|
||
|
|
Preparing model... [0.050s CPU, 0.043s wall-clock]
|
||
|
|
Generated 35 rules.
|
||
|
|
Computing model... [0.720s CPU, 0.725s wall-clock]
|
||
|
|
7293 relevant atoms
|
||
|
|
2871 auxiliary atoms
|
||
|
|
10164 final queue length
|
||
|
|
16104 total queue pushes
|
||
|
|
Completing instantiation... [1.230s CPU, 1.223s wall-clock]
|
||
|
|
Instantiating: [2.030s CPU, 2.039s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
11 initial candidates
|
||
|
|
Finding invariants: [0.040s 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.010s CPU, 0.004s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
5 uncovered facts
|
||
|
|
Choosing groups: [0.010s CPU, 0.013s wall-clock]
|
||
|
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Computing fact groups: [0.180s 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.380s CPU, 1.384s 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.700s CPU, 0.697s 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.179s 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.555s wall-clock]
|
||
|
|
Done! [5.110s CPU, 5.145s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 0.97s
|
||
|
|
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: 118MB (+2MB)
|
||
|
|
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 (+17MB)
|
||
|
|
Unblocking actions...
|
||
|
|
Solving...
|
||
|
|
Solving Time: 2.46s
|
||
|
|
Memory: 154MB (+19MB)
|
||
|
|
UNKNOWN
|
||
|
|
Iteration Time: 3.01s
|
||
|
|
|
||
|
|
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: 23.05s
|
||
|
|
Memory: 1222MB (+1025MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.26s
|
||
|
|
Memory: 1228MB (+6MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 1.10s
|
||
|
|
Memory: 1288MB (+60MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.16s
|
||
|
|
Memory: 1288MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.97s
|
||
|
|
Memory: 1301MB (+13MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.12s
|
||
|
|
Memory: 1301MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.98s
|
||
|
|
Memory: 1311MB (+10MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.12s
|
||
|
|
Memory: 1311MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.90s
|
||
|
|
Memory: 1317MB (+6MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.16s
|
||
|
|
Memory: 1335MB (+18MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
NOT SERIALIZABLE
|
||
|
|
Testing Time: 0.90s
|
||
|
|
Memory: 1335MB (+0MB)
|
||
|
|
Solving...
|
||
|
|
Solving Time: 0.06s
|
||
|
|
Memory: 1335MB (+0MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE
|
||
|
|
Testing Time: 0.75s
|
||
|
|
Memory: 1335MB (+0MB)
|
||
|
|
Answer: 7
|
||
|
|
occurs(action(("load-truck","package13","truck1","s2")),1) occurs(action(("load-truck","package5","truck1","s2")),1) occurs(action(("board-truck","driver1","truck5","s10")),1) occurs(action(("walk","driver2","s13","p3-13")),1) occurs(action(("walk","driver3","s10","p2-10")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("walk","driver5","s2","p2-12")),1) occurs(action(("drive-truck","truck5","s10","s14","driver1")),2) occurs(action(("walk","driver2","p3-13","s3")),2) occurs(action(("walk","driver3","p2-10","s2")),2) occurs(action(("walk","driver4","p8-9","s8")),2) occurs(action(("walk","driver5","p2-12","s12")),2) occurs(action(("drive-truck","truck5","s14","s6","driver1")),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","driver5","truck3","s12")),3) occurs(action(("board-truck","driver4","truck2","s8")),3) occurs(action(("board-truck","driver3","truck1","s2")),3) occurs(action(("drive-truck","truck3","s12","s5","driver5")),4) occurs(action(("load-truck","package4","truck5","s6")),4) occurs(action(("drive-truck","truck5","s6","s14","driver1")),4) occurs(action(("drive-truck","truck2","s8","s13","driver4")),4) occurs(action(("drive-truck","truck4","s3","s12","driver2")),4) occurs(action(("drive-truck","truck1","s2","s0","driver3")),4) occurs(action(("drive-truck","truck2","s13","s1","driver4")),5) occurs(action(("load-truck","package1","truck4","s12")),5) occurs(action(("load-truck","package8","truck4","s12")),5) occurs(action(("drive-truck","truck5","s14","s13","driver1")),5) occurs(action(("load-truck","package9","truck4","s12")),5) occurs(action(("drive-truck","truck4","s12","s13","driver2")),5) occurs(action(("drive-truck","truck1","s0","s10","driver3")),5) occurs(action(("disembark-truck","driver5","truck3","s5")),5) occurs(action(("unload-truck","package13","truck1","s10")),6) occurs(action(("unload-truck","package8","truck4","s13")),6) occurs(action(("drive-truck","truck4","s13","s8","driver2")),6) occurs(action(("drive-truck","truck1","s10","s14","driver3")),6) occurs(action(("load-truck","package11","truck2","s1")),6) occurs(action(("drive-truck","truck5","s13","s3","driver1")),6) occurs(action(("load-truck","package6","truck2","s1")),6) occurs(action(("drive-truck","truck2","s1","s9","driver4")),6) occurs(action(("unload-truck","package5","truck1","s10")),6) occurs(action(("walk","driver5","s5","p2-5")),6) occurs(action(("unload-truck","package4","truck5","s3")),7) occurs(action(("load-truck","package12","truck2","s9")),7) occurs(action(("load-truck","package3","truck5","s3")),7) occurs(action(("drive-truck","truck5","s3","s15","driver1")),7) occurs(action(("drive-truck","truck2","s9","s8","driver4")),7) occurs(action(("unload-truck","package1","truck4","s8")),7) occurs(action(("unload-truck","package9","truck4","s8")),7) occurs(action(("disembark-truck","driver2","truck4","s8")),7) occurs(action(("disembark-truck","driver3","truck1","s14")),7) occurs(action(("walk","driver5","p2-5","s2")),7) occurs(action(("unload-truck","package11","truck2","s8")),8) occurs(action(("unload-truck","package2","truck5","s15")),8) occurs(action(("unload-truck","package6","truck2","s8")),8) occurs(action(("load-truck","package1","truck2","s8")),8) occurs(action(("load-truck","package14","truck5","s15")),8) occurs(action(("load-truck","package9","truck2","s8")),8) occurs(action(("walk","driver5","s2","p2-15")),8) occurs(action(("drive-truck","truck5","s15","s12","driver1")),8) occurs(action(("drive-truck","truck2","s8","s14","driver4")),8) occurs(action(("walk","driver2","s8","p7-8")),8) occurs(action(("walk","driver3","s14","p9-14")),8) occurs(action(("walk","driver5","p2-15","s15")),9) occurs(action(("drive-truck","truck5","s12","s10","driver1")),9) occurs(action(("unload-truck","package12","truck2","s14")),9) occurs(action(("drive-truck","truck2","s14","s5","driver4")),9) occurs(action(("walk","driver2","p7-8","s7")),9) occurs(action(("walk","driver3"
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 10
|
||
|
|
Time : 29.442s (Solving: 2.91s 1st Model: 0.41s Unsat: 0.00s)
|
||
|
|
CPU Time : 29.424s
|
||
|
|
|
||
|
|
Choices : 95708 (Domain: 95589)
|
||
|
|
Conflicts : 10493 (Analyzed: 10492)
|
||
|
|
Restarts : 106 (Average: 98.98 Last: 112)
|
||
|
|
Model-Level : 793.9
|
||
|
|
Problems : 10 (Average Length: 14.00 Splits: 0)
|
||
|
|
Lemmas : 10669 (Deleted: 6331)
|
||
|
|
Binary : 273 (Ratio: 2.56%)
|
||
|
|
Ternary : 26 (Ratio: 0.24%)
|
||
|
|
Conflict : 10492 (Average Length: 699.1 Ratio: 98.34%)
|
||
|
|
Loop : 177 (Average Length: 2.0 Ratio: 1.66%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 10492 (Average: 6.93 Max: 529 Sum: 72677)
|
||
|
|
Executed : 10436 (Average: 6.89 Max: 529 Sum: 72316 Ratio: 99.50%)
|
||
|
|
Bounded : 56 (Average: 6.45 Max: 17 Sum: 361 Ratio: 0.50%)
|
||
|
|
|
||
|
|
Rules : 13284417
|
||
|
|
Acyc : 1303900
|
||
|
|
Atoms : 11980517
|
||
|
|
Bodies : 91 (Original: 90)
|
||
|
|
Equivalences : 270 (Atom=Atom: 90 Body=Body: 0 Other: 180)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 103218 (Eliminated: 0 Frozen: 43689)
|
||
|
|
Constraints : 427411 (Binary: 96.4% Ternary: 2.2% Other: 1.4%)
|
||
|
|
|
||
|
|
Memory Peak : 1335MB
|
||
|
|
Max. Length : 15 steps
|
||
|
|
Sol. Length : 15 steps
|
||
|
|
Models : 7
|
||
|
|
|
||
|
|
|