details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.02059 seconds
cpu usage	4.29263
user time	4.10146
system time	0.191165
max virtual memory	1.8277816E7
max residence set size	248396.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS_Equational 2019-03-21 05.09