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	n150.star.cs.uiowa.edu
space	Mixed_ITRS_2014

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	27.3777 seconds
cpu usage	90.38
user time	88.3946
system time	1.98537
max virtual memory	2.0692412E7
max residence set size	5114744.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/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, 20 ms] (6) IDP (7) IDependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) IDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) IDP (12) IDPNonInfProof [SOUND, 242 ms] (13) IDP (14) IDependencyGraphProof [EQUIVALENT, 0 ms] (15) TRUE (16) IDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) IDP (19) IDPNonInfProof [SOUND, 173 ms] (20) IDP (21) IDependencyGraphProof [EQUIVALENT, 0 ms] (22) IDP (23) IDPNonInfProof [SOUND, 101 ms] (24) IDP (25) IDependencyGraphProof [EQUIVALENT, 0 ms] (26) IDP (27) IDPNonInfProof [SOUND, 5 ms] (28) IDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES (31) IDP (32) UsableRulesProof [EQUIVALENT, 0 ms] (33) IDP (34) IDPNonInfProof [SOUND, 280 ms] (35) IDP (36) IDependencyGraphProof [EQUIVALENT, 0 ms] (37) TRUE (38) IDP (39) UsableRulesProof [EQUIVALENT, 0 ms] (40) IDP (41) IDPtoQDPProof [SOUND, 49 ms] (42) QDP (43) QReductionProof [EQUIVALENT, 0 ms] (44) QDP (45) QDPQMonotonicMRRProof [EQUIVALENT, 130 ms] (46) QDP (47) PisEmptyProof [EQUIVALENT, 0 ms] (48) YES (49) IDP (50) UsableRulesProof [EQUIVALENT, 0 ms] (51) IDP (52) IDPNonInfProof [SOUND, 19 ms] (53) IDP (54) IDependencyGraphProof [EQUIVALENT, 0 ms] (55) 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)) Cond_mem(TRUE, x, cons(y, zs)) -> TRUE mem(x, cons(y, zs)) -> Cond_mem1(y > x, 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