details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.44864201546 seconds
cpu usage	3.161208191
max memory	2.009088E8

stage attributes

key	value
output-size	4054
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given CSR could be proven: (0) CSR (1) CSRRRRProof [EQUIVALENT, 55 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 0 ms] (4) CSR (5) CSRInnermostProof [EQUIVALENT, 0 ms] (6) CSR (7) CSDependencyPairsProof [EQUIVALENT, 0 ms] (8) QCSDP (9) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b The replacement map contains the following entries: f: {3} a: empty set b: empty set c: empty set ---------------------------------------- (1) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a c -> b The replacement map contains the following entries: f: {3} a: empty set b: empty set c: empty set Used ordering: Polynomial interpretation [POLO]: POL(a) = 1 POL(b) = 0 POL(c) = 1 POL(f(x_1, x_2, x_3)) = x_3 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: c -> b ---------------------------------------- (2) Obligation: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a The replacement map contains the following entries: f: {3} a: empty set b: empty set c: empty set ---------------------------------------- (3) CSRRRRProof (EQUIVALENT) The following CSR is given: Context-sensitive rewrite system: The TRS R consists of the following rules: f(a, b, X) -> f(X, X, X) c -> a popout

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

job log

popout

actions

all output return to TRS Context Sensitive