details

property	value
status	complete
benchmark	bag-sum-prod-bin.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n142.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.86578 seconds
cpu usage	4.22372
user time	4.0554
system time	0.168323
max virtual memory	1.8343376E7
max residence set size	241264.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could be proven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 155 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 31 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 0 ms] (6) ETRS (7) RRRPoloETRSProof [EQUIVALENT, 0 ms] (8) ETRS (9) RisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: 0(#) -> # +(#, x) -> x +(0(x), 0(y)) -> 0(+(x, y)) +(0(x), 1(y)) -> 1(+(x, y)) +(1(x), 1(y)) -> 0(+(1(#), +(x, y))) *(#, x) -> # *(0(x), y) -> 0(*(x, y)) *(1(x), y) -> +(0(*(x, y)), y) U(empty, b) -> b sum(empty) -> 0(#) sum(singl(x)) -> x sum(U(x, y)) -> +(sum(x), sum(y)) prod(empty) -> 1(#) prod(singl(x)) -> x prod(U(x, y)) -> *(prod(x), prod(y)) The set E consists of the following equations: *(x, y) == *(y, x) +(x, y) == +(y, x) U(x, y) == U(y, x) *(*(x, y), z) == *(x, *(y, z)) +(+(x, y), z) == +(x, +(y, z)) U(U(x, y), z) == U(x, U(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: 0(#) -> # +(#, x) -> x +(0(x), 0(y)) -> 0(+(x, y)) +(0(x), 1(y)) -> 1(+(x, y)) +(1(x), 1(y)) -> 0(+(1(#), +(x, y))) *(#, x) -> # *(0(x), y) -> 0(*(x, y)) *(1(x), y) -> +(0(*(x, y)), y) U(empty, b) -> b sum(empty) -> 0(#) sum(singl(x)) -> x sum(U(x, y)) -> +(sum(x), sum(y)) prod(empty) -> 1(#) prod(singl(x)) -> x prod(U(x, y)) -> *(prod(x), prod(y)) The set E consists of the following equations: *(x, y) == *(y, x) +(x, y) == +(y, x) U(x, y) == U(y, x) *(*(x, y), z) == *(x, *(y, z)) +(+(x, y), z) == +(x, +(y, z)) U(U(x, y), z) == U(x, U(y, z)) The following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly by a polynomial ordering: +(#, x) -> x *(#, x) -> # *(1(x), y) -> +(0(*(x, y)), y) U(empty, b) -> b sum(singl(x)) -> x sum(U(x, y)) -> +(sum(x), sum(y)) prod(empty) -> 1(#) prod(singl(x)) -> x prod(U(x, y)) -> *(prod(x), prod(y)) Used ordering: Polynomial interpretation [POLO]: POL(#) = 3 POL(*(x_1, x_2)) = 3 + 3*x_1 + 2*x_1*x_2 + 3*x_2 popout

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

job log

popout

actions

all output return to TRS Equational