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	n120.star.cs.uiowa.edu
space	Maude_06

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.01886510849 seconds
cpu usage	5.0134386
max memory	4.73362432E8

stage attributes

key	value
output-size	3933
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given CSR could be disproven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 62 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 6 ms] (4) CSR (5) ContextSensitiveLoopProof [COMPLETE, 28 ms] (6) 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)) = x_1 + x_2 POL(cons(x_1, x_2)) = x_1 + x_2 POL(length(x_1)) = x_1 POL(nil) = 1 POL(s(x_1)) = 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) and(tt, X) -> X length(cons(N, L)) -> s(length(L)) The replacement map contains the following entries: zeros: empty set cons: {1} 0: empty set popout

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

job log

popout

actions

all output return to TRS Context Sensitive