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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRSRRRProof [EQUIVALENT, 59 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 7 ms]
(4) RelTRS
(5) RelTRSRRRProof [EQUIVALENT, 15 ms]
(6) RelTRS
(7) RelTRSRRRProof [EQUIVALENT, 7 ms]
(8) RelTRS
(9) RelTRSRRRProof [EQUIVALENT, 3 ms]
(10) RelTRS
(11) RIsEmptyProof [EQUIVALENT, 1 ms]
(12) YES


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

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

   g(c(x, s(y))) -> g(c(s(x), y))
   f(c(s(x), y)) -> f(c(x, s(y)))
   f(f(x)) -> f(d(f(x)))
   f(x) -> 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(c(x_1, x_2)) = x_1 + x_2
   POL(d(x_1)) = x_1
   POL(f(x_1)) = 1 + x_1
   POL(g(x_1)) = x_1
   POL(rand(x_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:

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




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

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

   g(c(x, s(y))) -> g(c(s(x), y))
   f(c(s(x), y)) -> f(c(x, s(y)))
   f(f(x)) -> f(d(f(x)))

The relative TRS consists of the following S rules:

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


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

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

   POL(c(x_1, x_2)) = x_1 + x_2
   POL(d(x_1)) = x_1
   POL(f(x_1)) = x_1
   POL(g(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




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

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

   g(c(x, s(y))) -> g(c(s(x), y))
   f(c(s(x), y)) -> f(c(x, s(y)))
   f(f(x)) -> f(d(f(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(g(x_1)) =  	[[0], [0]] 	 +  	[[1, 0], [0, 0]] 	* 	x_1
>>>

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

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

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

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

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

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

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




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

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

   g(c(x, s(y))) -> g(c(s(x), y))
   f(c(s(x), y)) -> f(c(x, s(y)))

The relative TRS consists of the following S rules:

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


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

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

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

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

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

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

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

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

   g(c(x, s(y))) -> g(c(s(x), y))
Rules from S:
none




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

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

   f(c(s(x), y)) -> f(c(x, s(y)))

The relative TRS consists of the following S rules:

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


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

(9) 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, 0]] 	* 	x_1
>>>

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

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

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

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

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




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

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

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


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

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

(12)
YES