TRS Standard pair #487068523

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7875 seconds
cpu usage	4.10037
user time	3.90183
system time	0.198544
max virtual memory	1.8475476E7
max residence set size	260180.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) AAECC Innermost [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 12 ms]
(4) QDP
(5) UsableRulesProof [EQUIVALENT, 0 ms]
(6) QDP
(7) QReductionProof [EQUIVALENT, 0 ms]
(8) QDP
(9) QDPToSRSProof [SOUND, 0 ms]
(10) QTRS
(11) DependencyPairsProof [EQUIVALENT, 0 ms]
(12) QDP
(13) MRRProof [EQUIVALENT, 16 ms]
(14) QDP
(15) DependencyGraphProof [EQUIVALENT, 0 ms]
(16) AND
    (17) QDP
        (18) UsableRulesProof [EQUIVALENT, 0 ms]
        (19) QDP
        (20) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (21) YES
    (22) QDP
        (23) UsableRulesProof [EQUIVALENT, 0 ms]
        (24) QDP
        (25) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (26) YES


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

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

   f(x, a(b(y))) -> f(a(b(x)), y)
   f(x, b(c(y))) -> f(b(c(x)), y)
   f(x, c(a(y))) -> f(c(a(x)), y)
   f(a(x), y) -> f(x, a(y))
   f(b(x), y) -> f(x, b(y))
   f(c(x), y) -> f(x, c(y))

Q is empty.

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

(1) AAECC Innermost (EQUIVALENT)
We have applied [NOC,AAECCNOC] to switch to innermost. The TRS R 1 is none

The TRS R 2 is 
   f(x, a(b(y))) -> f(a(b(x)), y)
   f(x, b(c(y))) -> f(b(c(x)), y)
   f(x, c(a(y))) -> f(c(a(x)), y)
   f(a(x), y) -> f(x, a(y))
   f(b(x), y) -> f(x, b(y))
   f(c(x), y) -> f(x, c(y))

The signature Sigma is {f_2}
----------------------------------------

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

   f(x, a(b(y))) -> f(a(b(x)), y)
   f(x, b(c(y))) -> f(b(c(x)), y)
   f(x, c(a(y))) -> f(c(a(x)), y)
   f(a(x), y) -> f(x, a(y))
   f(b(x), y) -> f(x, b(y))
   f(c(x), y) -> f(x, c(y))

The set Q consists of the following terms:

   f(x0, a(b(x1)))
   f(x0, b(c(x1)))
   f(x0, c(a(x1)))
   f(a(x0), x1)
   f(b(x0), x1)
   f(c(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:

popout

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

job log

popout

actions all output return to TRS Standard