/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) 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:

   or(true, y) -> true
   or(x, true) -> true
   or(false, false) -> false
   mem(x, nil) -> false
   mem(x, set(y)) -> =(x, y)
   mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))

Q is empty.

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

(1) QTRSRRRProof (EQUIVALENT)
Used ordering:
or/2(YES,YES)
true/0)
false/0)
mem/2(YES,YES)
nil/0)
set/1)YES(
=/2(YES,YES)
union/2(YES,YES)

Quasi precedence:
[mem_2, =_2] > or_2 > [true, false, nil]
union_2 > or_2 > [true, false, nil]


Status:
or_2: [2,1]
true: multiset status
false: multiset status
mem_2: [1,2]
nil: multiset status
=_2: [1,2]
union_2: [2,1]

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

   or(true, y) -> true
   or(x, true) -> true
   or(false, false) -> false
   mem(x, nil) -> false
   mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))




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

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

   mem(x, set(y)) -> =(x, y)

Q is empty.

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

(3) QTRSRRRProof (EQUIVALENT)
Used ordering:
mem/2(YES,YES)
set/1)YES(
=/2(YES,YES)

Quasi precedence:
mem_2 > =_2


Status:
mem_2: 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:

   mem(x, set(y)) -> =(x, y)




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

(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