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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.73545 seconds
cpu usage	12.8507
user time	12.2199
system time	0.630801
max virtual memory	1.9235228E7
max residence set size	728052.0

stage attributes

key	value
starexec-result	YES

output

11.12/4.84 YES 12.74/5.22 proof of /export/starexec/sandbox2/benchmark/theBenchmark.itrs 12.74/5.22 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 12.74/5.22 12.74/5.22 12.74/5.22 Termination of the given ITRS could be proven: 12.74/5.22 12.74/5.22 (0) ITRS 12.74/5.22 (1) ITRStoIDPProof [EQUIVALENT, 0 ms] 12.74/5.22 (2) IDP 12.74/5.22 (3) UsableRulesProof [EQUIVALENT, 0 ms] 12.74/5.22 (4) IDP 12.74/5.22 (5) IDPNonInfProof [SOUND, 1624 ms] 12.74/5.22 (6) IDP 12.74/5.22 (7) IDependencyGraphProof [EQUIVALENT, 0 ms] 12.74/5.22 (8) IDP 12.74/5.22 (9) IDPNonInfProof [SOUND, 844 ms] 12.74/5.22 (10) IDP 12.74/5.22 (11) IDependencyGraphProof [EQUIVALENT, 0 ms] 12.74/5.22 (12) TRUE 12.74/5.22 12.74/5.22 12.74/5.22 ---------------------------------------- 12.74/5.22 12.74/5.22 (0) 12.74/5.22 Obligation: 12.74/5.22 ITRS problem: 12.74/5.22 12.74/5.22 The following function symbols are pre-defined: 12.74/5.22 <<< 12.74/5.22 & ~ Bwand: (Integer, Integer) -> Integer 12.74/5.22 >= ~ Ge: (Integer, Integer) -> Boolean 12.74/5.22 | ~ Bwor: (Integer, Integer) -> Integer 12.74/5.22 / ~ Div: (Integer, Integer) -> Integer 12.74/5.22 != ~ Neq: (Integer, Integer) -> Boolean 12.74/5.22 && ~ Land: (Boolean, Boolean) -> Boolean 12.74/5.22 ! ~ Lnot: (Boolean) -> Boolean 12.74/5.22 = ~ Eq: (Integer, Integer) -> Boolean 12.74/5.22 <= ~ Le: (Integer, Integer) -> Boolean 12.74/5.22 ^ ~ Bwxor: (Integer, Integer) -> Integer 12.74/5.22 % ~ Mod: (Integer, Integer) -> Integer 12.74/5.22 + ~ Add: (Integer, Integer) -> Integer 12.74/5.22 > ~ Gt: (Integer, Integer) -> Boolean 12.74/5.22 -1 ~ UnaryMinus: (Integer) -> Integer 12.74/5.22 < ~ Lt: (Integer, Integer) -> Boolean 12.74/5.22 || ~ Lor: (Boolean, Boolean) -> Boolean 12.74/5.22 - ~ Sub: (Integer, Integer) -> Integer 12.74/5.22 ~ ~ Bwnot: (Integer) -> Integer 12.74/5.22 * ~ Mul: (Integer, Integer) -> Integer 12.74/5.22 >>> 12.74/5.22 12.74/5.22 The TRS R consists of the following rules: 12.74/5.22 eval(an, bn, cn, i, j) -> Cond_eval(j < bn && i < an, an, bn, cn, i, j) 12.74/5.22 Cond_eval(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i, j + 1) 12.74/5.22 eval(an, bn, cn, i, j) -> Cond_eval1(j < bn && i < an, an, bn, cn, i, j) 12.74/5.22 Cond_eval1(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i + 1, j) 12.74/5.22 eval(an, bn, cn, i, j) -> Cond_eval2(j >= bn && i < an, an, bn, cn, i, j) 12.74/5.22 Cond_eval2(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i + 1, j) 12.74/5.22 eval(an, bn, cn, i, j) -> Cond_eval3(j < bn && i >= an, an, bn, cn, i, j) 12.74/5.22 Cond_eval3(TRUE, an, bn, cn, i, j) -> eval(an, bn, cn + 1, i, j + 1) 12.74/5.22 The set Q consists of the following terms: 12.74/5.22 eval(x0, x1, x2, x3, x4) 12.74/5.22 Cond_eval(TRUE, x0, x1, x2, x3, x4) 12.74/5.22 Cond_eval1(TRUE, x0, x1, x2, x3, x4) 12.74/5.22 Cond_eval2(TRUE, x0, x1, x2, x3, x4) 12.74/5.22 Cond_eval3(TRUE, x0, x1, x2, x3, x4) 12.74/5.22 12.74/5.22 ---------------------------------------- 12.74/5.22 12.74/5.22 (1) ITRStoIDPProof (EQUIVALENT) 12.74/5.22 Added dependency pairs 12.74/5.22 ---------------------------------------- 12.74/5.22 12.74/5.22 (2) 12.74/5.22 Obligation: 12.74/5.22 IDP problem: 12.74/5.22 The following function symbols are pre-defined: 12.74/5.22 <<< 12.74/5.22 & ~ Bwand: (Integer, Integer) -> Integer 12.74/5.22 >= ~ Ge: (Integer, Integer) -> Boolean 12.74/5.22 | ~ Bwor: (Integer, Integer) -> Integer 12.74/5.22 / ~ Div: (Integer, Integer) -> Integer 12.74/5.22 != ~ Neq: (Integer, Integer) -> Boolean 12.74/5.22 && ~ Land: (Boolean, Boolean) -> Boolean 12.74/5.22 ! ~ Lnot: (Boolean) -> Boolean 12.74/5.22 = ~ Eq: (Integer, Integer) -> Boolean 12.74/5.22 <= ~ Le: (Integer, Integer) -> Boolean 12.74/5.22 ^ ~ Bwxor: (Integer, Integer) -> Integer 12.74/5.22 % ~ Mod: (Integer, Integer) -> Integer 12.74/5.22 + ~ Add: (Integer, Integer) -> Integer 12.74/5.22 > ~ Gt: (Integer, Integer) -> Boolean 12.74/5.22 -1 ~ UnaryMinus: (Integer) -> Integer 12.74/5.22 < ~ Lt: (Integer, Integer) -> Boolean 12.74/5.22 || ~ Lor: (Boolean, Boolean) -> Boolean 12.74/5.22 - ~ Sub: (Integer, Integer) -> Integer 12.74/5.22 ~ ~ Bwnot: (Integer) -> Integer 12.74/5.22 * ~ Mul: (Integer, Integer) -> Integer 12.74/5.22 >>> 12.74/5.22 12.74/5.22 popout

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

job log

popout

actions

all output return to Integer_TRS_Innermost 2019-03-21 04.53