SRS Standard pair #516968266

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	8.43797779083 seconds
cpu usage	30.481517301
max memory	1.501118464E9

stage attributes

key	value
output-size	21213
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: 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) FlatCCProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) RootLabelingProof [EQUIVALENT, 0 ms]
(6) QTRS
(7) QTRSRRRProof [EQUIVALENT, 43 ms]
(8) QTRS
(9) DependencyPairsProof [EQUIVALENT, 0 ms]
(10) QDP
(11) DependencyGraphProof [EQUIVALENT, 0 ms]
(12) AND
    (13) QDP
        (14) UsableRulesProof [EQUIVALENT, 0 ms]
        (15) QDP
        (16) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (17) YES
    (18) QDP
        (19) QDPOrderProof [EQUIVALENT, 808 ms]
        (20) QDP
        (21) QDPOrderProof [EQUIVALENT, 15 ms]
        (22) QDP
        (23) QDPOrderProof [EQUIVALENT, 12 ms]
        (24) QDP
        (25) PisEmptyProof [EQUIVALENT, 0 ms]
        (26) YES


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

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

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

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

Q is empty.

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

(3) FlatCCProof (EQUIVALENT)
We used flat context closure [ROOTLAB]
As Q is empty the flat context closure was sound AND complete.

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

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

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

Q is empty.

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

(5) RootLabelingProof (EQUIVALENT)
We used plain root labeling [ROOTLAB] with the following heuristic:
LabelAll: All function symbols get labeled

popout

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

job log

popout

actions all output return to SRS Standard