TRS Stand 20472 pair #381715922

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	106.655250072 seconds
cpu usage	332.78659856
max memory	9.61245184E9

stage attributes

key	value
output-size	88852
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) DependencyPairsProof [EQUIVALENT, 0 ms]
(2) QDP
(3) DependencyGraphProof [EQUIVALENT, 0 ms]
(4) AND
    (5) QDP
        (6) QDPOrderProof [EQUIVALENT, 83 ms]
        (7) QDP
        (8) QDPOrderProof [EQUIVALENT, 52 ms]
        (9) QDP
        (10) DependencyGraphProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPOrderProof [EQUIVALENT, 33 ms]
        (13) QDP
        (14) DependencyGraphProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) UsableRulesProof [EQUIVALENT, 0 ms]
        (17) QDP
        (18) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (19) YES
    (20) QDP
        (21) TransformationProof [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) TransformationProof [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) TransformationProof [EQUIVALENT, 24 ms]
        (44) QDP
        (45) DependencyGraphProof [EQUIVALENT, 0 ms]
        (46) QDP
        (47) TransformationProof [EQUIVALENT, 14 ms]
        (48) QDP
        (49) TransformationProof [EQUIVALENT, 122 ms]
        (50) QDP
        (51) DependencyGraphProof [EQUIVALENT, 0 ms]
        (52) QDP
        (53) TransformationProof [EQUIVALENT, 133 ms]
        (54) QDP
        (55) TransformationProof [EQUIVALENT, 188 ms]
        (56) QDP
        (57) DependencyGraphProof [EQUIVALENT, 0 ms]
        (58) QDP
        (59) TransformationProof [EQUIVALENT, 97 ms]
        (60) QDP
        (61) QDPOrderProof [EQUIVALENT, 126 ms]
        (62) QDP
        (63) QDPOrderProof [EQUIVALENT, 33 ms]
        (64) QDP
        (65) NonTerminationLoopProof [COMPLETE, 52.5 s]
        (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(n__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)

popout

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

job log

popout

actions all output return to TRS Stand 20472