TRS Standard pair #487068813

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.18901 seconds
cpu usage	5.35822
user time	5.08801
system time	0.270215
max virtual memory	1.9209728E7
max residence set size	379964.0

stage attributes

key	value
starexec-result	YES

output

YES
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 proven:

(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) UsableRulesProof [EQUIVALENT, 0 ms]
        (12) QDP
        (13) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (14) YES
    (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) QDPOrderProof [EQUIVALENT, 45 ms]
        (34) QDP
        (35) MRRProof [EQUIVALENT, 0 ms]
        (36) QDP
        (37) MRRProof [EQUIVALENT, 0 ms]
        (38) QDP
        (39) PisEmptyProof [EQUIVALENT, 0 ms]
        (40) YES


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

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

   active(f(x)) -> mark(x)
   top(active(c)) -> top(mark(c))
   top(mark(x)) -> top(check(x))
   check(f(x)) -> f(check(x))
   check(x) -> start(match(f(X), x))
   match(f(x), f(y)) -> f(match(x, y))
   match(X, x) -> proper(x)
   proper(c) -> ok(c)
   proper(f(x)) -> f(proper(x))
   f(ok(x)) -> ok(f(x))
   start(ok(x)) -> found(x)
   f(found(x)) -> found(f(x))
   top(found(x)) -> top(active(x))
   active(f(x)) -> f(active(x))
   f(mark(x)) -> mark(f(x))

Q is empty.

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

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

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

   TOP(active(c)) -> TOP(mark(c))
   TOP(mark(x)) -> TOP(check(x))
   TOP(mark(x)) -> CHECK(x)
   CHECK(f(x)) -> F(check(x))
   CHECK(f(x)) -> CHECK(x)
   CHECK(x) -> START(match(f(X), x))
   CHECK(x) -> MATCH(f(X), x)
   CHECK(x) -> F(X)
   MATCH(f(x), f(y)) -> F(match(x, y))
   MATCH(f(x), f(y)) -> MATCH(x, y)
   MATCH(X, x) -> PROPER(x)
   PROPER(f(x)) -> F(proper(x))
   PROPER(f(x)) -> PROPER(x)
   F(ok(x)) -> F(x)

popout

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

job log

popout

actions all output return to TRS Standard