details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.9665081501 seconds
cpu usage	4.212904406
max memory	2.56753664E8

stage attributes

key	value
output-size	14802
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: 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, 61 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 3 ms] (14) CSR (15) CSRRRRProof [EQUIVALENT, 0 ms] (16) CSR (17) RisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(incr(nil)) -> mark(nil) active(incr(cons(X, L))) -> mark(cons(s(X), incr(L))) active(adx(nil)) -> mark(nil) active(adx(cons(X, L))) -> mark(incr(cons(X, adx(L)))) active(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0, zeros)) active(head(cons(X, L))) -> mark(X) active(tail(cons(X, L))) -> mark(L) active(incr(X)) -> incr(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(s(X)) -> s(active(X)) active(adx(X)) -> adx(active(X)) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) incr(mark(X)) -> mark(incr(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) s(mark(X)) -> mark(s(X)) adx(mark(X)) -> mark(adx(X)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) proper(incr(X)) -> incr(proper(X)) proper(nil) -> ok(nil) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(s(X)) -> s(proper(X)) proper(adx(X)) -> adx(proper(X)) proper(nats) -> ok(nats) proper(zeros) -> ok(zeros) proper(0) -> ok(0) proper(head(X)) -> head(proper(X)) proper(tail(X)) -> tail(proper(X)) incr(ok(X)) -> ok(incr(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) s(ok(X)) -> ok(s(X)) adx(ok(X)) -> ok(adx(X)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(nats) active(zeros) active(incr(x0)) active(cons(x0, x1)) active(s(x0)) active(adx(x0)) active(head(x0)) active(tail(x0)) incr(mark(x0)) cons(mark(x0), x1) s(mark(x0)) adx(mark(x0)) head(mark(x0)) tail(mark(x0)) proper(incr(x0)) proper(nil) proper(cons(x0, x1)) proper(s(x0)) popout

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

job log

popout

actions

all output return to TRS Innermost