156 lines
8.6 KiB
Plaintext
156 lines
8.6 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.020s CPU, 0.021s wall-clock]
|
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating...
|
|
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
|
Normalizing Datalog program...
|
|
Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
|
Generated 35 rules.
|
|
Computing model... [0.150s CPU, 0.152s wall-clock]
|
|
1376 relevant atoms
|
|
903 auxiliary atoms
|
|
2279 final queue length
|
|
3128 total queue pushes
|
|
Completing instantiation... [0.170s CPU, 0.168s wall-clock]
|
|
Instantiating: [0.370s CPU, 0.362s wall-clock]
|
|
Computing fact groups...
|
|
Finding invariants...
|
|
11 initial candidates
|
|
Finding invariants: [0.010s CPU, 0.015s wall-clock]
|
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
|
Instantiating groups... [0.020s CPU, 0.016s 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.040s CPU, 0.045s 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.010s wall-clock]
|
|
Translating task: [0.190s CPU, 0.178s 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.099s 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.020s CPU, 0.025s 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: 35928 KB
|
|
Writing output... [0.070s CPU, 0.081s wall-clock]
|
|
Done! [0.820s CPU, 0.825s wall-clock]
|
|
planner.py version 0.0.1
|
|
|
|
Time: 0.97s
|
|
Memory: 97MB
|
|
|
|
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.01s
|
|
Memory: 97MB (+0MB)
|
|
UNSAT
|
|
Iteration Time: 0.01s
|
|
|
|
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.22s
|
|
Memory: 119MB (+22MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.01s
|
|
Memory: 121MB (+2MB)
|
|
UNSAT
|
|
Iteration Time: 0.27s
|
|
|
|
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: 129MB (+8MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Solving Time: 0.03s
|
|
Memory: 132MB (+3MB)
|
|
UNSAT
|
|
Iteration Time: 0.22s
|
|
|
|
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.15s
|
|
Memory: 139MB (+7MB)
|
|
Unblocking actions...
|
|
Solving...
|
|
Answer: 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","driver1","truck1","s7")),3) occurs(action(("board-truck","driver2","truck2","s9")),3) occurs(action(("load-truck","package4","truck1","s7")),4) occurs(action(("drive-truck","truck2","s9","s4","driver2")),4) occurs(action(("drive-truck","truck1","s7","s6","driver1")),4) occurs(action(("load-truck","package2","truck2","s4")),5) occurs(action(("load-truck","package5","truck2","s4")),5) occurs(action(("drive-truck","truck2","s4","s2","driver2")),5) occurs(action(("drive-truck","truck1","s6","s3","driver1")),5) occurs(action(("unload-truck","package2","truck2","s2")),6) occurs(action(("load-truck","package1","truck1","s3")),6) occurs(action(("drive-truck","truck1","s3","s1","driver1")),6) occurs(action(("unload-truck","package5","truck2","s2")),6) occurs(action(("disembark-truck","driver2","truck2","s2")),6) occurs(action(("unload-truck","package4","truck1","s1")),7) occurs(action(("load-truck","package2","truck2","s2")),7) occurs(action(("load-truck","package5","truck3","s2")),7) occurs(action(("board-truck","driver2","truck3","s2")),7) occurs(action(("unload-truck","package1","truck1","s1")),7) occurs(action(("drive-truck","truck1","s1","s3","driver1")),7) occurs(action(("unload-truck","package2","truck2","s2")),8) occurs(action(("drive-truck","truck3","s2","s0","driver2")),8) occurs(action(("drive-truck","truck1","s3","s1","driver1")),8) occurs(action(("load-truck","package1","truck1","s1")),9) occurs(action(("load-truck","package6","truck1","s1")),9) occurs(action(("drive-truck","truck1","s1","s2","driver1")),9) occurs(action(("disembark-truck","driver2","truck3","s0")),9) occurs(action(("load-truck","package2","truck2","s2")),10) occurs(action(("disembark-truck","driver1","truck1","s2")),10) occurs(action(("walk","driver2","s0","p6-0")),10) occurs(action(("unload-truck","package1","truck1","s2")),11) occurs(action(("unload-truck","package2","truck2","s2")),11) occurs(action(("unload-truck","package5","truck3","s0")),11) occurs(action(("board-truck","driver1","truck2","s2")),11) occurs(action(("walk","driver2","p6-0","s6")),11) occurs(action(("drive-truck","truck2","s2","s5","driver1")),12) occurs(action(("load-truck","package1","truck1","s2")),12) occurs(action(("walk","driver2","s6","p6-5")),12) occurs(action(("unload-truck","package1","truck1","s2")),13) occurs(action(("disembark-truck","driver1","truck2","s5")),13) occurs(action(("walk","driver2","p6-5","s5")),13) occurs(action(("unload-truck","package6","truck1","s2")),14) occurs(action(("load-truck","package1","truck1","s2")),14) occurs(action(("load-truck","package2","truck1","s2")),14) occurs(action(("walk","driver2","s5","p5-9")),14) occurs(action(("walk","driver1","s5","p4-5")),14) occurs(action(("unload-truck","package1","truck1","s2")),15) occurs(action(("unload-truck","package2","truck1","s2")),15) occurs(action(("walk","driver2","p5-9","s9")),15) occurs(action(("walk","driver1","p4-5","s4")),15)
|
|
Solving Time: 0.14s
|
|
Memory: 143MB (+4MB)
|
|
SAT
|
|
SATISFIABLE
|
|
|
|
Models : 1+
|
|
Calls : 4
|
|
Time : 1.825s (Solving: 0.15s 1st Model: 0.13s Unsat: 0.02s)
|
|
CPU Time : 1.810s
|
|
|
|
Choices : 5100
|
|
Conflicts : 2184 (Analyzed: 2183)
|
|
Restarts : 21 (Average: 103.95 Last: 132)
|
|
Model-Level : 66.0
|
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
|
Lemmas : 2183 (Deleted: 0)
|
|
Binary : 207 (Ratio: 9.48%)
|
|
Ternary : 111 (Ratio: 5.08%)
|
|
Conflict : 2183 (Average Length: 32.3 Ratio: 100.00%)
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
|
Backjumps : 2183 (Average: 2.27 Max: 39 Sum: 4966)
|
|
Executed : 2172 (Average: 2.23 Max: 39 Sum: 4869 Ratio: 98.05%)
|
|
Bounded : 11 (Average: 8.82 Max: 17 Sum: 97 Ratio: 1.95%)
|
|
|
|
Rules : 500737
|
|
Atoms : 500737
|
|
Bodies : 1 (Original: 0)
|
|
Tight : Yes
|
|
Variables : 30782 (Eliminated: 0 Frozen: 18181)
|
|
Constraints : 64690 (Binary: 93.1% Ternary: 4.7% Other: 2.1%)
|
|
|
|
Memory Peak : 143MB
|
|
Max. Length : 15 steps
|
|
Sol. Length : 15 steps
|
|
|
|
|