0.00/0.17 YES 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 (VAR v_NonEmpty:S X:S X1:S X2:S) 0.00/0.17 (RULES 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ) 0.00/0.17 (STRATEGY INNERMOST) 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 Dependency Pairs Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 A__F(s(0)) -> A__P(s(0)) 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 A__F(s(0)) -> A__P(s(0)) 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 ->->Cycle: 0.00/0.17 ->->-> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 A__F(s(0)) -> A__P(s(0)) 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 ->->-> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 Reduction Pairs Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 A__F(s(0)) -> A__P(s(0)) 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 -> Usable rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Interpretation type: 0.00/0.17 Linear 0.00/0.17 ->Coefficients: 0.00/0.17 Natural Numbers 0.00/0.17 ->Dimension: 0.00/0.17 1 0.00/0.17 ->Bound: 0.00/0.17 2 0.00/0.17 ->Interpretation: 0.00/0.17 0.00/0.17 [a__f](X) = 2.X + 2 0.00/0.17 [a__p](X) = X 0.00/0.17 [mark](X) = 2.X 0.00/0.17 [0] = 2 0.00/0.17 [cons](X1,X2) = 2.X1 + 2 0.00/0.17 [f](X) = 2.X + 2 0.00/0.17 [fSNonEmpty] = 0 0.00/0.17 [p](X) = X 0.00/0.17 [s](X) = 2.X 0.00/0.17 [A__F](X) = 2.X + 2 0.00/0.17 [A__P](X) = X + 2 0.00/0.17 [MARK](X) = 2.X + 2 0.00/0.17 0.00/0.17 Problem 1: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> A__F(mark(X:S)) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 ->->Cycle: 0.00/0.17 ->->-> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 ->->-> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->->Cycle: 0.00/0.17 ->->-> Pairs: 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 ->->-> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 0.00/0.17 0.00/0.17 The problem is decomposed in 2 subproblems. 0.00/0.17 0.00/0.17 Problem 1.1: 0.00/0.17 0.00/0.17 Reduction Pairs Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__F(s(0)) -> A__F(a__p(s(0))) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 -> Usable rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Interpretation type: 0.00/0.17 Linear 0.00/0.17 ->Coefficients: 0.00/0.17 All rationals 0.00/0.17 ->Dimension: 0.00/0.17 1 0.00/0.17 ->Bound: 0.00/0.17 2 0.00/0.17 ->Interpretation: 0.00/0.17 0.00/0.17 [a__f](X) = 0 0.00/0.17 [a__p](X) = 1/2.X + 1/2 0.00/0.17 [mark](X) = X 0.00/0.17 [0] = 2 0.00/0.17 [cons](X1,X2) = 2.X2 0.00/0.17 [f](X) = 0 0.00/0.17 [fSNonEmpty] = 0 0.00/0.17 [p](X) = 1/2.X + 1/2 0.00/0.17 [s](X) = 2.X + 1/2 0.00/0.17 [A__F](X) = 2.X 0.00/0.17 [A__P](X) = 0 0.00/0.17 [MARK](X) = 0 0.00/0.17 0.00/0.17 Problem 1.1: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 Empty 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 There is no strongly connected component 0.00/0.17 0.00/0.17 The problem is finite. 0.00/0.17 0.00/0.17 Problem 1.2: 0.00/0.17 0.00/0.17 Reduction Pairs Processor: 0.00/0.17 -> Pairs: 0.00/0.17 A__P(s(X:S)) -> MARK(X:S) 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 -> Usable rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Interpretation type: 0.00/0.17 Linear 0.00/0.17 ->Coefficients: 0.00/0.17 Natural Numbers 0.00/0.17 ->Dimension: 0.00/0.17 1 0.00/0.17 ->Bound: 0.00/0.17 2 0.00/0.17 ->Interpretation: 0.00/0.17 0.00/0.17 [a__f](X) = 2.X + 2 0.00/0.17 [a__p](X) = X 0.00/0.17 [mark](X) = 2.X + 1 0.00/0.17 [0] = 0 0.00/0.17 [cons](X1,X2) = X1 + 1 0.00/0.17 [f](X) = 2.X + 2 0.00/0.17 [fSNonEmpty] = 0 0.00/0.17 [p](X) = X 0.00/0.17 [s](X) = 2.X + 2 0.00/0.17 [A__F](X) = 0 0.00/0.17 [A__P](X) = X + 1 0.00/0.17 [MARK](X) = 2.X + 2 0.00/0.17 0.00/0.17 Problem 1.2: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> A__P(mark(X:S)) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 ->->Cycle: 0.00/0.17 ->->-> Pairs: 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 ->->-> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 0.00/0.17 Problem 1.2: 0.00/0.17 0.00/0.17 Subterm Processor: 0.00/0.17 -> Pairs: 0.00/0.17 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.17 MARK(f(X:S)) -> MARK(X:S) 0.00/0.17 MARK(p(X:S)) -> MARK(X:S) 0.00/0.17 MARK(s(X:S)) -> MARK(X:S) 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Projection: 0.00/0.17 pi(MARK) = 1 0.00/0.17 0.00/0.17 Problem 1.2: 0.00/0.17 0.00/0.17 SCC Processor: 0.00/0.17 -> Pairs: 0.00/0.17 Empty 0.00/0.17 -> Rules: 0.00/0.17 a__f(0) -> cons(0,f(s(0))) 0.00/0.17 a__f(s(0)) -> a__f(a__p(s(0))) 0.00/0.17 a__f(X:S) -> f(X:S) 0.00/0.17 a__p(s(X:S)) -> mark(X:S) 0.00/0.17 a__p(X:S) -> p(X:S) 0.00/0.17 mark(0) -> 0 0.00/0.17 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) 0.00/0.17 mark(f(X:S)) -> a__f(mark(X:S)) 0.00/0.17 mark(p(X:S)) -> a__p(mark(X:S)) 0.00/0.17 mark(s(X:S)) -> s(mark(X:S)) 0.00/0.17 ->Strongly Connected Components: 0.00/0.17 There is no strongly connected component 0.00/0.17 0.00/0.17 The problem is finite. 0.00/0.17 EOF