details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.19916 seconds
cpu usage	4.94806
user time	4.73713
system time	0.210925
max virtual memory	1.860698E7
max residence set size	286292.0

stage attributes

key	value
starexec-result	YES

output

4.83/2.15 YES 4.87/2.17 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 4.87/2.17 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.87/2.17 4.87/2.17 4.87/2.17 Termination w.r.t. Q of the given QTRS could be proven: 4.87/2.17 4.87/2.17 (0) QTRS 4.87/2.17 (1) QTRSToCSRProof [SOUND, 0 ms] 4.87/2.17 (2) CSR 4.87/2.17 (3) CSRRRRProof [EQUIVALENT, 90 ms] 4.87/2.17 (4) CSR 4.87/2.17 (5) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (6) CSR 4.87/2.17 (7) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (8) CSR 4.87/2.17 (9) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (10) CSR 4.87/2.17 (11) CSRRRRProof [EQUIVALENT, 5 ms] 4.87/2.17 (12) CSR 4.87/2.17 (13) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (14) CSR 4.87/2.17 (15) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (16) CSR 4.87/2.17 (17) CSRRRRProof [EQUIVALENT, 3 ms] 4.87/2.17 (18) CSR 4.87/2.17 (19) CSRRRRProof [EQUIVALENT, 0 ms] 4.87/2.17 (20) CSR 4.87/2.17 (21) RisEmptyProof [EQUIVALENT, 0 ms] 4.87/2.17 (22) YES 4.87/2.17 4.87/2.17 4.87/2.17 ---------------------------------------- 4.87/2.17 4.87/2.17 (0) 4.87/2.17 Obligation: 4.87/2.17 Q restricted rewrite system: 4.87/2.17 The TRS R consists of the following rules: 4.87/2.17 4.87/2.17 active(pairNs) -> mark(cons(0, incr(oddNs))) 4.87/2.17 active(oddNs) -> mark(incr(pairNs)) 4.87/2.17 active(incr(cons(X, XS))) -> mark(cons(s(X), incr(XS))) 4.87/2.17 active(take(0, XS)) -> mark(nil) 4.87/2.17 active(take(s(N), cons(X, XS))) -> mark(cons(X, take(N, XS))) 4.87/2.17 active(zip(nil, XS)) -> mark(nil) 4.87/2.17 active(zip(X, nil)) -> mark(nil) 4.87/2.17 active(zip(cons(X, XS), cons(Y, YS))) -> mark(cons(pair(X, Y), zip(XS, YS))) 4.87/2.17 active(tail(cons(X, XS))) -> mark(XS) 4.87/2.17 active(repItems(nil)) -> mark(nil) 4.87/2.17 active(repItems(cons(X, XS))) -> mark(cons(X, cons(X, repItems(XS)))) 4.87/2.17 active(cons(X1, X2)) -> cons(active(X1), X2) 4.87/2.17 active(incr(X)) -> incr(active(X)) 4.87/2.17 active(s(X)) -> s(active(X)) 4.87/2.17 active(take(X1, X2)) -> take(active(X1), X2) 4.87/2.17 active(take(X1, X2)) -> take(X1, active(X2)) 4.87/2.17 active(zip(X1, X2)) -> zip(active(X1), X2) 4.87/2.17 active(zip(X1, X2)) -> zip(X1, active(X2)) 4.87/2.17 active(pair(X1, X2)) -> pair(active(X1), X2) 4.87/2.17 active(pair(X1, X2)) -> pair(X1, active(X2)) 4.87/2.17 active(tail(X)) -> tail(active(X)) 4.87/2.17 active(repItems(X)) -> repItems(active(X)) 4.87/2.17 cons(mark(X1), X2) -> mark(cons(X1, X2)) 4.87/2.17 incr(mark(X)) -> mark(incr(X)) 4.87/2.17 s(mark(X)) -> mark(s(X)) 4.87/2.17 take(mark(X1), X2) -> mark(take(X1, X2)) 4.87/2.17 take(X1, mark(X2)) -> mark(take(X1, X2)) 4.87/2.17 zip(mark(X1), X2) -> mark(zip(X1, X2)) 4.87/2.17 zip(X1, mark(X2)) -> mark(zip(X1, X2)) 4.87/2.17 pair(mark(X1), X2) -> mark(pair(X1, X2)) 4.87/2.17 pair(X1, mark(X2)) -> mark(pair(X1, X2)) 4.87/2.17 tail(mark(X)) -> mark(tail(X)) 4.87/2.17 repItems(mark(X)) -> mark(repItems(X)) 4.87/2.17 proper(pairNs) -> ok(pairNs) 4.87/2.17 proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 4.87/2.17 proper(0) -> ok(0) 4.87/2.17 proper(incr(X)) -> incr(proper(X)) 4.87/2.17 proper(oddNs) -> ok(oddNs) 4.87/2.17 proper(s(X)) -> s(proper(X)) 4.87/2.17 proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 4.87/2.17 proper(nil) -> ok(nil) 4.87/2.17 proper(zip(X1, X2)) -> zip(proper(X1), proper(X2)) 4.87/2.17 proper(pair(X1, X2)) -> pair(proper(X1), proper(X2)) 4.87/2.17 proper(tail(X)) -> tail(proper(X)) 4.87/2.17 proper(repItems(X)) -> repItems(proper(X)) 4.87/2.17 cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 4.87/2.17 incr(ok(X)) -> ok(incr(X)) 4.87/2.17 s(ok(X)) -> ok(s(X)) 4.87/2.17 take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 4.87/2.17 zip(ok(X1), ok(X2)) -> ok(zip(X1, X2)) 4.87/2.17 pair(ok(X1), ok(X2)) -> ok(pair(X1, X2)) 4.87/2.17 tail(ok(X)) -> ok(tail(X)) 4.87/2.17 repItems(ok(X)) -> ok(repItems(X)) 4.87/2.17 top(mark(X)) -> top(proper(X)) 4.87/2.17 top(ok(X)) -> top(active(X)) 4.87/2.17 4.87/2.17 The set Q consists of the following terms: 4.87/2.17 4.87/2.17 active(pairNs) 4.87/2.17 active(oddNs) 4.87/2.17 active(cons(x0, x1)) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12