0.00/0.00	MAYBE
0.00/0.00	
0.00/0.00	
0.00/0.00	Succeeded in reading "/export/starexec/sandbox2/benchmark/theBenchmark.trs".
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR y x\' x x\'\')
0.00/0.00	    (RULES
0.00/0.00	      f(x,x\') -> g(y,y) | x == y, x\' == y
0.00/0.00	      h(x,x\',x\'\') -> c | x == y, x\' == y, x\'\' == y
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-60381-6_19 [71] Example 1 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 y x\' x x\'\')
0.00/0.00	    (RULES
0.00/0.00	      f(x,x\') -> g(y,y) | x == y, x\' == y
0.00/0.00	      h(x,x\',x\'\') -> c | x == y, x\' == y, x\'\' == y
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-60381-6_19 [71] Example 1 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 y x\' x x\'\')
0.00/0.00	    (RULES
0.00/0.00	      f(x,x\') -> g(y,y) | x == y, x\' == y
0.00/0.00	      h(x,x\',x\'\') -> c | x == y, x\' == y, x\'\' == y
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-60381-6_19 [71] Example 1 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 y x\' x x\'\')
0.00/0.00	    (RULES
0.00/0.00	      f(x,x\') -> g(y,y) | x == y, x\' == y
0.00/0.00	      h(x,x\',x\'\') -> c | x == y, x\' == y, x\'\' == y
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-60381-6_19 [71] Example 1 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 x2 x1 x3 x4)
0.00/0.00	    (RULES
0.00/0.00	      f(x1,x2) -> u1(x1,x1,x2)
0.00/0.00	      u1(x3,x1,x2) -> u2(x2,x3,x1,x2)
0.00/0.00	      u2(x3,x3,x1,x2) -> g(x3,x3)
0.00/0.00	      h(x1,x2,x3) -> u3(x1,x1,x2,x3)
0.00/0.00	      u3(x4,x1,x2,x3) -> u4(x2,x4,x1,x2,x3)
0.00/0.00	      u4(x4,x4,x1,x2,x3) -> u5(x3,x4,x1,x2,x3)
0.00/0.00	      u5(x4,x4,x1,x2,x3) -> c
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