Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963981
details
property
value
status
complete
benchmark
25.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n170.star.cs.uiowa.edu
space
Various_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.0933141708374 seconds
cpu usage
0.0374294
max memory
3006464.0
stage attributes
key
value
output-size
1559
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) (RULES b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) ) Problem 1: Innermost Equivalent Processor: -> Rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: B -> F(a,a) G(a) -> B G(a) -> G(b) -> Rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) Problem 1: SCC Processor: -> Pairs: B -> F(a,a) G(a) -> B G(a) -> G(b) -> Rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: G(a) -> G(b) ->->-> Rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) Problem 1: Reduction Pairs Processor: -> Pairs: G(a) -> G(b) -> Rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) -> Usable rules: b -> f(a,a) f(a,a) -> g(d) g(a) -> g(b) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [b] = 0 [f](X1,X2) = 0 [g](X) = 2.X [a] = 2 [d] = 0 [fSNonEmpty] = 0 [B] = 0 [F](X1,X2) = 0 [G](X) = 2.X Problem 1: SCC Processor: -> Pairs: Empty -> Rules: b -> f(a,a) f(a,a) -> g(d)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard