0.00/0.27 YES 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 (VAR v_NonEmpty:S I:S P:S X:S X1:S X2:S Y:S Z:S) 0.00/0.27 (RULES 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ) 0.00/0.27 (STRATEGY INNERMOST) 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Dependency Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> A__ISNEPAL(mark(X:S)) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> A__ISNEPAL(mark(X:S)) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [a__and](X1,X2) = 2.X1 + 2.X2 + 1 0.00/0.27 [a__isNePal](X) = 2.X + 1 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [and](X1,X2) = 2.X1 + 2.X2 + 1 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = 2.X + 1 0.00/0.27 [nil] = 0 0.00/0.27 [tt] = 1 0.00/0.27 [A____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [A__AND](X1,X2) = 2.X1 + 2.X2 + 1 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = X + 2 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> A____(mark(Y:S),mark(Z:S)) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [a__and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [a__isNePal](X) = 2.X + 2 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = 2.X + 2 0.00/0.27 [nil] = 0 0.00/0.27 [tt] = 1 0.00/0.27 [A____](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 1 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(X:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [a__and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [a__isNePal](X) = 2.X + 1 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = 2.X + 1 0.00/0.27 [nil] = 2 0.00/0.27 [tt] = 2 0.00/0.27 [A____](X1,X2) = 2.X1 + 2.X2 + 1 0.00/0.27 [A__AND](X1,X2) = X1 + 2.X2 + 2 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 2 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Y:S) 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [a__and](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [a__isNePal](X) = X + 1 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [and](X1,X2) = 2.X1 + X2 + 1 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = X + 1 0.00/0.27 [nil] = 1 0.00/0.27 [tt] = 1 0.00/0.27 [A____](X1,X2) = 2.X1 + 2.X2 0.00/0.27 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 1 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(__(X:S,Y:S),Z:S) -> MARK(Z:S) 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [a__and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [a__isNePal](X) = X + 2 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [and](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = X + 2 0.00/0.27 [nil] = 2 0.00/0.27 [tt] = 0 0.00/0.27 [A____](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 2 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(nil,X:S) -> MARK(X:S) 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [a__and](X1,X2) = X1 + 2.X2 + 2 0.00/0.27 [a__isNePal](X) = 2.X + 1 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [and](X1,X2) = X1 + 2.X2 + 2 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = 2.X + 1 0.00/0.27 [nil] = 2 0.00/0.27 [tt] = 0 0.00/0.27 [A____](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.27 [A__AND](X1,X2) = 2.X2 + 2 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 2 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Reduction Pairs Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A____(X:S,nil) -> MARK(X:S) 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 -> Usable rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Interpretation type: 0.00/0.27 Linear 0.00/0.27 ->Coefficients: 0.00/0.27 Natural Numbers 0.00/0.27 ->Dimension: 0.00/0.27 1 0.00/0.27 ->Bound: 0.00/0.27 2 0.00/0.27 ->Interpretation: 0.00/0.27 0.00/0.27 [a____](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [a__and](X1,X2) = X1 + 2.X2 + 2 0.00/0.27 [a__isNePal](X) = 2.X 0.00/0.27 [mark](X) = X 0.00/0.27 [__](X1,X2) = 2.X1 + X2 + 2 0.00/0.27 [and](X1,X2) = X1 + 2.X2 + 2 0.00/0.27 [fSNonEmpty] = 0 0.00/0.27 [isNePal](X) = 2.X 0.00/0.27 [nil] = 2 0.00/0.27 [tt] = 2 0.00/0.27 [A____](X1,X2) = 2.X1 + X2 0.00/0.27 [A__AND](X1,X2) = 2.X1 + 2.X2 + 1 0.00/0.27 [A__ISNEPAL](X) = 0 0.00/0.27 [MARK](X) = 2.X + 1 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> A____(mark(X1:S),mark(X2:S)) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 ->->Cycle: 0.00/0.27 ->->-> Pairs: 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 ->->-> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 Subterm Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(__(X1:S,X2:S)) -> MARK(X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) 0.00/0.27 MARK(and(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.27 MARK(isNePal(X:S)) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Projection: 0.00/0.27 pi(A__AND) = 2 0.00/0.27 pi(MARK) = 1 0.00/0.27 0.00/0.27 Problem 1: 0.00/0.27 0.00/0.27 SCC Processor: 0.00/0.27 -> Pairs: 0.00/0.27 A__AND(tt,X:S) -> MARK(X:S) 0.00/0.27 -> Rules: 0.00/0.27 a____(__(X:S,Y:S),Z:S) -> a____(mark(X:S),a____(mark(Y:S),mark(Z:S))) 0.00/0.27 a____(nil,X:S) -> mark(X:S) 0.00/0.27 a____(X:S,nil) -> mark(X:S) 0.00/0.27 a____(X1:S,X2:S) -> __(X1:S,X2:S) 0.00/0.27 a__and(tt,X:S) -> mark(X:S) 0.00/0.27 a__and(X1:S,X2:S) -> and(X1:S,X2:S) 0.00/0.27 a__isNePal(__(I:S,__(P:S,I:S))) -> tt 0.00/0.27 a__isNePal(X:S) -> isNePal(X:S) 0.00/0.27 mark(__(X1:S,X2:S)) -> a____(mark(X1:S),mark(X2:S)) 0.00/0.27 mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) 0.00/0.27 mark(isNePal(X:S)) -> a__isNePal(mark(X:S)) 0.00/0.27 mark(nil) -> nil 0.00/0.27 mark(tt) -> tt 0.00/0.27 ->Strongly Connected Components: 0.00/0.27 There is no strongly connected component 0.00/0.27 0.00/0.27 The problem is finite. 0.00/0.27 EOF