details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.19407510757 seconds
cpu usage	5.754647822
max memory	4.80321536E8

stage attributes

key	value
output-size	3208
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) CSDependencyPairsProof [EQUIVALENT, 0 ms] (2) QCSDP (3) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSUsableRulesProof [EQUIVALENT, 0 ms] (6) QCSDP (7) QCSDPInstantiationProcessor [EQUIVALENT, 0 ms] (8) QCSDP (9) PIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a The replacement map contains the following entries: f: {2} a: empty set b: empty set ---------------------------------------- (1) CSDependencyPairsProof (EQUIVALENT) Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem. ---------------------------------------- (2) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_3, F_3} we have mu(f) = {2}. The ordinary context-sensitive dependency pairs DP_o are: F(a, X, X) -> F(X, b, b) F(a, X, X) -> B The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a Q is empty. ---------------------------------------- (3) QCSDependencyGraphProof (EQUIVALENT) The approximation of the Context-Sensitive Dependency Graph [LPAR08] contains 1 SCC with 1 less node. ---------------------------------------- (4) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_3, F_3} we have mu(f) = {2}. The TRS P consists of the following rules: F(a, X, X) -> F(X, b, b) The TRS R consists of the following rules: f(a, X, X) -> f(X, b, b) b -> a Q is empty. ---------------------------------------- (5) QCSUsableRulesProof (EQUIVALENT) The following rules are not useable [DA_EMMES] and can be deleted: f(a, x0, x0) -> f(x0, b, b) ---------------------------------------- (6) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {F_3} we have mu(f) = {2}. popout

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

job log

popout

actions

all output return to TRS Context Sensitive