Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711109
details
property
value
status
complete
benchmark
#4.37.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0469810962677 seconds
cpu usage
0.037425483
max memory
2994176.0
stage attributes
key
value
output-size
2386
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 f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(c(s(x),y)) -> F(c(x,s(y))) G(c(x,s(y))) -> G(c(s(x),y)) -> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) Problem 1: SCC Processor: -> Pairs: F(c(s(x),y)) -> F(c(x,s(y))) G(c(x,s(y))) -> G(c(s(x),y)) -> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(c(x,s(y))) -> G(c(s(x),y)) ->->-> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) ->->Cycle: ->->-> Pairs: F(c(s(x),y)) -> F(c(x,s(y))) ->->-> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: G(c(x,s(y))) -> G(c(s(x),y)) -> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) -> Usable rules: Empty ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [c](X1,X2) = 2.X2 [s](X) = 2.X + 2 [G](X) = 2.X Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: f(c(s(x),y)) -> f(c(x,s(y))) g(c(x,s(y))) -> g(c(s(x),y)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472