details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.40804 seconds
cpu usage	2.96377
user time	2.83693
system time	0.126847
max virtual memory	1.8341556E7
max residence set size	199988.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) CSRRRRProof [EQUIVALENT, 40 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, X) -> f(a, b) b -> a The replacement map contains the following entries: f: {1} a: empty set b: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, X) -> f(a, b) b -> a The replacement map contains the following entries: f: {1} a: empty set b: empty set Used ordering: Polynomial interpretation [POLO]: POL(a) = 0 POL(b) = 2 POL(f(x_1, x_2)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b -> a ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(X, X) -> f(a, b) The replacement map contains the following entries: f: {1} a: empty set b: empty set ---------------------------------------- (3) CSDependencyPairsProof (EQUIVALENT) Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem. ---------------------------------------- (4) Obligation: Q-restricted context-sensitive dependency pair problem: For all symbols f in {f_2, F_2} we have mu(f) = {1}. The ordinary context-sensitive dependency pairs DP_o are: F(X, X) -> F(a, b) The TRS R consists of the following rules: f(X, X) -> f(a, b) Q is empty. ---------------------------------------- (5) QCSDependencyGraphProof (EQUIVALENT) The approximation of the Context-Sensitive Dependency Graph [LPAR08] contains 0 SCCs. The rules F(z0, z0) -> F(a, b) and F(x0, x0) -> F(a, b) form no chain, because ECap^mu(F(a, b)) = F(a, b) does not unify with F(x0, x0). ---------------------------------------- popout

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

job log

popout

actions

all output return to TRS Contextsensitive