tplp-planning-benchmark/gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_17.out

224 lines
12 KiB
Plaintext
Raw Permalink Normal View History

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.034s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.014s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
Preparing model... [0.030s CPU, 0.035s wall-clock]
Generated 35 rules.
Computing model... [0.720s CPU, 0.714s wall-clock]
7293 relevant atoms
2871 auxiliary atoms
10164 final queue length
16104 total queue pushes
Completing instantiation... [1.220s CPU, 1.224s wall-clock]
Instantiating: [2.010s CPU, 2.013s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.040s CPU, 0.035s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.080s CPU, 0.076s wall-clock]
Collecting mutex groups... [0.000s 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.176s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.068s wall-clock]
Translating task: [1.400s CPU, 1.395s 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.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.555s wall-clock]
Done! [5.080s CPU, 5.123s wall-clock]
planner.py version 0.0.1
Time: 1.01s
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.55s
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.34s
Memory: 135MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 2.47s
Memory: 154MB (+19MB)
UNKNOWN
Iteration Time: 3.02s
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.10s
Memory: 197MB (+23MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.92s
Memory: 211MB (+14MB)
Solving...
Solving Time: 0.84s
Memory: 199MB (+-12MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.84s
Memory: 199MB (+0MB)
Solving...
Solving Time: 0.50s
Memory: 211MB (+12MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.85s
Memory: 236MB (+25MB)
Solving...
Solving Time: 0.16s
Memory: 223MB (+-13MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.83s
Memory: 238MB (+15MB)
Solving...
Solving Time: 1.64s
Memory: 238MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.85s
Memory: 241MB (+3MB)
Solving...
Solving Time: 1.00s
Memory: 241MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.85s
Memory: 245MB (+4MB)
Solving...
Solving Time: 6.28s
Memory: 245MB (+0MB)
UNKNOWN
Iteration Time: 16.21s
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.48s
Memory: 239MB (+-6MB)
Unblocking actions...
Solving...
Solving Time: 0.15s
Memory: 256MB (+17MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.78s
Memory: 279MB (+23MB)
Answer: 7
occurs(action(("load-truck","package13","truck1","s2")),1) 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(("walk","driver1","s10","p2-10")),1) occurs(action(("walk","driver2","s13","p3-13")),1) occurs(action(("walk","driver4","s9","p8-9")),1) occurs(action(("walk","driver5","s2","p2-12")),1) 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(("walk","driver5","p2-12","s12")),2) occurs(action(("load-truck","package1","truck5","s12")),3) occurs(action(("load-truck","package9","truck5","s12")),3) occurs(action(("drive-truck","truck5","s12","s15","driver3")),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","driver1","truck1","s2")),3) occurs(action(("drive-truck","truck3","s12","s5","driver5")),4) occurs(action(("load-truck","package14","truck5","s15")),4) occurs(action(("drive-truck","truck4","s3","s10","driver2")),4) occurs(action(("drive-truck","truck2","s8","s10","driver4")),4) occurs(action(("drive-truck","truck1","s2","s9","driver1")),4) occurs(action(("drive-truck","truck4","s10","s8","driver2")),5) occurs(action(("drive-truck","truck2","s10","s1","driver4")),5) occurs(action(("load-truck","package10","truck3","s5")),5) occurs(action(("drive-truck","truck5","s15","s13","driver3")),5) occurs(action(("drive-truck","truck1","s9","s1","driver1")),5) occurs(action(("disembark-truck","driver4","truck2","s1")),6) occurs(action(("load-truck","package11","truck1","s1")),6) occurs(action(("load-truck","package6","truck1","s1")),6) occurs(action(("drive-truck","truck5","s13","s1","driver3")),6) occurs(action(("drive-truck","truck3","s5","s14","driver5")),6) occurs(action(("unload-truck","package3","truck4","s8")),6) occurs(action(("unload-truck","package5","truck1","s1")),6) occurs(action(("disembark-truck","driver2","truck4","s8")),6) occurs(action(("unload-truck","package1","truck5","s1")),7) occurs(action(("unload-truck","package14","truck5","s1")),7) occurs(action(("unload-truck","package9","truck5","s1")),7) occurs(action(("drive-truck","truck3","s14","s11","driver5")),7) occurs(action(("load-truck","package5","truck5","s1")),7) occurs(action(("drive-truck","truck1","s1","s10","driver1")),7) occurs(action(("walk","driver2","s8","p8-9")),7) occurs(action(("unload-truck","package10","truck3","s11")),8) occurs(action(("drive-truck","truck1","s10","s8","driver1")),8) occurs(action(("drive-truck","truck5","s1","s9","driver3")),8) occurs(action(("walk","driver2","p8-9","s9")),8) occurs(action(("unload-truck","package11","truck1","s8")),9) occurs(action(("unload-truck","package6","truck1","s8")),9) occurs(action(("load-truck","package3","truck1","s8")),9) occurs(action(("drive-truck","truck3","s11","s8","driver5")),9) occurs(action(("drive-truck","truck5","s9","s5","driver3")),9) occurs(action(("walk","driver2","s9","p9-4")),9) occurs(action(("drive-truck","truck5","s5","s14","driver3")),10) occurs(action(("drive-truck","truck3","s8","s9","driver5")),10) occurs(action(("drive-truck","truck1","s8","s10","driver1")),10) occurs(action(("walk","driver2","p9-4","s4")),10) occurs(action(("unload-truck","package13","truck1","s10")),11) occurs(action(("unload-truck","package3","truck1","s10")),11) occurs(action(("drive-truck","truck5","s14","s6","driver3")),11) occurs(action(("load-truck","package12","truck3","s9")),11) occurs(action(("walk","driver2","s4","p15-4")),11) occurs(action(("unload-truck","package5","truck5","s6")),12) occurs(action(("drive-truck","truck3","s9","s2","driver5")),12) occurs(action(("walk","driver2","p15-4","s15")),12) occurs(action(("disembark-truck","driver3","truck5","s6")),12) occurs(action(("drive-truck","truck1","s10","s12","driver1")),12)
SATISFIABLE
Models : 1+
Calls : 11
Time : 17.002s (Solving: 12.79s 1st Model: 4.03s Unsat: 0.00s)
CPU Time : 16.972s
Choices : 481647 (Domain: 481192)
Conflicts : 28234 (Analyzed: 28233)
Restarts : 281 (Average: 100.47 Last: 90)
Model-Level : 793.0
Problems : 11 (Average Length: 14.73 Splits: 0)
Lemmas : 28233 (Deleted: 23368)
Binary : 201 (Ratio: 0.71%)
Ternary : 51 (Ratio: 0.18%)
Conflict : 28233 (Average Length: 587.7 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 28233 (Average: 14.15 Max: 673 Sum: 399570)
Executed : 28108 (Average: 14.12 Max: 673 Sum: 398735 Ratio: 99.79%)
Bounded : 125 (Average: 6.68 Max: 22 Sum: 835 Ratio: 0.21%)
Rules : 220202 (Original: 220164)
Atoms : 92108
Bodies : 124525 (Original: 124486)
Count : 344 (Original: 348)
Equivalences : 66005 (Atom=Atom: 90 Body=Body: 0 Other: 65915)
Tight : Yes
Variables : 140897 (Eliminated: 0 Frozen: 107999)
Constraints : 783197 (Binary: 97.1% Ternary: 1.7% Other: 1.2%)
Memory Peak : 279MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 7