The TRS could be proven terminating. The proof took 19 ms.
Problem 1 was processed with processor SubtermCriterion (1ms).
| if#(if(x, y, z), u, v) | → | if#(y, u, v) | if#(if(x, y, z), u, v) | → | if#(z, u, v) | |
| if#(if(x, y, z), u, v) | → | if#(x, if(y, u, v), if(z, u, v)) |
| if(true, x, y) | → | x | if(false, x, y) | → | y | |
| if(x, y, y) | → | y | if(if(x, y, z), u, v) | → | if(x, if(y, u, v), if(z, u, v)) |
Termination of terms over the following signature is verified: v, u, if, true, false
The following projection was used:
Thus, the following dependency pairs are removed:
| if#(if(x, y, z), u, v) | → | if#(y, u, v) | if#(if(x, y, z), u, v) | → | if#(z, u, v) | |
| if#(if(x, y, z), u, v) | → | if#(x, if(y, u, v), if(z, u, v)) |