details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.84772992134 seconds
cpu usage	4.919650391
max memory	4.78339072E8

stage attributes

key	value
output-size	5202
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) CSRInnermostProof [EQUIVALENT, 0 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 7 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) QCSDP (7) QCSDPSubtermProof [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: 2nd(cons1(X, cons(Y, Z))) -> Y 2nd(cons(X, X1)) -> 2nd(cons1(X, X1)) from(X) -> cons(X, from(s(X))) The replacement map contains the following entries: 2nd: {1} cons1: {1, 2} cons: {1} from: {1} s: {1} ---------------------------------------- (1) CSRInnermostProof (EQUIVALENT) The CSR is orthogonal. By [CS_Inn] we can switch to innermost. ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: 2nd(cons1(X, cons(Y, Z))) -> Y 2nd(cons(X, X1)) -> 2nd(cons1(X, X1)) from(X) -> cons(X, from(s(X))) The replacement map contains the following entries: 2nd: {1} cons1: {1, 2} cons: {1} from: {1} s: {1} Innermost Strategy. ---------------------------------------- (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: The symbols in {2nd_1, cons1_2, from_1, s_1, 2ND_1, FROM_1} are replacing on all positions. For all symbols f in {cons_2} we have mu(f) = {1}. The symbols in {U_1} are not replacing on any position. The ordinary context-sensitive dependency pairs DP_o are: 2ND(cons(X, X1)) -> 2ND(cons1(X, X1)) The collapsing dependency pairs are DP_c: 2ND(cons(X, X1)) -> X1 The hidden terms of R are: from(s(x0)) Every hiding context is built from: aprove.DPFramework.CSDPProblem.QCSDPProblem$1@2a208f78 aprove.DPFramework.CSDPProblem.QCSDPProblem$1@996b748 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 Context Sensitive