details

property	value
status	complete
benchmark	AC22.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	AProVE_AC_04

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.87394 seconds
cpu usage	9.13629
user time	8.82201
system time	0.314278
max virtual memory	1.8328356E7
max residence set size	490680.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could be proven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 222 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 62 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 47 ms] (6) ETRS (7) EquationalDependencyPairsProof [EQUIVALENT, 83 ms] (8) EDP (9) EUsableRulesReductionPairsProof [EQUIVALENT, 97 ms] (10) EDP (11) ERuleRemovalProof [EQUIVALENT, 0 ms] (12) EDP (13) EDPPoloProof [EQUIVALENT, 0 ms] (14) EDP (15) PisEmptyProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: zero(0) -> 0 plus(x, 0) -> x plus(zero(x), zero(y)) -> zero(plus(x, y)) plus(zero(x), un(y)) -> un(plus(x, y)) plus(zero(x), j(y)) -> j(plus(x, y)) plus(un(x), j(y)) -> zero(plus(x, y)) plus(un(x), un(y)) -> j(plus(x, plus(y, un(0)))) plus(j(x), j(y)) -> un(plus(x, plus(y, j(0)))) minus(x, y) -> plus(x, neg(y)) neg(0) -> 0 neg(zero(x)) -> zero(neg(x)) neg(un(x)) -> j(neg(x)) neg(j(x)) -> un(neg(x)) times(x, 0) -> 0 times(x, times(0, z)) -> times(0, z) times(x, zero(y)) -> zero(times(x, y)) times(x, times(zero(y), z)) -> times(zero(times(x, y)), z) times(x, un(y)) -> plus(x, zero(times(x, y))) times(x, times(un(y), z)) -> times(plus(x, zero(times(x, y))), z) times(x, j(y)) -> plus(zero(times(x, y)), neg(x)) times(x, times(j(y), z)) -> times(plus(zero(times(x, y)), neg(x)), z) The set E consists of the following equations: plus(x, y) == plus(y, x) times(x, y) == times(y, x) plus(plus(x, y), z) == plus(x, plus(y, z)) times(times(x, y), z) == times(x, times(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: zero(0) -> 0 plus(x, 0) -> x plus(zero(x), zero(y)) -> zero(plus(x, y)) plus(zero(x), un(y)) -> un(plus(x, y)) plus(zero(x), j(y)) -> j(plus(x, y)) plus(un(x), j(y)) -> zero(plus(x, y)) plus(un(x), un(y)) -> j(plus(x, plus(y, un(0)))) plus(j(x), j(y)) -> un(plus(x, plus(y, j(0)))) minus(x, y) -> plus(x, neg(y)) neg(0) -> 0 neg(zero(x)) -> zero(neg(x)) neg(un(x)) -> j(neg(x)) neg(j(x)) -> un(neg(x)) times(x, 0) -> 0 times(x, times(0, z)) -> times(0, z) times(x, zero(y)) -> zero(times(x, y)) times(x, times(zero(y), z)) -> times(zero(times(x, y)), z) times(x, un(y)) -> plus(x, zero(times(x, y))) times(x, times(un(y), z)) -> times(plus(x, zero(times(x, y))), z) times(x, j(y)) -> plus(zero(times(x, y)), neg(x)) times(x, times(j(y), z)) -> times(plus(zero(times(x, y)), neg(x)), z) The set E consists of the following equations: plus(x, y) == plus(y, x) times(x, y) == times(y, x) plus(plus(x, y), z) == plus(x, plus(y, z)) times(times(x, y), z) == times(x, times(y, z)) The following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly by a polynomial ordering: popout

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

job log

popout

actions

all output return to TRS Equational