Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487066945
details
property
value
status
complete
benchmark
#4.32.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n180.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
NTI-TC20-firstrun
configuration
Default 200
runtime (wallclock)
0.357524 seconds
cpu usage
0.911697
user time
0.861141
system time
0.050556
max virtual memory
113188.0
max residence set size
80104.0
stage attributes
key
value
starexec-result
YES
output
YES Prover = TRS(tech=GUIDED_UNF_TRIPLES, nb_unfoldings=unlimited, unfold_variables=false, max_nb_coefficients=12, max_nb_unfolded_rules=-1, strategy=LEFTMOST_NE) ** 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... ## Round 1: ## DP problem: Dependency pairs = [f^#(_0,c(_1)) -> f^#(_1,_1)] TRS = {f(_0,c(_1)) -> f(_0,s(f(_1,_1))), f(s(_0),s(_1)) -> f(_0,s(c(s(_1))))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the precedence: s > [f], c > [f] and the argument filtering: {f:[0], s:[0], c:[0], f^#:[0, 1]} This DP problem is finite. ## DP problem: Dependency pairs = [f^#(s(_0),s(_1)) -> f^#(_0,s(c(s(_1))))] TRS = {f(_0,c(_1)) -> f(_0,s(f(_1,_1))), f(s(_0),s(_1)) -> f(_0,s(c(s(_1))))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the precedence: f > [f, s, c], s > [f] and the argument filtering: {f:[0], s:[0], c:[0], f^#:[0, 1]} This DP problem is finite. ** END proof description ** Proof stopped at iteration 0 Number of unfolded rules generated by this proof = 0 Number of unfolded rules generated by all the parallel proofs = 121
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard