TRS Innermost pair #487524503

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.13529682159 seconds
cpu usage	10.586656013
max memory	8.75020288E8

stage attributes

key	value
output-size	75214
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


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, 24 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) UsableRulesProof [EQUIVALENT, 0 ms]
        (35) QDP
        (36) QReductionProof [EQUIVALENT, 0 ms]
        (37) QDP
        (38) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (39) YES
    (40) QDP
        (41) UsableRulesProof [EQUIVALENT, 0 ms]
        (42) QDP
        (43) QReductionProof [EQUIVALENT, 0 ms]
        (44) QDP
        (45) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (46) YES
    (47) QDP
        (48) QDPQMonotonicMRRProof [EQUIVALENT, 141 ms]
        (49) QDP
        (50) QDPOrderProof [EQUIVALENT, 23 ms]
        (51) QDP
        (52) QDPOrderProof [EQUIVALENT, 0 ms]
        (53) QDP
        (54) QDPOrderProof [EQUIVALENT, 0 ms]
        (55) QDP
        (56) QDPOrderProof [EQUIVALENT, 0 ms]
        (57) QDP
        (58) DependencyGraphProof [EQUIVALENT, 0 ms]
        (59) QDP
        (60) UsableRulesProof [EQUIVALENT, 0 ms]
        (61) QDP
        (62) QReductionProof [EQUIVALENT, 0 ms]
        (63) QDP
        (64) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (65) YES


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

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

   active(app(nil, YS)) -> mark(YS)
   active(app(cons(X, XS), YS)) -> mark(cons(X, app(XS, YS)))
   active(from(X)) -> mark(cons(X, from(s(X))))
   active(zWadr(nil, YS)) -> mark(nil)
   active(zWadr(XS, nil)) -> mark(nil)
   active(zWadr(cons(X, XS), cons(Y, YS))) -> mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
   active(prefix(L)) -> mark(cons(nil, zWadr(L, prefix(L))))
   mark(app(X1, X2)) -> active(app(mark(X1), mark(X2)))
   mark(nil) -> active(nil)
   mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
   mark(from(X)) -> active(from(mark(X)))
   mark(s(X)) -> active(s(mark(X)))

popout

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

job log

popout

actions all output return to TRS Innermost