details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.89894 seconds
cpu usage	18.1723
user time	17.5052
system time	0.667115
max virtual memory	2.0695068E7
max residence set size	944728.0

stage attributes

key	value
starexec-result	YES

output

17.87/9.81 YES 18.05/9.84 proof of /export/starexec/sandbox2/benchmark/theBenchmark.itrs 18.05/9.84 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 18.05/9.84 18.05/9.84 18.05/9.84 Termination of the given ITRS could be proven: 18.05/9.84 18.05/9.84 (0) ITRS 18.05/9.84 (1) ITRStoIDPProof [EQUIVALENT, 0 ms] 18.05/9.84 (2) IDP 18.05/9.84 (3) UsableRulesProof [EQUIVALENT, 0 ms] 18.05/9.84 (4) IDP 18.05/9.84 (5) IDependencyGraphProof [EQUIVALENT, 0 ms] 18.05/9.84 (6) IDP 18.05/9.84 (7) IDPNonInfProof [SOUND, 1408 ms] 18.05/9.84 (8) IDP 18.05/9.84 (9) IDependencyGraphProof [EQUIVALENT, 0 ms] 18.05/9.84 (10) IDP 18.05/9.84 (11) IDPNonInfProof [SOUND, 1165 ms] 18.05/9.84 (12) IDP 18.05/9.84 (13) IDependencyGraphProof [EQUIVALENT, 0 ms] 18.05/9.84 (14) IDP 18.05/9.84 (15) IDPNonInfProof [SOUND, 530 ms] 18.05/9.84 (16) IDP 18.05/9.84 (17) IDependencyGraphProof [EQUIVALENT, 0 ms] 18.05/9.84 (18) IDP 18.05/9.84 (19) IDPNonInfProof [SOUND, 57 ms] 18.05/9.84 (20) IDP 18.05/9.84 (21) IDependencyGraphProof [EQUIVALENT, 0 ms] 18.05/9.84 (22) TRUE 18.05/9.84 18.05/9.84 18.05/9.84 ---------------------------------------- 18.05/9.84 18.05/9.84 (0) 18.05/9.84 Obligation: 18.05/9.84 ITRS problem: 18.05/9.84 18.05/9.84 The following function symbols are pre-defined: 18.05/9.84 <<< 18.05/9.84 & ~ Bwand: (Integer, Integer) -> Integer 18.05/9.84 >= ~ Ge: (Integer, Integer) -> Boolean 18.05/9.84 | ~ Bwor: (Integer, Integer) -> Integer 18.05/9.84 / ~ Div: (Integer, Integer) -> Integer 18.05/9.84 != ~ Neq: (Integer, Integer) -> Boolean 18.05/9.84 && ~ Land: (Boolean, Boolean) -> Boolean 18.05/9.84 ! ~ Lnot: (Boolean) -> Boolean 18.05/9.84 = ~ Eq: (Integer, Integer) -> Boolean 18.05/9.84 <= ~ Le: (Integer, Integer) -> Boolean 18.05/9.84 ^ ~ Bwxor: (Integer, Integer) -> Integer 18.05/9.84 % ~ Mod: (Integer, Integer) -> Integer 18.05/9.84 > ~ Gt: (Integer, Integer) -> Boolean 18.05/9.84 + ~ Add: (Integer, Integer) -> Integer 18.05/9.84 -1 ~ UnaryMinus: (Integer) -> Integer 18.05/9.84 < ~ Lt: (Integer, Integer) -> Boolean 18.05/9.84 || ~ Lor: (Boolean, Boolean) -> Boolean 18.05/9.84 - ~ Sub: (Integer, Integer) -> Integer 18.05/9.84 ~ ~ Bwnot: (Integer) -> Integer 18.05/9.84 * ~ Mul: (Integer, Integer) -> Integer 18.05/9.84 >>> 18.05/9.84 18.05/9.84 The TRS R consists of the following rules: 18.05/9.84 eval_1(i, j, l, r, n) -> Cond_eval_1(l >= 2, i, j, l, r, n) 18.05/9.84 Cond_eval_1(TRUE, i, j, l, r, n) -> eval_2(i, j, l - 1, r, n) 18.05/9.84 eval_1(i, j, l, r, n) -> Cond_eval_11(2 > l, i, j, l, r, n) 18.05/9.84 Cond_eval_11(TRUE, i, j, l, r, n) -> eval_2(i, j, l, r - 1, n) 18.05/9.84 eval_2(i, j, l, r, n) -> Cond_eval_2(r >= 2, i, j, l, r, n) 18.05/9.84 Cond_eval_2(TRUE, i, j, l, r, n) -> eval_3(l, 2 * l, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_3(r >= j && r - 1 >= j, i, j, l, r, n) 18.05/9.84 Cond_eval_3(TRUE, i, j, l, r, n) -> eval_4(i, j, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_31(r >= j && r - 1 >= j, i, j, l, r, n) 18.05/9.84 Cond_eval_31(TRUE, i, j, l, r, n) -> eval_4(i, j + 1, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_32(r >= j && r - 1 >= j && j >= 1, i, j, l, r, n) 18.05/9.84 Cond_eval_32(TRUE, i, j, l, r, n) -> eval_3(j, 2 * j, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_33(r >= j && r - 1 >= j && j >= 1, i, j, l, r, n) 18.05/9.84 Cond_eval_33(TRUE, i, j, l, r, n) -> eval_3(j + 1, 2 * j + 2, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_34(r >= j && j > r - 1, i, j, l, r, n) 18.05/9.84 Cond_eval_34(TRUE, i, j, l, r, n) -> eval_4(i, j, l, r, n) 18.05/9.84 eval_3(i, j, l, r, n) -> Cond_eval_35(r >= j && j > r - 1 && j >= 1, i, j, l, r, n) 18.05/9.84 Cond_eval_35(TRUE, i, j, l, r, n) -> eval_3(j, 2 * j, l, r, n) 18.05/9.84 eval_4(i, j, l, r, n) -> Cond_eval_4(l >= 2 && l >= 1 && r >= 2, i, j, l, r, n) 18.05/9.84 Cond_eval_4(TRUE, i, j, l, r, n) -> eval_2(i, j, l - 1, r, n) 18.05/9.84 eval_4(i, j, l, r, n) -> Cond_eval_41(2 > l && l >= 1 && r >= 2, i, j, l, r, n) 18.05/9.84 Cond_eval_41(TRUE, i, j, l, r, n) -> eval_2(i, j, l, r - 1, n) 18.05/9.84 The set Q consists of the following terms: 18.05/9.84 eval_1(x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_1(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_11(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 eval_2(x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_2(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 eval_3(x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_3(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_31(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_32(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_33(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_34(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_35(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 eval_4(x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_4(TRUE, x0, x1, x2, x3, x4) 18.05/9.84 Cond_eval_41(TRUE, x0, x1, x2, x3, x4) 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