YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRSRRRProof [EQUIVALENT, 48 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 11 ms]
(4) RelTRS
(5) RIsEmptyProof [EQUIVALENT, 2 ms]
(6) YES


----------------------------------------

(0)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:

   f(g(x), y, z) -> f(x, y, g(z))

The relative TRS consists of the following S rules:

   f(x, y, g(z)) -> f(x, g(y), z)
   f(x, a, z) -> f(x, g(a), z)
   f(x, y, z) -> f(x, y, g(z))


----------------------------------------

(1) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

   <<<
 POL(f(x_1, x_2, x_3)) =  	[[0], [0]] 	 +  	[[1, 0], [1, 0]] 	* 	x_1 	 +  	[[1, 1], [0, 0]] 	* 	x_2 	 +  	[[1, 0], [1, 0]] 	* 	x_3
>>>

   <<<
 POL(g(x_1)) =  	[[0], [0]] 	 +  	[[1, 0], [0, 0]] 	* 	x_1
>>>

   <<<
 POL(a) =  	[[0], [1]]
>>>

With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
none
Rules from S:

   f(x, a, z) -> f(x, g(a), z)




----------------------------------------

(2)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:

   f(g(x), y, z) -> f(x, y, g(z))

The relative TRS consists of the following S rules:

   f(x, y, g(z)) -> f(x, g(y), z)
   f(x, y, z) -> f(x, y, g(z))


----------------------------------------

(3) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

   <<<
 POL(f(x_1, x_2, x_3)) =  	[[0], [0]] 	 +  	[[1, 1], [1, 1]] 	* 	x_1 	 +  	[[1, 0], [1, 0]] 	* 	x_2 	 +  	[[1, 0], [1, 0]] 	* 	x_3
>>>

   <<<
 POL(g(x_1)) =  	[[0], [1]] 	 +  	[[1, 0], [0, 1]] 	* 	x_1
>>>

With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:

   f(g(x), y, z) -> f(x, y, g(z))
Rules from S:
none




----------------------------------------

(4)
Obligation:
Relative term rewrite system:
R is empty.
The relative TRS consists of the following S rules:

   f(x, y, g(z)) -> f(x, g(y), z)
   f(x, y, z) -> f(x, y, g(z))


----------------------------------------

(5) RIsEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(6)
YES