details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.40125608444 seconds
cpu usage	6.362325448
max memory	4.99351552E8

stage attributes

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

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

job log

popout

actions

all output return to TRS Context Sensitive