tplp-planning-benchmark/gc-ta5-tt0/ipc-2002_driverlog-strips-automatic_15.out

187 lines
9.4 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-15.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-15.pddl
Parsing...
Parsing: [0.010s CPU, 0.023s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.015s wall-clock]
Preparing model... [0.020s CPU, 0.022s wall-clock]
Generated 35 rules.
Computing model... [0.340s CPU, 0.343s wall-clock]
3250 relevant atoms
1604 auxiliary atoms
4854 final queue length
7326 total queue pushes
Completing instantiation... [0.510s CPU, 0.509s wall-clock]
Instantiating: [0.890s CPU, 0.902s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.024s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.030s CPU, 0.035s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [0.090s CPU, 0.090s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.029s wall-clock]
Translating task: [0.590s CPU, 0.588s wall-clock]
192 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
16 propositions removed
Detecting unreachable propositions: [0.290s CPU, 0.295s wall-clock]
Reordering and filtering variables...
20 of 20 variables necessary.
4 of 20 mutex groups necessary.
2592 of 2592 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.080s CPU, 0.078s wall-clock]
Translator variables: 20
Translator derived variables: 0
Translator facts: 336
Translator goal facts: 10
Translator mutex groups: 4
Translator total mutex groups size: 20
Translator operators: 2592
Translator axioms: 0
Translator task size: 10978
Translator peak memory: 43980 KB
Writing output... [0.220s CPU, 0.235s wall-clock]
Done! [2.210s CPU, 2.243s wall-clock]
planner.py version 0.0.1
Time: 0.42s
Memory: 77MB
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: 77MB (+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.11s
Memory: 77MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 79MB (+2MB)
UNSAT
Iteration Time: 0.20s
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.14s
Memory: 87MB (+8MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 94MB (+7MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.34s
Memory: 110MB (+16MB)
Solving...
Solving Time: 0.01s
Memory: 110MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.34s
Memory: 94MB (+-16MB)
Solving...
Solving Time: 0.08s
Memory: 94MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.34s
Memory: 111MB (+17MB)
Solving...
Solving Time: 1.24s
Memory: 111MB (+0MB)
UNKNOWN
Iteration Time: 2.58s
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.13s
Memory: 111MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 111MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.33s
Memory: 111MB (+0MB)
Answer: 4
occurs(action(("load-truck","package1","truck3","s3")),1) occurs(action(("load-truck","package7","truck2","s9")),1) occurs(action(("walk","driver1","s8","p8-3")),1) occurs(action(("walk","driver2","s5","p5-9")),1) occurs(action(("walk","driver3","s5","p1-5")),1) occurs(action(("walk","driver4","s10","p10-0")),1) occurs(action(("walk","driver1","p8-3","s3")),2) occurs(action(("walk","driver2","p5-9","s9")),2) occurs(action(("walk","driver3","p1-5","s1")),2) occurs(action(("walk","driver4","p10-0","s0")),2) occurs(action(("walk","driver3","s1","p8-1")),3) occurs(action(("board-truck","driver1","truck3","s3")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver4","s0","p0-6")),3) occurs(action(("drive-truck","truck3","s3","s8","driver1")),4) occurs(action(("walk","driver4","p0-6","s6")),5) occurs(action(("walk","driver3","p8-1","s8")),6) occurs(action(("drive-truck","truck2","s9","s2","driver2")),6) occurs(action(("unload-truck","package1","truck3","s8")),6) occurs(action(("board-truck","driver4","truck4","s6")),6) occurs(action(("disembark-truck","driver1","truck3","s8")),6) occurs(action(("unload-truck","package7","truck2","s2")),7) occurs(action(("load-truck","package2","truck2","s2")),7) occurs(action(("drive-truck","truck2","s2","s5","driver2")),7) occurs(action(("drive-truck","truck4","s6","s8","driver4")),7) occurs(action(("walk","driver1","s8","p8-3")),7) occurs(action(("unload-truck","package2","truck2","s5")),8) occurs(action(("load-truck","package1","truck4","s8")),8) occurs(action(("load-truck","package3","truck4","s8")),8) occurs(action(("drive-truck","truck4","s8","s2","driver4")),8) occurs(action(("drive-truck","truck2","s5","s3","driver2")),8) occurs(action(("walk","driver1","p8-3","s3")),8) occurs(action(("unload-truck","package1","truck4","s2")),9) occurs(action(("drive-truck","truck4","s2","s1","driver4")),9) occurs(action(("board-truck","driver1","truck1","s3")),9) occurs(action(("drive-truck","truck2","s3","s10","driver2")),9) occurs(action(("unload-truck","package3","truck4","s1")),10) occurs(action(("load-truck","package5","truck4","s1")),11) occurs(action(("load-truck","package8","truck2","s10")),11) occurs(action(("drive-truck","truck4","s1","s0","driver4")),11) occurs(action(("drive-truck","truck1","s3","s8","driver1")),11) occurs(action(("drive-truck","truck2","s10","s3","driver2")),11) occurs(action(("unload-truck","package5","truck4","s0")),12) occurs(action(("load-truck","package6","truck1","s8")),12) occurs(action(("drive-truck","truck2","s3","s11","driver2")),12) occurs(action(("drive-truck","truck4","s0","s11","driver4")),12) occurs(action(("unload-truck","package8","truck2","s3")),12) occurs(action(("drive-truck","truck1","s8","s3","driver1")),12) occurs(action(("load-truck","package4","truck4","s11")),13) occurs(action(("drive-truck","truck4","s11","s7","driver4")),13) occurs(action(("drive-truck","truck1","s3","s11","driver1")),13) occurs(action(("load-truck","package8","truck1","s3")),13) occurs(action(("unload-truck","package4","truck4","s7")),14) occurs(action(("unload-truck","package6","truck1","s11")),14) occurs(action(("drive-truck","truck4","s7","s11","driver4")),14) occurs(action(("drive-truck","truck1","s11","s0","driver1")),14) occurs(action(("unload-truck","package8","truck1","s0")),15) occurs(action(("drive-truck","truck1","s0","s11","driver1")),15)
SATISFIABLE
Models : 1+
Calls : 7
Time : 2.460s (Solving: 1.32s 1st Model: 0.08s Unsat: 0.00s)
CPU Time : 2.444s
Choices : 39196 (Domain: 39142)
Conflicts : 9611 (Analyzed: 9611)
Restarts : 108 (Average: 88.99 Last: 86)
Model-Level : 196.0
Problems : 7 (Average Length: 10.57 Splits: 0)
Lemmas : 9611 (Deleted: 6587)
Binary : 415 (Ratio: 4.32%)
Ternary : 103 (Ratio: 1.07%)
Conflict : 9611 (Average Length: 148.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9611 (Average: 3.86 Max: 95 Sum: 37069)
Executed : 9528 (Average: 3.76 Max: 95 Sum: 36139 Ratio: 97.49%)
Bounded : 83 (Average: 11.20 Max: 12 Sum: 930 Ratio: 2.51%)
Rules : 36072
Atoms : 36069
Bodies : 34 (Original: 33)
Count : 3
Equivalences : 90 (Atom=Atom: 30 Body=Body: 0 Other: 60)
Tight : Yes
Variables : 45491 (Eliminated: 0 Frozen: 8071)
Constraints : 168563 (Binary: 95.6% Ternary: 2.7% Other: 1.7%)
Memory Peak : 124MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 4