SRS Standard pair #487510949

details

property	value
status	complete
benchmark	random-114.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n094.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	17.4982180595 seconds
cpu usage	66.516299759
max memory	5.047324672E9

stage attributes

key	value
output-size	8903
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) QTRS
(1) DependencyPairsProof [EQUIVALENT, 35 ms]
(2) QDP
(3) QDPOrderProof [EQUIVALENT, 71 ms]
(4) QDP
(5) QDPOrderProof [EQUIVALENT, 1331 ms]
(6) QDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) QDP
        (10) QDPOrderProof [EQUIVALENT, 144 ms]
        (11) QDP
        (12) PisEmptyProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QDP
        (15) QDPOrderProof [EQUIVALENT, 357 ms]
        (16) QDP
        (17) PisEmptyProof [EQUIVALENT, 0 ms]
        (18) YES


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

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

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

Q is empty.

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

(1) DependencyPairsProof (EQUIVALENT)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
----------------------------------------

(2)
Obligation:
Q DP problem:
The TRS P consists of the following rules:

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

The TRS R consists of the following rules:

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

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

(3) QDPOrderProof (EQUIVALENT)
We use the reduction pair processor [LPAR04,JAR06].


The following pairs can be oriented strictly and are deleted.

   B(a(a(a(x1)))) -> B(a(b(x1)))
   B(a(a(a(x1)))) -> A(b(x1))
   B(a(a(a(x1)))) -> B(x1)
   A(b(a(b(x1)))) -> A(b(b(x1)))
   A(b(a(b(x1)))) -> B(b(x1))
   A(a(b(a(x1)))) -> B(a(b(x1)))
   A(a(b(a(x1)))) -> A(b(x1))
   A(a(b(a(x1)))) -> B(x1)
The remaining pairs can at least be oriented weakly.
Used ordering:  Polynomial interpretation [POLO]:

popout

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

job log

popout

actions all output return to SRS Standard