0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR v_NonEmpty:S X:S X1:S X2:S X3:S) 0.00/0.01 (RULES 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 ) 0.00/0.01 (STRATEGY INNERMOST) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 A__F(b,X:S,c) -> A__C 0.00/0.01 A__F(b,X:S,c) -> A__F(X:S,a__c,X:S) 0.00/0.01 MARK(c) -> A__C 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,mark(X2:S),X3:S) 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 A__F(b,X:S,c) -> A__C 0.00/0.01 A__F(b,X:S,c) -> A__F(X:S,a__c,X:S) 0.00/0.01 MARK(c) -> A__C 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> A__F(X1:S,mark(X2:S),X3:S) 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) 0.00/0.01 ->->-> Rules: 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Subterm Processor: 0.00/0.01 -> Pairs: 0.00/0.01 MARK(f(X1:S,X2:S,X3:S)) -> MARK(X2:S) 0.00/0.01 -> Rules: 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 ->Projection: 0.00/0.01 pi(MARK) = 1 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 Empty 0.00/0.01 -> Rules: 0.00/0.01 a__c -> b 0.00/0.01 a__c -> c 0.00/0.01 a__f(b,X:S,c) -> a__f(X:S,a__c,X:S) 0.00/0.01 a__f(X1:S,X2:S,X3:S) -> f(X1:S,X2:S,X3:S) 0.00/0.01 mark(b) -> b 0.00/0.01 mark(c) -> a__c 0.00/0.01 mark(f(X1:S,X2:S,X3:S)) -> a__f(X1:S,mark(X2:S),X3:S) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 There is no strongly connected component 0.00/0.01 0.00/0.01 The problem is finite. 0.00/0.01 EOF