details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.07593 seconds
cpu usage	5.32834
user time	5.08167
system time	0.246666
max virtual memory	1.8541468E7
max residence set size	492896.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSDependencyPairsProof [EQUIVALENT, 33 ms] (2) QCSDP (3) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDPReductionPairProof [EQUIVALENT, 34 ms] (6) QCSDP (7) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (8) QCSDP (9) QCSDPReductionPairProof [EQUIVALENT, 0 ms] (10) QCSDP (11) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (12) QCSDP (13) QCSDPSubtermProof [EQUIVALENT, 0 ms] (14) QCSDP (15) PIsEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: cons_1(x, cons_1(y, z)) -> big_0 cons_1(x, cons_0(y, z)) -> big_0 *top*_0(inf_1(x)) -> *top*_0(cons_0(x, inf_1(s_0(x)))) s_0(inf_1(x)) -> s_0(cons_0(x, inf_1(s_0(x)))) cons_0(inf_1(x), x0) -> cons_0(cons_0(x, inf_1(s_0(x))), x0) cons_0(x0, inf_1(x)) -> cons_1(x0, cons_0(x, inf_1(s_0(x)))) The replacement map contains the following entries: cons_1: empty set big_0: empty set cons_0: {1, 2} *top*_0: {1} inf_1: empty set s_0: {1} ---------------------------------------- (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: The symbols in {cons_0_2, *top*_0_1, s_0_1, *TOP*_0_1, CONS_0_2, S_0_1} are replacing on all positions. The symbols in {cons_1_2, inf_1_1, CONS_1_2, U_1} are not replacing on any position. The ordinary context-sensitive dependency pairs DP_o are: *TOP*_0(inf_1(x)) -> *TOP*_0(cons_0(x, inf_1(s_0(x)))) *TOP*_0(inf_1(x)) -> CONS_0(x, inf_1(s_0(x))) S_0(inf_1(x)) -> S_0(cons_0(x, inf_1(s_0(x)))) S_0(inf_1(x)) -> CONS_0(x, inf_1(s_0(x))) CONS_0(inf_1(x), x0) -> CONS_0(cons_0(x, inf_1(s_0(x))), x0) CONS_0(inf_1(x), x0) -> CONS_0(x, inf_1(s_0(x))) CONS_0(x0, inf_1(x)) -> CONS_1(x0, cons_0(x, inf_1(s_0(x)))) The collapsing dependency pairs are DP_c: *TOP*_0(inf_1(x)) -> x S_0(inf_1(x)) -> x CONS_0(inf_1(x), x0) -> x The hidden terms of R are: s_0(x0) cons_0(x0, inf_1(s_0(x0))) Every hiding context is built from: aprove.DPFramework.CSDPProblem.QCSDPProblem$1@752dcf71 aprove.DPFramework.CSDPProblem.QCSDPProblem$1@19e6e77 Hence, the new unhiding pairs DP_u are : *TOP*_0(inf_1(x)) -> U(x) S_0(inf_1(x)) -> U(x) CONS_0(inf_1(x), x0) -> U(x) U(s_0(x_0)) -> U(x_0) U(cons_0(x_0, x_1)) -> U(x_0) U(s_0(x0)) -> S_0(x0) U(cons_0(x0, inf_1(s_0(x0)))) -> CONS_0(x0, inf_1(s_0(x0))) The TRS R consists of the following rules: cons_1(x, cons_1(y, z)) -> big_0 cons_1(x, cons_0(y, z)) -> big_0 *top*_0(inf_1(x)) -> *top*_0(cons_0(x, inf_1(s_0(x)))) s_0(inf_1(x)) -> s_0(cons_0(x, inf_1(s_0(x)))) popout

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

job log

popout

actions

all output return to TRS Contextsensitive