details

property	value
status	complete
benchmark	LengthOfFiniteLists_nosorts-noand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.55407 seconds
cpu usage	3.43857
user time	3.29043
system time	0.148139
max virtual memory	1.8343604E7
max residence set size	214028.0

stage attributes

key	value
starexec-result	NO

output

NO proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be disproven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 41 ms] (2) CSR (3) ContextSensitiveLoopProof [COMPLETE, 25 ms] (4) NO ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) U11(tt, L) -> U12(tt, L) U12(tt, L) -> s(length(L)) length(nil) -> 0 length(cons(N, L)) -> U11(tt, L) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set U11: {1} tt: empty set U12: {1} s: {1} length: {1} nil: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) U11(tt, L) -> U12(tt, L) U12(tt, L) -> s(length(L)) length(nil) -> 0 length(cons(N, L)) -> U11(tt, L) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set U11: {1} tt: empty set U12: {1} s: {1} length: {1} nil: empty set Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(U11(x_1, x_2)) = x_1 + 2*x_2 POL(U12(x_1, x_2)) = x_1 + 2*x_2 POL(cons(x_1, x_2)) = 2*x_1 + 2*x_2 POL(length(x_1)) = x_1 POL(nil) = 1 POL(s(x_1)) = 2*x_1 POL(tt) = 0 POL(zeros) = 0 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: length(nil) -> 0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: zeros -> cons(0, zeros) U11(tt, L) -> U12(tt, L) U12(tt, L) -> s(length(L)) length(cons(N, L)) -> U11(tt, L) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set U11: {1} tt: empty set popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Contextsensitive