0.00/0.03	YES
0.00/0.03	(ignored inputs)COMMENT doi:10.1007/978-3-540-31959-7_13 [67] Example 1 submitted by: Thomas Sternagel and Aart Middeldorp
0.00/0.03	Conditional Rewrite Rules:
0.00/0.03	   [ even(0) -> true,
0.00/0.03	     even(s(?x)) -> false | odd(?x) == false,
0.00/0.03	     even(s(?x)) -> true | odd(?x) == true,
0.00/0.03	     odd(0) -> false,
0.00/0.03	     odd(s(?x)) -> false | even(?x) == false,
0.00/0.03	     odd(s(?x)) -> true | even(?x) == true ]
0.00/0.03	Check whether all rules are type 3
0.00/0.03	OK
0.00/0.03	Check whether the input is deterministic
0.00/0.03	OK
0.00/0.03	Result of unraveling:
0.00/0.03	   [ even(0) -> true,
0.00/0.03	     even(s(?x)) -> U1(odd(?x),?x),
0.00/0.03	     U1(false,?x) -> false,
0.00/0.03	     U1(true,?x) -> true,
0.00/0.03	     odd(0) -> false,
0.00/0.03	     odd(s(?x)) -> U3(even(?x),?x),
0.00/0.03	     U3(false,?x) -> false,
0.00/0.03	     U3(true,?x) -> true ]
0.00/0.03	Check whether U(R) is terminating
0.00/0.03	OK
0.00/0.03	Check whether the input is weakly left-linear
0.00/0.03	OK
0.00/0.03	Check whether U(R) is confluent
0.00/0.03	OK
0.00/0.03	R is deterministic, weakly left-linear and U(R) is confluent
0.00/0.03	/export/starexec/sandbox2/benchmark/theBenchmark.trs: Success(CR)
0.00/0.03	(3 msec.)
0.00/0.03	EOF