The TRS could be proven terminating. The proof took 20 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(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: if
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)) |