Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710112
details
property
value
status
complete
benchmark
tpa2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.129853963852 seconds
cpu usage
0.111921722
max memory
4042752.0
stage attributes
key
value
output-size
4685
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 Problem 1: (VAR x y) (RULES -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> 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),y) -> -#(s(x),y) F(s(x),y) -> -#(y,s(x)) F(s(x),y) -> F(p(-(s(x),y)),p(-(y,s(x)))) F(s(x),y) -> P(-(s(x),y)) F(s(x),y) -> P(-(y,s(x))) F(x,s(y)) -> -#(s(y),x) F(x,s(y)) -> -#(x,s(y)) F(x,s(y)) -> F(p(-(x,s(y))),p(-(s(y),x))) F(x,s(y)) -> P(-(s(y),x)) F(x,s(y)) -> P(-(x,s(y))) -> Rules: -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: -#(s(x),s(y)) -> -#(x,y) F(s(x),y) -> -#(s(x),y) F(s(x),y) -> -#(y,s(x)) F(s(x),y) -> F(p(-(s(x),y)),p(-(y,s(x)))) F(s(x),y) -> P(-(s(x),y)) F(s(x),y) -> P(-(y,s(x))) F(x,s(y)) -> -#(s(y),x) F(x,s(y)) -> -#(x,s(y)) F(x,s(y)) -> F(p(-(x,s(y))),p(-(s(y),x))) F(x,s(y)) -> P(-(s(y),x)) F(x,s(y)) -> P(-(x,s(y))) -> Rules: -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: -#(s(x),s(y)) -> -#(x,y) ->->-> Rules: -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> x ->->Cycle: ->->-> Pairs: F(s(x),y) -> F(p(-(s(x),y)),p(-(y,s(x)))) F(x,s(y)) -> F(p(-(x,s(y))),p(-(s(y),x))) ->->-> Rules: -(s(x),s(y)) -> -(x,y) -(x,0) -> x f(s(x),y) -> f(p(-(s(x),y)),p(-(y,s(x)))) f(x,s(y)) -> f(p(-(x,s(y))),p(-(s(y),x))) p(s(x)) -> x The problem is decomposed in 2 subproblems. Problem 1.1:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472