0.00/0.04 YES 0.00/0.04 0.00/0.04 Problem 1: 0.00/0.04 0.00/0.04 (VAR v_NonEmpty:S X:S X1:S X2:S Y:S) 0.00/0.04 (RULES 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ) 0.00/0.04 (STRATEGY INNERMOST) 0.00/0.04 0.00/0.04 Problem 1: 0.00/0.04 0.00/0.04 Dependency Pairs Processor: 0.00/0.04 -> Pairs: 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> F(X:S,f(g(X:S),Y:S)) 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> MARK(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 F(active(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(mark(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 G(active(X:S)) -> G(X:S) 0.00/0.04 G(mark(X:S)) -> G(X:S) 0.00/0.04 MARK(f(X1:S,X2:S)) -> ACTIVE(f(mark(X1:S),X2:S)) 0.00/0.04 MARK(f(X1:S,X2:S)) -> F(mark(X1:S),X2:S) 0.00/0.04 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.04 MARK(g(X:S)) -> ACTIVE(g(mark(X:S))) 0.00/0.04 MARK(g(X:S)) -> G(mark(X:S)) 0.00/0.04 MARK(g(X:S)) -> MARK(X:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 0.00/0.04 Problem 1: 0.00/0.04 0.00/0.04 SCC Processor: 0.00/0.04 -> Pairs: 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> F(X:S,f(g(X:S),Y:S)) 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> MARK(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 F(active(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(mark(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 G(active(X:S)) -> G(X:S) 0.00/0.04 G(mark(X:S)) -> G(X:S) 0.00/0.04 MARK(f(X1:S,X2:S)) -> ACTIVE(f(mark(X1:S),X2:S)) 0.00/0.04 MARK(f(X1:S,X2:S)) -> F(mark(X1:S),X2:S) 0.00/0.04 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.04 MARK(g(X:S)) -> ACTIVE(g(mark(X:S))) 0.00/0.04 MARK(g(X:S)) -> G(mark(X:S)) 0.00/0.04 MARK(g(X:S)) -> MARK(X:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Strongly Connected Components: 0.00/0.04 ->->Cycle: 0.00/0.04 ->->-> Pairs: 0.00/0.04 G(active(X:S)) -> G(X:S) 0.00/0.04 G(mark(X:S)) -> G(X:S) 0.00/0.04 ->->-> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->->Cycle: 0.00/0.04 ->->-> Pairs: 0.00/0.04 F(active(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(mark(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 ->->-> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->->Cycle: 0.00/0.04 ->->-> Pairs: 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> MARK(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 MARK(f(X1:S,X2:S)) -> ACTIVE(f(mark(X1:S),X2:S)) 0.00/0.04 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.04 MARK(g(X:S)) -> ACTIVE(g(mark(X:S))) 0.00/0.04 MARK(g(X:S)) -> MARK(X:S) 0.00/0.04 ->->-> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 0.00/0.04 0.00/0.04 The problem is decomposed in 3 subproblems. 0.00/0.04 0.00/0.04 Problem 1.1: 0.00/0.04 0.00/0.04 Subterm Processor: 0.00/0.04 -> Pairs: 0.00/0.04 G(active(X:S)) -> G(X:S) 0.00/0.04 G(mark(X:S)) -> G(X:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Projection: 0.00/0.04 pi(G) = 1 0.00/0.04 0.00/0.04 Problem 1.1: 0.00/0.04 0.00/0.04 SCC Processor: 0.00/0.04 -> Pairs: 0.00/0.04 Empty 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Strongly Connected Components: 0.00/0.04 There is no strongly connected component 0.00/0.04 0.00/0.04 The problem is finite. 0.00/0.04 0.00/0.04 Problem 1.2: 0.00/0.04 0.00/0.04 Subterm Processor: 0.00/0.04 -> Pairs: 0.00/0.04 F(active(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(mark(X1:S),X2:S) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Projection: 0.00/0.04 pi(F) = 1 0.00/0.04 0.00/0.04 Problem 1.2: 0.00/0.04 0.00/0.04 SCC Processor: 0.00/0.04 -> Pairs: 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Strongly Connected Components: 0.00/0.04 ->->Cycle: 0.00/0.04 ->->-> Pairs: 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 ->->-> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 0.00/0.04 Problem 1.2: 0.00/0.04 0.00/0.04 Subterm Processor: 0.00/0.04 -> Pairs: 0.00/0.04 F(X1:S,active(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 F(X1:S,mark(X2:S)) -> F(X1:S,X2:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Projection: 0.00/0.04 pi(F) = 2 0.00/0.04 0.00/0.04 Problem 1.2: 0.00/0.04 0.00/0.04 SCC Processor: 0.00/0.04 -> Pairs: 0.00/0.04 Empty 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 ->Strongly Connected Components: 0.00/0.04 There is no strongly connected component 0.00/0.04 0.00/0.04 The problem is finite. 0.00/0.04 0.00/0.04 Problem 1.3: 0.00/0.04 0.00/0.04 Reduction Pairs Processor: 0.00/0.04 -> Pairs: 0.00/0.04 ACTIVE(f(g(X:S),Y:S)) -> MARK(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 MARK(f(X1:S,X2:S)) -> ACTIVE(f(mark(X1:S),X2:S)) 0.00/0.04 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.04 MARK(g(X:S)) -> ACTIVE(g(mark(X:S))) 0.00/0.04 MARK(g(X:S)) -> MARK(X:S) 0.00/0.04 -> Rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.04 g(active(X:S)) -> g(X:S) 0.00/0.04 g(mark(X:S)) -> g(X:S) 0.00/0.04 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.04 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.04 -> Usable rules: 0.00/0.04 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.04 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.04 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 g(active(X:S)) -> g(X:S) 0.00/0.14 g(mark(X:S)) -> g(X:S) 0.00/0.14 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.14 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.14 ->Interpretation type: 0.00/0.14 Linear 0.00/0.14 ->Coefficients: 0.00/0.14 Natural Numbers 0.00/0.14 ->Dimension: 0.00/0.14 1 0.00/0.14 ->Bound: 0.00/0.14 2 0.00/0.14 ->Interpretation: 0.00/0.14 0.00/0.14 [active](X) = X + 1 0.00/0.14 [f](X1,X2) = 2.X1 + 2 0.00/0.14 [g](X) = 2.X + 2 0.00/0.14 [mark](X) = 2.X 0.00/0.14 [fSNonEmpty] = 0 0.00/0.14 [ACTIVE](X) = X + 1 0.00/0.14 [F](X1,X2) = 0 0.00/0.14 [G](X) = 0 0.00/0.14 [MARK](X) = 2.X + 2 0.00/0.14 0.00/0.14 Problem 1.3: 0.00/0.14 0.00/0.14 SCC Processor: 0.00/0.14 -> Pairs: 0.00/0.14 MARK(f(X1:S,X2:S)) -> ACTIVE(f(mark(X1:S),X2:S)) 0.00/0.14 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.14 MARK(g(X:S)) -> ACTIVE(g(mark(X:S))) 0.00/0.14 MARK(g(X:S)) -> MARK(X:S) 0.00/0.14 -> Rules: 0.00/0.14 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.14 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 g(active(X:S)) -> g(X:S) 0.00/0.14 g(mark(X:S)) -> g(X:S) 0.00/0.14 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.14 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.14 ->Strongly Connected Components: 0.00/0.14 ->->Cycle: 0.00/0.14 ->->-> Pairs: 0.00/0.14 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.14 MARK(g(X:S)) -> MARK(X:S) 0.00/0.14 ->->-> Rules: 0.00/0.14 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.14 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 g(active(X:S)) -> g(X:S) 0.00/0.14 g(mark(X:S)) -> g(X:S) 0.00/0.14 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.14 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.14 0.00/0.14 Problem 1.3: 0.00/0.14 0.00/0.14 Subterm Processor: 0.00/0.14 -> Pairs: 0.00/0.14 MARK(f(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.14 MARK(g(X:S)) -> MARK(X:S) 0.00/0.14 -> Rules: 0.00/0.14 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.14 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 g(active(X:S)) -> g(X:S) 0.00/0.14 g(mark(X:S)) -> g(X:S) 0.00/0.14 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.14 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.14 ->Projection: 0.00/0.14 pi(MARK) = 1 0.00/0.14 0.00/0.14 Problem 1.3: 0.00/0.14 0.00/0.14 SCC Processor: 0.00/0.14 -> Pairs: 0.00/0.14 Empty 0.00/0.14 -> Rules: 0.00/0.14 active(f(g(X:S),Y:S)) -> mark(f(X:S,f(g(X:S),Y:S))) 0.00/0.14 f(active(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(mark(X1:S),X2:S) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,active(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 f(X1:S,mark(X2:S)) -> f(X1:S,X2:S) 0.00/0.14 g(active(X:S)) -> g(X:S) 0.00/0.14 g(mark(X:S)) -> g(X:S) 0.00/0.14 mark(f(X1:S,X2:S)) -> active(f(mark(X1:S),X2:S)) 0.00/0.14 mark(g(X:S)) -> active(g(mark(X:S))) 0.00/0.14 ->Strongly Connected Components: 0.00/0.14 There is no strongly connected component 0.00/0.14 0.00/0.14 The problem is finite. 0.00/0.14 EOF