Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964656
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
n140.star.cs.uiowa.edu
space
Rubio_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0951900482178 seconds
cpu usage
0.038537302
max memory
3256320.0
stage attributes
key
value
output-size
2083
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 v_NonEmpty:S X:S) (RULES f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) ) Problem 1: Innermost Equivalent Processor: -> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(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: F(g(X:S)) -> F(f(X:S)) F(g(X:S)) -> F(X:S) -> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) Problem 1: SCC Processor: -> Pairs: F(g(X:S)) -> F(f(X:S)) F(g(X:S)) -> F(X:S) -> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(X:S)) -> F(f(X:S)) F(g(X:S)) -> F(X:S) ->->-> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) Problem 1: Reduction Pairs Processor: -> Pairs: F(g(X:S)) -> F(f(X:S)) F(g(X:S)) -> F(X:S) -> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) -> Usable rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = X [fSNonEmpty] = 0 [g](X) = 2.X + 2 [h](X) = 2 [F](X) = 2.X Problem 1: SCC Processor: -> Pairs: F(g(X:S)) -> F(X:S) -> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(g(X:S)) -> F(X:S) ->->-> Rules: f(g(X:S)) -> g(f(f(X:S))) f(h(X:S)) -> h(g(X:S)) Problem 1: Subterm Processor:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard