1
0
tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-2002_driverlog-strips-automatic_14.out

156 lines
7.7 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-14.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-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.014s wall-clock]
Preparing model... [0.020s CPU, 0.015s wall-clock]
Generated 35 rules.
Computing model... [0.160s CPU, 0.164s wall-clock]
1580 relevant atoms
947 auxiliary atoms
2527 final queue length
3598 total queue pushes
Completing instantiation... [0.200s CPU, 0.204s wall-clock]
Instantiating: [0.410s CPU, 0.407s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.010s CPU, 0.017s wall-clock]
Checking invariant weight... [0.010s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.016s wall-clock]
Collecting mutex groups... [0.010s 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.049s 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.012s wall-clock]
Translating task: [0.220s CPU, 0.220s wall-clock]
90 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.119s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
3 of 15 mutex groups necessary.
1158 of 1158 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.033s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 195
Translator goal facts: 9
Translator mutex groups: 3
Translator total mutex groups size: 12
Translator operators: 1158
Translator axioms: 0
Translator task size: 4965
Translator peak memory: 36440 KB
Writing output... [0.090s CPU, 0.098s wall-clock]
Done! [0.950s CPU, 0.961s wall-clock]
planner.py version 0.0.1
Time: 0.20s
Memory: 57MB
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: 57MB (+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.08s
Memory: 58MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+3MB)
UNSAT
Iteration Time: 0.11s
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.09s
Memory: 65MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.31s
Memory: 67MB (+2MB)
UNSAT
Iteration Time: 0.43s
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.08s
Memory: 72MB (+5MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver3","s2","p1-2")),1) occurs(action(("board-truck","driver2","truck1","s2")),1) occurs(action(("walk","driver1","s9","p7-9")),1) occurs(action(("walk","driver3","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s2","s3","driver2")),2) occurs(action(("walk","driver1","p7-9","s7")),2) occurs(action(("drive-truck","truck1","s3","s6","driver2")),3) occurs(action(("walk","driver1","s7","p3-7")),3) occurs(action(("walk","driver1","p3-7","s3")),4) occurs(action(("disembark-truck","driver2","truck1","s6")),4) occurs(action(("walk","driver1","s3","p8-3")),5) occurs(action(("walk","driver2","s6","p6-2")),5) occurs(action(("walk","driver1","p8-3","s8")),6) occurs(action(("walk","driver2","p6-2","s2")),6) occurs(action(("board-truck","driver1","truck3","s8")),7) occurs(action(("walk","driver2","s2","p1-2")),7) occurs(action(("drive-truck","truck3","s8","s4","driver1")),8) occurs(action(("walk","driver2","p1-2","s1")),8) occurs(action(("load-truck","package6","truck3","s4")),9) occurs(action(("board-truck","driver2","truck2","s1")),9) occurs(action(("drive-truck","truck2","s1","s3","driver2")),10) occurs(action(("drive-truck","truck3","s4","s5","driver1")),10) occurs(action(("unload-truck","package5","truck2","s3")),11) occurs(action(("unload-truck","package6","truck3","s5")),11) occurs(action(("load-truck","package1","truck3","s5")),11) occurs(action(("load-truck","package2","truck3","s5")),11) occurs(action(("load-truck","package4","truck2","s3")),11) occurs(action(("drive-truck","truck3","s5","s0","driver1")),12) occurs(action(("drive-truck","truck2","s3","s9","driver2")),12) occurs(action(("unload-truck","package1","truck3","s0")),13) occurs(action(("unload-truck","package2","truck3","s0")),13) occurs(action(("load-truck","package3","truck2","s9")),13) occurs(action(("drive-truck","truck3","s0","s3","driver1")),14) occurs(action(("drive-truck","truck2","s9","s4","driver2")),14) occurs(action(("unload-truck","package3","truck2","s4")),15) occurs(action(("unload-truck","package4","truck2","s4")),15) occurs(action(("disembark-truck","driver1","truck3","s3")),15) occurs(action(("disembark-truck","driver2","truck2","s4")),15)
Solving Time: 0.01s
Memory: 75MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.894s (Solving: 0.32s 1st Model: 0.01s Unsat: 0.31s)
CPU Time : 0.880s
Choices : 8064 (Domain: 8061)
Conflicts : 2417 (Analyzed: 2416)
Restarts : 25 (Average: 96.64 Last: 46)
Model-Level : 255.0
Problems : 4 (Average Length: 9.50 Splits: 0)
Lemmas : 2416 (Deleted: 951)
Binary : 48 (Ratio: 1.99%)
Ternary : 8 (Ratio: 0.33%)
Conflict : 2416 (Average Length: 118.1 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 2416 (Average: 3.34 Max: 60 Sum: 8069)
Executed : 2375 (Average: 3.16 Max: 60 Sum: 7632 Ratio: 94.58%)
Bounded : 41 (Average: 10.66 Max: 12 Sum: 437 Ratio: 5.42%)
Rules : 17578
Atoms : 17578
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 22219 (Eliminated: 0 Frozen: 18554)
Constraints : 103399 (Binary: 95.2% Ternary: 2.7% Other: 2.1%)
Memory Peak : 76MB
Max. Length : 15 steps
Sol. Length : 15 steps