Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Contextsensitive 2019-03-21 05.07 pair #429997009
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
n170.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.60708 seconds
cpu usage
3.72935
user time
3.56777
system time
0.161578
max virtual memory
1.8341532E7
max residence set size
234656.0
stage attributes
key
value
starexec-result
YES
output
3.46/1.57 YES 3.46/1.58 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.46/1.58 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.46/1.58 3.46/1.58 3.46/1.58 Termination of the given CSR could be proven: 3.46/1.58 3.46/1.58 (0) CSR 3.46/1.58 (1) CSRRRRProof [EQUIVALENT, 76 ms] 3.46/1.58 (2) CSR 3.46/1.58 (3) CSRRRRProof [EQUIVALENT, 19 ms] 3.46/1.58 (4) CSR 3.46/1.58 (5) CSRRRRProof [EQUIVALENT, 0 ms] 3.46/1.58 (6) CSR 3.46/1.58 (7) CSRRRRProof [EQUIVALENT, 6 ms] 3.46/1.58 (8) CSR 3.46/1.58 (9) CSRRRRProof [EQUIVALENT, 0 ms] 3.46/1.58 (10) CSR 3.46/1.58 (11) RisEmptyProof [EQUIVALENT, 0 ms] 3.46/1.58 (12) YES 3.46/1.58 3.46/1.58 3.46/1.58 ---------------------------------------- 3.46/1.58 3.46/1.58 (0) 3.46/1.58 Obligation: 3.46/1.58 Context-sensitive rewrite system: 3.46/1.58 The TRS R consists of the following rules: 3.46/1.58 3.46/1.58 pairNs -> cons(0, incr(oddNs)) 3.46/1.58 oddNs -> incr(pairNs) 3.46/1.58 incr(cons(X, XS)) -> cons(s(X), incr(XS)) 3.46/1.58 take(0, XS) -> nil 3.46/1.58 take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) 3.46/1.58 zip(nil, XS) -> nil 3.46/1.58 zip(X, nil) -> nil 3.46/1.58 zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) 3.46/1.58 tail(cons(X, XS)) -> XS 3.46/1.58 repItems(nil) -> nil 3.46/1.58 repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) 3.46/1.58 3.46/1.58 The replacement map contains the following entries: 3.46/1.58 3.46/1.58 pairNs: empty set 3.46/1.58 cons: {1} 3.46/1.58 0: empty set 3.46/1.58 incr: {1} 3.46/1.58 oddNs: empty set 3.46/1.58 s: {1} 3.46/1.58 take: {1, 2} 3.46/1.58 nil: empty set 3.46/1.58 zip: {1, 2} 3.46/1.58 pair: {1, 2} 3.46/1.58 tail: {1} 3.46/1.58 repItems: {1} 3.46/1.58 3.46/1.58 ---------------------------------------- 3.46/1.58 3.46/1.58 (1) CSRRRRProof (EQUIVALENT) 3.46/1.58 The following CSR is given: Context-sensitive rewrite system: 3.46/1.58 The TRS R consists of the following rules: 3.46/1.58 3.46/1.58 pairNs -> cons(0, incr(oddNs)) 3.46/1.58 oddNs -> incr(pairNs) 3.46/1.58 incr(cons(X, XS)) -> cons(s(X), incr(XS)) 3.46/1.58 take(0, XS) -> nil 3.46/1.58 take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) 3.46/1.58 zip(nil, XS) -> nil 3.46/1.58 zip(X, nil) -> nil 3.46/1.58 zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) 3.46/1.58 tail(cons(X, XS)) -> XS 3.46/1.58 repItems(nil) -> nil 3.46/1.58 repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS))) 3.46/1.58 3.46/1.58 The replacement map contains the following entries: 3.46/1.58 3.46/1.58 pairNs: empty set 3.46/1.58 cons: {1} 3.46/1.58 0: empty set 3.46/1.58 incr: {1} 3.46/1.58 oddNs: empty set 3.46/1.58 s: {1} 3.46/1.58 take: {1, 2} 3.46/1.58 nil: empty set 3.46/1.58 zip: {1, 2} 3.46/1.58 pair: {1, 2} 3.46/1.58 tail: {1} 3.46/1.58 repItems: {1} 3.46/1.58 Used ordering: 3.46/1.58 Polynomial interpretation [POLO]: 3.46/1.58 3.46/1.58 POL(0) = 0 3.46/1.58 POL(cons(x_1, x_2)) = 2*x_1 + x_2 3.46/1.58 POL(incr(x_1)) = 2*x_1 3.46/1.58 POL(nil) = 0 3.46/1.58 POL(oddNs) = 0 3.46/1.58 POL(pair(x_1, x_2)) = x_1 + x_2 3.46/1.58 POL(pairNs) = 0 3.46/1.58 POL(repItems(x_1)) = 2 + 2*x_1 3.46/1.58 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 2019-03-21 05.07