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	n140.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.54582 seconds
cpu usage	3.01168
user time	2.85543
system time	0.156256
max virtual memory	1.8343376E7
max residence set size	213512.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty 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 Contextsensitive