1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_driverlog-strips-automatic_12.out

184 lines
8.8 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-12.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-12.pddl
Parsing...
Parsing: [0.030s CPU, 0.032s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.030s CPU, 0.025s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.182s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.190s CPU, 0.189s wall-clock]
Instantiating: [0.430s CPU, 0.429s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.017s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.018s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.050s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.011s wall-clock]
Translating task: [0.200s CPU, 0.201s wall-clock]
60 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.109s wall-clock]
Reordering and filtering variables...
14 of 14 variables necessary.
3 of 14 mutex groups necessary.
948 of 948 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.028s wall-clock]
Translator variables: 14
Translator derived variables: 0
Translator facts: 176
Translator goal facts: 10
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 948
Translator axioms: 0
Translator task size: 4037
Translator peak memory: 39116 KB
Writing output... [0.080s CPU, 0.089s wall-clock]
Done! [0.940s CPU, 0.953s wall-clock]
planner.py version 0.0.1
Time: 0.15s
Memory: 59MB
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: 59MB (+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.04s
Memory: 59MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+1MB)
UNSAT
Iteration Time: 0.07s
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.04s
Memory: 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 65MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.19s
Memory: 71MB (+6MB)
Solving...
Solving Time: 0.01s
Memory: 70MB (+-1MB)
UNSAT
Iteration Time: 0.30s
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.11s
Memory: 70MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 2.15s
Memory: 78MB (+8MB)
UNKNOWN
Iteration Time: 2.31s
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.11s
Memory: 84MB (+6MB)
Unblocking actions...
Solving...
Solving Time: 0.11s
Memory: 86MB (+2MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 86MB (+0MB)
Answer: 2
occurs(action(("load-truck","package4","truck1","s7")),1) occurs(action(("walk","driver2","s3","p3-9")),1) occurs(action(("walk","driver1","s1","p1-7")),1) occurs(action(("walk","driver2","p3-9","s9")),2) occurs(action(("walk","driver1","p1-7","s7")),2) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("walk","driver1","s7","p2-7")),3) occurs(action(("drive-truck","truck2","s9","s4","driver2")),4) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("drive-truck","truck2","s4","s5","driver2")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s9","driver1")),6) occurs(action(("disembark-truck","driver2","truck2","s5")),6) occurs(action(("walk","driver2","s5","p5-9")),7) occurs(action(("disembark-truck","driver1","truck3","s9")),7) occurs(action(("walk","driver2","p5-9","s9")),8) occurs(action(("walk","driver1","s9","p7-9")),8) occurs(action(("board-truck","driver2","truck3","s9")),9) occurs(action(("walk","driver1","p7-9","s7")),9) occurs(action(("board-truck","driver1","truck1","s7")),10) occurs(action(("drive-truck","truck3","s9","s3","driver2")),10) occurs(action(("load-truck","package1","truck3","s3")),11) occurs(action(("drive-truck","truck1","s7","s1","driver1")),11) occurs(action(("unload-truck","package4","truck1","s1")),12) occurs(action(("load-truck","package6","truck1","s1")),12) occurs(action(("drive-truck","truck3","s3","s1","driver2")),12) occurs(action(("drive-truck","truck3","s1","s0","driver2")),13) occurs(action(("drive-truck","truck1","s1","s4","driver1")),13) occurs(action(("load-truck","package2","truck1","s4")),14) occurs(action(("load-truck","package5","truck1","s4")),14) occurs(action(("unload-truck","package1","truck3","s0")),14) occurs(action(("disembark-truck","driver2","truck3","s0")),14) occurs(action(("drive-truck","truck1","s4","s0","driver1")),15) occurs(action(("walk","driver2","s0","p6-0")),15) occurs(action(("unload-truck","package5","truck1","s0")),16) occurs(action(("load-truck","package1","truck1","s0")),16) occurs(action(("walk","driver2","p6-0","s6")),16) occurs(action(("drive-truck","truck1","s0","s2","driver1")),17) occurs(action(("walk","driver2","s6","p7-6")),17) occurs(action(("unload-truck","package1","truck1","s2")),18) occurs(action(("unload-truck","package2","truck1","s2")),18) occurs(action(("unload-truck","package6","truck1","s2")),18) occurs(action(("walk","driver2","p7-6","s7")),18) occurs(action(("walk","driver2","s7","p7-9")),19) occurs(action(("drive-truck","truck1","s2","s4","driver1")),19) occurs(action(("walk","driver2","p7-9","s9")),20) occurs(action(("disembark-truck","driver1","truck1","s4")),20)
SATISFIABLE
Models : 1+
Calls : 6
Time : 2.962s (Solving: 2.27s 1st Model: 0.12s Unsat: 0.00s)
CPU Time : 2.960s
Choices : 32339 (Domain: 32339)
Conflicts : 9034 (Analyzed: 9033)
Restarts : 107 (Average: 84.42 Last: 112)
Model-Level : 127.5
Problems : 6 (Average Length: 12.00 Splits: 0)
Lemmas : 9033 (Deleted: 4529)
Binary : 36 (Ratio: 0.40%)
Ternary : 24 (Ratio: 0.27%)
Conflict : 9033 (Average Length: 468.4 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9033 (Average: 2.82 Max: 151 Sum: 25507)
Executed : 8991 (Average: 2.76 Max: 151 Sum: 24953 Ratio: 97.83%)
Bounded : 42 (Average: 13.19 Max: 17 Sum: 554 Ratio: 2.17%)
Rules : 22734 (Original: 22709)
Atoms : 14461
Bodies : 8238 (Original: 8212)
Count : 78 (Original: 83)
Equivalences : 4611 (Atom=Atom: 16 Body=Body: 0 Other: 4595)
Tight : Yes
Variables : 23629 (Eliminated: 0 Frozen: 16531)
Constraints : 113503 (Binary: 94.9% Ternary: 2.8% Other: 2.3%)
Memory Peak : 88MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 2