/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRSRRRProof [EQUIVALENT, 34 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 23 ms]
(4) RelTRS
(5) RelTRSRRRProof [EQUIVALENT, 2 ms]
(6) RelTRS
(7) RIsEmptyProof [EQUIVALENT, 5 ms]
(8) YES


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

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

   f(x) -> s(x)
   f(s(s(x))) -> s(f(f(x)))

The relative TRS consists of the following S rules:

   rand(x) -> x
   rand(x) -> rand(s(x))


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

(1) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Polynomial interpretation [POLO]:

   POL(f(x_1)) = x_1
   POL(rand(x_1)) = 1 + x_1
   POL(s(x_1)) = x_1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:
none
Rules from S:

   rand(x) -> x




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

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

   f(x) -> s(x)
   f(s(s(x))) -> s(f(f(x)))

The relative TRS consists of the following S rules:

   rand(x) -> rand(s(x))


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

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

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

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

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

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

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




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

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

   f(x) -> s(x)

The relative TRS consists of the following S rules:

   rand(x) -> rand(s(x))


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

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

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

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

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

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

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




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

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

   rand(x) -> rand(s(x))


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

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

(8)
YES