/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, 62 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 12 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) RisEmptyProof [EQUIVALENT, 0 ms]
(8) YES


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

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

   app(nil, y) -> y
   app(add(n, x), y) -> add(n, app(x, y))
   reverse(nil) -> nil
   reverse(add(n, x)) -> app(reverse(x), add(n, nil))
   shuffle(nil) -> nil
   shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))

Q is empty.

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

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

   POL(add(x_1, x_2)) = 2 + 2*x_1 + x_2
   POL(app(x_1, x_2)) = x_1 + x_2
   POL(nil) = 0
   POL(reverse(x_1)) = x_1
   POL(shuffle(x_1)) = 2 + 2*x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   shuffle(nil) -> nil
   shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))




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

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

   app(nil, y) -> y
   app(add(n, x), y) -> add(n, app(x, y))
   reverse(nil) -> nil
   reverse(add(n, x)) -> app(reverse(x), add(n, nil))

Q is empty.

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

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

   POL(add(x_1, x_2)) = 2*x_1 + x_2
   POL(app(x_1, x_2)) = x_1 + x_2
   POL(nil) = 0
   POL(reverse(x_1)) = 2 + x_1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

   reverse(nil) -> nil




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

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

   app(nil, y) -> y
   app(add(n, x), y) -> add(n, app(x, y))
   reverse(add(n, x)) -> app(reverse(x), add(n, nil))

Q is empty.

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

(5) QTRSRRRProof (EQUIVALENT)
Used ordering:
Quasi precedence:
reverse_1 > app_2 > add_2
reverse_1 > nil > add_2


Status:
app_2: multiset status
nil: multiset status
add_2: multiset status
reverse_1: [1]

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

   app(nil, y) -> y
   app(add(n, x), y) -> add(n, app(x, y))
   reverse(add(n, x)) -> app(reverse(x), add(n, nil))




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

(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