details

property	value
status	complete
benchmark	Ex1_Luc04b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n052.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.66364789009 seconds
cpu usage	3.578855352
max memory	2.17608192E8

stage attributes

key	value
output-size	6268
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 28 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 8 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 0 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: nats -> cons(0, incr(nats)) pairs -> cons(0, incr(odds)) odds -> incr(pairs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) head(cons(X, XS)) -> X tail(cons(X, XS)) -> XS The replacement map contains the following entries: nats: empty set cons: {1} 0: empty set incr: {1} pairs: empty set odds: empty set s: {1} head: {1} tail: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: nats -> cons(0, incr(nats)) pairs -> cons(0, incr(odds)) odds -> incr(pairs) incr(cons(X, XS)) -> cons(s(X), incr(XS)) head(cons(X, XS)) -> X tail(cons(X, XS)) -> XS The replacement map contains the following entries: nats: empty set cons: {1} 0: empty set incr: {1} pairs: empty set odds: empty set s: {1} head: {1} tail: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons(x_1, x_2)) = 2*x_1 + x_2 POL(head(x_1)) = 1 + 2*x_1 POL(incr(x_1)) = x_1 POL(nats) = 0 POL(odds) = 0 POL(pairs) = 0 POL(s(x_1)) = x_1 POL(tail(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: head(cons(X, XS)) -> X ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651