tplp-planning-benchmark/fd-pb-e3/ipc-2002_driverlog-strips-automatic_13.out

143 lines
7.0 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-13.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-13.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.019s wall-clock]
Preparing model... [0.030s CPU, 0.027s wall-clock]
Generated 35 rules.
Computing model... [0.190s CPU, 0.197s wall-clock]
1675 relevant atoms
1119 auxiliary atoms
2794 final queue length
3819 total queue pushes
Completing instantiation... [0.210s CPU, 0.202s wall-clock]
Instantiating: [0.460s CPU, 0.459s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.019s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.020s CPU, 0.019s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
3 uncovered facts
Choosing groups: [0.010s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.050s CPU, 0.056s wall-clock]
Building STRIPS to SAS dictionary... [0.010s 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.210s CPU, 0.216s wall-clock]
72 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
11 propositions removed
Detecting unreachable propositions: [0.120s CPU, 0.118s wall-clock]
Reordering and filtering variables...
13 of 14 variables necessary.
3 of 14 mutex groups necessary.
1076 of 1148 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.029s wall-clock]
Translator variables: 13
Translator derived variables: 0
Translator facts: 197
Translator goal facts: 8
Translator mutex groups: 3
Translator total mutex groups size: 9
Translator operators: 1076
Translator axioms: 0
Translator task size: 4547
Translator peak memory: 36440 KB
Writing output... [0.080s CPU, 0.092s wall-clock]
Done! [1.000s CPU, 1.018s wall-clock]
planner.py version 0.0.1
Time: 1.32s
Memory: 116MB
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: 116MB (+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.17s
Memory: 134MB (+18MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 136MB (+2MB)
UNSAT
Iteration Time: 0.23s
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.18s
Memory: 146MB (+10MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("board-truck","driver2","truck2","s9")),1) occurs(action(("walk","driver1","s0","p0-2")),1) occurs(action(("drive-truck","truck2","s9","s11","driver2")),2) occurs(action(("walk","driver1","p0-2","s2")),2) occurs(action(("board-truck","driver1","truck3","s2")),3) occurs(action(("drive-truck","truck2","s11","s6","driver2")),3) occurs(action(("load-truck","package2","truck2","s6")),4) occurs(action(("load-truck","package4","truck2","s6")),4) occurs(action(("load-truck","package6","truck3","s2")),4) occurs(action(("drive-truck","truck3","s2","s8","driver1")),4) occurs(action(("drive-truck","truck2","s6","s4","driver2")),4) occurs(action(("load-truck","package1","truck2","s4")),5) occurs(action(("drive-truck","truck3","s8","s5","driver1")),5) occurs(action(("drive-truck","truck2","s4","s5","driver2")),5) occurs(action(("unload-truck","package1","truck2","s5")),6) occurs(action(("unload-truck","package6","truck3","s5")),6) occurs(action(("drive-truck","truck3","s5","s4","driver1")),6) occurs(action(("load-truck","package3","truck3","s5")),6) occurs(action(("unload-truck","package2","truck2","s5")),6) occurs(action(("unload-truck","package3","truck3","s4")),7) occurs(action(("load-truck","package2","truck2","s5")),7) occurs(action(("drive-truck","truck2","s5","s2","driver2")),7) occurs(action(("load-truck","package3","truck3","s4")),8) occurs(action(("drive-truck","truck2","s2","s0","driver2")),8) occurs(action(("disembark-truck","driver1","truck3","s4")),8) occurs(action(("unload-truck","package2","truck2","s0")),9) occurs(action(("unload-truck","package3","truck3","s4")),9) occurs(action(("unload-truck","package4","truck2","s0")),9) occurs(action(("walk","driver1","s4","p11-4")),9) occurs(action(("drive-truck","truck2","s0","s10","driver2")),9) occurs(action(("walk","driver1","p11-4","s11")),10) occurs(action(("drive-truck","truck2","s10","s8","driver2")),10)
Solving Time: 0.05s
Memory: 149MB (+3MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 1.868s (Solving: 0.04s 1st Model: 0.04s Unsat: 0.00s)
CPU Time : 1.850s
Choices : 1463
Conflicts : 552 (Analyzed: 551)
Restarts : 6 (Average: 91.83 Last: 65)
Model-Level : 32.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 551 (Deleted: 0)
Binary : 65 (Ratio: 11.80%)
Ternary : 21 (Ratio: 3.81%)
Conflict : 551 (Average Length: 35.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 551 (Average: 2.74 Max: 35 Sum: 1512)
Executed : 540 (Average: 2.58 Max: 35 Sum: 1424 Ratio: 94.18%)
Bounded : 11 (Average: 8.00 Max: 12 Sum: 88 Ratio: 5.82%)
Rules : 733211
Atoms : 733211
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 23454 (Eliminated: 0 Frozen: 14171)
Constraints : 43847 (Binary: 93.6% Ternary: 4.3% Other: 2.1%)
Memory Peak : 149MB
Max. Length : 10 steps
Sol. Length : 10 steps