TRS Standard pair #487071213

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.48639 seconds
cpu usage	9.73868
user time	9.3214
system time	0.417281
max virtual memory	1.9211844E7
max residence set size	663920.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox2/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) QTRSRRRProof [EQUIVALENT, 110 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 30 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 23 ms]
(6) QTRS
(7) DependencyPairsProof [EQUIVALENT, 43 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) AND
    (11) QDP
        (12) UsableRulesProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) QDP
        (17) UsableRulesProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES
    (21) QDP
        (22) UsableRulesProof [EQUIVALENT, 0 ms]
        (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) UsableRulesProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (30) YES
    (31) QDP
        (32) UsableRulesProof [EQUIVALENT, 0 ms]
        (33) QDP
        (34) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (35) YES
    (36) QDP
        (37) UsableRulesProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (40) YES
    (41) QDP
        (42) MRRProof [EQUIVALENT, 50 ms]
        (43) QDP
        (44) MRRProof [EQUIVALENT, 47 ms]
        (45) QDP
        (46) MRRProof [EQUIVALENT, 54 ms]
        (47) QDP
        (48) TransformationProof [EQUIVALENT, 0 ms]
        (49) QDP
        (50) DependencyGraphProof [EQUIVALENT, 0 ms]
        (51) QDP
        (52) QDPOrderProof [EQUIVALENT, 102 ms]
        (53) QDP
        (54) QDPOrderProof [EQUIVALENT, 49 ms]
        (55) QDP
        (56) QDPOrderProof [EQUIVALENT, 0 ms]
        (57) QDP
        (58) PisEmptyProof [EQUIVALENT, 0 ms]
        (59) YES


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

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

   active(nats) -> mark(adx(zeros))
   active(zeros) -> mark(cons(0, zeros))
   active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y)))
   active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y))))
   active(hd(cons(X, Y))) -> mark(X)
   active(tl(cons(X, Y))) -> mark(Y)
   mark(nats) -> active(nats)
   mark(adx(X)) -> active(adx(mark(X)))
   mark(zeros) -> active(zeros)
   mark(cons(X1, X2)) -> active(cons(X1, X2))
   mark(0) -> active(0)
   mark(incr(X)) -> active(incr(mark(X)))
   mark(s(X)) -> active(s(X))
   mark(hd(X)) -> active(hd(mark(X)))
   mark(tl(X)) -> active(tl(mark(X)))
   adx(mark(X)) -> adx(X)
   adx(active(X)) -> adx(X)
   cons(mark(X1), X2) -> cons(X1, X2)
   cons(X1, mark(X2)) -> cons(X1, X2)
   cons(active(X1), X2) -> cons(X1, X2)
   cons(X1, active(X2)) -> cons(X1, X2)
   incr(mark(X)) -> incr(X)
   incr(active(X)) -> incr(X)
   s(mark(X)) -> s(X)

popout

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

job log

popout

actions all output return to TRS Standard