details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	14.6607358456 seconds
cpu usage	15.35066159
max memory	1.193074688E9

stage attributes

key	value
output-size	8764
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 ETRS could be proven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 1322 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 1069 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 748 ms] (6) ETRS (7) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (8) EDP (9) EDependencyGraphProof [EQUIVALENT, 0 ms] (10) EDP (11) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (12) EDP (13) PisEmptyProof [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: union(empty, X) -> X max(singl(x)) -> x max(union(singl(x), singl(0))) -> x max(union(singl(s(x)), singl(s(y)))) -> s(max(union(singl(x), singl(y)))) max(union(singl(x), union(Y, Z))) -> max(union(singl(x), singl(max(union(Y, Z))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: union(empty, X) -> X max(singl(x)) -> x max(union(singl(x), singl(0))) -> x max(union(singl(s(x)), singl(s(y)))) -> s(max(union(singl(x), singl(y)))) max(union(singl(x), union(Y, Z))) -> max(union(singl(x), singl(max(union(Y, Z))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) The following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly by a polynomial ordering: union(empty, X) -> X Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(empty) = 1 POL(max(x_1)) = x_1 POL(s(x_1)) = x_1 POL(singl(x_1)) = x_1 POL(union(x_1, x_2)) = x_1 + x_2 ---------------------------------------- (2) Obligation: Equational rewrite system: The TRS R consists of the following rules: max(singl(x)) -> x max(union(singl(x), singl(0))) -> x max(union(singl(s(x)), singl(s(y)))) -> s(max(union(singl(x), singl(y)))) max(union(singl(x), union(Y, Z))) -> max(union(singl(x), singl(max(union(Y, Z))))) The set E consists of the following equations: union(x, y) == union(y, x) union(union(x, y), z) == union(x, union(y, z)) popout

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

job log

popout

actions

all output return to TRS Equational