TRS Innermost pair #487093095

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.92833 seconds
cpu usage	7.73284
user time	7.39505
system time	0.337795
max virtual memory	1.9410676E7
max residence set size	538824.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) DependencyPairsProof [EQUIVALENT, 0 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) QDP
        (6) UsableRulesProof [EQUIVALENT, 0 ms]
        (7) QDP
        (8) QReductionProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (11) YES
    (12) QDP
        (13) UsableRulesProof [EQUIVALENT, 0 ms]
        (14) QDP
        (15) QReductionProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES
    (19) QDP
        (20) UsableRulesProof [EQUIVALENT, 0 ms]
        (21) QDP
        (22) QReductionProof [EQUIVALENT, 0 ms]
        (23) QDP
        (24) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (25) YES
    (26) QDP
        (27) UsableRulesProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) QReductionProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (32) YES
    (33) QDP
        (34) MRRProof [EQUIVALENT, 45 ms]
        (35) QDP
        (36) QDPQMonotonicMRRProof [EQUIVALENT, 62 ms]
        (37) QDP
        (38) QDPOrderProof [EQUIVALENT, 17 ms]
        (39) QDP
        (40) DependencyGraphProof [EQUIVALENT, 0 ms]
        (41) AND
            (42) QDP
                (43) TransformationProof [EQUIVALENT, 0 ms]
                (44) QDP
                (45) QDPOrderProof [EQUIVALENT, 7 ms]
                (46) QDP
                (47) PisEmptyProof [EQUIVALENT, 0 ms]
                (48) YES
            (49) QDP
                (50) UsableRulesProof [EQUIVALENT, 0 ms]
                (51) QDP
                (52) QReductionProof [EQUIVALENT, 0 ms]
                (53) QDP
                (54) QDPSizeChangeProof [EQUIVALENT, 0 ms]
                (55) YES


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

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

   active(f(0)) -> mark(cons(0, f(s(0))))
   active(f(s(0))) -> mark(f(p(s(0))))
   active(p(s(0))) -> mark(0)
   mark(f(X)) -> active(f(mark(X)))
   mark(0) -> active(0)
   mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
   mark(s(X)) -> active(s(mark(X)))
   mark(p(X)) -> active(p(mark(X)))
   f(mark(X)) -> f(X)
   f(active(X)) -> f(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)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
   p(mark(X)) -> p(X)
   p(active(X)) -> p(X)

The set Q consists of the following terms:

   active(f(0))
   active(f(s(0)))
   active(p(s(0)))
   mark(f(x0))
   mark(0)
   mark(cons(x0, x1))
   mark(s(x0))

popout

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

job log

popout

actions all output return to TRS Innermost