details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.00011110306 seconds
cpu usage	4.971349794
max memory	4.72387584E8

stage attributes

key	value
output-size	5491
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, 51 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 1 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRRRRProof [EQUIVALENT, 7 ms] (8) CSR (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: f_1: empty set g_1: empty set a_0: empty set f_0: {1} b_0: empty set *top*_0: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: f_1: empty set g_1: empty set a_0: empty set f_0: {1} b_0: empty set *top*_0: {1} Used ordering: Polynomial interpretation [POLO]: POL(*top*_0(x_1)) = x_1 POL(a_0) = 1 POL(b_0) = 0 POL(f_0(x_1)) = x_1 POL(f_1(x_1)) = 1 POL(g_1(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: f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) The replacement map contains the following entries: popout

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

job log

popout

actions

all output return to TRS Context Sensitive