details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.46941494942 seconds
cpu usage	6.73662442
max memory	4.99728384E8

stage attributes

key	value
output-size	15808
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 [SOUND, 0 ms] (2) CSR (3) CSRInnermostProof [EQUIVALENT, 0 ms] (4) CSR (5) CSDependencyPairsProof [EQUIVALENT, 12 ms] (6) QCSDP (7) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (8) QCSDP (9) QCSDPSubtermProof [EQUIVALENT, 20 ms] (10) QCSDP (11) PIsEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(primes) -> mark(sieve(from(s(s(0))))) active(from(X)) -> mark(cons(X, from(s(X)))) active(head(cons(X, Y))) -> mark(X) active(tail(cons(X, Y))) -> mark(Y) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(filter(s(s(X)), cons(Y, Z))) -> mark(if(divides(s(s(X)), Y), filter(s(s(X)), Z), cons(Y, filter(X, sieve(Y))))) active(sieve(cons(X, Y))) -> mark(cons(X, filter(X, sieve(Y)))) active(sieve(X)) -> sieve(active(X)) active(from(X)) -> from(active(X)) active(s(X)) -> s(active(X)) active(cons(X1, X2)) -> cons(active(X1), X2) active(head(X)) -> head(active(X)) active(tail(X)) -> tail(active(X)) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) active(filter(X1, X2)) -> filter(active(X1), X2) active(filter(X1, X2)) -> filter(X1, active(X2)) active(divides(X1, X2)) -> divides(active(X1), X2) active(divides(X1, X2)) -> divides(X1, active(X2)) sieve(mark(X)) -> mark(sieve(X)) from(mark(X)) -> mark(from(X)) s(mark(X)) -> mark(s(X)) cons(mark(X1), X2) -> mark(cons(X1, X2)) head(mark(X)) -> mark(head(X)) tail(mark(X)) -> mark(tail(X)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) filter(mark(X1), X2) -> mark(filter(X1, X2)) filter(X1, mark(X2)) -> mark(filter(X1, X2)) divides(mark(X1), X2) -> mark(divides(X1, X2)) divides(X1, mark(X2)) -> mark(divides(X1, X2)) proper(primes) -> ok(primes) proper(sieve(X)) -> sieve(proper(X)) proper(from(X)) -> from(proper(X)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(head(X)) -> head(proper(X)) proper(tail(X)) -> tail(proper(X)) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) proper(true) -> ok(true) proper(false) -> ok(false) proper(filter(X1, X2)) -> filter(proper(X1), proper(X2)) proper(divides(X1, X2)) -> divides(proper(X1), proper(X2)) sieve(ok(X)) -> ok(sieve(X)) from(ok(X)) -> ok(from(X)) s(ok(X)) -> ok(s(X)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) head(ok(X)) -> ok(head(X)) tail(ok(X)) -> ok(tail(X)) if(ok(X1), ok(X2), ok(X3)) -> ok(if(X1, X2, X3)) filter(ok(X1), ok(X2)) -> ok(filter(X1, X2)) divides(ok(X1), ok(X2)) -> ok(divides(X1, X2)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(primes) active(from(x0)) active(sieve(x0)) active(s(x0)) active(cons(x0, x1)) active(head(x0)) active(tail(x0)) active(if(x0, x1, x2)) popout

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

job log

popout

actions

all output return to TRS Innermost