Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Contextsensitive 2019-03-21 05.07 pair #429996987
details
property
value
status
complete
benchmark
ExIntrod_GM01.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.58233 seconds
cpu usage
3.71996
user time
3.54958
system time
0.170382
max virtual memory
1.8341304E7
max residence set size
233928.0
stage attributes
key
value
starexec-result
YES
output
3.51/1.53 YES 3.51/1.54 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.51/1.54 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.51/1.54 3.51/1.54 3.51/1.54 Termination of the given CSR could be proven: 3.51/1.54 3.51/1.54 (0) CSR 3.51/1.54 (1) CSRRRRProof [EQUIVALENT, 58 ms] 3.51/1.54 (2) CSR 3.51/1.54 (3) CSRRRRProof [EQUIVALENT, 7 ms] 3.51/1.54 (4) CSR 3.51/1.54 (5) CSRRRRProof [EQUIVALENT, 0 ms] 3.51/1.54 (6) CSR 3.51/1.54 (7) CSRRRRProof [EQUIVALENT, 0 ms] 3.51/1.54 (8) CSR 3.51/1.54 (9) CSRRRRProof [EQUIVALENT, 6 ms] 3.51/1.54 (10) CSR 3.51/1.54 (11) RisEmptyProof [EQUIVALENT, 0 ms] 3.51/1.54 (12) YES 3.51/1.54 3.51/1.54 3.51/1.54 ---------------------------------------- 3.51/1.54 3.51/1.54 (0) 3.51/1.54 Obligation: 3.51/1.54 Context-sensitive rewrite system: 3.51/1.54 The TRS R consists of the following rules: 3.51/1.54 3.51/1.54 incr(nil) -> nil 3.51/1.54 incr(cons(X, L)) -> cons(s(X), incr(L)) 3.51/1.54 adx(nil) -> nil 3.51/1.54 adx(cons(X, L)) -> incr(cons(X, adx(L))) 3.51/1.54 nats -> adx(zeros) 3.51/1.54 zeros -> cons(0, zeros) 3.51/1.54 head(cons(X, L)) -> X 3.51/1.54 tail(cons(X, L)) -> L 3.51/1.54 3.51/1.54 The replacement map contains the following entries: 3.51/1.54 3.51/1.54 incr: {1} 3.51/1.54 nil: empty set 3.51/1.54 cons: {1} 3.51/1.54 s: {1} 3.51/1.54 adx: {1} 3.51/1.54 nats: empty set 3.51/1.54 zeros: empty set 3.51/1.54 0: empty set 3.51/1.54 head: {1} 3.51/1.54 tail: {1} 3.51/1.54 3.51/1.54 ---------------------------------------- 3.51/1.54 3.51/1.54 (1) CSRRRRProof (EQUIVALENT) 3.51/1.54 The following CSR is given: Context-sensitive rewrite system: 3.51/1.54 The TRS R consists of the following rules: 3.51/1.54 3.51/1.54 incr(nil) -> nil 3.51/1.54 incr(cons(X, L)) -> cons(s(X), incr(L)) 3.51/1.54 adx(nil) -> nil 3.51/1.54 adx(cons(X, L)) -> incr(cons(X, adx(L))) 3.51/1.54 nats -> adx(zeros) 3.51/1.54 zeros -> cons(0, zeros) 3.51/1.54 head(cons(X, L)) -> X 3.51/1.54 tail(cons(X, L)) -> L 3.51/1.54 3.51/1.54 The replacement map contains the following entries: 3.51/1.54 3.51/1.54 incr: {1} 3.51/1.54 nil: empty set 3.51/1.54 cons: {1} 3.51/1.54 s: {1} 3.51/1.54 adx: {1} 3.51/1.54 nats: empty set 3.51/1.54 zeros: empty set 3.51/1.54 0: empty set 3.51/1.54 head: {1} 3.51/1.54 tail: {1} 3.51/1.54 Used ordering: 3.51/1.54 Polynomial interpretation [POLO]: 3.51/1.54 3.51/1.54 POL(0) = 0 3.51/1.54 POL(adx(x_1)) = x_1 3.51/1.54 POL(cons(x_1, x_2)) = x_1 + x_2 3.51/1.54 POL(head(x_1)) = 2*x_1 3.51/1.54 POL(incr(x_1)) = x_1 3.51/1.54 POL(nats) = 2 3.51/1.54 POL(nil) = 0 3.51/1.54 POL(s(x_1)) = x_1 3.51/1.54 POL(tail(x_1)) = x_1 3.51/1.54 POL(zeros) = 0 3.51/1.54 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: 3.51/1.54 3.51/1.54 nats -> adx(zeros) 3.51/1.54 3.51/1.54 3.51/1.54 3.51/1.54 3.51/1.54 ---------------------------------------- 3.51/1.54
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