details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.46271896362 seconds
cpu usage	6.410192253
max memory	4.80444416E8

stage attributes

key	value
output-size	11730
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [EQUIVALENT, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 73 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 6 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) CSRRRRProof [EQUIVALENT, 0 ms] (12) CSR (13) CSRRRRProof [EQUIVALENT, 5 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(eq(0, 0)) -> mark(true) active(eq(s(X), s(Y))) -> mark(eq(X, Y)) active(eq(X, Y)) -> mark(false) active(inf(X)) -> mark(cons(X, inf(s(X)))) active(take(0, X)) -> mark(nil) active(take(s(X), cons(Y, L))) -> mark(cons(Y, take(X, L))) active(length(nil)) -> mark(0) active(length(cons(X, L))) -> mark(s(length(L))) active(inf(X)) -> inf(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) active(length(X)) -> length(active(X)) inf(mark(X)) -> mark(inf(X)) take(mark(X1), X2) -> mark(take(X1, X2)) take(X1, mark(X2)) -> mark(take(X1, X2)) length(mark(X)) -> mark(length(X)) proper(eq(X1, X2)) -> eq(proper(X1), proper(X2)) proper(0) -> ok(0) proper(true) -> ok(true) proper(s(X)) -> s(proper(X)) proper(false) -> ok(false) proper(inf(X)) -> inf(proper(X)) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(take(X1, X2)) -> take(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(length(X)) -> length(proper(X)) eq(ok(X1), ok(X2)) -> ok(eq(X1, X2)) s(ok(X)) -> ok(s(X)) inf(ok(X)) -> ok(inf(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) take(ok(X1), ok(X2)) -> ok(take(X1, X2)) length(ok(X)) -> ok(length(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(eq(0, 0)) -> mark(true) active(eq(s(X), s(Y))) -> mark(eq(X, Y)) active(eq(X, Y)) -> mark(false) active(inf(X)) -> mark(cons(X, inf(s(X)))) active(take(0, X)) -> mark(nil) active(take(s(X), cons(Y, L))) -> mark(cons(Y, take(X, L))) active(length(nil)) -> mark(0) active(length(cons(X, L))) -> mark(s(length(L))) active(inf(X)) -> inf(active(X)) active(take(X1, X2)) -> take(active(X1), X2) active(take(X1, X2)) -> take(X1, active(X2)) active(length(X)) -> length(active(X)) inf(mark(X)) -> mark(inf(X)) take(mark(X1), X2) -> mark(take(X1, X2)) take(X1, mark(X2)) -> mark(take(X1, X2)) length(mark(X)) -> mark(length(X)) proper(eq(X1, X2)) -> eq(proper(X1), proper(X2)) proper(0) -> ok(0) popout

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

job log

popout

actions

all output return to TRS Standard