TRS Standard pair #487069903

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.85009 seconds
cpu usage	22.2018
user time	21.438
system time	0.763767
max virtual memory	1.8757208E7
max residence set size	1071752.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, 104 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 28 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 11 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 2 ms]
(8) QTRS
(9) QTRSRRRProof [EQUIVALENT, 13 ms]
(10) QTRS
(11) DependencyPairsProof [EQUIVALENT, 0 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) AND
    (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) UsableRulesProof [EQUIVALENT, 0 ms]
        (37) QDP
        (38) MRRProof [EQUIVALENT, 0 ms]
        (39) QDP
        (40) QDPOrderProof [EQUIVALENT, 61 ms]
        (41) QDP
        (42) QDPOrderProof [EQUIVALENT, 38 ms]
        (43) QDP
        (44) QDPOrderProof [EQUIVALENT, 37 ms]
        (45) QDP
        (46) DependencyGraphProof [EQUIVALENT, 0 ms]
        (47) QDP
        (48) QDPOrderProof [EQUIVALENT, 0 ms]
        (49) QDP
        (50) TransformationProof [EQUIVALENT, 0 ms]
        (51) QDP
        (52) TransformationProof [EQUIVALENT, 0 ms]
        (53) QDP
        (54) DependencyGraphProof [EQUIVALENT, 0 ms]
        (55) QDP
        (56) MRRProof [EQUIVALENT, 10 ms]
        (57) QDP
        (58) QDPOrderProof [EQUIVALENT, 129 ms]
        (59) QDP
        (60) QDPOrderProof [EQUIVALENT, 54 ms]
        (61) QDP
        (62) NonTerminationLoopProof [COMPLETE, 20 ms]
        (63) NO


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

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

   active(zeros) -> mark(cons(0, zeros))
   active(and(tt, X)) -> mark(X)
   active(length(nil)) -> mark(0)
   active(length(cons(N, L))) -> mark(s(length(L)))
   mark(zeros) -> active(zeros)
   mark(cons(X1, X2)) -> active(cons(mark(X1), X2))
   mark(0) -> active(0)
   mark(and(X1, X2)) -> active(and(mark(X1), X2))
   mark(tt) -> active(tt)
   mark(length(X)) -> active(length(mark(X)))
   mark(nil) -> active(nil)
   mark(s(X)) -> active(s(mark(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)
   and(mark(X1), X2) -> and(X1, X2)
   and(X1, mark(X2)) -> and(X1, X2)
   and(active(X1), X2) -> and(X1, X2)
   and(X1, active(X2)) -> and(X1, X2)

popout

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

job log

popout

actions all output return to TRS Standard