details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.75103116035 seconds
cpu usage	10.133434973
max memory	5.12077824E8

stage attributes

key	value
output-size	142480
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, 415 ms] (6) IDP (7) IDependencyGraphProof [EQUIVALENT, 0 ms] (8) IDP (9) IDPNonInfProof [SOUND, 391 ms] (10) IDP (11) IDependencyGraphProof [EQUIVALENT, 0 ms] (12) IDP (13) IDPNonInfProof [SOUND, 124 ms] (14) IDP (15) IDependencyGraphProof [EQUIVALENT, 0 ms] (16) 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 > z, x, y, z) Cond_eval(TRUE, x, y, z) -> eval(x - 1, y, z) eval(x, y, z) -> Cond_eval1(y > z && x > z, x, y, z) Cond_eval1(TRUE, x, y, z) -> eval(x - 1, y, z) eval(x, y, z) -> Cond_eval2(x > z && z >= x && y > z, x, y, z) Cond_eval2(TRUE, x, y, z) -> eval(x, y - 1, z) eval(x, y, z) -> Cond_eval3(y > z && z >= x, x, y, z) Cond_eval3(TRUE, x, y, z) -> eval(x, y - 1, z) eval(x, y, z) -> Cond_eval4(x > z && z >= x && z >= y, x, y, z) Cond_eval4(TRUE, x, y, z) -> eval(x, y, z) eval(x, y, z) -> Cond_eval5(y > z && z >= x && z >= y, x, y, z) Cond_eval5(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) Cond_eval3(TRUE, x0, x1, x2) Cond_eval4(TRUE, x0, x1, x2) Cond_eval5(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 popout

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

job log

popout

actions

all output return to Integ TRS Inner 43557