Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer TRS Innermost pair #487100592
details
property
value
status
complete
benchmark
c.04.itrs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
Mixed_ITRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.62033 seconds
cpu usage
6.679
user time
6.38247
system time
0.296528
max virtual memory
1.8809468E7
max residence set size
357600.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.itrs # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 549 ms] (8) IDP (9) IDependencyGraphProof [EQUIVALENT, 0 ms] (10) IDP (11) IDPNonInfProof [SOUND, 73 ms] (12) IDP (13) IDependencyGraphProof [EQUIVALENT, 0 ms] (14) 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_0(x, y, z) -> Cond_eval_0(y > 0, x, y, z) Cond_eval_0(TRUE, x, y, z) -> eval_1(x, y, z) eval_1(x, y, z) -> Cond_eval_1(y > x && z > y && y > 0, x, y, z) Cond_eval_1(TRUE, x, y, z) -> eval_1(x + y, y, z) eval_1(x, y, z) -> Cond_eval_11(y > x && z > y && y > 0, x, y, z) Cond_eval_11(TRUE, x, y, z) -> eval_1(x, y, x - y) The set Q consists of the following terms: eval_0(x0, x1, x2) Cond_eval_0(TRUE, x0, x1, x2) eval_1(x0, x1, x2) Cond_eval_1(TRUE, x0, x1, x2) Cond_eval_11(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 ! ~ 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 >>>
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer TRS Innermost