TRS Inner 89993 pair #381733853

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.92634510994 seconds
cpu usage	3.807474123
max memory	2.3779328E8

stage attributes

key	value
output-size	12527
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

(0) QTRS
(1) QTRSToCSRProof [SOUND, 0 ms]
(2) CSR
(3) CSRInnermostProof [EQUIVALENT, 0 ms]
(4) CSR
(5) CSDependencyPairsProof [EQUIVALENT, 4 ms]
(6) QCSDP
(7) QCSDependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) QCSDP
        (10) QCSDPSubtermProof [EQUIVALENT, 0 ms]
        (11) QCSDP
        (12) PIsEmptyProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) QCSDP
        (15) QCSDPSubtermProof [EQUIVALENT, 0 ms]
        (16) QCSDP
        (17) PIsEmptyProof [EQUIVALENT, 0 ms]
        (18) 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(first(0, Z)) -> mark(nil)
   active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z)))
   active(sel(0, cons(X, Z))) -> mark(X)
   active(sel(s(X), cons(Y, Z))) -> mark(sel(X, Z))
   active(from(X)) -> from(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(s(X)) -> s(active(X))
   active(first(X1, X2)) -> first(active(X1), X2)
   active(first(X1, X2)) -> first(X1, active(X2))
   active(sel(X1, X2)) -> sel(active(X1), X2)
   active(sel(X1, X2)) -> sel(X1, active(X2))
   from(mark(X)) -> mark(from(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   s(mark(X)) -> mark(s(X))
   first(mark(X1), X2) -> mark(first(X1, X2))
   first(X1, mark(X2)) -> mark(first(X1, X2))
   sel(mark(X1), X2) -> mark(sel(X1, X2))
   sel(X1, mark(X2)) -> mark(sel(X1, X2))
   proper(from(X)) -> from(proper(X))
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(s(X)) -> s(proper(X))
   proper(first(X1, X2)) -> first(proper(X1), proper(X2))
   proper(0) -> ok(0)
   proper(nil) -> ok(nil)
   proper(sel(X1, X2)) -> sel(proper(X1), proper(X2))
   from(ok(X)) -> ok(from(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   s(ok(X)) -> ok(s(X))
   first(ok(X1), ok(X2)) -> ok(first(X1, X2))
   sel(ok(X1), ok(X2)) -> ok(sel(X1, X2))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

The set Q consists of the following terms:

   active(from(x0))
   active(cons(x0, x1))
   active(s(x0))
   active(first(x0, x1))
   active(sel(x0, x1))
   from(mark(x0))
   cons(mark(x0), x1)
   s(mark(x0))
   first(mark(x0), x1)
   first(x0, mark(x1))
   sel(mark(x0), x1)
   sel(x0, mark(x1))
   proper(from(x0))
   proper(cons(x0, x1))
   proper(s(x0))
   proper(first(x0, x1))
   proper(0)
   proper(nil)
   proper(sel(x0, x1))
   from(ok(x0))
   cons(ok(x0), ok(x1))
   s(ok(x0))
   first(ok(x0), ok(x1))

popout

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

job log

popout

actions all output return to TRS Inner 89993