0.00/0.00	YES
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 y x x1)
0.00/0.00	    (RULES
0.00/0.00	      f(c(x),c(c(y))) -> a(a(x)) | c(f(x,y)) == c(a(b))
0.00/0.00	      f(c(c(c(x))),y) -> a(y) | c(f(c(x),c(c(y)))) == c(a(a(b)))
0.00/0.00	      h(b) -> b
0.00/0.00	      h(a(a(x))) -> a(b) | h(x) == b
0.00/0.00	    )
0.00/0.00	    (COMMENT COPS 440)
0.00/0.00	    (COMMENT submitted by: Naoki Nishida)
0.00/0.00	
0.00/0.00	No "->="-rules.
0.00/0.00	
0.00/0.00	Decomposed conditions and removed infeasible rules if possible.
0.00/0.00	    (CONDITIONTYPE ORIENTED)
0.00/0.00	    (VAR y x x1)
0.00/0.00	    (RULES
0.00/0.00	      h(b) -> b
0.00/0.00	      h(a(a(x))) -> a(b) | h(x) == b
0.00/0.00	    )
0.00/0.00	    (COMMENT COPS 440)
0.00/0.00	    (COMMENT submitted by: Naoki Nishida)
0.00/0.00	
0.00/0.00	(VAR y x1)
0.00/0.00	(CONDITION 
0.00/0.00	c(f(c(c(x1)),y)) == c(a(b)), c(f(c(x1),c(c(c(c(y)))))) == c(a(a(b)))
0.00/0.00	)
0.00/0.00	
0.00/0.00	Optimized the infeasibility problem if possible.
0.00/0.00	
0.00/0.00	(VAR y x1)
0.00/0.00	(CONDITION 
0.00/0.00	f(c(c(x1)),y) == a(b), f(c(x1),c(c(c(c(y))))) == a(a(b))
0.00/0.00	)
0.00/0.00	
0.00/0.00	This is ultra-RL and deterministic.
0.00/0.00	
0.00/0.00	This is operationally terminating and confluent.
0.00/0.00	
0.00/0.00	(RTG_of_NARROWINGTREE
0.00/0.00	(START
0.00/0.00	  Gamma[f(c(c(x1)),y) == a(b) : { e, 1, 1.1, 1.1.1 } & f(c(x1),c(c(c(c(y))))) == a(a(b)) : { e, 1, 1.1, 1.2, 1.2.1, 1.2.1.1, 1.2.1.1.1 }]
0.00/0.00	)
0.00/0.00	(NONTERMINALS
0.00/0.00	  Gamma[f(c(c(x1)),y) == a(b) : { e, 1, 1.1, 1.1.1 } & f(c(x1),c(c(c(c(y))))) == a(a(b)) : { e, 1, 1.1, 1.2, 1.2.1, 1.2.1.1, 1.2.1.1.1 }]
0.00/0.00	)
0.00/0.00	(RULES
0.00/0.00	  Gamma[f(c(c(x1)),y) == a(b) : { e, 1, 1.1, 1.1.1 } & f(c(x1),c(c(c(c(y))))) == a(a(b)) : { e, 1, 1.1, 1.2, 1.2.1, 1.2.1.1, 1.2.1.1.1 }] -> EmptySet
0.00/0.00	)
0.00/0.00	)
0.00/0.00	
0.00/0.00	YES
0.00/0.00	EOF