/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 w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 102 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) RisEmptyProof [EQUIVALENT, 0 ms]
(6) YES


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

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

   g(A) -> A
   g(B) -> A
   g(B) -> B
   g(C) -> A
   g(C) -> B
   g(C) -> C
   foldB(t, 0) -> t
   foldB(t, s(n)) -> f(foldB(t, n), B)
   foldC(t, 0) -> t
   foldC(t, s(n)) -> f(foldC(t, n), C)
   f(t, x) -> f'(t, g(x))
   f'(triple(a, b, c), C) -> triple(a, b, s(c))
   f'(triple(a, b, c), B) -> f(triple(a, b, c), A)
   f'(triple(a, b, c), A) -> f''(foldB(triple(s(a), 0, c), b))
   f''(triple(a, b, c)) -> foldC(triple(a, b, 0), c)

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Polynomial interpretation [POLO]:

   POL(0) = 0
   POL(A) = 2
   POL(B) = 2
   POL(C) = 2
   POL(f(x_1, x_2)) = x_1 + 2*x_2
   POL(f'(x_1, x_2)) = x_1 + 2*x_2
   POL(f''(x_1)) = x_1
   POL(foldB(x_1, x_2)) = x_1 + 2*x_2
   POL(foldC(x_1, x_2)) = x_1 + 2*x_2
   POL(g(x_1)) = x_1
   POL(s(x_1)) = 2 + x_1
   POL(triple(x_1, x_2, x_3)) = x_1 + 2*x_2 + 2*x_3
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   f'(triple(a, b, c), A) -> f''(foldB(triple(s(a), 0, c), b))




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

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

   g(A) -> A
   g(B) -> A
   g(B) -> B
   g(C) -> A
   g(C) -> B
   g(C) -> C
   foldB(t, 0) -> t
   foldB(t, s(n)) -> f(foldB(t, n), B)
   foldC(t, 0) -> t
   foldC(t, s(n)) -> f(foldC(t, n), C)
   f(t, x) -> f'(t, g(x))
   f'(triple(a, b, c), C) -> triple(a, b, s(c))
   f'(triple(a, b, c), B) -> f(triple(a, b, c), A)
   f''(triple(a, b, c)) -> foldC(triple(a, b, 0), c)

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:g_1 > A > f''_1 > foldC_2 > f_2 > f'_2 > triple_3 > s_1 > 0 > B > foldB_2 > C

and weight map:

   A=1
   B=2
   C=3
   0=2
   g_1=0
   s_1=3
   f''_1=3
   foldB_2=0
   f_2=0
   foldC_2=0
   f'_2=0
   triple_3=0

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

   g(A) -> A
   g(B) -> A
   g(B) -> B
   g(C) -> A
   g(C) -> B
   g(C) -> C
   foldB(t, 0) -> t
   foldB(t, s(n)) -> f(foldB(t, n), B)
   foldC(t, 0) -> t
   foldC(t, s(n)) -> f(foldC(t, n), C)
   f(t, x) -> f'(t, g(x))
   f'(triple(a, b, c), C) -> triple(a, b, s(c))
   f'(triple(a, b, c), B) -> f(triple(a, b, c), A)
   f''(triple(a, b, c)) -> foldC(triple(a, b, 0), c)




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

(4)
Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.

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

(5) RisEmptyProof (EQUIVALENT)
The TRS R is empty. Hence, termination is trivially proven.
----------------------------------------

(6)
YES