/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, 65 ms]
(2) QTRS
(3) RisEmptyProof [EQUIVALENT, 0 ms]
(4) YES


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

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

   f(0, y) -> y
   f(x, 0) -> x
   f(i(x), y) -> i(x)
   f(f(x, y), z) -> f(x, f(y, z))
   f(g(x, y), z) -> g(f(x, z), f(y, z))
   f(1, g(x, y)) -> x
   f(2, g(x, y)) -> y

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
f/2(YES,YES)
0/0)
i/1)YES(
g/2(YES,YES)
1/0)
2/0)

Quasi precedence:
f_2 > g_2
0 > g_2
1 > g_2
2 > g_2


Status:
f_2: [1,2]
0: multiset status
g_2: [1,2]
1: multiset status
2: multiset status

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

   f(0, y) -> y
   f(x, 0) -> x
   f(i(x), y) -> i(x)
   f(f(x, y), z) -> f(x, f(y, z))
   f(g(x, y), z) -> g(f(x, z), f(y, z))
   f(1, g(x, y)) -> x
   f(2, g(x, y)) -> y




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

(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