Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711140
details
property
value
status
complete
benchmark
secret2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.67838406563 seconds
cpu usage
3.73215931
max memory
2.25447936E8
stage attributes
key
value
output-size
2170
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 134 ms] (2) QTRS (3) RisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(h, h, h, x) -> s(x) a(l, x, s(y), h) -> a(l, x, y, s(h)) a(l, x, s(y), s(z)) -> a(l, x, y, a(l, x, s(y), z)) a(l, s(x), h, z) -> a(l, x, z, z) a(s(l), h, h, z) -> a(l, z, h, z) +(x, h) -> x +(h, x) -> x +(s(x), s(y)) -> s(s(+(x, y))) +(+(x, y), z) -> +(x, +(y, z)) s(h) -> 1 *(h, x) -> h *(x, h) -> h *(s(x), s(y)) -> s(+(+(*(x, y), x), y)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Quasi precedence: a_4 > [h, 1] > s_1 *_2 > [h, 1] > s_1 *_2 > +_2 > s_1 Status: a_4: [1,2,3,4] h: multiset status s_1: multiset status +_2: [1,2] 1: multiset status *_2: [2,1] With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: a(h, h, h, x) -> s(x) a(l, x, s(y), h) -> a(l, x, y, s(h)) a(l, x, s(y), s(z)) -> a(l, x, y, a(l, x, s(y), z)) a(l, s(x), h, z) -> a(l, x, z, z) a(s(l), h, h, z) -> a(l, z, h, z) +(x, h) -> x +(h, x) -> x +(s(x), s(y)) -> s(s(+(x, y))) +(+(x, y), z) -> +(x, +(y, z)) s(h) -> 1 *(h, x) -> h *(x, h) -> h *(s(x), s(y)) -> s(+(+(*(x, y), x), y)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: R is empty. Q is empty. ---------------------------------------- (3) RisEmptyProof (EQUIVALENT) The TRS R is empty. Hence, termination is trivially proven. ---------------------------------------- (4) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472