Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516966585
details
property
value
status
complete
benchmark
2.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n028.star.cs.uiowa.edu
space
SK90
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.15235996246 seconds
cpu usage
5.606625512
max memory
4.80374784E8
stage attributes
key
value
output-size
2031
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 112 ms] (2) QTRS (3) RisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: fib(0) -> 0 fib(s(0)) -> s(0) fib(s(s(0))) -> s(0) fib(s(s(x))) -> sp(g(x)) g(0) -> pair(s(0), 0) g(s(0)) -> pair(s(0), s(0)) g(s(x)) -> np(g(x)) sp(pair(x, y)) -> +(x, y) np(pair(x, y)) -> pair(+(x, y), x) +(x, 0) -> x +(x, s(y)) -> s(+(x, y)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Quasi precedence: [fib_1, g_1] > [sp_1, np_1, +_2] > s_1 > [0, pair_2] Status: fib_1: multiset status 0: multiset status s_1: multiset status sp_1: multiset status g_1: multiset status pair_2: multiset status np_1: multiset status +_2: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: fib(0) -> 0 fib(s(0)) -> s(0) fib(s(s(0))) -> s(0) fib(s(s(x))) -> sp(g(x)) g(0) -> pair(s(0), 0) g(s(0)) -> pair(s(0), s(0)) g(s(x)) -> np(g(x)) sp(pair(x, y)) -> +(x, y) np(pair(x, y)) -> pair(+(x, y), x) +(x, 0) -> x +(x, s(y)) -> s(+(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 Standard