Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer_TRS_Innermost 2019-03-21 04.53 pair #429995080
details
property
value
status
complete
benchmark
a.10.itrs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n009.star.cs.uiowa.edu
space
Mixed_ITRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
10.0695 seconds
cpu usage
24.3185
user time
23.2076
system time
1.11086
max virtual memory
3.8046904E7
max residence set size
912660.0
stage attributes
key
value
starexec-result
YES
output
24.07/10.00 YES 24.21/10.02 proof of /export/starexec/sandbox/benchmark/theBenchmark.itrs 24.21/10.02 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 24.21/10.02 24.21/10.02 24.21/10.02 Termination of the given ITRS could be proven: 24.21/10.02 24.21/10.02 (0) ITRS 24.21/10.02 (1) ITRStoIDPProof [EQUIVALENT, 0 ms] 24.21/10.02 (2) IDP 24.21/10.02 (3) UsableRulesProof [EQUIVALENT, 0 ms] 24.21/10.02 (4) IDP 24.21/10.02 (5) IDPNonInfProof [SOUND, 247 ms] 24.21/10.02 (6) IDP 24.21/10.02 (7) IDPNonInfProof [SOUND, 3824 ms] 24.21/10.02 (8) IDP 24.21/10.02 (9) IDependencyGraphProof [EQUIVALENT, 0 ms] 24.21/10.02 (10) TRUE 24.21/10.02 24.21/10.02 24.21/10.02 ---------------------------------------- 24.21/10.02 24.21/10.02 (0) 24.21/10.02 Obligation: 24.21/10.02 ITRS problem: 24.21/10.02 24.21/10.02 The following function symbols are pre-defined: 24.21/10.02 <<< 24.21/10.02 & ~ Bwand: (Integer, Integer) -> Integer 24.21/10.02 >= ~ Ge: (Integer, Integer) -> Boolean 24.21/10.02 | ~ Bwor: (Integer, Integer) -> Integer 24.21/10.02 / ~ Div: (Integer, Integer) -> Integer 24.21/10.02 != ~ Neq: (Integer, Integer) -> Boolean 24.21/10.02 && ~ Land: (Boolean, Boolean) -> Boolean 24.21/10.02 ! ~ Lnot: (Boolean) -> Boolean 24.21/10.02 = ~ Eq: (Integer, Integer) -> Boolean 24.21/10.02 <= ~ Le: (Integer, Integer) -> Boolean 24.21/10.02 ^ ~ Bwxor: (Integer, Integer) -> Integer 24.21/10.02 % ~ Mod: (Integer, Integer) -> Integer 24.21/10.02 + ~ Add: (Integer, Integer) -> Integer 24.21/10.02 > ~ Gt: (Integer, Integer) -> Boolean 24.21/10.02 -1 ~ UnaryMinus: (Integer) -> Integer 24.21/10.02 < ~ Lt: (Integer, Integer) -> Boolean 24.21/10.02 || ~ Lor: (Boolean, Boolean) -> Boolean 24.21/10.02 - ~ Sub: (Integer, Integer) -> Integer 24.21/10.02 ~ ~ Bwnot: (Integer) -> Integer 24.21/10.02 * ~ Mul: (Integer, Integer) -> Integer 24.21/10.02 >>> 24.21/10.02 24.21/10.02 The TRS R consists of the following rules: 24.21/10.02 eval(x, y) -> Cond_eval(x > y, x, y) 24.21/10.02 Cond_eval(TRUE, x, y) -> eval(x, y + 1) 24.21/10.02 eval(x, y) -> Cond_eval1(y > x && x > y, x, y) 24.21/10.02 Cond_eval1(TRUE, x, y) -> eval(x, y + 1) 24.21/10.02 eval(x, y) -> Cond_eval2(x > y && y >= x, x, y) 24.21/10.02 Cond_eval2(TRUE, x, y) -> eval(x + 1, y) 24.21/10.02 eval(x, y) -> Cond_eval3(y > x && y >= x, x, y) 24.21/10.02 Cond_eval3(TRUE, x, y) -> eval(x + 1, y) 24.21/10.02 The set Q consists of the following terms: 24.21/10.02 eval(x0, x1) 24.21/10.02 Cond_eval(TRUE, x0, x1) 24.21/10.02 Cond_eval1(TRUE, x0, x1) 24.21/10.02 Cond_eval2(TRUE, x0, x1) 24.21/10.02 Cond_eval3(TRUE, x0, x1) 24.21/10.02 24.21/10.02 ---------------------------------------- 24.21/10.02 24.21/10.02 (1) ITRStoIDPProof (EQUIVALENT) 24.21/10.02 Added dependency pairs 24.21/10.02 ---------------------------------------- 24.21/10.02 24.21/10.02 (2) 24.21/10.02 Obligation: 24.21/10.02 IDP problem: 24.21/10.02 The following function symbols are pre-defined: 24.21/10.02 <<< 24.21/10.02 & ~ Bwand: (Integer, Integer) -> Integer 24.21/10.02 >= ~ Ge: (Integer, Integer) -> Boolean 24.21/10.02 | ~ Bwor: (Integer, Integer) -> Integer 24.21/10.02 / ~ Div: (Integer, Integer) -> Integer 24.21/10.02 != ~ Neq: (Integer, Integer) -> Boolean 24.21/10.02 && ~ Land: (Boolean, Boolean) -> Boolean 24.21/10.02 ! ~ Lnot: (Boolean) -> Boolean 24.21/10.02 = ~ Eq: (Integer, Integer) -> Boolean 24.21/10.02 <= ~ Le: (Integer, Integer) -> Boolean 24.21/10.02 ^ ~ Bwxor: (Integer, Integer) -> Integer 24.21/10.02 % ~ Mod: (Integer, Integer) -> Integer 24.21/10.02 + ~ Add: (Integer, Integer) -> Integer 24.21/10.02 > ~ Gt: (Integer, Integer) -> Boolean 24.21/10.02 -1 ~ UnaryMinus: (Integer) -> Integer 24.21/10.02 < ~ Lt: (Integer, Integer) -> Boolean 24.21/10.02 || ~ Lor: (Boolean, Boolean) -> Boolean 24.21/10.02 - ~ Sub: (Integer, Integer) -> Integer 24.21/10.02 ~ ~ Bwnot: (Integer) -> Integer 24.21/10.02 * ~ Mul: (Integer, Integer) -> Integer 24.21/10.02 >>> 24.21/10.02 24.21/10.02 24.21/10.02 The following domains are used: 24.21/10.02 Integer, Boolean
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