SRS Standard pair #516968938

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	5.79107809067 seconds
cpu usage	19.772975394
max memory	1.28253952E9

stage attributes

key	value
output-size	7113
starexec-result	YES

output

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


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


YES
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished


Termination w.r.t. Q of the given QTRS could be proven:

(0) QTRS
(1) QTRS Reverse [EQUIVALENT, 0 ms]
(2) QTRS
(3) DependencyPairsProof [EQUIVALENT, 0 ms]
(4) QDP
(5) MRRProof [EQUIVALENT, 36 ms]
(6) QDP
(7) QDPOrderProof [EQUIVALENT, 42 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) AND
    (11) QDP
        (12) UsableRulesProof [EQUIVALENT, 1 ms]
        (13) QDP
        (14) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (15) YES
    (16) QDP
        (17) UsableRulesProof [EQUIVALENT, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES


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

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

   a(b(x1)) -> b(c(a(x1)))
   b(c(x1)) -> c(b(b(x1)))
   c(a(x1)) -> a(c(x1))

Q is empty.

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

(1) QTRS Reverse (EQUIVALENT)
We applied the QTRS Reverse Processor [REVERSE].
----------------------------------------

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

   b(a(x1)) -> a(c(b(x1)))
   c(b(x1)) -> b(b(c(x1)))
   a(c(x1)) -> c(a(x1))

Q is empty.

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

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

   B(a(x1)) -> A(c(b(x1)))
   B(a(x1)) -> C(b(x1))
   B(a(x1)) -> B(x1)
   C(b(x1)) -> B(b(c(x1)))
   C(b(x1)) -> B(c(x1))
   C(b(x1)) -> C(x1)
   A(c(x1)) -> C(a(x1))
   A(c(x1)) -> A(x1)

The TRS R consists of the following rules:

   b(a(x1)) -> a(c(b(x1)))
   c(b(x1)) -> b(b(c(x1)))
   a(c(x1)) -> c(a(x1))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
----------------------------------------

(5) MRRProof (EQUIVALENT)
By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.

Strictly oriented dependency pairs:

popout

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

job log

popout

actions all output return to SRS Standard