Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516961532
details
property
value
status
complete
benchmark
PALINDROME_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n183.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
4.40189385414 seconds
cpu usage
4.740012998
max memory
1.4544896E8
stage attributes
key
value
output-size
2211
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 = [__^#(__(_0,_1),_2) -> __^#(_0,__(_1,_2)), __^#(__(_0,_1),_2) -> __^#(_1,_2)] TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, and(tt,_0) -> activate(_0), isNePal(__(_0,__(_1,_0))) -> tt, activate(_0) -> _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 = [__^#(__(_0,_1),_2) -> __^#(_0,__(_1,_2))] TRS = {__(__(_0,_1),_2) -> __(_0,__(_1,_2)), __(_0,nil) -> _0, __(nil,_0) -> _0, and(tt,_0) -> activate(_0), isNePal(__(_0,__(_1,_0))) -> tt, activate(_0) -> _0} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... The constraints are satisfied by the polynomials: {activate(_0):[_0], and(_0,_1):[_0 * _1], isNePal(_0):[_0], tt:[1], nil:[1], __(_0,_1):[2 * _0 * _1], __^#(_0,_1):[_0]} for all instantiations of the variables with values greater than or equal to mu = 1. 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