YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) DependencyPairsProof [EQUIVALENT, 6 ms]
(2) QDP
(3) QDPOrderProof [EQUIVALENT, 125 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) QDP
(7) QDPOrderProof [EQUIVALENT, 85 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) TRUE


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

(0)
Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:

   a(x1) -> b(b(x1))
   c(b(x1)) -> d(x1)
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(a(x1)) -> f(x1)

Q is empty.

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

(1) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(2)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   C(b(x1)) -> D(x1)
   E(b(x1)) -> C(c(x1))
   E(b(x1)) -> C(x1)
   D(b(x1)) -> F(x1)
   F(x1) -> A(e(x1))
   F(x1) -> E(x1)
   A(a(x1)) -> F(x1)

The TRS R consists of the following rules:

   a(x1) -> b(b(x1))
   c(b(x1)) -> d(x1)
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(a(x1)) -> f(x1)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(3) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   C(b(x1)) -> D(x1)
The remaining pairs can at least be oriented weakly.
Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

   <<<
 POL(C(x_1)) =  	[[-I]] 	 +  	[[0A, 0A, 0A]] 	* 	x_1
>>>

   <<<
 POL(b(x_1)) =  	[[0A], [1A], [0A]] 	 +  	[[0A, 0A, 0A], [0A, 0A, 1A], [0A, -I, 0A]] 	* 	x_1
>>>

   <<<
 POL(D(x_1)) =  	[[0A]] 	 +  	[[-I, -I, 0A]] 	* 	x_1
>>>

   <<<
 POL(E(x_1)) =  	[[0A]] 	 +  	[[0A, -I, 0A]] 	* 	x_1
>>>

   <<<
 POL(c(x_1)) =  	[[-I], [-I], [-I]] 	 +  	[[0A, 0A, 0A], [0A, 0A, 0A], [0A, 0A, 0A]] 	* 	x_1
>>>

   <<<
 POL(F(x_1)) =  	[[0A]] 	 +  	[[0A, -I, 0A]] 	* 	x_1
>>>

   <<<
 POL(A(x_1)) =  	[[0A]] 	 +  	[[0A, -I, 0A]] 	* 	x_1
>>>

   <<<
 POL(e(x_1)) =  	[[0A], [-I], [-I]] 	 +  	[[0A, -I, -I], [0A, -I, -I], [0A, -I, 0A]] 	* 	x_1
>>>

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

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

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


The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   c(b(x1)) -> d(x1)
   c(x1) -> x1
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   a(a(x1)) -> f(x1)
   f(x1) -> a(e(x1))
   a(x1) -> b(b(x1))


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

(4)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   E(b(x1)) -> C(c(x1))
   E(b(x1)) -> C(x1)
   D(b(x1)) -> F(x1)
   F(x1) -> A(e(x1))
   F(x1) -> E(x1)
   A(a(x1)) -> F(x1)

The TRS R consists of the following rules:

   a(x1) -> b(b(x1))
   c(b(x1)) -> d(x1)
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(a(x1)) -> f(x1)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(5) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 4 less nodes.
----------------------------------------

(6)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   F(x1) -> A(e(x1))
   A(a(x1)) -> F(x1)

The TRS R consists of the following rules:

   a(x1) -> b(b(x1))
   c(b(x1)) -> d(x1)
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(a(x1)) -> f(x1)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(7) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   F(x1) -> A(e(x1))
The remaining pairs can at least be oriented weakly.
Used ordering:  Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

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

   <<<
 POL(A(x_1)) =  	[[-I]] 	 +  	[[0A, -I, -I]] 	* 	x_1
>>>

   <<<
 POL(e(x_1)) =  	[[0A], [-I], [0A]] 	 +  	[[-I, -I, 0A], [-I, 0A, 0A], [-I, 0A, 0A]] 	* 	x_1
>>>

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

   <<<
 POL(b(x_1)) =  	[[0A], [0A], [0A]] 	 +  	[[-I, 1A, 0A], [-I, -I, 0A], [0A, 0A, 0A]] 	* 	x_1
>>>

   <<<
 POL(c(x_1)) =  	[[0A], [0A], [0A]] 	 +  	[[0A, 0A, 0A], [0A, 0A, 0A], [0A, -I, 0A]] 	* 	x_1
>>>

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

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


The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

   e(b(x1)) -> c(c(x1))
   c(b(x1)) -> d(x1)
   d(b(x1)) -> b(f(x1))
   a(a(x1)) -> f(x1)
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(x1) -> b(b(x1))


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

(8)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   A(a(x1)) -> F(x1)

The TRS R consists of the following rules:

   a(x1) -> b(b(x1))
   c(b(x1)) -> d(x1)
   e(b(x1)) -> c(c(x1))
   d(b(x1)) -> b(f(x1))
   f(x1) -> a(e(x1))
   c(x1) -> x1
   a(a(x1)) -> f(x1)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(9) DependencyGraphProof (EQUIVALENT)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
----------------------------------------

(10)
TRUE