details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	1.81529092789 seconds
cpu usage	4.441822903
max memory	4.74304512E8

stage attributes

key	value
output-size	2524
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: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 66 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: f(b, X, c) -> f(X, c, X) c -> b The replacement map contains the following entries: f: {2} b: empty set c: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(b, X, c) -> f(X, c, X) c -> b The replacement map contains the following entries: f: {2} b: empty set c: empty set Used ordering: Polynomial interpretation [POLO]: POL(b) = 1 POL(c) = 2 POL(f(x_1, x_2, x_3)) = 2*x_2 + 2*x_3 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c -> b ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(b, X, c) -> f(X, c, X) The replacement map contains the following entries: f: {2} b: empty set c: empty set ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(b, X, c) -> f(X, c, X) The replacement map contains the following entries: f: {2} b: empty set c: empty set Used ordering: Polynomial interpretation [POLO]: POL(b) = 1 POL(c) = 0 POL(f(x_1, x_2, x_3)) = x_1 + x_2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: popout

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

job log

popout

actions

all output return to TRS Context Sensitive