Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711102
details
property
value
status
complete
benchmark
t013.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
HirokawaMiddeldorp_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0589821338654 seconds
cpu usage
0.058873444
max memory
4009984.0
stage attributes
key
value
output-size
5216
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 Problem 1: (VAR x y) (RULES -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x))) ) Problem 1: Innermost Equivalent Processor: -> Rules: -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: -#(s(x),s(y)) -> -#(x,y) F(s(x)) -> -#(s(x),g(f(x))) F(s(x)) -> F(x) F(s(x)) -> G(f(x)) G(s(x)) -> -#(s(x),f(g(x))) G(s(x)) -> F(g(x)) G(s(x)) -> G(x) -> Rules: -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x))) Problem 1: SCC Processor: -> Pairs: -#(s(x),s(y)) -> -#(x,y) F(s(x)) -> -#(s(x),g(f(x))) F(s(x)) -> F(x) F(s(x)) -> G(f(x)) G(s(x)) -> -#(s(x),f(g(x))) G(s(x)) -> F(g(x)) G(s(x)) -> G(x) -> Rules: -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: -#(s(x),s(y)) -> -#(x,y) ->->-> Rules: -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x))) ->->Cycle: ->->-> Pairs: F(s(x)) -> F(x) F(s(x)) -> G(f(x)) G(s(x)) -> F(g(x)) G(s(x)) -> G(x) ->->-> Rules: -(0,s(y)) -> 0 -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(0) -> 0 f(s(x)) -> -(s(x),g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x),f(g(x)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472