0.00/0.00	MAYBE
0.00/0.00	
0.00/0.00	
0.00/0.00	Succeeded in reading "/export/starexec/sandbox/benchmark/theBenchmark.trs".
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y)
0.00/0.00	    (RULES
0.00/0.00	      a -> c
0.00/0.00	      a -> d
0.00/0.00	      b -> c
0.00/0.00	      b -> d
0.00/0.00	      c -> e
0.00/0.00	      d -> e
0.00/0.00	      k -> e
0.00/0.00	      l -> e
0.00/0.00	      s(c) -> t(k)
0.00/0.00	      s(c) -> t(l)
0.00/0.00	      s(e) -> t(e)
0.00/0.00	      g(x,x) -> h(x,x)
0.00/0.00	      f(x) -> pair(x,y) | s(x) == t(y)
0.00/0.00	    )
0.00/0.00	    (COMMENT [75] Example 23 submitted by: Thomas Sternagel and Aart Middeldorp)
0.00/0.00	
0.00/0.00	No "->="-rules.
0.00/0.00	
0.00/0.00	Decomposed conditions if possible.
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y)
0.00/0.00	    (RULES
0.00/0.00	      a -> c
0.00/0.00	      a -> d
0.00/0.00	      b -> c
0.00/0.00	      b -> d
0.00/0.00	      c -> e
0.00/0.00	      d -> e
0.00/0.00	      k -> e
0.00/0.00	      l -> e
0.00/0.00	      s(c) -> t(k)
0.00/0.00	      s(c) -> t(l)
0.00/0.00	      s(e) -> t(e)
0.00/0.00	      g(x,x) -> h(x,x)
0.00/0.00	      f(x) -> pair(x,y) | s(x) == t(y)
0.00/0.00	    )
0.00/0.00	    (COMMENT [75] Example 23 submitted by: Thomas Sternagel and Aart Middeldorp)
0.00/0.00	
0.00/0.00	Removed infeasible rules as much as possible.
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y)
0.00/0.00	    (RULES
0.00/0.00	      a -> c
0.00/0.00	      a -> d
0.00/0.00	      b -> c
0.00/0.00	      b -> d
0.00/0.00	      c -> e
0.00/0.00	      d -> e
0.00/0.00	      k -> e
0.00/0.00	      l -> e
0.00/0.00	      s(c) -> t(k)
0.00/0.00	      s(c) -> t(l)
0.00/0.00	      s(e) -> t(e)
0.00/0.00	      g(x,x) -> h(x,x)
0.00/0.00	      f(x) -> pair(x,y) | s(x) == t(y)
0.00/0.00	    )
0.00/0.00	    (COMMENT [75] Example 23 submitted by: Thomas Sternagel and Aart Middeldorp)
0.00/0.00	
0.00/0.00	Try to disprove confluence of the following (C)TRS:
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR x y)
0.00/0.00	    (RULES
0.00/0.00	      a -> c
0.00/0.00	      a -> d
0.00/0.00	      b -> c
0.00/0.00	      b -> d
0.00/0.00	      c -> e
0.00/0.00	      d -> e
0.00/0.00	      k -> e
0.00/0.00	      l -> e
0.00/0.00	      s(c) -> t(k)
0.00/0.00	      s(c) -> t(l)
0.00/0.00	      s(e) -> t(e)
0.00/0.00	      g(x,x) -> h(x,x)
0.00/0.00	      f(x) -> pair(x,y) | s(x) == t(y)
0.00/0.00	    )
0.00/0.00	    (COMMENT [75] Example 23 submitted by: Thomas Sternagel and Aart Middeldorp)
0.00/0.00	
0.00/0.00	Failed either to apply SR and U for normal 1CTRSs to the above CTRS or to prove confluence of any converted TRSs.
0.00/0.00	
0.00/0.00	Try to apply SR and U for 3DCTRSs to the above CTRS.
0.00/0.00	
0.00/0.00	Succeeded in applying U for 3DCTRSs to the above CTRS.
0.00/0.00	U(R) =
0.00/0.00	    (VAR x1 x2)
0.00/0.00	    (RULES
0.00/0.00	      a -> c
0.00/0.00	      a -> d
0.00/0.00	      b -> c
0.00/0.00	      b -> d
0.00/0.00	      c -> e
0.00/0.00	      d -> e
0.00/0.00	      k -> e
0.00/0.00	      l -> e
0.00/0.00	      s(c) -> t(k)
0.00/0.00	      s(c) -> t(l)
0.00/0.00	      s(e) -> t(e)
0.00/0.00	      g(x1,x1) -> h(x1,x1)
0.00/0.00	      f(x1) -> u1(s(x1),x1)
0.00/0.00	      u1(t(x2),x1) -> pair(x1,x2)
0.00/0.00	    )
0.00/0.00	
0.00/0.00	Failed to prove confluence of U(R).
0.00/0.00	
0.00/0.00	Try to prove operational termination of R, i.e., termination of U(R).
0.00/0.00	
0.00/0.00	Succeeded in proving operational termination of R.
0.00/0.00	
0.00/0.00	Try to prove joinability of all (conditional) CPs.
0.00/0.00	
0.00/0.00	Failed to prove joinability of conditional CPs (via narrowing trees).
0.00/0.00	
0.00/0.00	MAYBE
0.00/0.00	EOF