Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487066634
details
property
value
status
complete
benchmark
ex5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n175.star.cs.uiowa.edu
space
AProVE_10
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.023528 seconds
cpu usage
0.017763
user time
0.004315
system time
0.013448
max virtual memory
0.0
max residence set size
4228.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: G(s(x:S)) -> F(g(x:S)) G(s(x:S)) -> G(x:S) -> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) Problem 1: SCC Processor: -> Pairs: G(s(x:S)) -> F(g(x:S)) G(s(x:S)) -> G(x:S) -> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(s(x:S)) -> G(x:S) ->->-> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) Problem 1: Subterm Processor: -> Pairs: G(s(x:S)) -> G(x:S) -> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) ->Projection: pi(G) = 1 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: f(0) -> 0 g(0) -> 0 g(s(x:S)) -> f(g(x:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard