/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

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


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

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

   sqr(0) -> 0
   sqr(s(x)) -> +(sqr(x), s(double(x)))
   double(0) -> 0
   double(s(x)) -> s(s(double(x)))
   +(x, 0) -> x
   +(x, s(y)) -> s(+(x, y))
   sqr(s(x)) -> s(+(sqr(x), double(x)))

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
Quasi precedence:
[sqr_1, double_1] > 0
[sqr_1, double_1] > +_2 > s_1


Status:
sqr_1: multiset status
0: multiset status
s_1: multiset status
+_2: [1,2]
double_1: multiset status

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

   sqr(0) -> 0
   sqr(s(x)) -> +(sqr(x), s(double(x)))
   double(0) -> 0
   double(s(x)) -> s(s(double(x)))
   +(x, 0) -> x
   +(x, s(y)) -> s(+(x, y))
   sqr(s(x)) -> s(+(sqr(x), double(x)))




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

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

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

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

(4)
YES