details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.198213 seconds
cpu usage	0.195791
user time	0.145148
system time	0.050643
max virtual memory	113188.0
max residence set size	9160.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S X3:S Y:S Z:S) (RULES a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__and(ffalse,Y:S) -> ffalse a__and(ttrue,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(X:S,from(s(X:S))) a__from(X:S) -> from(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),X2:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(cons(X1:S,X2:S)) -> cons(X1:S,X2:S) mark(ffalse) -> ffalse mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(X:S) mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),X2:S,X3:S) mark(nil) -> nil mark(s(X:S)) -> s(X:S) mark(ttrue) -> ttrue ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__AND(ttrue,X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(add(X1:S,X2:S)) -> A__ADD(mark(X1:S),X2:S) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(from(X:S)) -> A__FROM(X:S) MARK(if(X1:S,X2:S,X3:S)) -> A__IF(mark(X1:S),X2:S,X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) -> Rules: a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) a__add(X1:S,X2:S) -> add(X1:S,X2:S) a__and(ffalse,Y:S) -> ffalse a__and(ttrue,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__first(0,X:S) -> nil a__first(s(X:S),cons(Y:S,Z:S)) -> cons(Y:S,first(X:S,Z:S)) a__first(X1:S,X2:S) -> first(X1:S,X2:S) a__from(X:S) -> cons(X:S,from(s(X:S))) a__from(X:S) -> from(X:S) a__if(ffalse,X:S,Y:S) -> mark(Y:S) a__if(ttrue,X:S,Y:S) -> mark(X:S) a__if(X1:S,X2:S,X3:S) -> if(X1:S,X2:S,X3:S) mark(0) -> 0 mark(add(X1:S,X2:S)) -> a__add(mark(X1:S),X2:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(cons(X1:S,X2:S)) -> cons(X1:S,X2:S) mark(ffalse) -> ffalse mark(first(X1:S,X2:S)) -> a__first(mark(X1:S),mark(X2:S)) mark(from(X:S)) -> a__from(X:S) mark(if(X1:S,X2:S,X3:S)) -> a__if(mark(X1:S),X2:S,X3:S) mark(nil) -> nil mark(s(X:S)) -> s(X:S) mark(ttrue) -> ttrue Problem 1: SCC Processor: -> Pairs: A__ADD(0,X:S) -> MARK(X:S) A__AND(ttrue,X:S) -> MARK(X:S) A__IF(ffalse,X:S,Y:S) -> MARK(Y:S) A__IF(ttrue,X:S,Y:S) -> MARK(X:S) MARK(add(X1:S,X2:S)) -> A__ADD(mark(X1:S),X2:S) MARK(add(X1:S,X2:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> A__FIRST(mark(X1:S),mark(X2:S)) MARK(first(X1:S,X2:S)) -> MARK(X1:S) MARK(first(X1:S,X2:S)) -> MARK(X2:S) MARK(from(X:S)) -> A__FROM(X:S) MARK(if(X1:S,X2:S,X3:S)) -> A__IF(mark(X1:S),X2:S,X3:S) MARK(if(X1:S,X2:S,X3:S)) -> MARK(X1:S) -> Rules: a__add(0,X:S) -> mark(X:S) a__add(s(X:S),Y:S) -> s(add(X:S,Y:S)) popout

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

job log

popout

actions

all output return to TRS Innermost