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	n120.star.cs.uiowa.edu
space	AProVE_AC_04

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.277463 seconds
cpu usage	0.183723
user time	0.12538
system time	0.058343
max virtual memory	113176.0
max residence set size	8868.0

stage attributes

key	value
starexec-result	MAYBE

output

0.00/0.27 MAYBE 0.00/0.27 Input TRS: 0.00/0.27 AC symbols: plus times 0.00/0.27 1: zero(0()) -> 0() 0.00/0.27 2: plus(x,0()) -> x 0.00/0.27 3: plus(zero(x),zero(y)) -> zero(plus(x,y)) 0.00/0.27 4: plus(zero(x),un(y)) -> un(plus(x,y)) 0.00/0.27 5: plus(zero(x),j(y)) -> j(plus(x,y)) 0.00/0.27 6: plus(un(x),j(y)) -> zero(plus(x,y)) 0.00/0.27 7: plus(un(x),un(y)) -> j(plus(x,plus(y,un(0())))) 0.00/0.27 8: plus(j(x),j(y)) -> un(plus(x,plus(y,j(0())))) 0.00/0.27 9: minus(x,y) -> plus(x,neg(y)) 0.00/0.27 10: neg(0()) -> 0() 0.00/0.27 11: neg(zero(x)) -> zero(neg(x)) 0.00/0.27 12: neg(un(x)) -> j(neg(x)) 0.00/0.27 13: neg(j(x)) -> un(neg(x)) 0.00/0.27 14: times(x,0()) -> 0() 0.00/0.27 15: times(x,times(0(),z)) -> times(0(),z) 0.00/0.27 16: times(x,zero(y)) -> zero(times(x,y)) 0.00/0.27 17: times(x,times(zero(y),z)) -> times(zero(times(x,y)),z) 0.00/0.27 18: times(x,un(y)) -> plus(x,zero(times(x,y))) 0.00/0.27 19: times(x,times(un(y),z)) -> times(plus(x,zero(times(x,y))),z) 0.00/0.27 20: times(x,j(y)) -> plus(zero(times(x,y)),neg(x)) 0.00/0.27 21: times(x,times(j(y),z)) -> times(plus(zero(times(x,y)),neg(x)),z) 0.00/0.27 Number of strict rules: 21 0.00/0.27 Direct POLO(bPol) ... failed. 0.00/0.27 Uncurrying ... failed. 0.00/0.27 Dependency Pairs: 0.00/0.27 #1: #plus(un(x),j(y)) -> #zero(plus(x,y)) 0.00/0.27 #2: #plus(un(x),j(y)) -> #plus(x,y) 0.00/0.27 #3: #neg(j(x)) -> #neg(x) 0.00/0.27 #4: #minus(x,y) -> #plus(x,neg(y)) 0.00/0.27 #5: #minus(x,y) -> #neg(y) 0.00/0.27 #6: #neg(zero(x)) -> #zero(neg(x)) 0.00/0.27 #7: #neg(zero(x)) -> #neg(x) 0.00/0.27 #8: #times(x,times(y,z)) ->= #times(times(x,y),z) 0.00/0.27 #9: #times(x,times(y,z)) ->= #times(x,y) 0.00/0.27 #10: #neg(un(x)) -> #neg(x) 0.00/0.27 #11: #times(x,j(y)) -> #plus(zero(times(x,y)),neg(x)) 0.00/0.27 #12: #times(x,j(y)) -> #zero(times(x,y)) 0.00/0.27 #13: #times(x,j(y)) -> #times(x,y) 0.00/0.27 #14: #times(x,j(y)) -> #neg(x) 0.00/0.27 #15: #plus(un(x),un(y)) -> #plus(x,plus(y,un(0()))) 0.00/0.27 #16: #plus(un(x),un(y)) -> #plus(y,un(0())) 0.00/0.27 #17: #plus(zero(x),j(y)) -> #plus(x,y) 0.00/0.27 #18: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) 0.00/0.27 #19: #plus(x,plus(y,z)) ->= #plus(x,y) 0.00/0.27 #20: #times(x,times(zero(y),z)) -> #times(zero(times(x,y)),z) 0.00/0.27 #21: #times(x,times(zero(y),z)) -> #zero(times(x,y)) 0.00/0.27 #22: #times(x,times(zero(y),z)) -> #times(x,y) 0.00/0.27 #23: #times(x,times(un(y),z)) -> #times(plus(x,zero(times(x,y))),z) 0.00/0.27 #24: #times(x,times(un(y),z)) -> #plus(x,zero(times(x,y))) 0.00/0.27 #25: #times(x,times(un(y),z)) -> #zero(times(x,y)) 0.00/0.27 #26: #times(x,times(un(y),z)) -> #times(x,y) 0.00/0.27 #27: #times(x,times(j(y),z)) -> #times(plus(zero(times(x,y)),neg(x)),z) 0.00/0.27 #28: #times(x,times(j(y),z)) -> #plus(zero(times(x,y)),neg(x)) 0.00/0.27 #29: #times(x,times(j(y),z)) -> #zero(times(x,y)) 0.00/0.27 #30: #times(x,times(j(y),z)) -> #times(x,y) 0.00/0.27 #31: #times(x,times(j(y),z)) -> #neg(x) 0.00/0.27 #32: #times(x,zero(y)) -> #zero(times(x,y)) 0.00/0.27 #33: #times(x,zero(y)) -> #times(x,y) 0.00/0.27 #34: #plus(zero(x),zero(y)) -> #zero(plus(x,y)) 0.00/0.27 #35: #plus(zero(x),zero(y)) -> #plus(x,y) 0.00/0.27 #36: #plus(j(x),j(y)) -> #plus(x,plus(y,j(0()))) 0.00/0.27 #37: #plus(j(x),j(y)) -> #plus(y,j(0())) 0.00/0.27 #38: #plus(zero(x),un(y)) -> #plus(x,y) 0.00/0.27 #39: #times(x,un(y)) -> #plus(x,zero(times(x,y))) 0.00/0.27 #40: #times(x,un(y)) -> #zero(times(x,y)) 0.00/0.27 #41: #times(x,un(y)) -> #times(x,y) 0.00/0.27 Number of SCCs: 3, DPs: 24 0.00/0.27 SCC { #3 #7 #10 } 0.00/0.27 POLO(Sum)... succeeded. 0.00/0.27 zero w: x1 + 1 0.00/0.27 minus w: 0 0.00/0.27 #plus w: 0 0.00/0.27 #times w: 0 0.00/0.27 0 w: 0 0.00/0.27 times w: 0 0.00/0.27 neg w: 0 0.00/0.27 j w: x1 + 1 0.00/0.27 #minus w: 0 0.00/0.27 plus w: 0 0.00/0.27 #neg w: x1 0.00/0.27 #zero w: 0 0.00/0.27 un w: x1 + 1 0.00/0.27 USABLE RULES: { } 0.00/0.27 Removed DPs: #3 #7 #10 0.00/0.27 Number of SCCs: 2, DPs: 21 0.00/0.27 SCC { #2 #15..19 #35..38 } 0.00/0.27 POLO(Sum)... succeeded. 0.00/0.27 zero w: x1 + 1 0.00/0.27 minus w: 0 0.00/0.27 #plus w: x1 + x2 0.00/0.27 #times w: 0 0.00/0.27 0 w: 0 0.00/0.27 times w: 0 0.00/0.27 neg w: 0 0.00/0.27 j w: x1 + 1 0.00/0.27 #minus w: 0 0.00/0.27 plus w: x1 + x2 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