details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.10294389725 seconds
cpu usage	5.426371489
max memory	4.78363648E8

stage attributes

key	value
output-size	8289
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 of the given CSR could be proven: (0) CSR (1) CSRInnermostProof [EQUIVALENT, 0 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 32 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) QCSDP (7) QCSDPSubtermProof [EQUIVALENT, 0 ms] (8) QCSDP (9) PIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: primes -> sieve(from(s(s(0)))) from(X) -> cons(X, from(s(X))) head(cons(X, Y)) -> X tail(cons(X, Y)) -> Y if(true, X, Y) -> X if(false, X, Y) -> Y filter(s(s(X)), cons(Y, Z)) -> if(divides(s(s(X)), Y), filter(s(s(X)), Z), cons(Y, filter(X, sieve(Y)))) sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) The replacement map contains the following entries: primes: empty set sieve: {1} from: {1} s: {1} 0: empty set cons: {1} head: {1} tail: {1} if: {1} true: empty set false: empty set filter: {1, 2} divides: {1, 2} ---------------------------------------- (1) CSRInnermostProof (EQUIVALENT) The CSR is orthogonal. By [CS_Inn] we can switch to innermost. ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: primes -> sieve(from(s(s(0)))) from(X) -> cons(X, from(s(X))) head(cons(X, Y)) -> X tail(cons(X, Y)) -> Y if(true, X, Y) -> X if(false, X, Y) -> Y filter(s(s(X)), cons(Y, Z)) -> if(divides(s(s(X)), Y), filter(s(s(X)), Z), cons(Y, filter(X, sieve(Y)))) sieve(cons(X, Y)) -> cons(X, filter(X, sieve(Y))) The replacement map contains the following entries: primes: empty set sieve: {1} from: {1} s: {1} 0: empty set cons: {1} head: {1} tail: {1} if: {1} true: empty set false: empty set filter: {1, 2} divides: {1, 2} Innermost Strategy. ---------------------------------------- (3) CSDependencyPairsProof (EQUIVALENT) popout

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

job log

popout

actions

all output return to TRS Context Sensitive