TRS Standard pair #516963455

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	6.85722494125 seconds
cpu usage	22.735465841
max memory	1.23971584E9

stage attributes

key	value
output-size	49915
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, 0 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) QDPOrderProof [EQUIVALENT, 142 ms]
        (32) QDP
        (33) QDPOrderProof [EQUIVALENT, 88 ms]
        (34) QDP
        (35) QDPOrderProof [EQUIVALENT, 203 ms]
        (36) QDP
        (37) QDPOrderProof [EQUIVALENT, 164 ms]
        (38) QDP
        (39) QDPOrderProof [EQUIVALENT, 81 ms]
        (40) QDP
        (41) QDPOrderProof [EQUIVALENT, 144 ms]
        (42) QDP
        (43) QDPOrderProof [EQUIVALENT, 48 ms]
        (44) QDP
        (45) QDPOrderProof [EQUIVALENT, 7 ms]
        (46) QDP
        (47) QDPOrderProof [EQUIVALENT, 9 ms]
        (48) QDP
        (49) QDPOrderProof [EQUIVALENT, 83 ms]
        (50) QDP
        (51) QDPOrderProof [EQUIVALENT, 139 ms]
        (52) QDP
        (53) PisEmptyProof [EQUIVALENT, 0 ms]
        (54) YES


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

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

   active(2nd(cons1(X, cons(Y, Z)))) -> mark(Y)
   active(2nd(cons(X, X1))) -> mark(2nd(cons1(X, X1)))
   active(from(X)) -> mark(cons(X, from(s(X))))
   mark(2nd(X)) -> active(2nd(mark(X)))
   mark(cons1(X1, X2)) -> active(cons1(mark(X1), mark(X2)))
   mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
   mark(from(X)) -> active(from(mark(X)))
   mark(s(X)) -> active(s(mark(X)))
   2nd(mark(X)) -> 2nd(X)
   2nd(active(X)) -> 2nd(X)
   cons1(mark(X1), X2) -> cons1(X1, X2)
   cons1(X1, mark(X2)) -> cons1(X1, X2)
   cons1(active(X1), X2) -> cons1(X1, X2)
   cons1(X1, active(X2)) -> cons1(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)

popout

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

job log

popout

actions all output return to TRS Standard