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

Add benchmark result [gc-ta7-tt1 | ipc-1998 | mystery-round-1-strips | 27]

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

50
gc-ta7-tt1/ipc-1998_mystery-round-1-strips_27.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-1998/domains/mystery-round-1-strips/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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: mystery-round-1-strips
instance: 27
ipc: ipc-1998
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

33
gc-ta7-tt1/ipc-1998_mystery-round-1-strips_27.err Normal file
View File

@ -0,0 +1,33 @@
# 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-1998', 'domain': 'mystery-round-1-strips', 'instance': 27}
# 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-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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))
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
mutexGroup(G)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
contains(G,X,V)
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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 6.81 MEM 33472 MAXMEM 122168 STALE 1 MAXMEM_RSS 65516
<time name="ALL">6750</time>

247
gc-ta7-tt1/ipc-1998_mystery-round-1-strips_27.out Normal file
View File

@ -0,0 +1,247 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.pddl
Parsing...
Parsing: [0.020s CPU, 0.026s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.036s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 42 rules.
Computing model... [0.200s CPU, 0.200s wall-clock]
1446 relevant atoms
813 auxiliary atoms
2259 final queue length
4448 total queue pushes
Completing instantiation... [0.460s CPU, 0.455s wall-clock]
Instantiating: [0.720s CPU, 0.718s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.030s CPU, 0.029s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
0 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.054s 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.019s wall-clock]
Translating task: [0.330s CPU, 0.334s 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.170s CPU, 0.165s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
0 of 19 mutex groups necessary.
1161 of 1161 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.050s CPU, 0.056s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 152
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 1161
Translator axioms: 0
Translator task size: 6734
Translator peak memory: 40908 KB
Writing output... [0.110s CPU, 0.127s wall-clock]
Done! [1.480s CPU, 1.502s wall-clock]
planner.py version 0.0.1
Time: 0.28s
Memory: 68MB
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: 68MB (+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: 68MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.01s
Memory: 69MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+11MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 80MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 80MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+1MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 81MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.22s
Memory: 81MB (+0MB)
Answer: 15
occurs(action(("overcome","grief","satisfaction","scallion","mars","uranus")),1) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("succumb","grief","satisfaction","guava","mars","uranus")),2) occurs(action(("overcome","boils","love","scallion","mars","uranus")),2) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),2) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),2) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("succumb","boils","love","guava","mars","uranus")),3) occurs(action(("feast","love","guava","wurst","quebec","kentucky")),3) occurs(action(("overcome","abrasion","love","wurst","mars","uranus")),4) occurs(action(("overcome","anxiety","satisfaction","wurst","mars","uranus")),4) occurs(action(("feast","satisfaction","wurst","onion","oregon","bavaria")),4) occurs(action(("feast","love","wurst","guava","kentucky","oregon")),5) occurs(action(("feast","satisfaction","onion","pork","bavaria","goias")),5) occurs(action(("feast","triumph","scallion","popover","guanabara","manitoba")),5)
SATISFIABLE
Models : 1+
Calls : 16
Time : 0.524s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 0.504s
Choices : 848 (Domain: 596)
Conflicts : 15 (Analyzed: 15)
Restarts : 0
Model-Level : 54.7
Problems : 16 (Average Length: 6.69 Splits: 0)
Lemmas : 15 (Deleted: 0)
Binary : 1 (Ratio: 6.67%)
Ternary : 2 (Ratio: 13.33%)
Conflict : 15 (Average Length: 80.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 15 (Average: 8.80 Max: 21 Sum: 132)
Executed : 15 (Average: 8.80 Max: 21 Sum: 132 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 21136
Atoms : 21061
Bodies : 146 (Original: 145)
Equivalences : 210 (Atom=Atom: 70 Body=Body: 0 Other: 140)
Tight : Yes
Variables : 6097 (Eliminated: 0 Frozen: 512)
Constraints : 21620 (Binary: 96.0% Ternary: 1.8% Other: 2.2%)
Memory Peak : 81MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 15