Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092517
details
property
value
status
complete
benchmark
Ex49_GM04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n143.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.5681 seconds
cpu usage
3.65097
user time
3.49274
system time
0.158234
max virtual memory
1.8407092E7
max residence set size
228076.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 48 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 16 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: minus(0, Y) -> 0 minus(s(X), s(Y)) -> minus(X, Y) geq(X, 0) -> true geq(0, s(Y)) -> false geq(s(X), s(Y)) -> geq(X, Y) div(0, s(Y)) -> 0 div(s(X), s(Y)) -> if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0) if(true, X, Y) -> X if(false, X, Y) -> Y The replacement map contains the following entries: minus: empty set 0: empty set s: {1} geq: empty set true: empty set false: empty set div: {1} if: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: minus(0, Y) -> 0 minus(s(X), s(Y)) -> minus(X, Y) geq(X, 0) -> true geq(0, s(Y)) -> false geq(s(X), s(Y)) -> geq(X, Y) div(0, s(Y)) -> 0 div(s(X), s(Y)) -> if(geq(X, Y), s(div(minus(X, Y), s(Y))), 0) if(true, X, Y) -> X if(false, X, Y) -> Y The replacement map contains the following entries: minus: empty set 0: empty set s: {1} geq: empty set true: empty set false: empty set div: {1} if: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(div(x_1, x_2)) = 2*x_1 POL(false) = 0 POL(geq(x_1, x_2)) = x_1 POL(if(x_1, x_2, x_3)) = x_1 + 2*x_2 + 2*x_3 POL(minus(x_1, x_2)) = 0 POL(s(x_1)) = 1 + 2*x_1 POL(true) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: geq(s(X), s(Y)) -> geq(X, Y) ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: minus(0, Y) -> 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive