details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.51692700386 seconds
cpu usage	3.213061241
max memory	1.72531712E8

stage attributes

key	value
output-size	2983
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, 49 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt) -> U12(tt) U12(tt) -> tt isNePal(__(I, __(P, I))) -> U11(tt) The replacement map contains the following entries: __: {1, 2} nil: empty set U11: {1} tt: empty set U12: {1} isNePal: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt) -> U12(tt) U12(tt) -> tt isNePal(__(I, __(P, I))) -> U11(tt) The replacement map contains the following entries: __: {1, 2} nil: empty set U11: {1} tt: empty set U12: {1} isNePal: {1} Used ordering: Polynomial interpretation [POLO]: POL(U11(x_1)) = 2 + 2*x_1 POL(U12(x_1)) = 2*x_1 POL(__(x_1, x_2)) = 2 + x_1 + x_2 POL(isNePal(x_1)) = 2*x_1 POL(nil) = 2 POL(tt) = 2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: __(X, nil) -> X __(nil, X) -> X U11(tt) -> U12(tt) U12(tt) -> tt isNePal(__(I, __(P, I))) -> U11(tt) ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) The replacement map contains the following entries: __: {1, 2} ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651