details

property	value
status	complete
benchmark	ExProp7_Luc06_iGM.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	Transformed_CSR_innermost_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.754843 seconds
cpu usage	0.681084
user time	0.529395
system time	0.151689
max virtual memory	452896.0
max residence set size	10548.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S) (RULES active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(p(s(X:S))) -> mark(X:S) 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) f(active(X:S)) -> f(X:S) f(mark(X:S)) -> f(X:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(f(X:S)) -> active(f(mark(X:S))) mark(p(X:S)) -> active(p(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(0) -> active(0) p(active(X:S)) -> p(X:S) p(mark(X:S)) -> p(X:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(s(0))) -> MARK(f(p(s(0)))) ACTIVE(f(0)) -> MARK(cons(0,f(s(0)))) ACTIVE(p(s(X:S))) -> MARK(X:S) 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) F(active(X:S)) -> F(X:S) F(mark(X:S)) -> F(X: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(f(X:S)) -> ACTIVE(f(mark(X:S))) MARK(f(X:S)) -> F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> ACTIVE(p(mark(X:S))) MARK(p(X:S)) -> MARK(X:S) MARK(p(X:S)) -> P(mark(X:S)) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) MARK(s(X:S)) -> S(mark(X:S)) P(active(X:S)) -> P(X:S) P(mark(X:S)) -> P(X:S) S(active(X:S)) -> S(X:S) S(mark(X:S)) -> S(X:S) -> Rules: active(f(s(0))) -> mark(f(p(s(0)))) active(f(0)) -> mark(cons(0,f(s(0)))) active(p(s(X:S))) -> mark(X:S) 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) f(active(X:S)) -> f(X:S) f(mark(X:S)) -> f(X:S) mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) mark(f(X:S)) -> active(f(mark(X:S))) mark(p(X:S)) -> active(p(mark(X:S))) mark(s(X:S)) -> active(s(mark(X:S))) mark(0) -> active(0) p(active(X:S)) -> p(X:S) p(mark(X:S)) -> p(X:S) s(active(X:S)) -> s(X:S) s(mark(X:S)) -> s(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(s(0))) -> MARK(f(p(s(0)))) ACTIVE(f(0)) -> MARK(cons(0,f(s(0)))) ACTIVE(p(s(X:S))) -> MARK(X:S) 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) F(active(X:S)) -> F(X:S) F(mark(X:S)) -> F(X: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(f(X:S)) -> ACTIVE(f(mark(X:S))) MARK(f(X:S)) -> F(mark(X:S)) MARK(f(X:S)) -> MARK(X:S) MARK(p(X:S)) -> ACTIVE(p(mark(X:S))) MARK(p(X:S)) -> MARK(X:S) MARK(p(X:S)) -> P(mark(X:S)) MARK(s(X:S)) -> ACTIVE(s(mark(X:S))) MARK(s(X:S)) -> MARK(X:S) popout

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

job log

popout

actions

all output return to TRS Innermost