/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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination of the given CSR could be proven:

(0) CSR
(1) CSRRRRProof [EQUIVALENT, 62 ms]
(2) CSR
(3) CSRRRRProof [EQUIVALENT, 0 ms]
(4) CSR
(5) CSRRRRProof [EQUIVALENT, 7 ms]
(6) CSR
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

(0)
Obligation:
Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(0) -> cons(0, f(s(0)))
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

The replacement map contains the following entries:

f: {1}
0: empty set
cons: {1}
s: {1}
p: {1}

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

(1) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(0) -> cons(0, f(s(0)))
   f(s(0)) -> f(p(s(0)))
   p(s(0)) -> 0

The replacement map contains the following entries:

f: {1}
0: empty set
cons: {1}
s: {1}
p: {1}
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 1
   POL(cons(x_1, x_2)) = 1 + x_1
   POL(f(x_1)) = 1 + x_1
   POL(p(x_1)) = x_1
   POL(s(x_1)) = 1 + x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   p(s(0)) -> 0




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

(2)
Obligation:
Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(0) -> cons(0, f(s(0)))
   f(s(0)) -> f(p(s(0)))

The replacement map contains the following entries:

f: {1}
0: empty set
cons: {1}
s: {1}
p: {1}

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

(3) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(0) -> cons(0, f(s(0)))
   f(s(0)) -> f(p(s(0)))

The replacement map contains the following entries:

f: {1}
0: empty set
cons: {1}
s: {1}
p: {1}
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 0
   POL(cons(x_1, x_2)) = x_1
   POL(f(x_1)) = 1 + 2*x_1
   POL(p(x_1)) = 2*x_1
   POL(s(x_1)) = x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   f(0) -> cons(0, f(s(0)))




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

(4)
Obligation:
Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(s(0)) -> f(p(s(0)))

The replacement map contains the following entries:

f: {1}
0: empty set
s: {1}
p: {1}

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

(5) CSRRRRProof (EQUIVALENT)
The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

   f(s(0)) -> f(p(s(0)))

The replacement map contains the following entries:

f: {1}
0: empty set
s: {1}
p: {1}
Used ordering:
Matrix interpretation [MATRO] to (N^2, +, *, >=, >) :

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

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

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

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

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   f(s(0)) -> f(p(s(0)))




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

(6)
Obligation:
Context-sensitive rewrite system:
R is empty.

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

(7) RisEmptyProof (EQUIVALENT)
The CSR R is empty. Hence, termination is trivially proven.
----------------------------------------

(8)
YES