/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


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, 55 ms]
(2) RelTRS
(3) RIsEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

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

   f(g(x)) -> x

The relative TRS consists of the following S rules:

   a -> h(g(f(a)))


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

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

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

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

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

   <<<
 POL(h(x_1)) =  	[[0], [0]] 	 +  	[[2, 0], [0, 0]] 	* 	x_1
>>>

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

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




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

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

   a -> h(g(f(a)))


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

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

(4)
YES