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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	6.55805110931 seconds
cpu usage	17.69637928
max memory	7.85174528E8

stage attributes

key	value
output-size	255434
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) IDependencyGraphProof [EQUIVALENT, 0 ms] (6) IDP (7) IDPNonInfProof [SOUND, 1453 ms] (8) IDP (9) IDependencyGraphProof [EQUIVALENT, 0 ms] (10) IDP (11) IDPNonInfProof [SOUND, 1084 ms] (12) IDP (13) IDependencyGraphProof [EQUIVALENT, 0 ms] (14) IDP (15) IDPNonInfProof [SOUND, 608 ms] (16) IDP (17) IDependencyGraphProof [EQUIVALENT, 0 ms] (18) IDP (19) IDPNonInfProof [SOUND, 62 ms] (20) IDP (21) IDependencyGraphProof [EQUIVALENT, 0 ms] (22) 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_1(i, j, l, r, n) -> Cond_eval_1(l >= 2, i, j, l, r, n) Cond_eval_1(TRUE, i, j, l, r, n) -> eval_2(i, j, l - 1, r, n) eval_1(i, j, l, r, n) -> Cond_eval_11(2 > l, i, j, l, r, n) Cond_eval_11(TRUE, i, j, l, r, n) -> eval_2(i, j, l, r - 1, n) eval_2(i, j, l, r, n) -> Cond_eval_2(r >= 2, i, j, l, r, n) Cond_eval_2(TRUE, i, j, l, r, n) -> eval_3(l, 2 * l, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_3(r >= j && r - 1 >= j, i, j, l, r, n) Cond_eval_3(TRUE, i, j, l, r, n) -> eval_4(i, j, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_31(r >= j && r - 1 >= j, i, j, l, r, n) Cond_eval_31(TRUE, i, j, l, r, n) -> eval_4(i, j + 1, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_32(r >= j && r - 1 >= j && j >= 1, i, j, l, r, n) Cond_eval_32(TRUE, i, j, l, r, n) -> eval_3(j, 2 * j, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_33(r >= j && r - 1 >= j && j >= 1, i, j, l, r, n) Cond_eval_33(TRUE, i, j, l, r, n) -> eval_3(j + 1, 2 * j + 2, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_34(r >= j && j > r - 1, i, j, l, r, n) Cond_eval_34(TRUE, i, j, l, r, n) -> eval_4(i, j, l, r, n) eval_3(i, j, l, r, n) -> Cond_eval_35(r >= j && j > r - 1 && j >= 1, i, j, l, r, n) Cond_eval_35(TRUE, i, j, l, r, n) -> eval_3(j, 2 * j, l, r, n) eval_4(i, j, l, r, n) -> Cond_eval_4(l >= 2 && l >= 1 && r >= 2, i, j, l, r, n) Cond_eval_4(TRUE, i, j, l, r, n) -> eval_2(i, j, l - 1, r, n) eval_4(i, j, l, r, n) -> Cond_eval_41(2 > l && l >= 1 && r >= 2, i, j, l, r, n) Cond_eval_41(TRUE, i, j, l, r, n) -> eval_2(i, j, l, r - 1, n) The set Q consists of the following terms: eval_1(x0, x1, x2, x3, x4) Cond_eval_1(TRUE, x0, x1, x2, x3, x4) Cond_eval_11(TRUE, x0, x1, x2, x3, x4) eval_2(x0, x1, x2, x3, x4) Cond_eval_2(TRUE, x0, x1, x2, x3, x4) eval_3(x0, x1, x2, x3, x4) Cond_eval_3(TRUE, x0, x1, x2, x3, x4) Cond_eval_31(TRUE, x0, x1, x2, x3, x4) Cond_eval_32(TRUE, x0, x1, x2, x3, x4) popout

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

job log

popout

actions

all output return to Integ TRS Inner 43557