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

274 lines
13 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.038s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.020s CPU, 0.015s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.040s CPU, 0.038s wall-clock]
Generated 35 rules.
Computing model... [0.700s CPU, 0.715s 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.020s CPU, 2.020s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.033s 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.014s wall-clock]
Building translation key... [0.010s CPU, 0.008s wall-clock]
Computing fact groups: [0.170s CPU, 0.173s 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.005s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.070s CPU, 0.069s wall-clock]
Translating task: [1.390s CPU, 1.389s 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.699s 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.500s CPU, 0.553s wall-clock]
Done! [5.060s CPU, 5.124s wall-clock]
planner.py version 0.0.1
Time: 0.99s
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.34s
Memory: 135MB (+15MB)
Unblocking actions...
Solving...
Solving Time: 2.47s
Memory: 154MB (+19MB)
UNKNOWN
Iteration Time: 3.03s
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.32s
Memory: 174MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 0.10s
Memory: 197MB (+23MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.83s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.14s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.23s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.82s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.05s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.82s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.12s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.06s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.82s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.08s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.07s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.82s
Memory: 197MB (+0MB)
Solving...
Solving Time: 0.09s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 214MB (+17MB)
Solving...
Solving Time: 0.05s
Memory: 214MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 197MB (+-17MB)
Solving...
Solving Time: 0.05s
Memory: 197MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 239MB (+42MB)
Solving...
Solving Time: 0.05s
Memory: 197MB (+-42MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 239MB (+42MB)
Solving...
Solving Time: 0.13s
Memory: 239MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.81s
Memory: 216MB (+-23MB)
Solving...
Solving Time: 0.05s
Memory: 216MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.86s
Memory: 200MB (+-16MB)
Solving...
Solving Time: 0.04s
Memory: 200MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.84s
Memory: 200MB (+0MB)
Answer: 15
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","s0","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(("drive-truck","truck5","s0","s2","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","truck5","s2","s6","driver3")),4) occurs(action(("drive-truck","truck3","s12","s5","driver5")),4) occurs(action(("drive-truck","truck1","s2","s6","driver1")),4) occurs(action(("drive-truck","truck4","s3","s12","driver2")),4) occurs(action(("drive-truck","truck2","s8","s14","driver4")),4) occurs(action(("unload-truck","package5","truck1","s6")),5) occurs(action(("drive-truck","truck1","s6","s14","driver1")),5) occurs(action(("load-truck","package1","truck4","s12")),5) occurs(action(("load-truck","package15","truck2","s14")),5) occurs(action(("load-truck","package2","truck2","s14")),5) occurs(action(("load-truck","package4","truck1","s6")),5) occurs(action(("load-truck","package8","truck4","s12")),5) occurs(action(("load-truck","package9","truck4","s12")),5) occurs(action(("drive-truck","truck4","s12","s13","driver2")),5) occurs(action(("drive-truck","truck2","s14","s4","driver4")),5) occurs(action(("disembark-truck","driver3","truck5","s6")),5) occurs(action(("disembark-truck","driver5","truck3","s5")),5) occurs(action(("unload-truck","package15","truck2","s4")),6) occurs(action(("unload-truck","package8","truck4","s13")),6) occurs(action(("drive-truck","truck2","s4","s15","driver4")),6) occurs(action(("walk","driver5","s5","p5-15")),6) occurs(action(("drive-truck","truck1","s14","s11","driver1")),6) occurs(action(("drive-truck","truck4","s13","s12","driver2")),6) occurs(action(("walk","driver3","s6","p6-11")),6) occurs(action(("unload-truck","package2","truck2","s15")),7) occurs(action(("walk","driver5","p5-15","s15")),7) occurs(action(("load-truck","package14","truck2","s15")),7) occurs(action(("drive-truck","truck1","s11","s3","driver1")),7) occurs(action(("drive-truck","truck4","s12","s5","driver2")),7) occurs(action(("drive-truck","truck2","s15","s2","driver4")),7) occurs(action(("unload-truck","package4","truck1","s3")),8) occurs(action(("load-truck","package10","truck4","s5")),8) occurs(action(("load-truck","package13","truck2","s2")),8) occurs(action(("drive-truck","truck1","s3","s5","driver1")),8) occurs(action(("drive-truck","truck4","s5","s2","driver2")),8) occurs(action(("drive-truck","truck2","s2","s0","driver4")),8) occurs(action(("drive-truck","truck4","s2","s11","driver2")),9) occurs(action(("drive-truck","truck2","s0","s10","driver4")),9) occurs(action(("drive-truck","truck1","s5","s9","driver1")),9) occurs(action(("unload-truck","package10","truck4","s11")),10) occurs(action(("unload-truck","package13","truck2","s10")),10) occurs(action(("drive-truck","truck4","s11","s8","driver2")),10) occurs(action(("drive-truck","truck2","s10","s1","driver4")),10) occurs(action(("load-truck","package12","truck1","s9")),10) occurs(action(("drive-truck","truck1","s9","s2","driver1")),10) occurs(action(("unload-truck","package14","truck2","s1")),11) occurs(action(("load-truck","package11","truck2","s1")),11) occurs(action(("load-truck","package6","truck2","s1")),11) occurs(action(("drive-truck","truck2","s1","s4","driver4")),11) occurs(action(("drive-truck","truck1","s2","s6","driver1")),11) occurs(action(("unload-truck","package1","truck4","s8")),11) occurs(action(("unload
SATISFIABLE
Models : 1+
Calls : 18
Time : 6.749s (Solving: 3.53s 1st Model: 0.93s Unsat: 0.00s)
CPU Time : 6.716s
Choices : 122476 (Domain: 122246)
Conflicts : 11895 (Analyzed: 11894)
Restarts : 117 (Average: 101.66 Last: 90)
Model-Level : 776.5
Problems : 18 (Average Length: 15.33 Splits: 0)
Lemmas : 11894 (Deleted: 6331)
Binary : 127 (Ratio: 1.07%)
Ternary : 38 (Ratio: 0.32%)
Conflict : 11894 (Average Length: 646.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 11894 (Average: 7.61 Max: 632 Sum: 90553)
Executed : 11828 (Average: 7.58 Max: 632 Sum: 90150 Ratio: 99.55%)
Bounded : 66 (Average: 6.11 Max: 17 Sum: 403 Ratio: 0.45%)
Rules : 85314
Atoms : 85268
Bodies : 257 (Original: 256)
Equivalences : 630 (Atom=Atom: 210 Body=Body: 0 Other: 420)
Tight : Yes
Variables : 103218 (Eliminated: 0 Frozen: 8905)
Constraints : 427431 (Binary: 96.4% Ternary: 2.2% Other: 1.4%)
Memory Peak : 240MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 15