SRS Relative pair #487082097

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.7578 seconds
cpu usage	8.12241
user time	7.69847
system time	0.423936
max virtual memory	3.883514E7
max residence set size	1016660.0

stage attributes

key	value
starexec-result	YES

output

YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRS Reverse [EQUIVALENT, 0 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 22 ms]
(4) RelTRS
(5) RelTRSRRRProof [EQUIVALENT, 83 ms]
(6) RelTRS
(7) RelTRSRRRProof [EQUIVALENT, 3 ms]
(8) RelTRS
(9) RIsEmptyProof [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:

   o(l(x1)) -> r(x1)
   n(l(o(x1))) -> r(o(x1))
   L(l(o(x1))) -> L(r(o(x1)))
   r(o(x1)) -> l(x1)
   o(r(n(x1))) -> o(l(x1))
   o(r(R(x1))) -> o(l(R(x1)))

The relative TRS consists of the following S rules:

   L(x1) -> L(n(x1))
   R(x1) -> n(R(x1))


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

(1) RelTRS Reverse (EQUIVALENT)
We have reversed the following relative TRS [REVERSE]:
The set of rules R is 
   o(l(x1)) -> r(x1)
   n(l(o(x1))) -> r(o(x1))
   L(l(o(x1))) -> L(r(o(x1)))
   r(o(x1)) -> l(x1)
   o(r(n(x1))) -> o(l(x1))
   o(r(R(x1))) -> o(l(R(x1)))

The set of rules S is 
   L(x1) -> L(n(x1))
   R(x1) -> n(R(x1))

We have obtained the following relative TRS:
The set of rules R is 
   l(o(x1)) -> r(x1)
   o(l(n(x1))) -> o(r(x1))
   o(l(L(x1))) -> o(r(L(x1)))
   o(r(x1)) -> l(x1)
   n(r(o(x1))) -> l(o(x1))
   R(r(o(x1))) -> R(l(o(x1)))

The set of rules S is 
   L(x1) -> n(L(x1))
   R(x1) -> R(n(x1))


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

(2)
Obligation:
Relative term rewrite system:
The relative TRS consists of the following R rules:

   l(o(x1)) -> r(x1)
   o(l(n(x1))) -> o(r(x1))
   o(l(L(x1))) -> o(r(L(x1)))
   o(r(x1)) -> l(x1)
   n(r(o(x1))) -> l(o(x1))
   R(r(o(x1))) -> R(l(o(x1)))

The relative TRS consists of the following S rules:

   L(x1) -> n(L(x1))
   R(x1) -> R(n(x1))


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

(3) RelTRSRRRProof (EQUIVALENT)
We used the following monotonic ordering for rule removal:
Polynomial interpretation [POLO]:

   POL(L(x_1)) = x_1
   POL(R(x_1)) = x_1
   POL(l(x_1)) = x_1
   POL(n(x_1)) = x_1

popout

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

job log

popout

actions all output return to SRS Relative