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

Add benchmark result [gc-ta1-tt1 | ipc-2000 | blocks-strips-typed | 16]

Browse Source
This commit is contained in:
Potassco Bot
2017-11-28 05:11:01 +01:00
parent 0167f09b8f
commit d4912327c9
3 changed files with 268 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

51
gc-ta1-tt1/ipc-2000_blocks-strips-typed_16.env Normal file
View File

@@ -0,0 +1,51 @@
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-2000/domains/blocks-strips-typed/domain.pddl
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-16.pddl
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
configuration:
id: gc-ta1-tt1
instanceSets:
- lpnmr-first-plan-not-serializable
- rintanen-aij-2012
options:
- --stats
- --verbose
- --print-call
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
exitCode: 0
instance:
domain: blocks-strips-typed
instance: 16
ipc: ipc-2000
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-ta1-tt1/ipc-2000_blocks-strips-typed_16.err Normal file
View File

@@ -0,0 +1,18 @@
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 16}
# 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-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-16.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-16.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_forall_t.lp --test-once --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
FINISHED CPU 2.08 MEM 33472 MAXMEM 117708 STALE 1 MAXMEM_RSS 46528
<time name="ALL">2040</time>

199
gc-ta1-tt1/ipc-2000_blocks-strips-typed_16.out Normal file
View File

@@ -0,0 +1,199 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-16.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-16.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.005s wall-clock]
Generated 21 rules.
Computing model... [0.040s CPU, 0.045s wall-clock]
317 relevant atoms
207 auxiliary atoms
524 final queue length
868 total queue pushes
Completing instantiation... [0.060s CPU, 0.061s wall-clock]
Instantiating: [0.120s CPU, 0.126s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.030s CPU, 0.026s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.003s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
10 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.050s CPU, 0.045s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.002s 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.062s wall-clock]
234 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
18 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.034s wall-clock]
Reordering and filtering variables...
19 of 19 variables necessary.
10 of 19 mutex groups necessary.
162 of 162 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.030s CPU, 0.021s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 110
Translator goal facts: 8
Translator mutex groups: 10
Translator total mutex groups size: 100
Translator operators: 162
Translator axioms: 0
Translator task size: 1425
Translator peak memory: 36812 KB
Writing output... [0.020s CPU, 0.028s wall-clock]
Done! [0.330s CPU, 0.341s wall-clock]
planner.py version 0.0.1
Time: 0.05s
Memory: 51MB
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: 52MB (+1MB)
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: 53MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+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: 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
UNSAT
Iteration Time: 0.03s
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: 56MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 57MB (+1MB)
UNSAT
Iteration Time: 0.03s
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.02s
Memory: 58MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 59MB (+1MB)
UNSAT
Iteration Time: 0.03s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.02s
Memory: 60MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 60MB (+0MB)
UNSAT
Iteration Time: 0.03s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.02s
Memory: 61MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 61MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.04s
Memory: 62MB (+1MB)
Answer: 1
occurs(action(("unstack","f","g")),1) occurs(action(("put-down","f")),2) occurs(action(("unstack","g","e")),3) occurs(action(("put-down","g")),4) occurs(action(("unstack","e","a")),5) occurs(action(("put-down","e")),6) occurs(action(("unstack","a","i")),7) occurs(action(("put-down","a")),8) occurs(action(("unstack","i","d")),9) occurs(action(("put-down","i")),10) occurs(action(("unstack","d","h")),11) occurs(action(("put-down","d")),12) occurs(action(("unstack","h","b")),13) occurs(action(("put-down","h")),14) occurs(action(("pick-up","e")),15) occurs(action(("stack","e","h")),16) occurs(action(("pick-up","f")),17) occurs(action(("stack","f","e")),18) occurs(action(("pick-up","i")),19) occurs(action(("stack","i","f")),20) occurs(action(("pick-up","a")),21) occurs(action(("stack","a","i")),22) occurs(action(("pick-up","c")),23) occurs(action(("stack","c","a")),24) occurs(action(("pick-up","b")),25) occurs(action(("stack","b","c")),26) occurs(action(("pick-up","d")),27) occurs(action(("stack","d","b")),28) occurs(action(("pick-up","g")),29) occurs(action(("stack","g","d")),30)
SATISFIABLE
Models : 1+
Calls : 7
Time : 0.247s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.236s
Choices : 175 (Domain: 175)
Conflicts : 33 (Analyzed: 29)
Restarts : 0
Model-Level : 114.0
Problems : 7 (Average Length: 17.00 Splits: 0)
Lemmas : 29 (Deleted: 0)
Binary : 3 (Ratio: 10.34%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 29 (Average Length: 9.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 29 (Average: 22.31 Max: 33 Sum: 647)
Executed : 6 (Average: 3.21 Max: 33 Sum: 93 Ratio: 14.37%)
Bounded : 23 (Average: 24.09 Max: 27 Sum: 554 Ratio: 85.63%)
Rules : 4401
Atoms : 4401
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 9365 (Eliminated: 0 Frozen: 2924)
Constraints : 43352 (Binary: 91.4% Ternary: 5.4% Other: 3.2%)
Memory Peak : 62MB
Max. Length : 30 steps
Sol. Length : 30 steps
Models : 1