details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	1.86110496521 seconds
cpu usage	4.676804765
max memory	4.72793088E8

stage attributes

key	value
output-size	3628
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 73 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 4 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_0(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> a_0 i_1(x) -> h_0(x) The replacement map contains the following entries: f_1: empty set h_0: {1} i_1: empty set a_0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_0(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> a_0 i_1(x) -> h_0(x) The replacement map contains the following entries: f_1: empty set h_0: {1} i_1: empty set a_0: empty set Used ordering: Polynomial interpretation [POLO]: POL(a_0) = 1 POL(f_1(x_1)) = 1 + 2*x_1 POL(h_0(x_1)) = 1 + 2*x_1 POL(i_1(x_1)) = 1 + 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f_1(i_1(x)) -> a_0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_0(x)) -> f_1(i_1(x)) i_1(x) -> h_0(x) The replacement map contains the following entries: f_1: empty set h_0: {1} i_1: empty set ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(h_0(x)) -> f_1(i_1(x)) i_1(x) -> h_0(x) The replacement map contains the following entries: f_1: empty set popout

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

job log

popout

actions

all output return to TRS Context Sensitive