details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	9.83638 seconds
cpu usage	9.72995
user time	9.48587
system time	0.244088
max virtual memory	726596.0
max residence set size	22220.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S X3:S) (RULES active(f(a,X:S,X:S)) -> mark(f(X:S,b,b)) active(b) -> mark(a) f(active(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(mark(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,active(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,mark(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,active(X3:S)) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,mark(X3:S)) -> f(X1:S,X2:S,X3:S) mark(f(X1:S,X2:S,X3:S)) -> active(f(X1:S,mark(X2:S),X3:S)) mark(a) -> active(a) mark(b) -> active(b) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(a,X:S,X:S)) -> F(X:S,b,b) ACTIVE(f(a,X:S,X:S)) -> MARK(f(X:S,b,b)) ACTIVE(b) -> MARK(a) F(active(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(mark(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,active(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,mark(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,active(X3:S)) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,mark(X3:S)) -> F(X1:S,X2:S,X3:S) MARK(f(X1:S,X2:S,X3:S)) -> ACTIVE(f(X1:S,mark(X2:S),X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> F(X1:S,mark(X2:S),X3:S) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) MARK(b) -> ACTIVE(b) -> Rules: active(f(a,X:S,X:S)) -> mark(f(X:S,b,b)) active(b) -> mark(a) f(active(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(mark(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,active(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,mark(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,active(X3:S)) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,mark(X3:S)) -> f(X1:S,X2:S,X3:S) mark(f(X1:S,X2:S,X3:S)) -> active(f(X1:S,mark(X2:S),X3:S)) mark(a) -> active(a) mark(b) -> active(b) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(a,X:S,X:S)) -> F(X:S,b,b) ACTIVE(f(a,X:S,X:S)) -> MARK(f(X:S,b,b)) ACTIVE(b) -> MARK(a) F(active(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(mark(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,active(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,mark(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,active(X3:S)) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,mark(X3:S)) -> F(X1:S,X2:S,X3:S) MARK(f(X1:S,X2:S,X3:S)) -> ACTIVE(f(X1:S,mark(X2:S),X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> F(X1:S,mark(X2:S),X3:S) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) MARK(b) -> ACTIVE(b) -> Rules: active(f(a,X:S,X:S)) -> mark(f(X:S,b,b)) active(b) -> mark(a) f(active(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(mark(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,active(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,mark(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,active(X3:S)) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,mark(X3:S)) -> f(X1:S,X2:S,X3:S) mark(f(X1:S,X2:S,X3:S)) -> active(f(X1:S,mark(X2:S),X3:S)) mark(a) -> active(a) mark(b) -> active(b) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(active(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(mark(X1:S),X2:S,X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,active(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,mark(X2:S),X3:S) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,active(X3:S)) -> F(X1:S,X2:S,X3:S) F(X1:S,X2:S,mark(X3:S)) -> F(X1:S,X2:S,X3:S) ->->-> Rules: active(f(a,X:S,X:S)) -> mark(f(X:S,b,b)) active(b) -> mark(a) f(active(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(mark(X1:S),X2:S,X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,active(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,mark(X2:S),X3:S) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,active(X3:S)) -> f(X1:S,X2:S,X3:S) f(X1:S,X2:S,mark(X3:S)) -> f(X1:S,X2:S,X3:S) mark(f(X1:S,X2:S,X3:S)) -> active(f(X1:S,mark(X2:S),X3:S)) mark(a) -> active(a) mark(b) -> active(b) popout

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

job log

popout

actions

all output return to TRS Innermost