patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [fd-pb-e3 | ipc-1998 | logistics-round-1-strips | 2]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-25 11:04:20 +01:00
parent 6b88fbb97f
commit 794344f09c
3 changed files with 200 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

129
fd-pb-e3/ipc-1998_logistics-round-1-strips_2.out Normal file
View File

@@ -0,0 +1,129 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-2.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-1998/domains/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-2.pddl
Parsing...
Parsing: [0.010s CPU, 0.019s 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.020s CPU, 0.026s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 51 rules.
Computing model... [0.190s CPU, 0.192s wall-clock]
1448 relevant atoms
1112 auxiliary atoms
2560 final queue length
3389 total queue pushes
Completing instantiation... [0.220s CPU, 0.217s wall-clock]
Instantiating: [0.470s CPU, 0.460s wall-clock]
Computing fact groups...
Finding invariants...
6 initial candidates
Finding invariants: [0.010s CPU, 0.012s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.021s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.040s CPU, 0.053s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.002s 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.009s wall-clock]
Translating task: [0.170s CPU, 0.172s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
19 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.097s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
980 of 980 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.023s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 230
Translator goal facts: 5
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 980
Translator axioms: 0
Translator task size: 3794
Translator peak memory: 35928 KB
Writing output... [0.070s CPU, 0.082s wall-clock]
Done! [0.900s CPU, 0.920s wall-clock]
planner.py version 0.0.1
Time: 0.76s
Memory: 87MB
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: 87MB (+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.14s
Memory: 102MB (+15MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("fly-airplane","plane4","city3-2","city2-2")),1) occurs(action(("load-truck","package2","truck10","city10-1")),1) occurs(action(("drive-truck","truck10","city10-1","city10-2","city10")),1) occurs(action(("drive-truck","truck9","city9-1","city9-2","city9")),2) occurs(action(("drive-truck","truck4","city4-1","city4-2","city4")),2) occurs(action(("drive-truck","truck3","city3-1","city3-2","city3")),2) occurs(action(("unload-truck","package2","truck10","city10-2")),2) occurs(action(("drive-truck","truck1","city1-1","city1-2","city1")),2) occurs(action(("drive-truck","truck6","city6-1","city6-2","city6")),2) occurs(action(("fly-airplane","plane1","city6-2","city10-2")),2) occurs(action(("fly-airplane","plane2","city3-2","city1-2")),2) occurs(action(("fly-airplane","plane3","city7-2","city6-2")),2) occurs(action(("fly-airplane","plane4","city2-2","city3-2")),2) occurs(action(("load-airplane","package1","plane4","city2-2")),2) occurs(action(("load-airplane","package3","plane2","city3-2")),2) occurs(action(("load-airplane","package4","plane3","city7-2")),2) occurs(action(("drive-truck","truck10","city10-2","city10-1","city10")),2) occurs(action(("load-airplane","package2","plane1","city10-2")),3) occurs(action(("fly-airplane","plane1","city10-2","city4-2")),3) occurs(action(("load-airplane","package5","plane2","city1-2")),3) occurs(action(("fly-airplane","plane2","city1-2","city4-2")),3) occurs(action(("fly-airplane","plane3","city6-2","city4-2")),3) occurs(action(("fly-airplane","plane4","city3-2","city4-2")),3) occurs(action(("unload-airplane","package1","plane4","city3-2")),3) occurs(action(("unload-airplane","package3","plane2","city1-2")),3) occurs(action(("unload-airplane","package4","plane3","city6-2")),3) occurs(action(("drive-truck","truck4","city4-2","city4-1","city4")),3) occurs(action(("drive-truck","truck9","city9-2","city9-1","city9")),3) occurs(action(("unload-airplane","package5","plane2","city4-2")),4) occurs(action(("load-truck","package1","truck3","city3-2")),4) occurs(action(("fly-airplane","plane1","city4-2","city9-2")),4) occurs(action(("load-truck","package3","truck1","city1-2")),4) occurs(action(("load-truck","package4","truck6","city6-2")),4) occurs(action(("drive-truck","truck3","city3-2","city3-1","city3")),4) occurs(action(("drive-truck","truck1","city1-2","city1-1","city1")),4) occurs(action(("drive-truck","truck6","city6-2","city6-1","city6")),4) occurs(action(("unload-truck","package1","truck3","city3-1")),5) occurs(action(("unload-airplane","package2","plane1","city9-2")),5) occurs(action(("unload-truck","package3","truck1","city1-1")),5) occurs(action(("unload-truck","package4","truck6","city6-1")),5) occurs(action(("fly-airplane","plane1","city9-2","city4-2")),5) occurs(action(("drive-truck","truck5","city5-1","city5-2","city5")),5) occurs(action(("drive-truck","truck7","city7-1","city7-2","city7")),5)
Solving Time: 0.01s
Memory: 103MB (+1MB)
SAT
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.955s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.940s
Choices : 210
Conflicts : 1 (Analyzed: 1)
Restarts : 0
Model-Level : 180.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 1 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 1 (Average Length: 10.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1 (Average: 37.00 Max: 37 Sum: 37)
Executed : 1 (Average: 37.00 Max: 37 Sum: 37 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 407341
Atoms : 407341
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 7523 (Eliminated: 0 Frozen: 0)
Constraints : 21360 (Binary: 92.9% Ternary: 5.2% Other: 1.8%)
Memory Peak : 103MB
Max. Length : 5 steps
Sol. Length : 5 steps