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

Add benchmark result [gc-ta7-tt1 | ipc-2002 | driverlog-strips-automatic | 14]

Browse Source
This commit is contained in:
Potassco Bot 2017-11-27 19:00:11 +01:00
parent a923682fd7
commit f322aa1505
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 328 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
gc-ta7-tt1/ipc-2002_driverlog-strips-automatic_14.env Normal file
View File

@ -0,0 +1,50 @@
command:
- timeout
- -m=8000000
- -t=900
- python3
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
- --domain=/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
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=7
- --test-times=1
configuration:
id: gc-ta7-tt1
instanceSets:
- lpnmr-first-plan-not-serializable
options:
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=7
- --test-times=1
exitCode: 0
instance:
domain: driverlog-strips-automatic
instance: 14
ipc: ipc-2002
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

18
gc-ta7-tt1/ipc-2002_driverlog-strips-automatic_14.err Normal file
View File

@ -0,0 +1,18 @@
# configuration: {'id': 'gc-ta7-tt1', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=7', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
# instance: {'ipc': 'ipc-2002', 'domain': 'driverlog-strips-automatic', 'instance': 14}
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/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', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=7', '--test-times=1']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
requires(feature(actionCosts))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
requires(feature(axiomRules))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
requires(feature(conditionalEffects))
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /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 && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -B 0.9 --test-until-not-sat --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_actions_t.lp --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
FINISHED CPU 5.57 MEM 33472 MAXMEM 120788 STALE 1 MAXMEM_RSS 63196
<time name="ALL">5510</time>

260
gc-ta7-tt1/ipc-2002_driverlog-strips-automatic_14.out Normal file
View File

@ -0,0 +1,260 @@
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.023s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.018s wall-clock]
Preparing model... [0.020s CPU, 0.019s wall-clock]
Generated 35 rules.
Computing model... [0.190s CPU, 0.189s wall-clock]
1580 relevant atoms
947 auxiliary atoms
2527 final queue length
3598 total queue pushes
Completing instantiation... [0.230s CPU, 0.228s wall-clock]
Instantiating: [0.460s CPU, 0.466s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.030s CPU, 0.025s 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.004s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.060s CPU, 0.060s 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.010s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.013s wall-clock]
Translating task: [0.250s CPU, 0.249s 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.140s CPU, 0.137s 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.035s 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: 39628 KB
Writing output... [0.100s CPU, 0.111s wall-clock]
Done! [1.080s CPU, 1.099s wall-clock]
planner.py version 0.0.1
Time: 0.19s
Memory: 61MB
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: 61MB (+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.06s
Memory: 61MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 63MB (+2MB)
UNSAT
Iteration Time: 0.09s
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.06s
Memory: 68MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 70MB (+2MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 77MB (+7MB)
Solving...
Solving Time: 0.00s
Memory: 70MB (+-7MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.02s
Memory: 70MB (+-8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.16s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.01s
Memory: 70MB (+-8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.00s
Memory: 70MB (+-8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.02s
Memory: 70MB (+-8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.16s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.01s
Memory: 78MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 74MB (+-4MB)
Solving...
Solving Time: 0.01s
Memory: 71MB (+-3MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+7MB)
Solving...
Solving Time: 0.04s
Memory: 70MB (+-8MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+8MB)
Solving...
Solving Time: 0.00s
Memory: 78MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 78MB (+0MB)
Solving...
Solving Time: 0.03s
Memory: 78MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 79MB (+1MB)
Solving...
Solving Time: 0.03s
Memory: 79MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 79MB (+0MB)
Solving...
Solving Time: 0.02s
Memory: 79MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 79MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 79MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.15s
Memory: 79MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 79MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.15s
Memory: 79MB (+0MB)
Answer: 15
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","p9-4")),1) occurs(action(("walk","driver3","p1-2","s1")),2) occurs(action(("drive-truck","truck1","s2","s0","driver2")),2) occurs(action(("walk","driver1","p9-4","s4")),2) occurs(action(("board-truck","driver3","truck2","s1")),3) occurs(action(("drive-truck","truck1","s0","s8","driver2")),3) occurs(action(("walk","driver1","s4","p4-6")),3) occurs(action(("drive-truck","truck2","s1","s3","driver3")),4) occurs(action(("walk","driver1","p4-6","s6")),4) occurs(action(("disembark-truck","driver2","truck1","s8")),4) occurs(action(("unload-truck","package5","truck2","s3")),5) occurs(action(("load-truck","package4","truck2","s3")),5) occurs(action(("board-truck","driver2","truck3","s8")),5) occurs(action(("drive-truck","truck2","s3","s9","driver3")),5) occurs(action(("walk","driver1","s6","p6-8")),5) occurs(action(("load-truck","package3","truck2","s9")),6) occurs(action(("drive-truck","truck2","s9","s4","driver3")),6) occurs(action(("drive-truck","truck3","s8","s9","driver2")),6) occurs(action(("walk","driver1","p6-8","s8")),6) occurs(action(("unload-truck","package3","truck2","s4")),7) occurs(action(("unload-truck","package4","truck2","s4")),7) occurs(action(("drive-truck","truck3","s9","s3","driver2")),7) occurs(action(("load-truck","package6","truck2","s4")),7) occurs(action(("drive-truck","truck2","s4","s5","driver3")),7) occurs(action(("board-truck","driver1","truck1","s8")),7) occurs(action(("unload-truck","package6","truck2","s5")),8) occurs(action(("drive-truck","truck1","s8","s6","driver1")),8) occurs(action(("load-truck","package1","truck2","s5")),8) occurs(action(("load-truck","package2","truck2","s5")),8) occurs(action(("drive-truck","truck2","s5","s0","driver3")),8) occurs(action(("disembark-truck","driver2","truck3","s3")),8) occurs(action(("unload-truck","package1","truck2","s0")),9) occurs(action(("unload-truck","package2","truck2","s0")),9) occurs(action(("disembark-truck","driver1","truck1","s6")),9) occurs(action(("drive-truck","truck2","s0","s1","driver3")),9) occurs(action(("disembark-truck","driver3","truck2","s1")),10) occurs(action(("board-truck","driver2","truck3","s3")),10) occurs(action(("board-truck","driver1","truck1","s6")),10)
SATISFIABLE
Models : 1+
Calls : 17
Time : 0.693s (Solving: 0.19s 1st Model: 0.18s Unsat: 0.00s)
CPU Time : 0.696s
Choices : 8144 (Domain: 8067)
Conflicts : 1791 (Analyzed: 1791)
Restarts : 17 (Average: 105.35 Last: 68)
Model-Level : 95.0
Problems : 17 (Average Length: 11.12 Splits: 0)
Lemmas : 1791 (Deleted: 0)
Binary : 15 (Ratio: 0.84%)
Ternary : 17 (Ratio: 0.95%)
Conflict : 1791 (Average Length: 149.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 1791 (Average: 3.53 Max: 63 Sum: 6323)
Executed : 1790 (Average: 3.53 Max: 63 Sum: 6322 Ratio: 99.98%)
Bounded : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 0.02%)
Rules : 16898
Atoms : 16756
Bodies : 283 (Original: 282)
Equivalences : 420 (Atom=Atom: 140 Body=Body: 0 Other: 280)
Tight : Yes
Variables : 13935 (Eliminated: 0 Frozen: 1712)
Constraints : 42125 (Binary: 94.1% Ternary: 3.7% Other: 2.2%)
Memory Peak : 79MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 15