details

property	value
status	complete
benchmark	eratosthenes.itrs
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n143.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	27.603178978 seconds
cpu usage	91.066457907
max memory	5.215563776E9

stage attributes

key	value
output-size	226667
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.itrs /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.itrs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ITRS could be proven: (0) ITRS (1) ITRStoIDPProof [EQUIVALENT, 0 ms] (2) IDP (3) UsableRulesProof [EQUIVALENT, 0 ms] (4) IDP (5) ItpfGraphProof [EQUIVALENT, 32 ms] (6) IDP (7) IDependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) IDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) IDP (12) IDPNonInfProof [SOUND, 236 ms] (13) IDP (14) IDependencyGraphProof [EQUIVALENT, 0 ms] (15) TRUE (16) IDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) IDP (19) IDPNonInfProof [SOUND, 185 ms] (20) IDP (21) IDependencyGraphProof [EQUIVALENT, 0 ms] (22) IDP (23) IDPNonInfProof [SOUND, 113 ms] (24) IDP (25) IDependencyGraphProof [EQUIVALENT, 0 ms] (26) TRUE (27) IDP (28) UsableRulesProof [EQUIVALENT, 0 ms] (29) IDP (30) IDPNonInfProof [SOUND, 304 ms] (31) IDP (32) IDependencyGraphProof [EQUIVALENT, 0 ms] (33) TRUE (34) IDP (35) UsableRulesProof [EQUIVALENT, 0 ms] (36) IDP (37) IDPtoQDPProof [SOUND, 68 ms] (38) QDP (39) QReductionProof [EQUIVALENT, 0 ms] (40) QDP (41) QDPQMonotonicMRRProof [EQUIVALENT, 107 ms] (42) QDP (43) PisEmptyProof [EQUIVALENT, 0 ms] (44) YES (45) IDP (46) UsableRulesProof [EQUIVALENT, 5 ms] (47) IDP (48) IDPNonInfProof [SOUND, 36 ms] (49) IDP (50) IDependencyGraphProof [EQUIVALENT, 0 ms] (51) TRUE ---------------------------------------- (0) Obligation: ITRS problem: The following function symbols are pre-defined: <<< & ~ Bwand: (Integer, Integer) -> Integer >= ~ Ge: (Integer, Integer) -> Boolean | ~ Bwor: (Integer, Integer) -> Integer / ~ Div: (Integer, Integer) -> Integer != ~ Neq: (Integer, Integer) -> Boolean && ~ Land: (Boolean, Boolean) -> Boolean ! ~ Lnot: (Boolean) -> Boolean = ~ Eq: (Integer, Integer) -> Boolean <= ~ Le: (Integer, Integer) -> Boolean ^ ~ Bwxor: (Integer, Integer) -> Integer % ~ Mod: (Integer, Integer) -> Integer > ~ Gt: (Integer, Integer) -> Boolean + ~ Add: (Integer, Integer) -> Integer -1 ~ Sub: (Integer, Integer) -> Integer < ~ Lt: (Integer, Integer) -> Boolean || ~ Lor: (Boolean, Boolean) -> Boolean - ~ UnaryMinus: (Integer) -> Integer ~ ~ Bwnot: (Integer) -> Integer * ~ Mul: (Integer, Integer) -> Integer >>> The TRS R consists of the following rules: isprime(x) -> mem(x, primes(x)) mem(x, nil) -> FALSE mem(x, cons(y, zs)) -> Cond_mem(x = y, x, cons(y, zs)) popout

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

job log

popout

actions

all output return to Integer TRS Innermost