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

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

This commit is contained in:
Potassco Bot 2018-02-15 14:08:27 +01:00
parent 165b05e1f3
commit d287ad8a0b
Signed by: potassco-bot
GPG Key ID: 1F54208CE70DDF73
3 changed files with 229 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

60
gc-ta1-tt1-single-shot/ipc-2000_blocks-strips-typed_64.env Normal file
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-64.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 110
- -T 110
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: 64
ipc: ipc-2000
planLength: 110
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

9
gc-ta1-tt1-single-shot/ipc-2000_blocks-strips-typed_64.err Normal file
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': 64, 'planLength': 110}
# 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-64.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 110', '-T 110']
# 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-64.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 110 -T 110 --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 16.58 MEM 33472 MAXMEM 891820 STALE 1 MAXMEM_RSS 761756
<time name="ALL">16500</time>

160
gc-ta1-tt1-single-shot/ipc-2000_blocks-strips-typed_64.out Normal file
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-64.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-64.pddl
Parsing...
Parsing: [0.020s CPU, 0.019s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.013s wall-clock]
Generated 21 rules.
Computing model... [0.390s CPU, 0.383s wall-clock]
3133 relevant atoms
2077 auxiliary atoms
5210 final queue length
9121 total queue pushes
Completing instantiation... [0.630s CPU, 0.633s wall-clock]
Instantiating: [1.050s CPU, 1.052s wall-clock]
Computing fact groups...
Finding invariants...
10 initial candidates
Finding invariants: [0.020s CPU, 0.023s wall-clock]
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
Instantiating groups... [0.040s CPU, 0.039s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.008s wall-clock]
Choosing groups...
32 uncovered facts
Choosing groups: [0.070s CPU, 0.071s wall-clock]
Building translation key... [0.020s CPU, 0.013s wall-clock]
Computing fact groups: [0.250s CPU, 0.248s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
Building dictionary for full mutex groups... [0.020s CPU, 0.014s wall-clock]
Building mutex information...
Building mutex information: [0.020s CPU, 0.023s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.032s wall-clock]
Translating task: [0.750s CPU, 0.755s wall-clock]
2852 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
62 propositions removed
Detecting unreachable propositions: [0.410s CPU, 0.416s wall-clock]
Reordering and filtering variables...
63 of 63 variables necessary.
32 of 63 mutex groups necessary.
1922 of 1922 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.230s CPU, 0.233s wall-clock]
Translator variables: 63
Translator derived variables: 0
Translator facts: 1056
Translator goal facts: 30
Translator mutex groups: 32
Translator total mutex groups size: 1024
Translator operators: 1922
Translator axioms: 0
Translator task size: 16495
Translator peak memory: 46284 KB
Writing output... [0.280s CPU, 0.295s wall-clock]
Done! [3.080s CPU, 3.097s wall-clock]
planner.py version 0.0.1
Time: 0.55s
Memory: 84MB
Iteration 1
Queue: [(0,110,0,True)]
Grounded Until: 0
Expected Memory: 84MB
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]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('step', [81]), ('step', [82]), ('step', [83]), ('step', [84]), ('step', [85]), ('step', [86]), ('step', [87]), ('step', [88]), ('step', [89]), ('step', [90]), ('step', [91]), ('step', [92]), ('step', [93]), ('step', [94]), ('step', [95]), ('step', [96]), ('step', [97]), ('step', [98]), ('step', [99]), ('step', [100]), ('step', [101]), ('step', [102]), ('step', [103]), ('step', [104]), ('step', [105]), ('step', [106]), ('step', [107]), ('step', [108]), ('step', [109]), ('step', [110]), ('check', [110])]
Grounding Time: 6.66s
Memory: 642MB (+558MB)
Unblocking actions...
Solving...
[start: stats after solve call]
Models : 1+
Calls : 1
Time : 10.727s (Solving: 0.42s 1st Model: 0.40s Unsat: 0.00s)
CPU Time : 10.656s
Choices : 9614 (Domain: 9614)
Conflicts : 117 (Analyzed: 117)
Restarts : 1 (Average: 117.00 Last: 57)
Model-Level : 3019.0
Problems : 1 (Average Length: 112.00 Splits: 0)
Lemmas : 117 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 117 (Average Length: 13.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 117 (Average: 120.50 Max: 284 Sum: 14099)
Executed : 51 (Average: 57.32 Max: 284 Sum: 6707 Ratio: 47.57%)
Bounded : 66 (Average: 112.00 Max: 112 Sum: 7392 Ratio: 52.43%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 343123 (Eliminated: 0 Frozen: 111937)
Constraints : 2400456 (Binary: 94.8% Ternary: 4.4% Other: 0.8%)
Memory Peak : 897MB
Max. Length : 0 steps
Models : 1
[endof: stats after solve call]
Solving Time: 0.68s
Memory: 833MB (+191MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.62s
Memory: 833MB (+0MB)
Answer: 1
occurs(action(("unstack","p","c")),1) occurs(action(("put-down","p")),2) occurs(action(("unstack","c","a")),3) occurs(action(("put-down","c")),4) occurs(action(("unstack","a","v")),5) occurs(action(("stack","a","c")),6) occurs(action(("unstack","v","e")),7) occurs(action(("put-down","v")),8) occurs(action(("unstack","e","a1")),9) occurs(action(("put-down","e")),10) occurs(action(("unstack","a1","o")),11) occurs(action(("put-down","a1")),12) occurs(action(("unstack","o","g")),13) occurs(action(("stack","o","r")),14) occurs(action(("unstack","g","d")),15) occurs(action(("put-down","g")),16) occurs(action(("unstack","d","b")),17) occurs(action(("put-down","d")),18) occurs(action(("unstack","b","m")),19) occurs(action(("put-down","b")),20) occurs(action(("unstack","m","l")),21) occurs(action(("stack","m","a1")),22) occurs(action(("unstack","l","y")),23) occurs(action(("put-down","l")),24) occurs(action(("unstack","n","j")),25) occurs(action(("put-down","n")),26) occurs(action(("unstack","j","s")),27) occurs(action(("put-down","j")),28) occurs(action(("pick-up","s")),29) occurs(action(("stack","s","l")),30) occurs(action(("unstack","y","d1")),31) occurs(action(("stack","y","e")),32) occurs(action(("unstack","d1","c1")),33) occurs(action(("put-down","d1")),34) occurs(action(("unstack","c1","e1")),35) occurs(action(("put-down","c1")),36) occurs(action(("unstack","e1","x")),37) occurs(action(("put-down","e1")),38) occurs(action(("unstack","x","q")),39) occurs(action(("stack","x","j")),40) occurs(action(("unstack","q","b1")),41) occurs(action(("stack","q","g")),42) occurs(action(("unstack","b1","h")),43) occurs(action(("stack","b1","m")),44) occurs(action(("pick-up","h")),45) occurs(action(("stack","h","s")),46) occurs(action(("unstack","a","c")),47) occurs(action(("stack","a","h")),48) occurs(action(("pick-up","v")),49) occurs(action(("stack","v","a")),50) occurs(action(("unstack","o","r")),51) occurs(action(("stack","o","v")),52) occurs(action(("unstack","z","w")),53) occurs(action(("stack","z","c")),54) occurs(action(("unstack","w","t")),55) occurs(action(("stack","w","x")),56) occurs(action(("unstack","t","i")),57) occurs(action(("stack","t","c1")),58) occurs(action(("pick-up","i")),59) occurs(action(("stack","i","o")),60) occurs(action(("unstack","y","e")),61) occurs(action(("stack","y","i")),62) occurs(action(("unstack","k","u")),63) occurs(action(("stack","k","n")),64) occurs(action(("pick-up","u")),65) occurs(action(("stack","u","y")),66) occurs(action(("pick-up","b")),67) occurs(action(("stack","b","u")),68) occurs(action(("unstack","z","c")),69) occurs(action(("stack","z","b")),70) occurs(action(("pick-up","d1")),71) occurs(action(("stack","d1","z")),72) occurs(action(("unstack","k","n")),73) occurs(action(("stack","k","d1")),74) occurs(action(("pick-up","p")),75) occurs(action(("stack","p","k")),76) occurs(action(("unstack","w","x")),77) occurs(action(("stack","w","p")),78) occurs(action(("unstack","x","j")),79) occurs(action(("stack","x","w")),80) occurs(action(("unstack","b1","m")),81) occurs(action(("stack","b1","x")),82) occurs(action(("pick-up","d")),83) occurs(action(("stack","d","b1")),84) occurs(action(("pick-up","e")),85) occurs(action(("stack","e","d")),86) occurs(action(("unstack","q","g")),87) occurs(action(("stack","q","e")),88) occurs(action(("unstack","m","a1")),89) occurs(action(("stack","m","q")),90) occurs(action(("unstack","t","c1")),91) occurs(action(("stack","t","m")),92) occurs(action(("pick-up","c")),93) occurs(action(("stack","c","t")),94) occurs(action(("pick-up","e1")),95) occurs(action(("stack","e1","c")),96) occurs(action(("pick-up","a1")),97) occurs(action(("stack","a1","e1")),98) occurs(action(("unstack","r","f")),99) occurs(action(("stack","r","a1")),100) occurs(action(("pick-up","f")),101) occurs(action(("stack","f","r")),102) occurs(action(("pick-up","n")),103) occurs(action(("stack","n","f")),104) occurs(action(("pick-up","c1")),105) occurs(action(("stack","c1","n")),106) occurs(action(("pick-up","g")),107) occurs(action(("stack","g","c1")),108) occurs(action(("pick-up","j")),109) occurs(action(("stack","j","g")),110)
SATISFIABLE
Models : 1+
Calls : 1
Time : 10.727s (Solving: 0.42s 1st Model: 0.40s Unsat: 0.00s)
CPU Time : 10.656s
Choices : 9614 (Domain: 9614)
Conflicts : 117 (Analyzed: 117)
Restarts : 1 (Average: 117.00 Last: 57)
Model-Level : 3019.0
Problems : 1 (Average Length: 112.00 Splits: 0)
Lemmas : 117 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 117 (Average Length: 13.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 117 (Average: 120.50 Max: 284 Sum: 14099)
Executed : 51 (Average: 57.32 Max: 284 Sum: 6707 Ratio: 47.57%)
Bounded : 66 (Average: 112.00 Max: 112 Sum: 7392 Ratio: 52.43%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 343123 (Eliminated: 0 Frozen: 111937)
Constraints : 2400456 (Binary: 94.8% Ternary: 4.4% Other: 0.8%)
Memory Peak : 897MB
Max. Length : 110 steps
Sol. Length : 110 steps
Models : 1