details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0524049 seconds
cpu usage	0.037061
user time	0.013733
system time	0.023328
max virtual memory	113188.0
max residence set size	5316.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 a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(a,X:S,X:S) -> A__B A__F(a,X:S,X:S) -> A__F(X:S,a__b,b) MARK(b) -> A__B MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,mark(X2:S),X3:S) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) -> Rules: a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) Problem 1: SCC Processor: -> Pairs: A__F(a,X:S,X:S) -> A__B A__F(a,X:S,X:S) -> A__F(X:S,a__b,b) MARK(b) -> A__B MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,mark(X2:S),X3:S) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) -> Rules: a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(a,X:S,X:S) -> A__F(X:S,a__b,b) ->->-> Rules: a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) ->->Cycle: ->->-> Pairs: MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) ->->-> Rules: a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: -> Pairs: A__F(a,X:S,X:S) -> A__F(X:S,a__b,b) -> Rules: a__b -> a a__b -> b a__f(a,X:S,X:S) -> a__f(X:S,a__b,b) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> a__b mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) -> Usable rules: a__b -> a a__b -> b ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 popout

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

job log

popout

actions

all output return to TRS Innermost