details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0438671 seconds
cpu usage	0.043619
user time	0.022621
system time	0.020998
max virtual memory	113188.0
max residence set size	5344.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__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,X2:S,mark(X3:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__F(a,b,X:S) -> A__F(X:S,X:S,mark(X:S)) A__F(a,b,X:S) -> MARK(X:S) MARK(c) -> A__C MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,X2:S,mark(X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X3:S) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,X2:S,mark(X3:S)) Problem 1: SCC Processor: -> Pairs: A__F(a,b,X:S) -> A__F(X:S,X:S,mark(X:S)) A__F(a,b,X:S) -> MARK(X:S) MARK(c) -> A__C MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,X2:S,mark(X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X3:S) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,X2:S,mark(X3:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__F(a,b,X:S) -> MARK(X:S) MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,X2:S,mark(X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X3:S) ->->-> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,X2:S,mark(X3:S)) Problem 1: Reduction Pairs Processor: -> Pairs: A__F(a,b,X:S) -> MARK(X:S) MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,X2:S,mark(X3:S)) MARK(f(X1:S,X2:S,X3:S)) -> MARK(X3:S) -> Rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,X2:S,mark(X3:S)) -> Usable rules: a__c -> a a__c -> b a__c -> c a__f(a,b,X:S) -> a__f(X:S,X:S,mark(X:S)) a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) mark(a) -> a mark(b) -> b mark(c) -> a__c popout

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

job log

popout

actions

all output return to TRS Innermost