details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.86320614815 seconds
cpu usage	4.302380673
max memory	2.05049856E8

stage attributes

key	value
output-size	11101
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 29 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 4 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 0 ms] (14) CSR (15) RisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0, zeros)) active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y))) active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y)))) active(hd(cons(X, Y))) -> mark(X) active(tl(cons(X, Y))) -> mark(Y) active(adx(X)) -> adx(active(X)) active(incr(X)) -> incr(active(X)) active(hd(X)) -> hd(active(X)) active(tl(X)) -> tl(active(X)) adx(mark(X)) -> mark(adx(X)) incr(mark(X)) -> mark(incr(X)) hd(mark(X)) -> mark(hd(X)) tl(mark(X)) -> mark(tl(X)) proper(nats) -> ok(nats) proper(adx(X)) -> adx(proper(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(incr(X)) -> incr(proper(X)) proper(s(X)) -> s(proper(X)) proper(hd(X)) -> hd(proper(X)) proper(tl(X)) -> tl(proper(X)) adx(ok(X)) -> ok(adx(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) incr(ok(X)) -> ok(incr(X)) s(ok(X)) -> ok(s(X)) hd(ok(X)) -> ok(hd(X)) tl(ok(X)) -> ok(tl(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(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0, zeros)) active(incr(cons(X, Y))) -> mark(cons(s(X), incr(Y))) active(adx(cons(X, Y))) -> mark(incr(cons(X, adx(Y)))) active(hd(cons(X, Y))) -> mark(X) active(tl(cons(X, Y))) -> mark(Y) active(adx(X)) -> adx(active(X)) active(incr(X)) -> incr(active(X)) active(hd(X)) -> hd(active(X)) active(tl(X)) -> tl(active(X)) adx(mark(X)) -> mark(adx(X)) incr(mark(X)) -> mark(incr(X)) hd(mark(X)) -> mark(hd(X)) tl(mark(X)) -> mark(tl(X)) proper(nats) -> ok(nats) proper(adx(X)) -> adx(proper(X)) proper(zeros) -> ok(zeros) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(0) -> ok(0) proper(incr(X)) -> incr(proper(X)) proper(s(X)) -> s(proper(X)) popout

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

job log

popout

actions

all output return to TRS Stand 20472