details

property	value
status	complete
benchmark	RENAMED-BOOL_complete.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n166.star.cs.uiowa.edu
space	Mixed_AC

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.614279 seconds
cpu usage	0.66
user time	0.56
system time	0.1
max virtual memory	423568.0
max residence set size	8908.0

stage attributes

key	value
starexec-result	MAYBE

output

0.66/0.60 MAYBE 0.66/0.61 Input TRS: 0.66/0.61 AC symbols: _or_ _xor_ _and_ 0.66/0.61 1: U101(tt(),A,B) -> _xor_(_and_(A,B),_xor_(A,B)) 0.66/0.61 2: U11(tt(),A) -> A 0.66/0.61 3: U111(tt()) -> false() 0.66/0.61 4: U121(tt(),A) -> A 0.66/0.61 5: U131(tt(),B,U') -> U132(equal(_isNotEqualTo_(B,true()),true()),U') 0.66/0.61 6: U132(tt(),U') -> U' 0.66/0.61 7: U141(tt(),U) -> U 0.66/0.61 8: U151(tt(),V1,V2) -> U152(isBool(V1),V2) 0.66/0.61 9: U152(tt(),V2) -> U153(isBool(V2)) 0.66/0.61 10: U153(tt()) -> tt() 0.66/0.61 11: U161(tt(),V1,V2) -> U162(isBool(V1),V2) 0.66/0.61 12: U162(tt(),V2) -> U163(isBool(V2)) 0.66/0.61 13: U163(tt()) -> tt() 0.66/0.61 14: U171(tt(),V1,V2) -> U172(isBool(V1),V2) 0.66/0.61 15: U172(tt(),V2) -> U173(isBool(V2)) 0.66/0.61 16: U173(tt()) -> tt() 0.66/0.61 17: U181(tt(),V1,V2) -> U182(isBool(V1),V2) 0.66/0.61 18: U182(tt(),V2) -> U183(isBool(V2)) 0.66/0.61 19: U183(tt()) -> tt() 0.66/0.61 20: U191(tt(),V1) -> U192(isBool(V1)) 0.66/0.61 21: U192(tt()) -> tt() 0.66/0.61 22: U201(tt(),A) -> _xor_(A,true()) 0.66/0.61 23: U21(tt(),A,B,C) -> _xor_(_and_(A,B),_and_(A,C)) 0.66/0.61 24: U31(tt()) -> false() 0.66/0.61 25: U41(tt(),A) -> A 0.66/0.61 26: U51(tt(),A,B) -> not_(_xor_(A,_and_(A,B))) 0.66/0.61 27: U61(tt(),U',U) -> U62(equal(_isNotEqualTo_(U,U'),true())) 0.66/0.61 28: U62(tt()) -> false() 0.66/0.61 29: U71(tt()) -> true() 0.66/0.61 30: U81(tt(),U',U) -> if_then_else_fi(_isEqualTo_(U,U'),false(),true()) 0.66/0.61 31: U91(tt()) -> false() 0.66/0.61 32: _and_(A,A) -> U11(and(isBool(A),isBoolKind(A)),A) 0.66/0.61 33: _and_(A,_xor_(B,C)) -> U21(and(and(isBool(A),isBoolKind(A)),and(and(isBool(B),isBoolKind(B)),and(isBool(C),isBoolKind(C)))),A,B,C) 0.66/0.61 34: _and_(false(),A) -> U31(and(isBool(A),isBoolKind(A))) 0.66/0.61 35: _and_(true(),A) -> U41(and(isBool(A),isBoolKind(A)),A) 0.66/0.61 36: _implies_(A,B) -> U51(and(and(isBool(A),isBoolKind(A)),and(isBool(B),isBoolKind(B))),A,B) 0.66/0.61 37: _isEqualTo_(U,U') -> U61(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U',U) 0.66/0.61 38: _isEqualTo_(U,U) -> U71(and(isS(U),isSKind(U))) 0.66/0.61 39: _isNotEqualTo_(U,U') -> U81(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U',U) 0.66/0.61 40: _isNotEqualTo_(U,U) -> U91(and(isS(U),isSKind(U))) 0.66/0.61 41: _or_(A,B) -> U101(and(and(isBool(A),isBoolKind(A)),and(isBool(B),isBoolKind(B))),A,B) 0.66/0.61 42: _xor_(A,A) -> U111(and(isBool(A),isBoolKind(A))) 0.66/0.61 43: _xor_(false(),A) -> U121(and(isBool(A),isBoolKind(A)),A) 0.66/0.61 44: and(tt(),X) -> X 0.66/0.61 45: equal(X,X) -> tt() 0.66/0.61 46: if_then_else_fi(B,U,U') -> U131(and(and(isBool(B),isBoolKind(B)),and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U)))),B,U') 0.66/0.61 47: if_then_else_fi(true(),U,U') -> U141(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U) 0.66/0.61 48: isBool(false()) -> tt() 0.66/0.61 49: isBool(true()) -> tt() 0.66/0.61 50: isBool(_and_(V1,V2)) -> U151(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 0.66/0.61 51: isBool(_implies_(V1,V2)) -> U161(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 0.66/0.61 52: isBool(_isEqualTo_(V1,V2)) -> tt() 0.66/0.61 53: isBool(_isNotEqualTo_(V1,V2)) -> tt() 0.66/0.61 54: isBool(_or_(V1,V2)) -> U171(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 0.66/0.61 55: isBool(_xor_(V1,V2)) -> U181(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 0.66/0.61 56: isBool(not_(V1)) -> U191(isBoolKind(V1),V1) 0.66/0.61 57: isBoolKind(false()) -> tt() 0.66/0.61 58: isBoolKind(true()) -> tt() 0.66/0.61 59: isBoolKind(_and_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 0.66/0.61 60: isBoolKind(_implies_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 0.66/0.61 61: isBoolKind(_isEqualTo_(V1,V2)) -> tt() 0.66/0.61 62: isBoolKind(_isNotEqualTo_(V1,V2)) -> tt() 0.66/0.61 63: isBoolKind(_or_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 0.66/0.61 64: isBoolKind(_xor_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 0.66/0.61 65: isBoolKind(not_(V1)) -> isBoolKind(V1) 0.66/0.61 66: not_(A) -> U201(and(isBool(A),isBoolKind(A)),A) 0.66/0.61 67: not_(false()) -> true() 0.66/0.61 68: not_(true()) -> false() 0.66/0.61 Number of strict rules: 68 0.66/0.61 Direct POLO(bPol) ... failed. 0.66/0.61 Uncurrying and 0.66/0.61 AC symbols: _or_ _xor_ _and_ 0.66/0.61 1: U101(tt(),A,B) -> _xor_(_and_(A,B),_xor_(A,B)) 0.66/0.61 2: U11(tt(),A) -> A 0.66/0.61 3: U111(tt()) -> false() 0.66/0.61 4: U121(tt(),A) -> A 0.66/0.61 5: U131(tt(),B,U') -> U132(equal(_isNotEqualTo_(B,true()),true()),U') 0.66/0.61 6: U132(tt(),U') -> U' 0.66/0.61 7: U141(tt(),U) -> U 0.66/0.61 8: U151(tt(),V1,V2) -> U152(isBool(V1),V2) 0.66/0.61 9: U152(tt(),V2) -> U153(isBool(V2)) 0.66/0.61 10: U153(tt()) -> tt() 0.66/0.61 11: U161(tt(),V1,V2) -> U162(isBool(V1),V2) 0.66/0.61 12: U162(tt(),V2) -> U163(isBool(V2)) 0.66/0.61 13: U163(tt()) -> tt() 0.66/0.61 14: U171(tt(),V1,V2) -> U172(isBool(V1),V2) 0.66/0.61 15: U172(tt(),V2) -> U173(isBool(V2)) 0.66/0.61 16: U173(tt()) -> tt() 0.66/0.61 17: U181(tt(),V1,V2) -> U182(isBool(V1),V2) 0.66/0.61 18: U182(tt(),V2) -> U183(isBool(V2)) 0.66/0.61 19: U183(tt()) -> tt() 0.66/0.61 20: U191(tt(),V1) -> U192(isBool(V1)) 0.66/0.61 21: U192(tt()) -> tt() 0.66/0.61 22: U201(tt(),A) -> _xor_(A,true()) 0.66/0.61 23: U21(tt(),A,B,C) -> _xor_(_and_(A,B),_and_(A,C)) 0.66/0.61 24: U31(tt()) -> false() 0.66/0.61 25: U41(tt(),A) -> A 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