TRS Standard pair #487068303

details

property	value
status	complete
benchmark	t002.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n182.star.cs.uiowa.edu
space	HirokawaMiddeldorp_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.15587 seconds
cpu usage	5.0091
user time	4.76968
system time	0.239426
max virtual memory	1.8544316E7
max residence set size	332240.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) Overlay + Local Confluence [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 14 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) QReductionProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) UsableRulesProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QReductionProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES
    (21) QDP
        (22) UsableRulesProof [EQUIVALENT, 0 ms]
        (23) QDP
        (24) QReductionProof [EQUIVALENT, 0 ms]
        (25) QDP
        (26) Induction-Processor [SOUND, 6 ms]
        (27) AND
            (28) QDP
                (29) PisEmptyProof [EQUIVALENT, 0 ms]
                (30) YES
            (31) QTRS
                (32) QTRSRRRProof [EQUIVALENT, 2 ms]
                (33) QTRS
                (34) RisEmptyProof [EQUIVALENT, 0 ms]
                (35) YES


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

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

   leq(0, y) -> true
   leq(s(x), 0) -> false
   leq(s(x), s(y)) -> leq(x, y)
   if(true, x, y) -> x
   if(false, x, y) -> y
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   mod(0, y) -> 0
   mod(s(x), 0) -> 0
   mod(s(x), s(y)) -> if(leq(y, x), mod(-(s(x), s(y)), s(y)), s(x))

Q is empty.

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

(1) Overlay + Local Confluence (EQUIVALENT)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
----------------------------------------

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

   leq(0, y) -> true
   leq(s(x), 0) -> false
   leq(s(x), s(y)) -> leq(x, y)
   if(true, x, y) -> x
   if(false, x, y) -> y
   -(x, 0) -> x
   -(s(x), s(y)) -> -(x, y)
   mod(0, y) -> 0
   mod(s(x), 0) -> 0
   mod(s(x), s(y)) -> if(leq(y, x), mod(-(s(x), s(y)), s(y)), s(x))

The set Q consists of the following terms:

   leq(0, x0)
   leq(s(x0), 0)
   leq(s(x0), s(x1))
   if(true, x0, x1)
   if(false, x0, x1)
   -(x0, 0)
   -(s(x0), s(x1))
   mod(0, x0)
   mod(s(x0), 0)
   mod(s(x0), s(x1))

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to TRS Standard