TRS Standard pair #487070838

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	14.5183 seconds
cpu usage	44.3831
user time	42.9837
system time	1.3994
max virtual memory	1.8422024E7
max residence set size	3938240.0

stage attributes

key	value
starexec-result	NO

output

NO
proof of /export/starexec/sandbox2/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) 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) TransformationProof [EQUIVALENT, 0 ms]
        (12) QDP
        (13) TransformationProof [EQUIVALENT, 0 ms]
        (14) QDP
        (15) DependencyGraphProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) TransformationProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) TransformationProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) DependencyGraphProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) TransformationProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) DependencyGraphProof [EQUIVALENT, 0 ms]
        (26) QDP
        (27) TransformationProof [EQUIVALENT, 0 ms]
        (28) QDP
        (29) TransformationProof [EQUIVALENT, 0 ms]
        (30) QDP
        (31) TransformationProof [EQUIVALENT, 0 ms]
        (32) QDP
        (33) DependencyGraphProof [EQUIVALENT, 0 ms]
        (34) QDP
        (35) TransformationProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) TransformationProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) DependencyGraphProof [EQUIVALENT, 0 ms]
        (40) QDP
        (41) TransformationProof [EQUIVALENT, 0 ms]
        (42) QDP
        (43) DependencyGraphProof [EQUIVALENT, 0 ms]
        (44) QDP
        (45) TransformationProof [EQUIVALENT, 0 ms]
        (46) QDP
        (47) DependencyGraphProof [EQUIVALENT, 0 ms]
        (48) QDP
        (49) TransformationProof [EQUIVALENT, 0 ms]
        (50) QDP
        (51) TransformationProof [EQUIVALENT, 0 ms]
        (52) QDP
        (53) DependencyGraphProof [EQUIVALENT, 0 ms]
        (54) QDP
        (55) TransformationProof [EQUIVALENT, 0 ms]
        (56) QDP
        (57) DependencyGraphProof [EQUIVALENT, 0 ms]
        (58) QDP
        (59) QDPOrderProof [EQUIVALENT, 32 ms]
        (60) QDP
        (61) QDPOrderProof [EQUIVALENT, 18 ms]
        (62) QDP
        (63) QDPOrderProof [EQUIVALENT, 16 ms]
        (64) QDP
        (65) NonTerminationLoopProof [COMPLETE, 3812 ms]
        (66) NO


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

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

   eq(n__0, n__0) -> true
   eq(n__s(X), n__s(Y)) -> eq(activate(X), activate(Y))
   eq(X, Y) -> false
   inf(X) -> cons(X, n__inf(s(X)))
   take(0, X) -> nil
   take(s(X), cons(Y, L)) -> cons(activate(Y), n__take(activate(X), activate(L)))
   length(nil) -> 0
   length(cons(X, L)) -> s(n__length(activate(L)))
   0 -> n__0
   s(X) -> n__s(X)
   inf(X) -> n__inf(X)
   take(X1, X2) -> n__take(X1, X2)
   length(X) -> n__length(X)
   activate(n__0) -> 0
   activate(n__s(X)) -> s(X)
   activate(n__inf(X)) -> inf(X)
   activate(n__take(X1, X2)) -> take(X1, X2)

popout

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

job log

popout

actions all output return to TRS Standard