Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997164
details
property
value
status
complete
benchmark
PEANO-NAT_complete.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Mixed_C
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
1.49075 seconds
cpu usage
1.34182
user time
1.17401
system time
0.167814
max virtual memory
367300.0
max residence set size
8884.0
stage attributes
key
value
starexec-result
MAYBE
output
1.33/1.48 MAYBE 1.33/1.48 Input TRS: 1.33/1.48 C symbols: d _+_ _*_ gcd 1.33/1.48 1: 1() -> s_(0()) 1.33/1.48 2: 2() -> s_(s_(0())) 1.33/1.48 3: 3() -> s_(s_(s_(0()))) 1.33/1.48 4: 4() -> s_(s_(s_(s_(0())))) 1.33/1.48 5: 5() -> s_(s_(s_(s_(s_(0()))))) 1.33/1.48 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 1.33/1.48 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 1.33/1.48 8: U101(tt(),M,N) -> d(N,M) 1.33/1.48 9: U11(tt()) -> 0() 1.33/1.48 10: U111(tt()) -> 0() 1.33/1.48 11: U121(tt(),M',N') -> U122(equal(_>_(N',M'),true()),M',N') 1.33/1.48 12: U122(tt(),M',N') -> gcd(d(N',M'),M') 1.33/1.48 13: U131(tt(),N') -> N' 1.33/1.48 14: U141(tt(),V1,V2) -> U142(isNat(V1),V2) 1.33/1.48 15: U142(tt(),V2) -> U143(isNat(V2)) 1.33/1.48 16: U143(tt()) -> tt() 1.33/1.48 17: U151(tt(),V1,V2) -> U152(isNat(V1),V2) 1.33/1.48 18: U152(tt(),V2) -> U153(isNat(V2)) 1.33/1.48 19: U153(tt()) -> tt() 1.33/1.48 20: U161(tt(),V) -> U162(isNzNat(V)) 1.33/1.48 21: U162(tt()) -> tt() 1.33/1.48 22: U171(tt(),V1,V2) -> U172(isNat(V1),V2) 1.33/1.48 23: U172(tt(),V2) -> U173(isNat(V2)) 1.33/1.48 24: U173(tt()) -> tt() 1.33/1.48 25: U181(tt(),V1,V2) -> U182(isNat(V1),V2) 1.33/1.48 26: U182(tt(),V2) -> U183(isNat(V2)) 1.33/1.48 27: U183(tt()) -> tt() 1.33/1.48 28: U191(tt(),V1,V2) -> U192(isNat(V1),V2) 1.33/1.48 29: U192(tt(),V2) -> U193(isNat(V2)) 1.33/1.48 30: U193(tt()) -> tt() 1.33/1.48 31: U201(tt(),V1,V2) -> U202(isNat(V1),V2) 1.33/1.48 32: U202(tt(),V2) -> U203(isNat(V2)) 1.33/1.48 33: U203(tt()) -> tt() 1.33/1.48 34: U21(tt(),M,N) -> s_(_+_(N,_+_(M,_*_(N,M)))) 1.33/1.48 35: U211(tt(),V1) -> U212(isNzNat(V1)) 1.33/1.48 36: U212(tt()) -> tt() 1.33/1.48 37: U221(tt(),V1,V2) -> U222(isNat(V1),V2) 1.33/1.48 38: U222(tt(),V2) -> U223(isNzNat(V2)) 1.33/1.48 39: U223(tt()) -> tt() 1.33/1.48 40: U231(tt(),V1,V2) -> U232(isNzNat(V1),V2) 1.33/1.48 41: U232(tt(),V2) -> U233(isNzNat(V2)) 1.33/1.48 42: U233(tt()) -> tt() 1.33/1.48 43: U241(tt(),V1,V2) -> U242(isNzNat(V1),V2) 1.33/1.48 44: U242(tt(),V2) -> U243(isNzNat(V2)) 1.33/1.48 45: U243(tt()) -> tt() 1.33/1.48 46: U251(tt(),V1) -> U252(isNat(V1)) 1.33/1.48 47: U252(tt()) -> tt() 1.33/1.48 48: U261(tt(),N) -> N 1.33/1.48 49: U271(tt()) -> s_(0()) 1.33/1.48 50: U281(tt(),M',N) -> U282(equal(_>_(M',N),true())) 1.33/1.48 51: U282(tt()) -> 0() 1.33/1.48 52: U291(tt(),M',N) -> U292(equal(_>_(N,M'),true()),M',N) 1.33/1.48 53: U292(tt(),M',N) -> s_(quot(d(N,M'),M')) 1.33/1.48 54: U31(tt(),N) -> N 1.33/1.48 55: U41(tt(),M,N) -> s_(s_(_+_(N,M))) 1.33/1.48 56: U51(tt(),M,N) -> _>_(M,N) 1.33/1.48 57: U61(tt()) -> false() 1.33/1.48 58: U71(tt()) -> true() 1.33/1.48 59: U81(tt(),M,N) -> _>_(N,M) 1.33/1.48 60: U91(tt(),N) -> N 1.33/1.48 61: _*_(N,0()) -> U11(and(isNat(N),isNatKind(N))) 1.33/1.48 62: _*_(s_(N),s_(M)) -> U21(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 1.33/1.48 63: _+_(N,0()) -> U31(and(isNat(N),isNatKind(N)),N) 1.33/1.48 64: _+_(s_(N),s_(M)) -> U41(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 1.33/1.48 65: _<_(N,M) -> U51(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 1.33/1.48 66: _>_(0(),M) -> U61(and(isNat(M),isNatKind(M))) 1.33/1.48 67: _>_(N',0()) -> U71(and(isNzNat(N'),isNatKind(N'))) 1.33/1.48 68: _>_(s_(N),s_(M)) -> U81(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 1.33/1.48 69: and(tt(),X) -> X 1.33/1.48 70: d(0(),N) -> U91(and(isNat(N),isNatKind(N)),N) 1.33/1.48 71: d(s_(N),s_(M)) -> U101(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N) 1.33/1.48 72: equal(X,X) -> tt() 1.33/1.48 73: gcd(0(),N) -> U111(and(isNat(N),isNatKind(N))) 1.33/1.48 74: gcd(N',M') -> U121(and(and(isNzNat(M'),isNatKind(M')),and(isNzNat(N'),isNatKind(N'))),M',N') 1.33/1.48 75: gcd(N',N') -> U131(and(isNzNat(N'),isNatKind(N')),N') 1.33/1.48 76: isBoolean(false()) -> tt() 1.33/1.48 77: isBoolean(true()) -> tt() 1.33/1.48 78: isBoolean(_<_(V1,V2)) -> U141(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 79: isBoolean(_>_(V1,V2)) -> U151(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 80: isBooleanKind(false()) -> tt() 1.33/1.48 81: isBooleanKind(true()) -> tt() 1.33/1.48 82: isBooleanKind(_<_(V1,V2)) -> and(isNatKind(V1),isNatKind(V2)) 1.33/1.48 83: isBooleanKind(_>_(V1,V2)) -> and(isNatKind(V1),isNatKind(V2)) 1.33/1.48 84: isNat(0()) -> tt() 1.33/1.48 85: isNat(V) -> U161(isNatKind(V),V) 1.33/1.48 86: isNat(_*_(V1,V2)) -> U171(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 87: isNat(_+_(V1,V2)) -> U181(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 88: isNat(d(V1,V2)) -> U191(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 89: isNat(gcd(V1,V2)) -> U201(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 90: isNat(p_(V1)) -> U211(isNatKind(V1),V1) 1.33/1.48 91: isNat(quot(V1,V2)) -> U221(and(isNatKind(V1),isNatKind(V2)),V1,V2) 1.33/1.48 92: isNatKind(0()) -> tt() 1.33/1.48 93: isNatKind(1()) -> tt() 1.33/1.48 94: isNatKind(2()) -> tt() 1.33/1.48 95: isNatKind(3()) -> tt() 1.33/1.48 96: isNatKind(4()) -> tt() 1.33/1.48 97: isNatKind(5()) -> tt()
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