Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967232
details
property
value
status
complete
benchmark
#3.15.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
AG01
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.267055034637 seconds
cpu usage
0.319428377
max memory
3.4435072E7
stage attributes
key
value
output-size
2186
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... ## 1 initial DP problem to solve. ## First, we try to decompose this problem into smaller problems. ## Round 1 [1 DP problem]: ## DP problem: Dependency pairs = [average^#(s(_0),_1) -> average^#(_0,s(_1)), average^#(_0,s(s(s(_1)))) -> average^#(s(_0),_1)] TRS = {average(s(_0),_1) -> average(_0,s(_1)), average(_0,s(s(s(_1)))) -> s(average(s(_0),_1)), average(0,0) -> 0, average(0,s(0)) -> 0, average(0,s(s(0))) -> s(0)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Successfully decomposed the DP problem into 1 smaller problem to solve! ## Round 2 [1 DP problem]: ## DP problem: Dependency pairs = [average^#(s(_0),_1) -> average^#(_0,s(_1))] TRS = {average(s(_0),_1) -> average(_0,s(_1)), average(_0,s(s(s(_1)))) -> s(average(s(_0),_1)), average(0,0) -> 0, average(0,s(0)) -> 0, average(0,s(s(0))) -> s(0)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... The constraints are satisfied by the polynomials: {0:[0], s(_0):[1 + _0], average(_0,_1):[_0 + _1], average^#(_0,_1):[_0]} for all instantiations of the variables with values greater than or equal to mu = 0. 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