details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.221383 seconds
cpu usage	0.052748
user time	0.02355
system time	0.029198
max virtual memory	113188.0
max residence set size	4436.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR X) (STRATEGY CONTEXTSENSITIVE (f 1) (p 1) (0) (cons 1) (s 1) ) (RULES f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X ) Problem 1: Innermost Equivalent Processor: -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: F(s(0)) -> F(p(s(0))) F(s(0)) -> P(s(0)) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(s(0)) -> F(p(s(0))) ->->-> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: F(s(0)) -> F(p(s(0))) -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X -> Unhiding rules: Empty -> Usable rules: p(s(X)) -> X ->Interpretation type: Linear ->Coefficients: All rationals ->Dimension: 1 ->Bound: 2 ->Interpretation: [p](X) = 1/2.X + 1/2 [0] = 0 [s](X) = 2.X + 2 [F](X) = 1/2.X Problem 1: Basic Processor: -> Pairs: Empty -> Rules: f(0) -> cons(0,f(s(0))) f(s(0)) -> f(p(s(0))) popout

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

job log

popout

actions

all output return to TRS Contextsensitive