/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Quasi decreasingness of the given CTRS could be proven:

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


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

(0)
Obligation:
Conditional term rewrite system:
The TRS R is empty.
The conditional TRS C consists of the following conditional rules:

   f(x, x') -> g(y, y) <= x -> y, x' -> y
   h(x, x', x'') -> c <= x -> y, x' -> y, x'' -> y


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

(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, x') -> U1(x, x')
   U1(y, x') -> U2(x', y)
   U2(y, y) -> g(y, y)
   h(x, x', x'') -> U3(x, x', x'')
   U3(y, x', x'') -> U4(x', x'')
   U4(y, x'') -> U5(x'')
   U5(y) -> c

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:h_3 > U3_3 > U4_2 > U5_1 > c > f_2 > U1_2 > U2_2 > g_2

and weight map:

   c=3
   U5_1=2
   f_2=0
   U1_2=0
   U2_2=0
   g_2=0
   h_3=0
   U3_3=0
   U4_2=1

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, x') -> U1(x, x')
   U1(y, x') -> U2(x', y)
   U2(y, y) -> g(y, y)
   h(x, x', x'') -> U3(x, x', x'')
   U3(y, x', x'') -> U4(x', x'')
   U4(y, x'') -> U5(x'')
   U5(y) -> 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