details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.40941 seconds
cpu usage	5.14849
user time	4.90607
system time	0.242427
max virtual memory	1.8876908E7
max residence set size	375108.0

stage attributes

key	value
starexec-result	YES

output

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 [EQUIVALENT, 0 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QCSDP (8) QCSDPSubtermProof [EQUIVALENT, 15 ms] (9) QCSDP (10) PIsEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) QCSDP (13) QCSDPReductionPairProof [EQUIVALENT, 9 ms] (14) QCSDP (15) PIsEmptyProof [EQUIVALENT, 0 ms] (16) YES (17) QCSDP (18) QCSDPSubtermProof [EQUIVALENT, 4 ms] (19) QCSDP (20) PIsEmptyProof [EQUIVALENT, 0 ms] (21) YES (22) QCSDP (23) QCSDPSubtermProof [EQUIVALENT, 9 ms] (24) QCSDP (25) PIsEmptyProof [EQUIVALENT, 0 ms] (26) 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(sel(0, cons(X, XS))) -> mark(X) active(sel(s(N), cons(X, XS))) -> mark(sel(N, XS)) active(minus(X, 0)) -> mark(0) active(minus(s(X), s(Y))) -> mark(minus(X, Y)) active(quot(0, s(Y))) -> mark(0) active(quot(s(X), s(Y))) -> mark(s(quot(minus(X, Y), s(Y)))) active(zWquot(XS, nil)) -> mark(nil) active(zWquot(nil, XS)) -> mark(nil) active(zWquot(cons(X, XS), cons(Y, YS))) -> mark(cons(quot(X, Y), zWquot(XS, YS))) active(from(X)) -> from(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(s(X)) -> s(active(X)) active(sel(X1, X2)) -> sel(active(X1), X2) active(sel(X1, X2)) -> sel(X1, active(X2)) active(minus(X1, X2)) -> minus(active(X1), X2) active(minus(X1, X2)) -> minus(X1, active(X2)) active(quot(X1, X2)) -> quot(active(X1), X2) active(quot(X1, X2)) -> quot(X1, active(X2)) active(zWquot(X1, X2)) -> zWquot(active(X1), X2) active(zWquot(X1, X2)) -> zWquot(X1, active(X2)) from(mark(X)) -> mark(from(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) s(mark(X)) -> mark(s(X)) sel(mark(X1), X2) -> mark(sel(X1, X2)) sel(X1, mark(X2)) -> mark(sel(X1, X2)) minus(mark(X1), X2) -> mark(minus(X1, X2)) minus(X1, mark(X2)) -> mark(minus(X1, X2)) quot(mark(X1), X2) -> mark(quot(X1, X2)) quot(X1, mark(X2)) -> mark(quot(X1, X2)) zWquot(mark(X1), X2) -> mark(zWquot(X1, X2)) zWquot(X1, mark(X2)) -> mark(zWquot(X1, X2)) proper(from(X)) -> from(proper(X)) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(s(X)) -> s(proper(X)) proper(sel(X1, X2)) -> sel(proper(X1), proper(X2)) proper(0) -> ok(0) proper(minus(X1, X2)) -> minus(proper(X1), proper(X2)) proper(quot(X1, X2)) -> quot(proper(X1), proper(X2)) proper(zWquot(X1, X2)) -> zWquot(proper(X1), proper(X2)) proper(nil) -> ok(nil) from(ok(X)) -> ok(from(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) s(ok(X)) -> ok(s(X)) sel(ok(X1), ok(X2)) -> ok(sel(X1, X2)) minus(ok(X1), ok(X2)) -> ok(minus(X1, X2)) quot(ok(X1), ok(X2)) -> ok(quot(X1, X2)) zWquot(ok(X1), ok(X2)) -> ok(zWquot(X1, X2)) 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: popout

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

job log

popout

actions

all output return to TRS Standard