TRS Stand 20472 pair #381715852

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	n072.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.3507900238 seconds
cpu usage	23.164404001
max memory	9.89446144E8

stage attributes

key	value
output-size	48127
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, 112 ms]
(2) QTRS
(3) QTRSRRRProof [EQUIVALENT, 38 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 16 ms]
(8) QTRS
(9) QTRSRRRProof [EQUIVALENT, 17 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, 39 ms]
        (41) QDP
        (42) QDPOrderProof [EQUIVALENT, 78 ms]
        (43) QDP
        (44) QDPOrderProof [EQUIVALENT, 40 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, 2 ms]
        (53) QDP
        (54) DependencyGraphProof [EQUIVALENT, 0 ms]
        (55) QDP
        (56) MRRProof [EQUIVALENT, 0 ms]
        (57) QDP
        (58) QDPOrderProof [EQUIVALENT, 119 ms]
        (59) QDP
        (60) QDPOrderProof [EQUIVALENT, 86 ms]
        (61) QDP
        (62) NonTerminationLoopProof [COMPLETE, 77 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)

popout

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

job log

popout

actions all output return to TRS Stand 20472