Add benchmark result [gc-ta1-tt1-single-shot | ipc-2000 | blocks-strips-typed | 26]

This commit is contained in:
Potassco Bot 2018-02-14 18:59:31 +01:00
parent 4a34064b46
commit 7d6eb1c44b
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 229 additions and 0 deletions

View File

@ -0,0 +1,60 @@
command:
- timeout
- -m=9216000
- -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-26.pddl
- --stats
- --stats-iter
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
- -i 0
- -F 40
- -T 40
configuration:
fixedHorizon: true
id: gc-ta1-tt1-single-shot
instanceSets:
- rintanen-aij-2012-interesting
options:
- --stats
- --stats-iter
- --verbose
- --print-call
- -m 8192
- --translate
- -B 0.9
- --parallel=0
- --shallow
- --use-heuristic
- --test-until-not-sat
- --test=0
- --test-add=1
- --test-times=1
- -i 0
exitCode: 0
instance:
domain: blocks-strips-typed
instance: 26
ipc: ipc-2000
planLength: 40
versions:
clingo: 5.2.2
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
planner: f090434475c02dbccc3811039498f2a63a357ddc (2018-02-01 18:15:39 +0100)
plasp: 3.1.1
python: 3.6.3
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner

View File

@ -0,0 +1,9 @@
# configuration: {'id': 'gc-ta1-tt1-single-shot', 'options': ['--stats', '--stats-iter', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1', '-i 0'], 'instanceSets': ['rintanen-aij-2012-interesting'], 'fixedHorizon': True}
# instance: {'ipc': 'ipc-2000', 'domain': 'blocks-strips-typed', 'instance': 26, 'planLength': 40}
# command: ['timeout', '-m=9216000', '-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-26.pddl', '--stats', '--stats-iter', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1', '-i 0', '-F 40', '-T 40']
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
# exit code: 0
# 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-26.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 --stats-iter --verbose -m 8192 -B 0.9 --test-until-not-sat -i 0 -F 40 -T 40 --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.77 MEM 33472 MAXMEM 206564 STALE 0 MAXMEM_RSS 76500
<time name="ALL">2710</time>

View File

@ -0,0 +1,160 @@
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-26.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-26.pddl
Parsing...
Parsing: [0.000s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.008s wall-clock]
Preparing model... [0.000s CPU, 0.005s wall-clock]
Generated 21 rules.
Computing model... [0.060s CPU, 0.060s wall-clock]
530 relevant atoms
348 auxiliary atoms
878 final queue length
1480 total queue pushes
Completing instantiation... [0.100s CPU, 0.100s wall-clock]
Instantiating: [0.180s CPU, 0.176s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.021s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.010s CPU, 0.005s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
13 uncovered facts
Choosing groups: [0.010s CPU, 0.007s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.050s CPU, 0.051s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.004s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.005s wall-clock]
Translating task: [0.120s CPU, 0.114s wall-clock]
420 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
24 propositions removed
Detecting unreachable propositions: [0.060s CPU, 0.063s wall-clock]
Reordering and filtering variables...
25 of 25 variables necessary.
13 of 25 mutex groups necessary.
288 of 288 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.035s wall-clock]
Translator variables: 25
Translator derived variables: 0
Translator facts: 182
Translator goal facts: 11
Translator mutex groups: 13
Translator total mutex groups size: 169
Translator operators: 288
Translator axioms: 0
Translator task size: 2511
Translator peak memory: 37580 KB
Writing output... [0.040s CPU, 0.046s wall-clock]
Done! [0.500s CPU, 0.511s wall-clock]
planner.py version 0.0.1
Time: 0.09s
Memory: 54MB
Iteration 1
Queue: [(0,40,0,True)]
Grounded Until: 0
Expected Memory: 54MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
Grounding Time: 0.28s
Memory: 85MB (+31MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 0.556s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 0.540s
Choices : 2946 (Domain: 2946)
Conflicts : 83 (Analyzed: 83)
Restarts : 1 (Average: 83.00 Last: 16)
Model-Level : 84.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 83 (Deleted: 0)
Binary : 2 (Ratio: 2.41%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 83 (Average Length: 98.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 83 (Average: 38.53 Max: 195 Sum: 3198)
Executed : 75 (Average: 34.99 Max: 195 Sum: 2904 Ratio: 90.81%)
Bounded : 8 (Average: 36.75 Max: 42 Sum: 294 Ratio: 9.19%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 21060 (Eliminated: 0 Frozen: 6644)
Constraints : 123507 (Binary: 92.8% Ternary: 5.0% Other: 2.2%)
Memory Peak : 228MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.05s
Memory: 164MB (+79MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.09s
Memory: 164MB (+0MB)
Answer: 1
occurs(action(("unstack","k","d")),1) occurs(action(("put-down","k")),2) occurs(action(("pick-up","d")),3) occurs(action(("stack","d","k")),4) occurs(action(("unstack","c","g")),5) occurs(action(("put-down","c")),6) occurs(action(("unstack","d","k")),7) occurs(action(("put-down","d")),8) occurs(action(("pick-up","k")),9) occurs(action(("put-down","k")),10) occurs(action(("unstack","g","h")),11) occurs(action(("stack","g","c")),12) occurs(action(("unstack","h","i")),13) occurs(action(("put-down","h")),14) occurs(action(("unstack","i","f")),15) occurs(action(("stack","i","d")),16) occurs(action(("unstack","f","b")),17) occurs(action(("put-down","f")),18) occurs(action(("unstack","b","a")),19) occurs(action(("stack","b","i")),20) occurs(action(("unstack","g","c")),21) occurs(action(("stack","g","b")),22) occurs(action(("unstack","a","l")),23) occurs(action(("stack","a","h")),24) occurs(action(("unstack","l","e")),25) occurs(action(("stack","l","g")),26) occurs(action(("pick-up","f")),27) occurs(action(("stack","f","l")),28) occurs(action(("unstack","a","h")),29) occurs(action(("stack","a","f")),30) occurs(action(("pick-up","h")),31) occurs(action(("stack","h","a")),32) occurs(action(("pick-up","k")),33) occurs(action(("stack","k","h")),34) occurs(action(("unstack","e","j")),35) occurs(action(("stack","e","k")),36) occurs(action(("pick-up","c")),37) occurs(action(("stack","c","e")),38) occurs(action(("pick-up","j")),39) occurs(action(("stack","j","c")),40)
SATISFIABLE
Models : 1+
Calls : 1
Time : 0.556s (Solving: 0.04s 1st Model: 0.03s Unsat: 0.00s)
CPU Time : 0.540s
Choices : 2946 (Domain: 2946)
Conflicts : 83 (Analyzed: 83)
Restarts : 1 (Average: 83.00 Last: 16)
Model-Level : 84.0
Problems : 1 (Average Length: 42.00 Splits: 0)
Lemmas : 83 (Deleted: 0)
Binary : 2 (Ratio: 2.41%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 83 (Average Length: 98.6 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 83 (Average: 38.53 Max: 195 Sum: 3198)
Executed : 75 (Average: 34.99 Max: 195 Sum: 2904 Ratio: 90.81%)
Bounded : 8 (Average: 36.75 Max: 42 Sum: 294 Ratio: 9.19%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 21060 (Eliminated: 0 Frozen: 6644)
Constraints : 123507 (Binary: 92.8% Ternary: 5.0% Other: 2.2%)
Memory Peak : 228MB
Max. Length : 40 steps
Sol. Length : 40 steps
Models : 1