Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997140
details
property
value
status
complete
benchmark
PEANO-NAT_nosorts-noand.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n159.star.cs.uiowa.edu
space
Mixed_C
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.378917 seconds
cpu usage
0.190255
user time
0.139482
system time
0.050773
max virtual memory
113176.0
max residence set size
8912.0
stage attributes
key
value
starexec-result
MAYBE
output
0.00/0.37 MAYBE 0.00/0.37 Input TRS: 0.00/0.37 C symbols: d _+_ _*_ gcd 0.00/0.37 1: 1() -> s_(0()) 0.00/0.37 2: 2() -> s_(s_(0())) 0.00/0.37 3: 3() -> s_(s_(s_(0()))) 0.00/0.37 4: 4() -> s_(s_(s_(s_(0())))) 0.00/0.37 5: 5() -> s_(s_(s_(s_(s_(0()))))) 0.00/0.37 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 0.00/0.37 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 0.00/0.37 8: U11(tt(),M,N) -> U12(tt(),M,N) 0.00/0.37 9: U12(tt(),M,N) -> s_(_+_(N,_+_(M,_*_(N,M)))) 0.00/0.37 10: U21(tt(),M,N) -> U22(tt(),M,N) 0.00/0.37 11: U22(tt(),M,N) -> s_(s_(_+_(N,M))) 0.00/0.37 12: U31(tt(),M,N) -> U32(tt(),M,N) 0.00/0.37 13: U32(tt(),M,N) -> _>_(M,N) 0.00/0.37 14: U41(tt(),M,N) -> U42(tt(),M,N) 0.00/0.37 15: U42(tt(),M,N) -> _>_(N,M) 0.00/0.37 16: U51(tt(),M,N) -> U52(tt(),M,N) 0.00/0.37 17: U52(tt(),M,N) -> d(N,M) 0.00/0.37 18: U61(tt(),M',N') -> U62(tt(),M',N') 0.00/0.37 19: U62(tt(),M',N') -> U63(equal(_>_(N',M'),true()),M',N') 0.00/0.37 20: U63(tt(),M',N') -> gcd(d(N',M'),M') 0.00/0.37 21: U71(tt(),M',N) -> U72(tt(),M',N) 0.00/0.37 22: U72(tt(),M',N) -> U73(equal(_>_(M',N),true())) 0.00/0.37 23: U73(tt()) -> 0() 0.00/0.37 24: U81(tt(),M',N) -> U82(tt(),M',N) 0.00/0.37 25: U82(tt(),M',N) -> U83(equal(_>_(N,M'),true()),M',N) 0.00/0.37 26: U83(tt(),M',N) -> s_(quot(d(N,M'),M')) 0.00/0.37 27: _*_(N,0()) -> 0() 0.00/0.37 28: _*_(s_(N),s_(M)) -> U11(tt(),M,N) 0.00/0.37 29: _+_(N,0()) -> N 0.00/0.37 30: _+_(s_(N),s_(M)) -> U21(tt(),M,N) 0.00/0.37 31: _<_(N,M) -> U31(tt(),M,N) 0.00/0.37 32: _>_(0(),M) -> false() 0.00/0.37 33: _>_(N',0()) -> true() 0.00/0.37 34: _>_(s_(N),s_(M)) -> U41(tt(),M,N) 0.00/0.37 35: d(0(),N) -> N 0.00/0.37 36: d(s_(N),s_(M)) -> U51(tt(),M,N) 0.00/0.37 37: equal(X,X) -> tt() 0.00/0.37 38: gcd(0(),N) -> 0() 0.00/0.37 39: gcd(N',M') -> U61(tt(),M',N') 0.00/0.37 40: gcd(N',N') -> N' 0.00/0.37 41: p_(s_(N)) -> N 0.00/0.37 42: quot(M',M') -> s_(0()) 0.00/0.37 43: quot(N,M') -> U71(tt(),M',N) 0.00/0.37 44: quot(N,M') -> U81(tt(),M',N) 0.00/0.37 Number of strict rules: 44 0.00/0.37 Direct POLO(bPol) ... failed. 0.00/0.37 Uncurrying U71 U41 U42 U32 U12 U51 U22 U62 U72 U82 U81 U11 U21 U31 U61 U52 0.00/0.37 C symbols: d _+_ _*_ gcd 0.00/0.37 1: 1() -> s_(0()) 0.00/0.37 2: 2() -> s_(s_(0())) 0.00/0.37 3: 3() -> s_(s_(s_(0()))) 0.00/0.37 4: 4() -> s_(s_(s_(s_(0())))) 0.00/0.37 5: 5() -> s_(s_(s_(s_(s_(0()))))) 0.00/0.37 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 0.00/0.37 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 0.00/0.37 8: U11^1_tt(M,N) -> U12^1_tt(M,N) 0.00/0.37 9: U12^1_tt(M,N) -> s_(_+_(N,_+_(M,_*_(N,M)))) 0.00/0.37 10: U21^1_tt(M,N) -> U22^1_tt(M,N) 0.00/0.37 11: U22^1_tt(M,N) -> s_(s_(_+_(N,M))) 0.00/0.37 12: U31^1_tt(M,N) -> U32^1_tt(M,N) 0.00/0.37 13: U32^1_tt(M,N) -> _>_(M,N) 0.00/0.37 14: U41^1_tt(M,N) -> U42^1_tt(M,N) 0.00/0.37 15: U42^1_tt(M,N) -> _>_(N,M) 0.00/0.37 16: U51^1_tt(M,N) -> U52^1_tt(M,N) 0.00/0.37 17: U52^1_tt(M,N) -> d(N,M) 0.00/0.37 18: U61^1_tt(M',N') -> U62^1_tt(M',N') 0.00/0.37 19: U62^1_tt(M',N') -> U63(equal(_>_(N',M'),true()),M',N') 0.00/0.37 20: U63(tt(),M',N') -> gcd(d(N',M'),M') 0.00/0.37 21: U71^1_tt(M',N) -> U72^1_tt(M',N) 0.00/0.37 22: U72^1_tt(M',N) -> U73(equal(_>_(M',N),true())) 0.00/0.37 23: U73(tt()) -> 0() 0.00/0.37 24: U81^1_tt(M',N) -> U82^1_tt(M',N) 0.00/0.37 25: U82^1_tt(M',N) -> U83(equal(_>_(N,M'),true()),M',N) 0.00/0.37 26: U83(tt(),M',N) -> s_(quot(d(N,M'),M')) 0.00/0.37 27: _*_(N,0()) -> 0() 0.00/0.37 28: _*_(s_(N),s_(M)) -> U11^1_tt(M,N) 0.00/0.37 29: _+_(N,0()) -> N 0.00/0.37 30: _+_(s_(N),s_(M)) -> U21^1_tt(M,N) 0.00/0.37 31: _<_(N,M) -> U31^1_tt(M,N) 0.00/0.37 32: _>_(0(),M) -> false() 0.00/0.37 33: _>_(N',0()) -> true() 0.00/0.37 34: _>_(s_(N),s_(M)) -> U41^1_tt(M,N) 0.00/0.37 35: d(0(),N) -> N 0.00/0.37 36: d(s_(N),s_(M)) -> U51^1_tt(M,N) 0.00/0.37 37: equal(X,X) -> tt() 0.00/0.37 38: gcd(0(),N) -> 0() 0.00/0.37 39: gcd(N',M') -> U61^1_tt(M',N') 0.00/0.37 40: gcd(N',N') -> N' 0.00/0.37 41: p_(s_(N)) -> N 0.00/0.37 42: quot(M',M') -> s_(0()) 0.00/0.37 43: quot(N,M') -> U71^1_tt(M',N) 0.00/0.37 44: quot(N,M') -> U81^1_tt(M',N) 0.00/0.37 45: U52(tt(),_2,_3) ->= U52^1_tt(_2,_3) 0.00/0.37 46: U61(tt(),_2,_3) ->= U61^1_tt(_2,_3) 0.00/0.37 47: U31(tt(),_2,_3) ->= U31^1_tt(_2,_3) 0.00/0.37 48: U21(tt(),_2,_3) ->= U21^1_tt(_2,_3) 0.00/0.37 49: U11(tt(),_2,_3) ->= U11^1_tt(_2,_3)
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
