Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516962377
details
property
value
status
complete
benchmark
ExSec11_1_Luc02a_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n045.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.237077951431 seconds
cpu usage
0.195461099
max memory
3.653632E7
stage attributes
key
value
output-size
2987
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ** BEGIN proof argument ** All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. ** END proof argument ** ** BEGIN proof description ** ## Searching for a generalized rewrite rule (a rule whose right-hand side contains a variable that does not occur in the left-hand side)... No generalized rewrite rule found! ## Applying the DP framework... ## 4 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [4 DP problems]: ## DP problem: Dependency pairs = [half^#(s(s(_0))) -> half^#(_0)] TRS = {terms(_0) -> cons(recip(sqr(_0))), sqr(0) -> 0, sqr(s(_0)) -> s(add(sqr(_0),dbl(_0))), dbl(0) -> 0, dbl(s(_0)) -> s(s(dbl(_0))), add(0,_0) -> _0, add(s(_0),_1) -> s(add(_0,_1)), first(0,_0) -> nil, first(s(_0),cons(_1)) -> cons(_1), half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), half(dbl(_0)) -> _0} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [sqr^#(s(_0)) -> sqr^#(_0)] TRS = {terms(_0) -> cons(recip(sqr(_0))), sqr(0) -> 0, sqr(s(_0)) -> s(add(sqr(_0),dbl(_0))), dbl(0) -> 0, dbl(s(_0)) -> s(s(dbl(_0))), add(0,_0) -> _0, add(s(_0),_1) -> s(add(_0,_1)), first(0,_0) -> nil, first(s(_0),cons(_1)) -> cons(_1), half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), half(dbl(_0)) -> _0} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [dbl^#(s(_0)) -> dbl^#(_0)] TRS = {terms(_0) -> cons(recip(sqr(_0))), sqr(0) -> 0, sqr(s(_0)) -> s(add(sqr(_0),dbl(_0))), dbl(0) -> 0, dbl(s(_0)) -> s(s(dbl(_0))), add(0,_0) -> _0, add(s(_0),_1) -> s(add(_0,_1)), first(0,_0) -> nil, first(s(_0),cons(_1)) -> cons(_1), half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), half(dbl(_0)) -> _0} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [add^#(s(_0),_1) -> add^#(_0,_1)] TRS = {terms(_0) -> cons(recip(sqr(_0))), sqr(0) -> 0, sqr(s(_0)) -> s(add(sqr(_0),dbl(_0))), dbl(0) -> 0, dbl(s(_0)) -> s(s(dbl(_0))), add(0,_0) -> _0, add(s(_0),_1) -> s(add(_0,_1)), first(0,_0) -> nil, first(s(_0),cons(_1)) -> cons(_1), half(0) -> 0, half(s(0)) -> 0, half(s(s(_0))) -> s(half(_0)), half(dbl(_0)) -> _0} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64 using Java version 1.8.0_292 ** END proof description ** Total number of generated unfolded rules = 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard