Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Contextsensitive pair #487092535
details
property
value
status
complete
benchmark
Ex5_DLMMU04.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n147.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.65647 seconds
cpu usage
3.70715
user time
3.53078
system time
0.176364
max virtual memory
1.8407092E7
max residence set size
235528.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, 56 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 18 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 7 ms] (8) CSR (9) CSRRRRProof [EQUIVALENT, 0 ms] (10) CSR (11) RisEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: pairNs -> cons(0, incr(oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) tail(cons(X, XS)) -> XS repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) The replacement map contains the following entries: pairNs: empty set cons: {1} 0: empty set incr: {1} oddNs: empty set s: {1} take: {1, 2} nil: empty set zip: {1, 2} pair: {1, 2} tail: {1} repItems: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: pairNs -> cons(0, incr(oddNs)) oddNs -> incr(pairNs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) take(0, XS) -> nil take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) zip(nil, XS) -> nil zip(X, nil) -> nil zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) tail(cons(X, XS)) -> XS repItems(nil) -> nil repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) The replacement map contains the following entries: pairNs: empty set cons: {1} 0: empty set incr: {1} oddNs: empty set s: {1} take: {1, 2} nil: empty set zip: {1, 2} pair: {1, 2} tail: {1} repItems: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons(x_1, x_2)) = 2*x_1 + x_2 POL(incr(x_1)) = 2*x_1 POL(nil) = 0 POL(oddNs) = 0 POL(pair(x_1, x_2)) = x_1 + x_2 POL(pairNs) = 0 POL(repItems(x_1)) = 2 + 2*x_1 POL(s(x_1)) = 2*x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Contextsensitive