Add benchmark result [fd-pb-es | ipc-2002 | driverlog-strips-automatic | 7]
This commit is contained in:
168
fd-pb-es/ipc-2002_driverlog-strips-automatic_7.out
Normal file
168
fd-pb-es/ipc-2002_driverlog-strips-automatic_7.out
Normal file
@@ -0,0 +1,168 @@
|
||||
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-7.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-7.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.019s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.020s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.012s wall-clock]
|
||||
Generated 35 rules.
|
||||
Computing model... [0.060s CPU, 0.057s wall-clock]
|
||||
412 relevant atoms
|
||||
273 auxiliary atoms
|
||||
685 final queue length
|
||||
904 total queue pushes
|
||||
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
|
||||
Instantiating: [0.150s CPU, 0.147s 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.001s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.008s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
3 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.030s CPU, 0.032s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.000s CPU, 0.003s wall-clock]
|
||||
Translating task: [0.060s CPU, 0.051s wall-clock]
|
||||
27 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
12 propositions removed
|
||||
Detecting unreachable propositions: [0.020s CPU, 0.027s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
15 of 15 variables necessary.
|
||||
3 of 15 mutex groups necessary.
|
||||
252 of 252 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.009s wall-clock]
|
||||
Translator variables: 15
|
||||
Translator derived variables: 0
|
||||
Translator facts: 78
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 3
|
||||
Translator total mutex groups size: 12
|
||||
Translator operators: 252
|
||||
Translator axioms: 0
|
||||
Translator task size: 1168
|
||||
Translator peak memory: 33624 KB
|
||||
Writing output... [0.020s CPU, 0.024s wall-clock]
|
||||
Done! [0.310s CPU, 0.313s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.07s
|
||||
Memory: 48MB
|
||||
|
||||
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: 48MB (+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.02s
|
||||
Memory: 48MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 48MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.03s
|
||||
|
||||
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.02s
|
||||
Memory: 49MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.30s
|
||||
Memory: 50MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.33s
|
||||
|
||||
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.02s
|
||||
Memory: 51MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.34s
|
||||
Memory: 52MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.37s
|
||||
|
||||
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.01s
|
||||
Memory: 53MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Answer: 1
|
||||
occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver3","s2","p2-1")),2) occurs(action(("board-truck","driver1","truck2","s1")),3) occurs(action(("walk","driver3","p2-1","s1")),4) occurs(action(("board-truck","driver3","truck1","s1")),5) occurs(action(("drive-truck","truck2","s1","s0","driver1")),6) occurs(action(("unload-truck","package5","truck2","s0")),7) occurs(action(("load-truck","package5","truck2","s0")),8) occurs(action(("drive-truck","truck1","s1","s2","driver3")),9) occurs(action(("walk","driver2","s2","p0-2")),10) occurs(action(("walk","driver2","p0-2","s0")),11) occurs(action(("load-truck","package2","truck1","s2")),12) occurs(action(("drive-truck","truck1","s2","s1","driver3")),13) occurs(action(("load-truck","package4","truck1","s1")),14) occurs(action(("unload-truck","package5","truck2","s0")),15) occurs(action(("unload-truck","package2","truck1","s1")),16) occurs(action(("drive-truck","truck1","s1","s2","driver3")),17) occurs(action(("unload-truck","package4","truck1","s2")),18) occurs(action(("disembark-truck","driver1","truck2","s0")),19) occurs(action(("drive-truck","truck1","s2","s1","driver3")),20)
|
||||
Solving Time: 0.36s
|
||||
Memory: 54MB (+1MB)
|
||||
SAT
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 5
|
||||
Time : 1.175s (Solving: 1.00s 1st Model: 0.36s Unsat: 0.00s)
|
||||
CPU Time : 1.180s
|
||||
|
||||
Choices : 44243
|
||||
Conflicts : 27879 (Analyzed: 27878)
|
||||
Restarts : 292 (Average: 95.47 Last: 86)
|
||||
Model-Level : 43.0
|
||||
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||||
Lemmas : 27878 (Deleted: 15663)
|
||||
Binary : 1770 (Ratio: 6.35%)
|
||||
Ternary : 1641 (Ratio: 5.89%)
|
||||
Conflict : 27878 (Average Length: 20.7 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 27878 (Average: 1.52 Max: 46 Sum: 42425)
|
||||
Executed : 27805 (Average: 1.50 Max: 46 Sum: 41897 Ratio: 98.76%)
|
||||
Bounded : 73 (Average: 7.23 Max: 22 Sum: 528 Ratio: 1.24%)
|
||||
|
||||
Rules : 3758
|
||||
Atoms : 3758
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 6457 (Eliminated: 0 Frozen: 4302)
|
||||
Constraints : 26576 (Binary: 90.9% Ternary: 5.0% Other: 4.1%)
|
||||
|
||||
Memory Peak : 54MB
|
||||
Max. Length : 20 steps
|
||||
Sol. Length : 20 steps
|
||||
|
||||
|
||||
Reference in New Issue
Block a user