TRS Innermost pair #487093233

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.6446 seconds
cpu usage	21.3609
user time	20.6995
system time	0.661448
max virtual memory	3.6704636E7
max residence set size	993240.0

stage attributes

key	value
starexec-result	NO

output

NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 146 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 36 ms]
(4) QTRS
(5) DependencyPairsProof [EQUIVALENT, 14 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) QDP
(9) MRRProof [EQUIVALENT, 30 ms]
(10) QDP
(11) DependencyGraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) QDP
        (14) MRRProof [EQUIVALENT, 11 ms]
        (15) QDP
        (16) DependencyGraphProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) UsableRulesProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) QReductionProof [EQUIVALENT, 0 ms]
        (21) QDP
        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (23) YES
    (24) QDP
        (25) TransformationProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) DependencyGraphProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) TransformationProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) DependencyGraphProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) TransformationProof [EQUIVALENT, 0 ms]
        (34) QDP
        (35) TransformationProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) DependencyGraphProof [EQUIVALENT, 0 ms]
        (38) AND
            (39) QDP
                (40) UsableRulesProof [EQUIVALENT, 0 ms]
                (41) QDP
                (42) QReductionProof [EQUIVALENT, 0 ms]
                (43) QDP
                (44) TransformationProof [EQUIVALENT, 0 ms]
                (45) QDP
                (46) NonTerminationLoopProof [COMPLETE, 0 ms]
                (47) NO
            (48) QDP


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

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

   a__zeros -> cons(0, zeros)
   a__U11(tt, L) -> a__U12(tt, L)
   a__U12(tt, L) -> s(a__length(mark(L)))
   a__U21(tt, IL, M, N) -> a__U22(tt, IL, M, N)
   a__U22(tt, IL, M, N) -> a__U23(tt, IL, M, N)
   a__U23(tt, IL, M, N) -> cons(mark(N), take(M, IL))
   a__length(nil) -> 0
   a__length(cons(N, L)) -> a__U11(tt, L)
   a__take(0, IL) -> nil
   a__take(s(M), cons(N, IL)) -> a__U21(tt, IL, M, N)
   mark(zeros) -> a__zeros
   mark(U11(X1, X2)) -> a__U11(mark(X1), X2)
   mark(U12(X1, X2)) -> a__U12(mark(X1), X2)
   mark(length(X)) -> a__length(mark(X))
   mark(U21(X1, X2, X3, X4)) -> a__U21(mark(X1), X2, X3, X4)
   mark(U22(X1, X2, X3, X4)) -> a__U22(mark(X1), X2, X3, X4)
   mark(U23(X1, X2, X3, X4)) -> a__U23(mark(X1), X2, X3, X4)
   mark(take(X1, X2)) -> a__take(mark(X1), mark(X2))
   mark(cons(X1, X2)) -> cons(mark(X1), X2)
   mark(0) -> 0
   mark(tt) -> tt
   mark(s(X)) -> s(mark(X))
   mark(nil) -> nil
   a__zeros -> zeros
   a__U11(X1, X2) -> U11(X1, X2)
   a__U12(X1, X2) -> U12(X1, X2)
   a__length(X) -> length(X)
   a__U21(X1, X2, X3, X4) -> U21(X1, X2, X3, X4)
   a__U22(X1, X2, X3, X4) -> U22(X1, X2, X3, X4)
   a__U23(X1, X2, X3, X4) -> U23(X1, X2, X3, X4)
   a__take(X1, X2) -> take(X1, X2)

The set Q consists of the following terms:

   a__zeros

popout

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

job log

popout

actions all output return to TRS Innermost