Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Integer TRS Innermost pair #487528933
details
property
value
status
complete
benchmark
csharp2.itrs
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Mixed_ITRS_2014
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.89534711838 seconds
cpu usage
4.097654472
max memory
2.44948992E8
stage attributes
key
value
output-size
21472
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: 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) IDPNonInfProof [SOUND, 145 ms] (6) IDP (7) IDependencyGraphProof [EQUIVALENT, 0 ms] (8) 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 + ~ 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: b10(sv14_14, sv23_37, sv24_38) -> b14(sv14_14, sv23_37, sv24_38) Cond_b14(TRUE, sv14_14, sv23_37, sv24_38) -> b15(sv14_14, sv23_37, sv24_38) b14(sv14_14, sv23_37, sv24_38) -> Cond_b14(sv23_37 >= sv14_14 && 1 < sv14_14 && 0 < sv24_38 && 1 < sv23_37, sv14_14, sv23_37, sv24_38) b15(sv14_14, sv23_37, sv24_38) -> b10(sv14_14, sv23_37 - sv14_14, sv24_38 + 1) The set Q consists of the following terms: b10(x0, x1, x2) Cond_b14(TRUE, x0, x1, x2) b14(x0, x1, x2) b15(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 + ~ 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 following domains are used: Boolean, Integer
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Integer TRS Innermost