/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


Quasi decreasingness of the given CTRS could be proven:

(0) CTRS
(1) CTRSToQTRSProof [SOUND, 0 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 56 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   h(c) -> d

The conditional TRS C consists of the following conditional rules:

   f(x, y) -> z <= x -> z
   g(x) -> b <= h(x) -> d


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

(1) CTRSToQTRSProof (SOUND)
The conditional rules have been transormed into unconditional rules according to [CTRS,AAECCNOC].
----------------------------------------

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

   f(x, y) -> U1(x)
   U1(z) -> z
   g(x) -> U2(h(x))
   U2(d) -> b
   h(c) -> d

Q is empty.

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

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

   POL(U1(x_1)) = 2 + 2*x_1
   POL(U2(x_1)) = 2*x_1
   POL(b) = 2
   POL(c) = 1
   POL(d) = 1
   POL(f(x_1, x_2)) = 2 + 2*x_1 + x_2
   POL(g(x_1)) = 2 + 2*x_1
   POL(h(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:

   U1(z) -> z
   h(c) -> d




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

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

   f(x, y) -> U1(x)
   g(x) -> U2(h(x))
   U2(d) -> b

Q is empty.

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

(5) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:g_1 > U2_1 > b > d > h_1 > f_2 > U1_1

and weight map:

   d=1
   b=2
   U1_1=1
   g_1=2
   U2_1=1
   h_1=1
   f_2=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:

   f(x, y) -> U1(x)
   g(x) -> U2(h(x))
   U2(d) -> b




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

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

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

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

(8)
YES