tplp-planning-benchmark/gc-ta3-tt0/ipc-2002_driverlog-strips-automatic_12.out

202 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.029s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.019s wall-clock]
Preparing model... [0.020s CPU, 0.023s wall-clock]
Generated 35 rules.
Computing model... [0.180s CPU, 0.179s wall-clock]
1376 relevant atoms
903 auxiliary atoms
2279 final queue length
3128 total queue pushes
Completing instantiation... [0.190s CPU, 0.187s wall-clock]
Instantiating: [0.420s CPU, 0.421s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.020s 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.010s CPU, 0.004s wall-clock]
Building translation key... [0.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.053s 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.000s 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.110s CPU, 0.110s 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.930s CPU, 0.945s wall-clock]
planner.py version 0.0.1
Time: 0.16s
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.06s
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.05s
Memory: 63MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 65MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.92s
Memory: 119MB (+54MB)
Solving...
Solving Time: 0.09s
Memory: 120MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.17s
Memory: 127MB (+7MB)
Solving...
Solving Time: 0.03s
Memory: 127MB (+0MB)
UNSAT
Iteration Time: 1.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.05s
Memory: 127MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 130MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.20s
Memory: 135MB (+5MB)
Solving...
Solving Time: 0.13s
Memory: 138MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 141MB (+3MB)
Solving...
Solving Time: 0.02s
Memory: 144MB (+3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.17s
Memory: 144MB (+0MB)
Solving...
Solving Time: 0.15s
Memory: 144MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.12s
Memory: 145MB (+1MB)
Answer: 6
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","s2","driver2")),4) occurs(action(("walk","driver1","p2-7","s2")),4) occurs(action(("drive-truck","truck2","s2","s5","driver2")),5) occurs(action(("board-truck","driver1","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s4","driver1")),6) occurs(action(("disembark-truck","driver2","truck2","s5")),6) occurs(action(("load-truck","package2","truck3","s4")),7) occurs(action(("load-truck","package5","truck3","s4")),7) occurs(action(("drive-truck","truck3","s4","s1","driver1")),7) occurs(action(("walk","driver2","s5","p5-1")),7) occurs(action(("unload-truck","package2","truck3","s1")),8) occurs(action(("drive-truck","truck3","s1","s3","driver1")),8) occurs(action(("walk","driver2","p5-1","s1")),8) occurs(action(("load-truck","package1","truck3","s3")),9) occurs(action(("drive-truck","truck3","s3","s1","driver1")),9) occurs(action(("walk","driver2","s1","p1-7")),9) occurs(action(("drive-truck","truck3","s1","s0","driver1")),10) occurs(action(("unload-truck","package1","truck3","s1")),10) occurs(action(("walk","driver2","p1-7","s7")),10) occurs(action(("unload-truck","package5","truck3","s0")),11) occurs(action(("board-truck","driver2","truck1","s7")),11) occurs(action(("disembark-truck","driver1","truck3","s0")),11) occurs(action(("drive-truck","truck1","s7","s1","driver2")),12) occurs(action(("walk","driver1","s0","p6-0")),12) occurs(action(("unload-truck","package4","truck1","s1")),13) occurs(action(("load-truck","package1","truck1","s1")),13) occurs(action(("load-truck","package2","truck1","s1")),13) occurs(action(("load-truck","package6","truck1","s1")),13) occurs(action(("drive-truck","truck1","s1","s2","driver2")),13) occurs(action(("walk","driver1","p6-0","s6")),13) occurs(action(("unload-truck","package1","truck1","s2")),14) occurs(action(("unload-truck","package2","truck1","s2")),14) occurs(action(("unload-truck","package6","truck1","s2")),14) occurs(action(("drive-truck","truck1","s2","s9","driver2")),14) occurs(action(("walk","driver1","s6","p6-4")),14) occurs(action(("disembark-truck","driver2","truck1","s9")),15) occurs(action(("walk","driver1","p6-4","s4")),15)
SATISFIABLE
Models : 1+
Calls : 9
Time : 1.861s (Solving: 0.37s 1st Model: 0.35s Unsat: 0.02s)
CPU Time : 1.852s
Choices : 15130 (Domain: 15118)
Conflicts : 3542 (Analyzed: 3541)
Restarts : 34 (Average: 104.15 Last: 98)
Model-Level : 111.5
Problems : 9 (Average Length: 12.56 Splits: 0)
Lemmas : 3541 (Deleted: 0)
Binary : 106 (Ratio: 2.99%)
Ternary : 25 (Ratio: 0.71%)
Conflict : 3541 (Average Length: 215.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3541 (Average: 3.54 Max: 119 Sum: 12529)
Executed : 3533 (Average: 3.53 Max: 119 Sum: 12505 Ratio: 99.81%)
Bounded : 8 (Average: 3.00 Max: 17 Sum: 24 Ratio: 0.19%)
Rules : 540780
Atoms : 527480
Bodies : 23158 (Original: 23157)
Equivalences : 32491 (Atom=Atom: 6863 Body=Body: 5924 Other: 19704)
Tight : No (SCCs: 603 Non-Hcfs: 0 Nodes: 20896 Gammas: 0)
Variables : 25321 (Eliminated: 0 Frozen: 14894)
Constraints : 58862 (Binary: 93.8% Ternary: 3.7% Other: 2.5%)
Memory Peak : 145MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 6