Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer TRS Innermost pair #487528965
details
property
value
status
complete
benchmark
countUpExp.itrs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
Mixed_ITRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.67181682587 seconds
cpu usage
4.365746039
max memory
2.5950208E8
stage attributes
key
value
output-size
23767
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.itrs /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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) AND (7) IDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) IDP (10) IDPNonInfProof [SOUND, 152 ms] (11) IDP (12) IDependencyGraphProof [EQUIVALENT, 0 ms] (13) TRUE (14) IDP (15) IDPNonInfProof [SOUND, 57 ms] (16) IDP (17) PisEmptyProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (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 + ~ Add: (Integer, Integer) -> Integer > ~ Gt: (Integer, Integer) -> Boolean -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: cu(TRUE, x) -> cu(x < exp(10, 2), x + 1) exp(x, y) -> if(y > 0, x, y) if(TRUE, x, y) -> x * exp(x, y - 1) if(FALSE, x, y) -> 1 The set Q consists of the following terms: cu(TRUE, x0) exp(x0, x1) if(TRUE, x0, x1) if(FALSE, x0, x1) ---------------------------------------- (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 + ~ Add: (Integer, Integer) -> Integer > ~ Gt: (Integer, Integer) -> Boolean -1 ~ UnaryMinus: (Integer) -> Integer < ~ Lt: (Integer, Integer) -> Boolean
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer TRS Innermost