details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.8336 seconds
cpu usage	7.07133
user time	6.66697
system time	0.404359
max virtual memory	1.8943624E7
max residence set size	402184.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) IDPNonInfProof [SOUND, 495 ms] (6) AND (7) IDP (8) IDependencyGraphProof [EQUIVALENT, 0 ms] (9) IDP (10) IDPNonInfProof [SOUND, 48 ms] (11) IDP (12) IDependencyGraphProof [EQUIVALENT, 0 ms] (13) TRUE (14) IDP (15) IDependencyGraphProof [EQUIVALENT, 0 ms] (16) IDP (17) IDPNonInfProof [SOUND, 68 ms] (18) IDP (19) IDependencyGraphProof [EQUIVALENT, 0 ms] (20) 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 ~ UnaryMinus: (Integer) -> Integer < ~ Lt: (Integer, Integer) -> Boolean || ~ Lor: (Boolean, Boolean) -> Boolean - ~ Sub: (Integer, Integer) -> Integer ~ ~ Bwnot: (Integer) -> Integer * ~ Mul: (Integer, Integer) -> Integer >>> The TRS R consists of the following rules: eval(x, y, z) -> Cond_eval(x + y > z && z >= 0 && x > 0, x, y, z) Cond_eval(TRUE, x, y, z) -> eval(x - 1, y, z) eval(x, y, z) -> Cond_eval1(x + y > z && z >= 0 && 0 >= x && y > 0, x, y, z) Cond_eval1(TRUE, x, y, z) -> eval(x, y - 1, z) eval(x, y, z) -> Cond_eval2(x + y > z && z >= 0 && 0 >= x && 0 >= y, x, y, z) Cond_eval2(TRUE, x, y, z) -> eval(x, y, z) The set Q consists of the following terms: eval(x0, x1, x2) Cond_eval(TRUE, x0, x1, x2) Cond_eval1(TRUE, x0, x1, x2) Cond_eval2(TRUE, x0, x1, x2) ---------------------------------------- (1) ITRStoIDPProof (EQUIVALENT) Added dependency pairs ---------------------------------------- (2) Obligation: IDP 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 ~ UnaryMinus: (Integer) -> Integer < ~ Lt: (Integer, Integer) -> Boolean || ~ Lor: (Boolean, Boolean) -> Boolean - ~ Sub: (Integer, Integer) -> Integer popout

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

job log

popout

actions

all output return to Integer TRS Innermost