details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	1.91599798203 seconds
cpu usage	4.695303446
max memory	4.74415104E8

stage attributes

key	value
output-size	3746
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) CSRRRRProof [EQUIVALENT, 56 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 6 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X The replacement map contains the following entries: f: {1} 0: empty set cons: {1} s: {1} p: {1} ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(0) -> cons(0, f(s(0))) f(s(0)) -> f(p(s(0))) p(s(X)) -> X The replacement map contains the following entries: f: {1} 0: empty set cons: {1} s: {1} p: {1} Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(cons(x_1, x_2)) = x_1 POL(f(x_1)) = 1 + x_1 POL(p(x_1)) = 2*x_1 POL(s(x_1)) = 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f(0) -> cons(0, f(s(0))) ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(s(0)) -> f(p(s(0))) p(s(X)) -> X The replacement map contains the following entries: f: {1} 0: empty set s: {1} p: {1} ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(s(0)) -> f(p(s(0))) p(s(X)) -> X popout

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

job log

popout

actions

all output return to TRS Context Sensitive