TRS Standard pair #516966000

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.83275818825 seconds
cpu usage	7.79467973
max memory	5.57228032E8

stage attributes

key	value
output-size	14068
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination w.r.t. Q of the given QTRS could be disproven:

(0) QTRS
(1) Overlay + Local Confluence [EQUIVALENT, 11 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) TransformationProof [EQUIVALENT, 0 ms]
        (13) QDP
        (14) TransformationProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) NonTerminationLoopProof [COMPLETE, 0 ms]
        (17) NO
    (18) QDP
        (19) UsableRulesProof [EQUIVALENT, 0 ms]
        (20) QDP
        (21) QReductionProof [EQUIVALENT, 0 ms]
        (22) QDP
        (23) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (24) YES
    (25) QDP
        (26) UsableRulesProof [EQUIVALENT, 0 ms]
        (27) QDP
        (28) QReductionProof [EQUIVALENT, 0 ms]
        (29) QDP
        (30) QDPOrderProof [EQUIVALENT, 0 ms]
        (31) QDP
        (32) PisEmptyProof [EQUIVALENT, 0 ms]
        (33) YES


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

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

   filter(cons(X, Y), 0, M) -> cons(0, filter(Y, M, M))
   filter(cons(X, Y), s(N), M) -> cons(X, filter(Y, N, M))
   sieve(cons(0, Y)) -> cons(0, sieve(Y))
   sieve(cons(s(N), Y)) -> cons(s(N), sieve(filter(Y, N, N)))
   nats(N) -> cons(N, nats(s(N)))
   zprimes -> sieve(nats(s(s(0))))

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:

   filter(cons(X, Y), 0, M) -> cons(0, filter(Y, M, M))
   filter(cons(X, Y), s(N), M) -> cons(X, filter(Y, N, M))
   sieve(cons(0, Y)) -> cons(0, sieve(Y))
   sieve(cons(s(N), Y)) -> cons(s(N), sieve(filter(Y, N, N)))
   nats(N) -> cons(N, nats(s(N)))
   zprimes -> sieve(nats(s(s(0))))

The set Q consists of the following terms:

   filter(cons(x0, x1), 0, x2)
   filter(cons(x0, x1), s(x2), x3)
   sieve(cons(0, x0))
   sieve(cons(s(x0), x1))
   nats(x0)
   zprimes


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

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

(4)

popout

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

job log

popout

actions all output return to TRS Standard