TRS Innermost pair #487524471

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81003808975 seconds
cpu usage	3.961460411
max memory	2.31378944E8

stage attributes

key	value
output-size	7669
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) QTRSToCSRProof [SOUND, 0 ms]
(2) CSR
(3) CSRRRRProof [EQUIVALENT, 42 ms]
(4) CSR
(5) CSRRRRProof [EQUIVALENT, 0 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(first(0, X)) -> mark(nil)
   active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z)))
   active(from(X)) -> mark(cons(X, from(s(X))))
   active(first(X1, X2)) -> first(active(X1), X2)
   active(first(X1, X2)) -> first(X1, active(X2))
   active(s(X)) -> s(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(from(X)) -> from(active(X))
   first(mark(X1), X2) -> mark(first(X1, X2))
   first(X1, mark(X2)) -> mark(first(X1, X2))
   s(mark(X)) -> mark(s(X))
   cons(mark(X1), X2) -> mark(cons(X1, X2))
   from(mark(X)) -> mark(from(X))
   proper(first(X1, X2)) -> first(proper(X1), proper(X2))
   proper(0) -> ok(0)
   proper(nil) -> ok(nil)
   proper(s(X)) -> s(proper(X))
   proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
   proper(from(X)) -> from(proper(X))
   first(ok(X1), ok(X2)) -> ok(first(X1, X2))
   s(ok(X)) -> ok(s(X))
   cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
   from(ok(X)) -> ok(from(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))

The set Q consists of the following terms:

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


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

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

   active(first(0, X)) -> mark(nil)
   active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z)))
   active(from(X)) -> mark(cons(X, from(s(X))))
   active(first(X1, X2)) -> first(active(X1), X2)
   active(first(X1, X2)) -> first(X1, active(X2))
   active(s(X)) -> s(active(X))
   active(cons(X1, X2)) -> cons(active(X1), X2)
   active(from(X)) -> from(active(X))
   first(mark(X1), X2) -> mark(first(X1, X2))
   first(X1, mark(X2)) -> mark(first(X1, X2))

popout

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

job log

popout

actions all output return to TRS Innermost