details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.99972987175 seconds
cpu usage	14.915080772
max memory	7.28997888E8

stage attributes

key	value
output-size	129944
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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, 1800 ms] (6) IDP (7) IDependencyGraphProof [EQUIVALENT, 0 ms] (8) IDP (9) IDPNonInfProof [SOUND, 843 ms] (10) AND (11) IDP (12) IDependencyGraphProof [EQUIVALENT, 0 ms] (13) TRUE (14) IDP (15) IDPNonInfProof [SOUND, 234 ms] (16) IDP (17) IDependencyGraphProof [EQUIVALENT, 0 ms] (18) 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 + ~ Add: (Integer, Integer) -> Integer > ~ Gt: (Integer, Integer) -> Boolean -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(an, bn, cn, i, j) -> Cond_eval(j < bn && i < an, an, bn, cn, i, j) Cond_eval(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i, j + 1) eval(an, bn, cn, i, j) -> Cond_eval1(j < bn && i < an, an, bn, cn, i, j) Cond_eval1(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i + 1, j) eval(an, bn, cn, i, j) -> Cond_eval2(j >= bn && i < an, an, bn, cn, i, j) Cond_eval2(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i + 1, j) eval(an, bn, cn, i, j) -> Cond_eval3(j < bn && i >= an, an, bn, cn, i, j) Cond_eval3(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i, j + 1) The set Q consists of the following terms: eval(x0, x1, x2, x3, x4) Cond_eval(TRUE, x0, x1, x2, x3, x4) Cond_eval1(TRUE, x0, x1, x2, x3, x4) Cond_eval2(TRUE, x0, x1, x2, x3, x4) Cond_eval3(TRUE, x0, x1, x2, x3, x4) ---------------------------------------- (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 popout

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

job log

popout

actions

all output return to Integ TRS Inner 43557