TRS Inner 89993 pair #381733869

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	n073.star.cs.uiowa.edu
space	Transformed_CSR_innermost_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.4913468361 seconds
cpu usage	26.099044052
max memory	1.004838912E9

stage attributes

key	value
output-size	74036
starexec-result	NO

output

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


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


NO
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

(0) QTRS
(1) QTRSRRRProof [EQUIVALENT, 133 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 51 ms]
(4) QTRS
(5) DependencyPairsProof [EQUIVALENT, 0 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) QDP
(9) MRRProof [EQUIVALENT, 71 ms]
(10) QDP
(11) DependencyGraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) QDP
        (14) MRRProof [EQUIVALENT, 6 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, 1 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
                (49) QDPOrderProof [EQUIVALENT, 160 ms]
                (50) QDP
                (51) DependencyGraphProof [EQUIVALENT, 0 ms]
                (52) 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)

popout

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

job log

popout

actions all output return to TRS Inner 89993