TRS Standard pair #487072133

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.32547 seconds
cpu usage	5.11902
user time	4.89248
system time	0.226535
max virtual memory	1.8477524E7
max residence set size	356388.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) Overlay + Local Confluence [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 0 ms]
(4) QDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) AND
    (7) QDP
        (8) UsableRulesProof [EQUIVALENT, 0 ms]
        (9) QDP
        (10) QReductionProof [EQUIVALENT, 0 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) UsableRulesProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QReductionProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) TransformationProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) TransformationProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) NonTerminationLoopProof [COMPLETE, 0 ms]
        (24) NO


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

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

   from(X) -> cons(X, from(s(X)))
   length(nil) -> 0
   length(cons(X, Y)) -> s(length1(Y))
   length1(X) -> length(X)

Q is empty.

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

(1) Overlay + Local Confluence (EQUIVALENT)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
----------------------------------------

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

   from(X) -> cons(X, from(s(X)))
   length(nil) -> 0
   length(cons(X, Y)) -> s(length1(Y))
   length1(X) -> length(X)

The set Q consists of the following terms:

   from(x0)
   length(nil)
   length(cons(x0, x1))
   length1(x0)


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

(3) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(4)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

   FROM(X) -> FROM(s(X))
   LENGTH(cons(X, Y)) -> LENGTH1(Y)
   LENGTH1(X) -> LENGTH(X)

The TRS R consists of the following rules:

   from(X) -> cons(X, from(s(X)))
   length(nil) -> 0
   length(cons(X, Y)) -> s(length1(Y))
   length1(X) -> length(X)

The set Q consists of the following terms:

   from(x0)
   length(nil)
   length(cons(x0, x1))
   length1(x0)

popout

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

job log

popout

actions all output return to TRS Standard