TRS Standard pair #615301139

details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	1.74140691757 seconds
cpu usage	4.553604882
max memory	2.57785856E8

stage attributes

key	value
output-size	6727
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: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished


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

(0) QTRS
(1) QTRSToCSRProof [EQUIVALENT, 0 ms]
(2) CSR
(3) CSRRRRProof [EQUIVALENT, 26 ms]
(4) CSR
(5) CSRRRRProof [EQUIVALENT, 6 ms]
(6) CSR
(7) CSRRRRProof [EQUIVALENT, 0 ms]
(8) CSR
(9) RisEmptyProof [EQUIVALENT, 0 ms]
(10) YES


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

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

   active(from(X)) -> mark(cons(X, from(s(X))))
   active(length(nil)) -> mark(0)
   active(length(cons(X, Y))) -> mark(s(length1(Y)))
   active(length1(X)) -> mark(length(X))
   active(from(X)) -> from(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   from(mark(X)) -> mark(from(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   proper(from(X)) -> from(proper(X))
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(length(X)) -> length(proper(X))
   proper(nil) -> ok(nil)
   proper(0) -> ok(0)
   proper(length1(X)) -> length1(proper(X))
   from(ok(X)) -> ok(from(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   length(ok(X)) -> ok(length(X))
   length1(ok(X)) -> ok(length1(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

Q is empty.

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

(1) QTRSToCSRProof (EQUIVALENT)
The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

   active(from(X)) -> mark(cons(X, from(s(X))))
   active(length(nil)) -> mark(0)
   active(length(cons(X, Y))) -> mark(s(length1(Y)))
   active(length1(X)) -> mark(length(X))
   active(from(X)) -> from(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   from(mark(X)) -> mark(from(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   proper(from(X)) -> from(proper(X))
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(length(X)) -> length(proper(X))
   proper(nil) -> ok(nil)
   proper(0) -> ok(0)
   proper(length1(X)) -> length1(proper(X))
   from(ok(X)) -> ok(from(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   length(ok(X)) -> ok(length(X))
   length1(ok(X)) -> ok(length1(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

Q is empty.
Special symbols used for the transformation (see [GM04]):
top: top_1, active: active_1, mark: mark_1, ok: ok_1, proper: proper_1
The replacement map contains the following entries:

from: {1}
cons: {1}
s: {1}
length: empty set

popout

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

job log

popout

actions all output return to TRS Standard