details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.197894 seconds
cpu usage	0.197411
user time	0.128044
system time	0.069367
max virtual memory	113188.0
max residence set size	6632.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S XS:S) (RULES active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(zeros) -> mark(cons(0,zeros)) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(0) -> active(0) mark(zeros) -> active(zeros) tail(active(X:S)) -> tail(X:S) tail(mark(X:S)) -> tail(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) ACTIVE(zeros) -> MARK(cons(0,zeros)) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) MARK(tail(X:S)) -> MARK(X:S) MARK(tail(X:S)) -> TAIL(mark(X:S)) MARK(zeros) -> ACTIVE(zeros) TAIL(active(X:S)) -> TAIL(X:S) TAIL(mark(X:S)) -> TAIL(X:S) -> Rules: active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(zeros) -> mark(cons(0,zeros)) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(0) -> active(0) mark(zeros) -> active(zeros) tail(active(X:S)) -> tail(X:S) tail(mark(X:S)) -> tail(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) ACTIVE(zeros) -> MARK(cons(0,zeros)) CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) MARK(tail(X:S)) -> MARK(X:S) MARK(tail(X:S)) -> TAIL(mark(X:S)) MARK(zeros) -> ACTIVE(zeros) TAIL(active(X:S)) -> TAIL(X:S) TAIL(mark(X:S)) -> TAIL(X:S) -> Rules: active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(zeros) -> mark(cons(0,zeros)) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(tail(X:S)) -> active(tail(mark(X:S))) mark(0) -> active(0) mark(zeros) -> active(zeros) tail(active(X:S)) -> tail(X:S) tail(mark(X:S)) -> tail(X:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: TAIL(active(X:S)) -> TAIL(X:S) TAIL(mark(X:S)) -> TAIL(X:S) ->->-> Rules: active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(zeros) -> mark(cons(0,zeros)) cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(tail(X:S)) -> active(tail(mark(X:S))) popout

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

job log

popout

actions

all output return to TRS Innermost