details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.50268 seconds
cpu usage	3.52574
user time	3.38179
system time	0.143942
max virtual memory	1.8409116E7
max residence set size	217840.0

stage attributes

key	value
starexec-result	YES

output

3.42/1.45 YES 3.42/1.46 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.42/1.46 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.42/1.46 3.42/1.46 3.42/1.46 Termination of the given CSR could be proven: 3.42/1.46 3.42/1.46 (0) CSR 3.42/1.46 (1) CSRInnermostProof [EQUIVALENT, 0 ms] 3.42/1.46 (2) CSR 3.42/1.46 (3) CSDependencyPairsProof [EQUIVALENT, 0 ms] 3.42/1.46 (4) QCSDP 3.42/1.46 (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] 3.42/1.46 (6) AND 3.42/1.46 (7) QCSDP 3.42/1.46 (8) QCSDPSubtermProof [EQUIVALENT, 0 ms] 3.42/1.46 (9) QCSDP 3.42/1.46 (10) PIsEmptyProof [EQUIVALENT, 0 ms] 3.42/1.46 (11) YES 3.42/1.46 (12) QCSDP 3.42/1.46 (13) QCSDPSubtermProof [EQUIVALENT, 0 ms] 3.42/1.46 (14) QCSDP 3.42/1.46 (15) PIsEmptyProof [EQUIVALENT, 0 ms] 3.42/1.46 (16) YES 3.42/1.46 3.42/1.46 3.42/1.46 ---------------------------------------- 3.42/1.46 3.42/1.46 (0) 3.42/1.46 Obligation: 3.42/1.46 Context-sensitive rewrite system: 3.42/1.46 The TRS R consists of the following rules: 3.42/1.46 3.42/1.46 from(X) -> cons(X, from(s(X))) 3.42/1.46 sel(0, cons(X, Y)) -> X 3.42/1.46 sel(s(X), cons(Y, Z)) -> sel(X, Z) 3.42/1.46 3.42/1.46 The replacement map contains the following entries: 3.42/1.46 3.42/1.46 from: {1} 3.42/1.46 cons: {1} 3.42/1.46 s: {1} 3.42/1.46 sel: {1, 2} 3.42/1.46 0: empty set 3.42/1.46 3.42/1.46 ---------------------------------------- 3.42/1.46 3.42/1.46 (1) CSRInnermostProof (EQUIVALENT) 3.42/1.46 The CSR is orthogonal. By [CS_Inn] we can switch to innermost. 3.42/1.46 ---------------------------------------- 3.42/1.46 3.42/1.46 (2) 3.42/1.46 Obligation: 3.42/1.46 Context-sensitive rewrite system: 3.42/1.46 The TRS R consists of the following rules: 3.42/1.46 3.42/1.46 from(X) -> cons(X, from(s(X))) 3.42/1.46 sel(0, cons(X, Y)) -> X 3.42/1.46 sel(s(X), cons(Y, Z)) -> sel(X, Z) 3.42/1.46 3.42/1.46 The replacement map contains the following entries: 3.42/1.46 3.42/1.46 from: {1} 3.42/1.46 cons: {1} 3.42/1.46 s: {1} 3.42/1.46 sel: {1, 2} 3.42/1.46 0: empty set 3.42/1.46 3.42/1.46 3.42/1.46 Innermost Strategy. 3.42/1.46 3.42/1.46 ---------------------------------------- 3.42/1.46 3.42/1.46 (3) CSDependencyPairsProof (EQUIVALENT) 3.42/1.46 Using Improved CS-DPs [LPAR08] we result in the following initial Q-CSDP problem. 3.42/1.46 ---------------------------------------- 3.42/1.46 3.42/1.46 (4) 3.42/1.46 Obligation: 3.42/1.46 Q-restricted context-sensitive dependency pair problem: 3.42/1.46 The symbols in {from_1, s_1, sel_2, SEL_2, FROM_1} are replacing on all positions. 3.42/1.46 For all symbols f in {cons_2} we have mu(f) = {1}. 3.42/1.46 The symbols in {U_1} are not replacing on any position. 3.42/1.46 3.42/1.46 The ordinary context-sensitive dependency pairs DP_o are: 3.42/1.46 SEL(s(X), cons(Y, Z)) -> SEL(X, Z) 3.42/1.46 3.42/1.46 The collapsing dependency pairs are DP_c: 3.42/1.46 SEL(s(X), cons(Y, Z)) -> Z 3.42/1.46 3.42/1.46 3.42/1.46 The hidden terms of R are: 3.42/1.46 3.42/1.46 from(s(x0)) 3.42/1.46 3.42/1.46 Every hiding context is built from: 3.42/1.46 aprove.DPFramework.CSDPProblem.QCSDPProblem$1@2f35cf78 3.42/1.46 aprove.DPFramework.CSDPProblem.QCSDPProblem$1@1d99a3e2 3.42/1.46 3.42/1.46 Hence, the new unhiding pairs DP_u are : popout

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

job log

popout

actions

all output return to TRS_Contextsensitive 2019-03-21 05.07