details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	1.91872906685 seconds
cpu usage	4.82322791
max memory	4.86514688E8

stage attributes

key	value
output-size	2214
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) QCSDPForwardInstantiationProcessor [EQUIVALENT, 0 ms] (4) QCSDP (5) PIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b The replacement map contains the following entries: f: {1, 3} a: empty set b: empty set c: 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) = {1, 3}. The ordinary context-sensitive dependency pairs DP_o are: F(a, b, X) -> F(X, X, X) The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b Q is empty. ---------------------------------------- (3) QCSDPForwardInstantiationProcessor (EQUIVALENT) Using the Context-Sensitive Forward Instantiation[DA_EMMES] Processor the pair F(a, b, X) -> F(X, X, X) was transformed to the following new pairs: F(a, b, b) -> F(b, b, b) ---------------------------------------- (4) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_3} we have mu(f) = {1, 3}. The TRS P consists of the following rules: none The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b Q is empty. ---------------------------------------- (5) PIsEmptyProof (EQUIVALENT) The TRS P is empty. Hence, there is no (P,Q,R,mu)-chain. ---------------------------------------- (6) YES popout

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

job log

popout

actions

all output return to TRS Context Sensitive