Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733233
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n071.star.cs.uiowa.edu
space
Maude_06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.5198829174 seconds
cpu usage
3.295654083
max memory
1.71495424E8
stage attributes
key
value
output-size
2795
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be disproven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 43 ms] (2) CSR (3) ContextSensitiveLoopProof [COMPLETE, 0 ms] (4) NO ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) and(tt, X) -> X length(nil) -> 0 length(cons(N, L)) -> s(length(L)) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set and: {1} tt: empty set length: {1} nil: empty set s: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) and(tt, X) -> X length(nil) -> 0 length(cons(N, L)) -> s(length(L)) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set and: {1} tt: empty set length: {1} nil: empty set s: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(and(x_1, x_2)) = 2*x_1 + x_2 POL(cons(x_1, x_2)) = x_1 + 2*x_2 POL(length(x_1)) = 2*x_1 POL(nil) = 1 POL(s(x_1)) = 2*x_1 POL(tt) = 1 POL(zeros) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: and(tt, X) -> X length(nil) -> 0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) length(cons(N, L)) -> s(length(L)) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set length: {1} s: {1}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651