details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.52700591087 seconds
cpu usage	3.539226476
max memory	2.24804864E8

stage attributes

key	value
output-size	7469
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) CSRRRRProof [EQUIVALENT, 65 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 12 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) CSRInnermostProof [EQUIVALENT, 0 ms] (8) CSR (9) CSDependencyPairsProof [EQUIVALENT, 0 ms] (10) QCSDP (11) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (12) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: *top*_0(a_1) -> *top*_0(f_0(a_1)) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 The replacement map contains the following entries: *top*_0: {1} a_1: empty set f_0: {1} f_1: empty set c_0: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: *top*_0(a_1) -> *top*_0(f_0(a_1)) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 The replacement map contains the following entries: *top*_0: {1} a_1: empty set f_0: {1} f_1: empty set c_0: empty set Used ordering: Polynomial interpretation [POLO]: POL(*top*_0(x_1)) = 2*x_1 POL(a_1) = 2 POL(c_0) = 1 POL(f_0(x_1)) = x_1 POL(f_1(x_1)) = 2 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: *top*_0(a_1) -> *top*_0(f_0(a_1)) popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651