SRS Standard pair #516973270

details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	28.9876320362 seconds
cpu usage	112.168933855
max memory	2.5965568E9

stage attributes

key	value
output-size	56526
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) FlatCCProof [EQUIVALENT, 0 ms]
(2) QTRS
(3) RootLabelingProof [EQUIVALENT, 0 ms]
(4) QTRS
(5) QTRSRRRProof [EQUIVALENT, 190 ms]
(6) QTRS
(7) DependencyPairsProof [EQUIVALENT, 46 ms]
(8) QDP
(9) DependencyGraphProof [EQUIVALENT, 0 ms]
(10) QDP
(11) QDPOrderProof [EQUIVALENT, 5018 ms]
(12) QDP
(13) DependencyGraphProof [EQUIVALENT, 0 ms]
(14) TRUE


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

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

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

Q is empty.

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

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

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

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

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

Q is empty.

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

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

As Q is empty the root labeling was sound AND complete.

popout

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

job log

popout

actions all output return to SRS Standard