Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711599
details
property
value
status
complete
benchmark
nestrec.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0378680229187 seconds
cpu usage
0.028836683
max memory
3231744.0
stage attributes
key
value
output-size
1919
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) (RULES f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(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: F(g(X)) -> F(f(X)) F(g(X)) -> F(X) -> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) Problem 1: SCC Processor: -> Pairs: F(g(X)) -> F(f(X)) F(g(X)) -> F(X) -> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(X)) -> F(f(X)) F(g(X)) -> F(X) ->->-> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) Problem 1: Reduction Pairs Processor: -> Pairs: F(g(X)) -> F(f(X)) F(g(X)) -> F(X) -> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) -> Usable rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = X [g](X) = 2.X + 2 [h](X) = 2 [F](X) = 2.X Problem 1: SCC Processor: -> Pairs: F(g(X)) -> F(X) -> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(X)) -> F(X) ->->-> Rules: f(g(X)) -> g(f(f(X))) f(h(X)) -> h(g(X)) Problem 1: Subterm Processor: -> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472