TRS Standard pair #487072508

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	7.17114 seconds
cpu usage	19.3583
user time	18.1522
system time	1.20616
max virtual memory	2.0885772E7
max residence set size	2619224.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, 14 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 0 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) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (27) YES
    (28) QDP
        (29) UsableRulesProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) QReductionProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) TransformationProof [EQUIVALENT, 0 ms]
        (34) QDP
        (35) TransformationProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) TransformationProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) UsableRulesProof [EQUIVALENT, 0 ms]
        (40) QDP
        (41) QReductionProof [EQUIVALENT, 0 ms]
        (42) QDP
        (43) Induction-Processor [SOUND, 24 ms]
        (44) AND
            (45) QDP
                (46) PisEmptyProof [EQUIVALENT, 0 ms]
                (47) YES
            (48) QTRS
                (49) QTRSRRRProof [EQUIVALENT, 41 ms]
                (50) QTRS
                (51) QTRSRRRProof [EQUIVALENT, 1 ms]
                (52) QTRS
                (53) RisEmptyProof [EQUIVALENT, 0 ms]
                (54) YES


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

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

   double(0) -> 0
   double(s(x)) -> s(s(double(x)))
   del(x, nil) -> nil
   del(x, cons(y, xs)) -> if(eq(x, y), x, y, xs)
   if(true, x, y, xs) -> xs
   if(false, x, y, xs) -> cons(y, del(x, xs))
   eq(0, 0) -> true
   eq(0, s(y)) -> false
   eq(s(x), 0) -> false
   eq(s(x), s(y)) -> eq(x, y)
   first(nil) -> 0
   first(cons(x, xs)) -> x
   doublelist(nil) -> nil
   doublelist(cons(x, xs)) -> cons(double(x), doublelist(del(first(cons(x, xs)), cons(x, xs))))

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:

   double(0) -> 0

popout

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

job log

popout

actions all output return to TRS Standard