details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.51629090309 seconds
cpu usage	3.594478738
max memory	2.22048256E8

stage attributes

key	value
output-size	6616
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 32 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 18 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 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: terms(N) -> cons(recip(sqr(N)), terms(s(N))) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X), dbl(X))) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) add(0, X) -> X add(s(X), Y) -> s(add(X, Y)) first(0, X) -> nil first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z)) The replacement map contains the following entries: terms: {1} cons: {1} recip: {1} sqr: {1} s: empty set 0: empty set add: {1, 2} dbl: {1} first: {1, 2} nil: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: terms(N) -> cons(recip(sqr(N)), terms(s(N))) sqr(0) -> 0 sqr(s(X)) -> s(add(sqr(X), dbl(X))) dbl(0) -> 0 dbl(s(X)) -> s(s(dbl(X))) add(0, X) -> X add(s(X), Y) -> s(add(X, Y)) first(0, X) -> nil first(s(X), cons(Y, Z)) -> cons(Y, first(X, Z)) The replacement map contains the following entries: terms: {1} cons: {1} recip: {1} sqr: {1} s: empty set 0: empty set add: {1, 2} dbl: {1} first: {1, 2} nil: empty set Used ordering: Polynomial interpretation [POLO]: POL(0) = 1 POL(add(x_1, x_2)) = x_1 + x_2 POL(cons(x_1, x_2)) = x_1 POL(dbl(x_1)) = x_1 POL(first(x_1, x_2)) = x_1 + x_2 POL(nil) = 1 POL(recip(x_1)) = 1 + x_1 POL(s(x_1)) = 0 POL(sqr(x_1)) = x_1 POL(terms(x_1)) = 1 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: add(0, X) -> X popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651