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