TRS Standard pair #516962030

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	4.03170990944 seconds
cpu usage	12.258487585
max memory	8.28452864E8

stage attributes

key	value
output-size	41077
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: 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) UsableRulesProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (34) YES
    (35) QDP
        (36) QDPOrderProof [EQUIVALENT, 171 ms]
        (37) QDP
        (38) QDPOrderProof [EQUIVALENT, 156 ms]
        (39) QDP
        (40) QDPOrderProof [EQUIVALENT, 34 ms]
        (41) QDP
        (42) QDPOrderProof [EQUIVALENT, 0 ms]
        (43) QDP
        (44) DependencyGraphProof [EQUIVALENT, 0 ms]
        (45) TRUE


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

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

   active(eq(0, 0)) -> mark(true)
   active(eq(s(X), s(Y))) -> mark(eq(X, Y))
   active(eq(X, Y)) -> mark(false)
   active(inf(X)) -> mark(cons(X, inf(s(X))))
   active(take(0, X)) -> mark(nil)
   active(take(s(X), cons(Y, L))) -> mark(cons(Y, take(X, L)))
   active(length(nil)) -> mark(0)
   active(length(cons(X, L))) -> mark(s(length(L)))
   mark(eq(X1, X2)) -> active(eq(X1, X2))
   mark(0) -> active(0)
   mark(true) -> active(true)
   mark(s(X)) -> active(s(X))
   mark(false) -> active(false)
   mark(inf(X)) -> active(inf(mark(X)))
   mark(cons(X1, X2)) -> active(cons(X1, X2))
   mark(take(X1, X2)) -> active(take(mark(X1), mark(X2)))
   mark(nil) -> active(nil)
   mark(length(X)) -> active(length(mark(X)))
   eq(mark(X1), X2) -> eq(X1, X2)
   eq(X1, mark(X2)) -> eq(X1, X2)
   eq(active(X1), X2) -> eq(X1, X2)
   eq(X1, active(X2)) -> eq(X1, X2)
   s(mark(X)) -> s(X)
   s(active(X)) -> s(X)
   inf(mark(X)) -> inf(X)
   inf(active(X)) -> inf(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)
   take(mark(X1), X2) -> take(X1, X2)
   take(X1, mark(X2)) -> take(X1, X2)

popout

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

job log

popout

actions all output return to TRS Standard