Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equat 89423 pair #381732793
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
n070.star.cs.uiowa.edu
space
Mixed_AC
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.577520847321 seconds
cpu usage
0.754786614
max memory
3.8342656E7
stage attributes
key
value
output-size
17321
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: AC symbols: _or_ _xor_ _and_ 1: U101(tt(),A,B) -> _xor_(_and_(A,B),_xor_(A,B)) 2: U11(tt(),A) -> A 3: U111(tt()) -> false() 4: U121(tt(),A) -> A 5: U131(tt(),B,U') -> U132(equal(_isNotEqualTo_(B,true()),true()),U') 6: U132(tt(),U') -> U' 7: U141(tt(),U) -> U 8: U151(tt(),V1,V2) -> U152(isBool(V1),V2) 9: U152(tt(),V2) -> U153(isBool(V2)) 10: U153(tt()) -> tt() 11: U161(tt(),V1,V2) -> U162(isBool(V1),V2) 12: U162(tt(),V2) -> U163(isBool(V2)) 13: U163(tt()) -> tt() 14: U171(tt(),V1,V2) -> U172(isBool(V1),V2) 15: U172(tt(),V2) -> U173(isBool(V2)) 16: U173(tt()) -> tt() 17: U181(tt(),V1,V2) -> U182(isBool(V1),V2) 18: U182(tt(),V2) -> U183(isBool(V2)) 19: U183(tt()) -> tt() 20: U191(tt(),V1) -> U192(isBool(V1)) 21: U192(tt()) -> tt() 22: U201(tt(),A) -> _xor_(A,true()) 23: U21(tt(),A,B,C) -> _xor_(_and_(A,B),_and_(A,C)) 24: U31(tt()) -> false() 25: U41(tt(),A) -> A 26: U51(tt(),A,B) -> not_(_xor_(A,_and_(A,B))) 27: U61(tt(),U',U) -> U62(equal(_isNotEqualTo_(U,U'),true())) 28: U62(tt()) -> false() 29: U71(tt()) -> true() 30: U81(tt(),U',U) -> if_then_else_fi(_isEqualTo_(U,U'),false(),true()) 31: U91(tt()) -> false() 32: _and_(A,A) -> U11(and(isBool(A),isBoolKind(A)),A) 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) 34: _and_(false(),A) -> U31(and(isBool(A),isBoolKind(A))) 35: _and_(true(),A) -> U41(and(isBool(A),isBoolKind(A)),A) 36: _implies_(A,B) -> U51(and(and(isBool(A),isBoolKind(A)),and(isBool(B),isBoolKind(B))),A,B) 37: _isEqualTo_(U,U') -> U61(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U',U) 38: _isEqualTo_(U,U) -> U71(and(isS(U),isSKind(U))) 39: _isNotEqualTo_(U,U') -> U81(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U',U) 40: _isNotEqualTo_(U,U) -> U91(and(isS(U),isSKind(U))) 41: _or_(A,B) -> U101(and(and(isBool(A),isBoolKind(A)),and(isBool(B),isBoolKind(B))),A,B) 42: _xor_(A,A) -> U111(and(isBool(A),isBoolKind(A))) 43: _xor_(false(),A) -> U121(and(isBool(A),isBoolKind(A)),A) 44: and(tt(),X) -> X 45: equal(X,X) -> tt() 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') 47: if_then_else_fi(true(),U,U') -> U141(and(and(isS(U'),isSKind(U')),and(isS(U),isSKind(U))),U) 48: isBool(false()) -> tt() 49: isBool(true()) -> tt() 50: isBool(_and_(V1,V2)) -> U151(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 51: isBool(_implies_(V1,V2)) -> U161(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 52: isBool(_isEqualTo_(V1,V2)) -> tt() 53: isBool(_isNotEqualTo_(V1,V2)) -> tt() 54: isBool(_or_(V1,V2)) -> U171(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 55: isBool(_xor_(V1,V2)) -> U181(and(isBoolKind(V1),isBoolKind(V2)),V1,V2) 56: isBool(not_(V1)) -> U191(isBoolKind(V1),V1) 57: isBoolKind(false()) -> tt() 58: isBoolKind(true()) -> tt() 59: isBoolKind(_and_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 60: isBoolKind(_implies_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 61: isBoolKind(_isEqualTo_(V1,V2)) -> tt() 62: isBoolKind(_isNotEqualTo_(V1,V2)) -> tt() 63: isBoolKind(_or_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 64: isBoolKind(_xor_(V1,V2)) -> and(isBoolKind(V1),isBoolKind(V2)) 65: isBoolKind(not_(V1)) -> isBoolKind(V1) 66: not_(A) -> U201(and(isBool(A),isBoolKind(A)),A) 67: not_(false()) -> true() 68: not_(true()) -> false() Number of strict rules: 68 Direct POLO(bPol) ... failed. Uncurrying and AC symbols: _or_ _xor_ _and_ 1: U101(tt(),A,B) -> _xor_(_and_(A,B),_xor_(A,B)) 2: U11(tt(),A) -> A 3: U111(tt()) -> false() 4: U121(tt(),A) -> A 5: U131(tt(),B,U') -> U132(equal(_isNotEqualTo_(B,true()),true()),U') 6: U132(tt(),U') -> U' 7: U141(tt(),U) -> U 8: U151(tt(),V1,V2) -> U152(isBool(V1),V2) 9: U152(tt(),V2) -> U153(isBool(V2)) 10: U153(tt()) -> tt() 11: U161(tt(),V1,V2) -> U162(isBool(V1),V2) 12: U162(tt(),V2) -> U163(isBool(V2)) 13: U163(tt()) -> tt() 14: U171(tt(),V1,V2) -> U172(isBool(V1),V2) 15: U172(tt(),V2) -> U173(isBool(V2)) 16: U173(tt()) -> tt() 17: U181(tt(),V1,V2) -> U182(isBool(V1),V2) 18: U182(tt(),V2) -> U183(isBool(V2)) 19: U183(tt()) -> tt()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equat 89423