details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.45421886444 seconds
cpu usage	3.166622643
max memory	1.99258112E8

stage attributes

key	value
output-size	3266
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 39 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: from_2(x) -> cons_0(x, from_3(s_0(x))) from_3(x) -> cons_1(x, from_3(s_0(x))) from_1(x) -> cons_0(x, from_3(s_0(x))) cons_1(s_0(x), xs) -> overflow_0 The replacement map contains the following entries: from_2: empty set cons_0: {1, 2} from_3: empty set s_0: {1} cons_1: empty set from_1: empty set overflow_0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: from_2(x) -> cons_0(x, from_3(s_0(x))) from_3(x) -> cons_1(x, from_3(s_0(x))) from_1(x) -> cons_0(x, from_3(s_0(x))) cons_1(s_0(x), xs) -> overflow_0 The replacement map contains the following entries: from_2: empty set cons_0: {1, 2} from_3: empty set s_0: {1} cons_1: empty set from_1: empty set overflow_0: empty set Used ordering: Polynomial interpretation [POLO]: POL(cons_0(x_1, x_2)) = 2*x_1 + x_2 POL(cons_1(x_1, x_2)) = 0 POL(from_1(x_1)) = 2 + 2*x_1 POL(from_2(x_1)) = 2 + 2*x_1 POL(from_3(x_1)) = 1 POL(overflow_0) = 0 POL(s_0(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: from_2(x) -> cons_0(x, from_3(s_0(x))) from_3(x) -> cons_1(x, from_3(s_0(x))) from_1(x) -> cons_0(x, from_3(s_0(x))) ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: cons_1(s_0(x), xs) -> overflow_0 The replacement map contains the following entries: s_0: {1} cons_1: empty set overflow_0: empty set ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Context Sensitive