details

property	value
status	complete
benchmark	Ex7_BLR02.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.0169921 seconds
cpu usage	0.017501
user time	0.008648
system time	0.008853
max virtual memory	113188.0
max residence set size	4988.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR N X XS) (STRATEGY CONTEXTSENSITIVE (2nd 1) (from 1) (head 1) (sel 1 2) (take 1 2) (0) (cons 1) (nil) (s 1) ) (RULES 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) ) Problem 1: Innermost Equivalent Processor: -> Rules: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: 2ND(cons(X,XS)) -> HEAD(XS) 2ND(cons(X,XS)) -> XS SEL(s(N),cons(X,XS)) -> SEL(N,XS) SEL(s(N),cons(X,XS)) -> XS -> Rules: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) -> Unhiding Rules: from(s(X)) -> FROM(s(X)) take(N,XS) -> TAKE(N,XS) take(N,x3) -> x3 Problem 1: SCC Processor: -> Pairs: 2ND(cons(X,XS)) -> HEAD(XS) 2ND(cons(X,XS)) -> XS SEL(s(N),cons(X,XS)) -> SEL(N,XS) SEL(s(N),cons(X,XS)) -> XS -> Rules: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) -> Unhiding rules: from(s(X)) -> FROM(s(X)) take(N,XS) -> TAKE(N,XS) take(N,x3) -> x3 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: SEL(s(N),cons(X,XS)) -> SEL(N,XS) ->->-> Rules: 2nd(cons(X,XS)) -> head(XS) from(X) -> cons(X,from(s(X))) head(cons(X,XS)) -> X sel(0,cons(X,XS)) -> X sel(s(N),cons(X,XS)) -> sel(N,XS) take(0,XS) -> nil take(s(N),cons(X,XS)) -> cons(X,take(N,XS)) ->->-> Unhiding rules: Empty Problem 1: SubNColl Processor: -> Pairs: popout

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

job log

popout

actions

all output return to TRS Contextsensitive