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	n040.star.cs.uiowa.edu
space	Transformed_outermost_08

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.90636587143 seconds
cpu usage	5.023308088
max memory	3.12922112E8

stage attributes

key	value
output-size	13567
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSDependencyPairsProof [EQUIVALENT, 23 ms] (2) QCSDP (3) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDPReductionPairProof [EQUIVALENT, 24 ms] (6) QCSDP (7) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (8) QCSDP (9) QCSDPSubtermProof [EQUIVALENT, 1 ms] (10) QCSDP (11) PIsEmptyProof [EQUIVALENT, 0 ms] (12) 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@973751b aprove.DPFramework.CSDPProblem.QCSDPProblem$1@4c71ea51 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 popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651