TRS Equat 89423 pair #381732683

details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	1.08541917801 seconds
cpu usage	1.180241557
max memory	2.9540352E7

stage attributes

key	value
output-size	8629
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(),A) -> _xor_(A,true())
    9: U21(tt(),A,B,C) -> _xor_(_and_(A,B),_and_(A,C))
    10: U31(tt()) -> false()
    11: U41(tt(),A) -> A
    12: U51(tt(),A,B) -> not_(_xor_(A,_and_(A,B)))
    13: U61(tt(),U',U) -> U62(equal(_isNotEqualTo_(U,U'),true()))
    14: U62(tt()) -> false()
    15: U71(tt()) -> true()
    16: U81(tt(),U',U) -> if_then_else_fi(_isEqualTo_(U,U'),false(),true())
    17: U91(tt()) -> false()
    18: _and_(A,A) -> U11(isBool(A),A)
    19: _and_(A,_xor_(B,C)) -> U21(and(isBool(A),and(isBool(B),isBool(C))),A,B,C)
    20: _and_(false(),A) -> U31(isBool(A))
    21: _and_(true(),A) -> U41(isBool(A),A)
    22: _implies_(A,B) -> U51(and(isBool(A),isBool(B)),A,B)
    23: _isEqualTo_(U,U') -> U61(and(isS(U'),isS(U)),U',U)
    24: _isEqualTo_(U,U) -> U71(isS(U))
    25: _isNotEqualTo_(U,U') -> U81(and(isS(U'),isS(U)),U',U)
    26: _isNotEqualTo_(U,U) -> U91(isS(U))
    27: _or_(A,B) -> U101(and(isBool(A),isBool(B)),A,B)
    28: _xor_(A,A) -> U111(isBool(A))
    29: _xor_(false(),A) -> U121(isBool(A),A)
    30: and(tt(),X) -> X
    31: equal(X,X) -> tt()
    32: if_then_else_fi(B,U,U') -> U131(and(isBool(B),and(isS(U'),isS(U))),B,U')
    33: if_then_else_fi(true(),U,U') -> U141(and(isS(U'),isS(U)),U)
    34: isBool(false()) -> tt()
    35: isBool(true()) -> tt()
    36: isBool(_and_(V1,V2)) -> and(isBool(V1),isBool(V2))
    37: isBool(_implies_(V1,V2)) -> and(isBool(V1),isBool(V2))
    38: isBool(_isEqualTo_(V1,V2)) -> and(isUniversal(V1),isUniversal(V2))
    39: isBool(_isNotEqualTo_(V1,V2)) -> and(isUniversal(V1),isUniversal(V2))
    40: isBool(_or_(V1,V2)) -> and(isBool(V1),isBool(V2))
    41: isBool(_xor_(V1,V2)) -> and(isBool(V1),isBool(V2))
    42: isBool(not_(V1)) -> isBool(V1)
    43: not_(A) -> U151(isBool(A),A)
    44: not_(false()) -> true()
    45: not_(true()) -> false()
Number of strict rules: 45
Direct POLO(bPol) ... failed.
Uncurrying and U71 U91
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(),A) -> _xor_(A,true())
9: U21(tt(),A,B,C) -> _xor_(_and_(A,B),_and_(A,C))
10: U31(tt()) -> false()
11: U41(tt(),A) -> A
12: U51(tt(),A,B) -> not_(_xor_(A,_and_(A,B)))
13: U61(tt(),U',U) -> U62(equal(_isNotEqualTo_(U,U'),true()))
14: U62(tt()) -> false()
15: U71^1_tt() -> true()
16: U81(tt(),U',U) -> if_then_else_fi(_isEqualTo_(U,U'),false(),true())
17: U91^1_tt() -> false()
18: _and_(A,A) -> U11(isBool(A),A)
19: _and_(A,_xor_(B,C)) -> U21(and(isBool(A),and(isBool(B),isBool(C))),A,B,C)
20: _and_(false(),A) -> U31(isBool(A))
21: _and_(true(),A) -> U41(isBool(A),A)
22: _implies_(A,B) -> U51(and(isBool(A),isBool(B)),A,B)
23: _isEqualTo_(U,U') -> U61(and^1_isS(U',isS(U)),U',U)
24: _isEqualTo_(U,U) -> U71^1_isS(U)
25: _isNotEqualTo_(U,U') -> U81(and^1_isS(U',isS(U)),U',U)
26: _isNotEqualTo_(U,U) -> U91^1_isS(U)
27: _or_(A,B) -> U101(and(isBool(A),isBool(B)),A,B)
28: _xor_(A,A) -> U111(isBool(A))
29: _xor_(false(),A) -> U121(isBool(A),A)
30: and^1_tt(X) -> X
31: equal(X,X) -> tt()
32: if_then_else_fi(B,U,U') -> U131(and(isBool(B),and^1_isS(U',isS(U))),B,U')
33: if_then_else_fi(true(),U,U') -> U141(and^1_isS(U',isS(U)),U)
34: isBool(false()) -> tt()
35: isBool(true()) -> tt()
36: isBool(_and_(V1,V2)) -> and(isBool(V1),isBool(V2))
37: isBool(_implies_(V1,V2)) -> and(isBool(V1),isBool(V2))
38: isBool(_isEqualTo_(V1,V2)) -> and^1_isUniversal(V1,isUniversal(V2))
39: isBool(_isNotEqualTo_(V1,V2)) -> and^1_isUniversal(V1,isUniversal(V2))
40: isBool(_or_(V1,V2)) -> and(isBool(V1),isBool(V2))
41: isBool(_xor_(V1,V2)) -> and(isBool(V1),isBool(V2))
42: isBool(not_(V1)) -> isBool(V1)

popout

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

job log

popout

actions all output return to TRS Equat 89423