Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381717643
details
property
value
status
complete
benchmark
z010.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0354790687561 seconds
cpu usage
0.027544715
max memory
2977792.0
stage attributes
key
value
output-size
2537
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 x1) (RULES a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) ) Problem 1: Innermost Equivalent Processor: -> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: A(b(x1)) -> A(x1) C(b(x1)) -> C(c(x1)) C(b(x1)) -> C(x1) -> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) Problem 1: SCC Processor: -> Pairs: A(b(x1)) -> A(x1) C(b(x1)) -> C(c(x1)) C(b(x1)) -> C(x1) -> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(b(x1)) -> C(c(x1)) C(b(x1)) -> C(x1) ->->-> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) ->->Cycle: ->->-> Pairs: A(b(x1)) -> A(x1) ->->-> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: C(b(x1)) -> C(c(x1)) C(b(x1)) -> C(x1) -> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) -> Usable rules: c(b(x1)) -> b(c(c(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [c](X) = X [b](X) = X + 2 [C](X) = 2.X Problem 1.1: SCC Processor: -> Pairs: C(b(x1)) -> C(x1) -> Rules: a(b(x1)) -> b(b(a(x1))) c(b(x1)) -> b(c(c(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685