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 x)
0.00/0.00	    (RULES
0.00/0.00	      c -> k(f(a))
0.00/0.00	      c -> k(g(b))
0.00/0.00	      h(x) -> k(x)
0.00/0.00	      h(f(a)) -> c
0.00/0.00	      a -> b
0.00/0.00	      f(x) -> g(x) | h(f(x)) == k(g(b))
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-19242-5_3 [49] Example B as join CTRS; correction of Cops #273 submitted by: Thomas Sternagel)
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)
0.00/0.00	    (RULES
0.00/0.00	      c -> k(f(a))
0.00/0.00	      c -> k(g(b))
0.00/0.00	      h(x) -> k(x)
0.00/0.00	      h(f(a)) -> c
0.00/0.00	      a -> b
0.00/0.00	      f(x) -> g(x) | h(f(x)) == k(g(b))
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-19242-5_3 [49] Example B as join CTRS; correction of Cops #273 submitted by: Thomas Sternagel)
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)
0.00/0.00	    (RULES
0.00/0.00	      c -> k(f(a))
0.00/0.00	      c -> k(g(b))
0.00/0.00	      h(x) -> k(x)
0.00/0.00	      h(f(a)) -> c
0.00/0.00	      a -> b
0.00/0.00	      f(x) -> g(x) | h(f(x)) == k(g(b))
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-19242-5_3 [49] Example B as join CTRS; correction of Cops #273 submitted by: Thomas Sternagel)
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)
0.00/0.00	    (RULES
0.00/0.00	      c -> k(f(a))
0.00/0.00	      c -> k(g(b))
0.00/0.00	      h(x) -> k(x)
0.00/0.00	      h(f(a)) -> c
0.00/0.00	      a -> b
0.00/0.00	      f(x) -> g(x) | h(f(x)) == k(g(b))
0.00/0.00	    )
0.00/0.00	    (COMMENT doi:10.1007/3-540-19242-5_3 [49] Example B as join CTRS; correction of Cops #273 submitted by: Thomas Sternagel)
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)
0.00/0.00	    (RULES
0.00/0.00	      c -> k(f(a))
0.00/0.00	      c -> k(g(b))
0.00/0.00	      h(x1) -> k(x1)
0.00/0.00	      h(f(a)) -> c
0.00/0.00	      a -> b
0.00/0.00	      f(x1) -> u1(h(f(x1)),x1)
0.00/0.00	      u1(k(g(b)),x1) -> g(x1)
0.00/0.00	    )
0.00/0.00	
0.00/0.00	U for 3DCTRSs is sound for the above CTRS.
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	Failed to prove operational termination of R.
0.00/0.00	
0.00/0.00	MAYBE
0.00/0.00	EOF