details

property	value
status	complete
benchmark	15.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n174.star.cs.uiowa.edu
space	Various_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0595971 seconds
cpu usage	0.04821
user time	0.019627
system time	0.028583
max virtual memory	113188.0
max residence set size	4764.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> 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(s(x:S)) -> F(p(s(x:S))) F(s(x:S)) -> P(s(x:S)) -> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: F(s(x:S)) -> F(p(s(x:S))) F(s(x:S)) -> P(s(x:S)) -> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(x:S)) -> F(p(s(x:S))) ->->-> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S Problem 1: Reduction Pairs Processor: -> Pairs: F(s(x:S)) -> F(p(s(x:S))) -> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S -> Usable rules: p(s(x:S)) -> x:S ->Interpretation type: Linear ->Coefficients: All rationals ->Dimension: 1 ->Bound: 2 ->Interpretation: [f](X) = 0 [p](X) = 1/2.X [0] = 0 [fSNonEmpty] = 0 [s](X) = 2.X + 1/2 [F](X) = 2.X [P](X) = 0 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: f(0) -> 0 f(s(x:S)) -> s(s(f(p(s(x:S))))) p(s(x:S)) -> x:S ->Strongly Connected Components: There is no strongly connected component The problem is finite. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard