details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.020246 seconds
cpu usage	0.02081
user time	0.009186
system time	0.011624
max virtual memory	113188.0
max residence set size	5356.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES activate(n__first(X1:S,X2:S)) -> first(X1:S,X2:S) activate(n__from(X:S)) -> from(X:S) activate(X:S) -> X:S first(0,Z:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(s(X:S))) from(X:S) -> n__from(X:S) sel(0,cons(X:S,Z:S)) -> X:S sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,activate(Z:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(X1:S,X2:S) ACTIVATE(n__from(X:S)) -> FROM(X:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) SEL(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) SEL(s(X:S),cons(Y:S,Z:S)) -> SEL(X:S,activate(Z:S)) -> Rules: activate(n__first(X1:S,X2:S)) -> first(X1:S,X2:S) activate(n__from(X:S)) -> from(X:S) activate(X:S) -> X:S first(0,Z:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(s(X:S))) from(X:S) -> n__from(X:S) sel(0,cons(X:S,Z:S)) -> X:S sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,activate(Z:S)) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(X1:S,X2:S) ACTIVATE(n__from(X:S)) -> FROM(X:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) SEL(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) SEL(s(X:S),cons(Y:S,Z:S)) -> SEL(X:S,activate(Z:S)) -> Rules: activate(n__first(X1:S,X2:S)) -> first(X1:S,X2:S) activate(n__from(X:S)) -> from(X:S) activate(X:S) -> X:S first(0,Z:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(s(X:S))) from(X:S) -> n__from(X:S) sel(0,cons(X:S,Z:S)) -> X:S sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,activate(Z:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(X1:S,X2:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) ->->-> Rules: activate(n__first(X1:S,X2:S)) -> first(X1:S,X2:S) activate(n__from(X:S)) -> from(X:S) activate(X:S) -> X:S first(0,Z:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(s(X:S))) from(X:S) -> n__from(X:S) sel(0,cons(X:S,Z:S)) -> X:S sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,activate(Z:S)) ->->Cycle: ->->-> Pairs: SEL(s(X:S),cons(Y:S,Z:S)) -> SEL(X:S,activate(Z:S)) ->->-> Rules: activate(n__first(X1:S,X2:S)) -> first(X1:S,X2:S) activate(n__from(X:S)) -> from(X:S) activate(X:S) -> X:S first(0,Z:S) -> nil first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,n__first(X:S,activate(Z:S))) first(X1:S,X2:S) -> n__first(X1:S,X2:S) from(X:S) -> cons(X:S,n__from(s(X:S))) from(X:S) -> n__from(X:S) sel(0,cons(X:S,Z:S)) -> X:S sel(s(X:S),cons(Y:S,Z:S)) -> sel(X:S,activate(Z:S)) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: ACTIVATE(n__first(X1:S,X2:S)) -> FIRST(X1:S,X2:S) FIRST(s(X:S),cons(Y:S,Z:S)) -> ACTIVATE(Z:S) -> Rules: popout

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

job log

popout

actions

all output return to TRS Standard