TRS Standard pair #487073228

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.42517 seconds
cpu usage	5.15254
user time	4.90213
system time	0.250413
max virtual memory	1.8412E7
max residence set size	331104.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) Overlay + Local Confluence [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 20 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) NonInfProof [EQUIVALENT, 50 ms]
        (20) AND
            (21) QDP
                (22) DependencyGraphProof [EQUIVALENT, 0 ms]
                (23) TRUE
            (24) QDP
                (25) DependencyGraphProof [EQUIVALENT, 0 ms]
                (26) TRUE


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

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

   le(0, y) -> true
   le(s(x), 0) -> false
   le(s(x), s(y)) -> le(x, y)
   int(x, y) -> if(le(x, y), x, y)
   if(true, x, y) -> cons(x, int(s(x), y))
   if(false, x, y) -> nil

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:

   le(0, y) -> true
   le(s(x), 0) -> false
   le(s(x), s(y)) -> le(x, y)
   int(x, y) -> if(le(x, y), x, y)
   if(true, x, y) -> cons(x, int(s(x), y))
   if(false, x, y) -> nil

The set Q consists of the following terms:

   le(0, x0)
   le(s(x0), 0)
   le(s(x0), s(x1))
   int(x0, x1)
   if(true, x0, x1)
   if(false, x0, x1)


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

(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:

   LE(s(x), s(y)) -> LE(x, y)
   INT(x, y) -> IF(le(x, y), x, y)
   INT(x, y) -> LE(x, y)
   IF(true, x, y) -> INT(s(x), y)

The TRS R consists of the following rules:

   le(0, y) -> true
   le(s(x), 0) -> false

popout

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

job log

popout

actions all output return to TRS Standard