details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.17560911179 seconds
cpu usage	5.860659766
max memory	4.70286336E8

stage attributes

key	value
output-size	4120
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 w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 90 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 7 ms] (6) QTRS (7) QTRSRRRProof [EQUIVALENT, 0 ms] (8) QTRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(a, X, X) -> a__f(X, a__b, b) a__b -> a mark(f(X1, X2, X3)) -> a__f(X1, mark(X2), X3) mark(b) -> a__b mark(a) -> a a__f(X1, X2, X3) -> f(X1, X2, X3) a__b -> b The set Q consists of the following terms: a__b mark(f(x0, x1, x2)) mark(b) mark(a) a__f(x0, x1, x2) ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a) = 1 POL(a__b) = 1 POL(a__f(x_1, x_2, x_3)) = 2 + 2*x_1 + 2*x_2 + 2*x_3 POL(b) = 0 POL(f(x_1, x_2, x_3)) = 2 + 2*x_1 + 2*x_2 + 2*x_3 POL(mark(x_1)) = 1 + 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: mark(f(X1, X2, X3)) -> a__f(X1, mark(X2), X3) mark(a) -> a a__b -> b ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a__f(a, X, X) -> a__f(X, a__b, b) a__b -> a mark(b) -> a__b a__f(X1, X2, X3) -> f(X1, X2, X3) The set Q consists of the following terms: a__b mark(f(x0, x1, x2)) mark(b) mark(a) a__f(x0, x1, x2) ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Quasi precedence: [a, a__b, mark_1] > a__f_3 > [b, f_3] popout

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

job log

popout

actions

all output return to TRS Innermost