/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, 30 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 8 ms]
(4) RelTRS
(5) RelTRSRRRProof [EQUIVALENT, 85 ms]
(6) RelTRS
(7) RIsEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   n(s(x1)) -> s(x1)
   o(s(x1)) -> s(x1)
   n(o(p(x1))) -> o(n(x1))

The relative TRS consists of the following S rules:

   t(x1) -> t(c(n(x1)))
   p(s(x1)) -> s(x1)
   o(n(x1)) -> n(o(x1))
   p(n(x1)) -> m(p(x1))
   p(m(x1)) -> m(p(x1))
   o(m(x1)) -> n(o(x1))
   n(p(x1)) -> p(n(x1))
   c(p(x1)) -> p(c(x1))
   c(m(x1)) -> m(c(x1))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)


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

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

   POL(c(x_1)) = x_1
   POL(m(x_1)) = x_1
   POL(n(x_1)) = x_1
   POL(o(x_1)) = 1 + x_1
   POL(p(x_1)) = x_1
   POL(s(x_1)) = x_1
   POL(t(x_1)) = x_1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:

   o(s(x1)) -> s(x1)
Rules from S:
none




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

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

   n(s(x1)) -> s(x1)
   n(o(p(x1))) -> o(n(x1))

The relative TRS consists of the following S rules:

   t(x1) -> t(c(n(x1)))
   p(s(x1)) -> s(x1)
   o(n(x1)) -> n(o(x1))
   p(n(x1)) -> m(p(x1))
   p(m(x1)) -> m(p(x1))
   o(m(x1)) -> n(o(x1))
   n(p(x1)) -> p(n(x1))
   c(p(x1)) -> p(c(x1))
   c(m(x1)) -> m(c(x1))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)


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

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

   POL(c(x_1)) = x_1
   POL(m(x_1)) = x_1
   POL(n(x_1)) = x_1
   POL(o(x_1)) = x_1
   POL(p(x_1)) = 1 + x_1
   POL(s(x_1)) = x_1
   POL(t(x_1)) = x_1
With this ordering the following rules can be removed [MATRO] because they are oriented strictly:
Rules from R:

   n(o(p(x1))) -> o(n(x1))
Rules from S:

   p(s(x1)) -> s(x1)




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

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

   n(s(x1)) -> s(x1)

The relative TRS consists of the following S rules:

   t(x1) -> t(c(n(x1)))
   o(n(x1)) -> n(o(x1))
   p(n(x1)) -> m(p(x1))
   p(m(x1)) -> m(p(x1))
   o(m(x1)) -> n(o(x1))
   n(p(x1)) -> p(n(x1))
   c(p(x1)) -> p(c(x1))
   c(m(x1)) -> m(c(x1))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)


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

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

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

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

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

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

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

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

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

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

   n(s(x1)) -> s(x1)
Rules from S:
none




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

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

   t(x1) -> t(c(n(x1)))
   o(n(x1)) -> n(o(x1))
   p(n(x1)) -> m(p(x1))
   p(m(x1)) -> m(p(x1))
   o(m(x1)) -> n(o(x1))
   n(p(x1)) -> p(n(x1))
   c(p(x1)) -> p(c(x1))
   c(m(x1)) -> m(c(x1))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)


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

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

(8)
YES