TRS Standard pair #516961400

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	n082.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	3.87587213516 seconds
cpu usage	11.758033513
max memory	8.29702144E8

stage attributes

key	value
output-size	47289
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


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

(0) QTRS
(1) DependencyPairsProof [EQUIVALENT, 67 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) QDP
        (6) UsableRulesProof [EQUIVALENT, 0 ms]
        (7) QDP
        (8) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (9) YES
    (10) QDP
        (11) UsableRulesProof [EQUIVALENT, 0 ms]
        (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (15) QDP
        (16) UsableRulesProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) UsableRulesProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (24) YES
    (25) QDP
        (26) UsableRulesProof [EQUIVALENT, 0 ms]
        (27) QDP
        (28) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (29) YES
    (30) QDP
        (31) UsableRulesProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (34) YES
    (35) QDP
        (36) QDPOrderProof [EQUIVALENT, 101 ms]
        (37) QDP
        (38) QDPOrderProof [EQUIVALENT, 25 ms]
        (39) QDP
        (40) QDPOrderProof [EQUIVALENT, 33 ms]
        (41) QDP
        (42) QDPOrderProof [EQUIVALENT, 7 ms]
        (43) QDP
        (44) DependencyGraphProof [EQUIVALENT, 0 ms]
        (45) QDP
        (46) UsableRulesProof [EQUIVALENT, 0 ms]
        (47) QDP
        (48) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (49) 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)))
   mark(zWadr(X1, X2)) -> active(zWadr(mark(X1), mark(X2)))
   mark(prefix(X)) -> active(prefix(mark(X)))
   app(mark(X1), X2) -> app(X1, X2)
   app(X1, mark(X2)) -> app(X1, X2)
   app(active(X1), X2) -> app(X1, X2)
   app(X1, active(X2)) -> app(X1, X2)
   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)
   from(mark(X)) -> from(X)
   from(active(X)) -> from(X)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
   zWadr(mark(X1), X2) -> zWadr(X1, X2)
   zWadr(X1, mark(X2)) -> zWadr(X1, X2)

popout

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

job log

popout

actions all output return to TRS Standard