/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, 75 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:

   f(X) -> cons(X, n__f(g(X)))
   g(0) -> s(0)
   g(s(X)) -> s(s(g(X)))
   sel(0, cons(X, Y)) -> X
   sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
   f(X) -> n__f(X)
   activate(n__f(X)) -> f(X)
   activate(X) -> X

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
f/1(YES)
cons/2(YES,YES)
n__f/1)YES(
g/1(YES)
0/0)
s/1(YES)
sel/2(YES,YES)
activate/1(YES)

Quasi precedence:
sel_2 > [f_1, activate_1] > g_1 > 0 > cons_2
sel_2 > [f_1, activate_1] > g_1 > s_1 > cons_2


Status:
f_1: multiset status
cons_2: multiset status
g_1: multiset status
0: multiset status
s_1: multiset status
sel_2: [1,2]
activate_1: multiset status

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

   f(X) -> cons(X, n__f(g(X)))
   g(0) -> s(0)
   g(s(X)) -> s(s(g(X)))
   sel(0, cons(X, Y)) -> X
   sel(s(X), cons(Y, Z)) -> sel(X, activate(Z))
   f(X) -> n__f(X)
   activate(X) -> X




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

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

   activate(n__f(X)) -> f(X)

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
Knuth-Bendix order [KBO] with precedence:activate_1 > f_1 > n__f_1

and weight map:

   activate_1=1
   n__f_1=1
   f_1=2

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

   activate(n__f(X)) -> f(X)




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

(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