SRS Relat 19260 pair #381725321

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.77873206139 seconds
cpu usage	15.749756849
max memory	2.326175744E9

stage attributes

key	value
output-size	10396
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given RelTRS could be proven:

(0) RelTRS
(1) RelTRS Reverse [EQUIVALENT, 0 ms]
(2) RelTRS
(3) RelTRSRRRProof [EQUIVALENT, 32 ms]
(4) RelTRS
(5) RelTRSRRRProof [EQUIVALENT, 316 ms]
(6) RelTRS
(7) RelTRSRRRProof [EQUIVALENT, 0 ms]
(8) RelTRS
(9) RelTRSRRRProof [EQUIVALENT, 34 ms]
(10) RelTRS
(11) RelTRSRRRProof [EQUIVALENT, 30 ms]
(12) RelTRS
(13) RelTRSRRRProof [EQUIVALENT, 53 ms]
(14) RelTRS
(15) RIsEmptyProof [EQUIVALENT, 0 ms]
(16) YES


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

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

   t(u(x1)) -> t(c(d(x1)))
   d(f(x1)) -> f(d(x1))
   d(g(x1)) -> u(g(x1))
   f(u(x1)) -> u(f(x1))
   d(n(x1)) -> d(x1)
   d(o(x1)) -> d(x1)
   o(u(x1)) -> u(x1)

The relative TRS consists of the following S rules:

   n(u(x1)) -> u(x1)
   f(x1) -> f(n(x1))
   t(x1) -> t(c(n(x1)))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)
   c(f(x1)) -> f(c(x1))
   c(u(x1)) -> u(c(x1))
   c(d(x1)) -> d(c(x1))


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

(1) RelTRS Reverse (EQUIVALENT)
We have reversed the following relative TRS [REVERSE]:
The set of rules R is 
   t(u(x1)) -> t(c(d(x1)))
   d(f(x1)) -> f(d(x1))
   d(g(x1)) -> u(g(x1))
   f(u(x1)) -> u(f(x1))
   d(n(x1)) -> d(x1)
   d(o(x1)) -> d(x1)
   o(u(x1)) -> u(x1)

The set of rules S is 
   n(u(x1)) -> u(x1)
   f(x1) -> f(n(x1))
   t(x1) -> t(c(n(x1)))
   c(n(x1)) -> n(c(x1))
   c(o(x1)) -> o(c(x1))
   c(o(x1)) -> o(x1)
   c(f(x1)) -> f(c(x1))
   c(u(x1)) -> u(c(x1))
   c(d(x1)) -> d(c(x1))

We have obtained the following relative TRS:
The set of rules R is 
   u(t(x1)) -> d(c(t(x1)))
   f(d(x1)) -> d(f(x1))
   g(d(x1)) -> g(u(x1))
   u(f(x1)) -> f(u(x1))
   n(d(x1)) -> d(x1)
   o(d(x1)) -> d(x1)
   u(o(x1)) -> u(x1)

The set of rules S is 
   u(n(x1)) -> u(x1)
   f(x1) -> n(f(x1))
   t(x1) -> n(c(t(x1)))
   n(c(x1)) -> c(n(x1))
   o(c(x1)) -> c(o(x1))

popout

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

job log

popout

actions all output return to SRS Relat 19260