Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997161
details
property
value
status
complete
benchmark
PEANO-NAT_nosorts.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n062.star.cs.uiowa.edu
space
Mixed_C
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.221066 seconds
cpu usage
0.092541
user time
0.061421
system time
0.03112
max virtual memory
113176.0
max residence set size
6656.0
stage attributes
key
value
starexec-result
MAYBE
output
0.00/0.21 MAYBE 0.00/0.21 Input TRS: 0.00/0.21 C symbols: d _+_ _*_ gcd 0.00/0.21 1: 1() -> s_(0()) 0.00/0.21 2: 2() -> s_(s_(0())) 0.00/0.21 3: 3() -> s_(s_(s_(0()))) 0.00/0.21 4: 4() -> s_(s_(s_(s_(0())))) 0.00/0.21 5: 5() -> s_(s_(s_(s_(s_(0()))))) 0.00/0.21 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 0.00/0.21 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 0.00/0.21 8: U11(tt(),M',N') -> U12(equal(_>_(N',M'),true()),M',N') 0.00/0.21 9: U12(tt(),M',N') -> gcd(d(N',M'),M') 0.00/0.21 10: U21(tt(),M',N) -> U22(equal(_>_(M',N),true())) 0.00/0.21 11: U22(tt()) -> 0() 0.00/0.21 12: U31(tt(),M',N) -> U32(equal(_>_(N,M'),true()),M',N) 0.00/0.21 13: U32(tt(),M',N) -> s_(quot(d(N,M'),M')) 0.00/0.21 14: _*_(N,0()) -> 0() 0.00/0.21 15: _*_(s_(N),s_(M)) -> s_(_+_(N,_+_(M,_*_(N,M)))) 0.00/0.21 16: _+_(N,0()) -> N 0.00/0.21 17: _+_(s_(N),s_(M)) -> s_(s_(_+_(N,M))) 0.00/0.21 18: _<_(N,M) -> _>_(M,N) 0.00/0.21 19: _>_(0(),M) -> false() 0.00/0.21 20: _>_(N',0()) -> true() 0.00/0.21 21: _>_(s_(N),s_(M)) -> _>_(N,M) 0.00/0.21 22: and(tt(),X) -> X 0.00/0.21 23: d(0(),N) -> N 0.00/0.21 24: d(s_(N),s_(M)) -> d(N,M) 0.00/0.21 25: equal(X,X) -> tt() 0.00/0.21 26: gcd(0(),N) -> 0() 0.00/0.21 27: gcd(N',M') -> U11(tt(),M',N') 0.00/0.21 28: gcd(N',N') -> N' 0.00/0.21 29: p_(s_(N)) -> N 0.00/0.21 30: quot(M',M') -> s_(0()) 0.00/0.21 31: quot(N,M') -> U21(tt(),M',N) 0.00/0.21 32: quot(N,M') -> U31(tt(),M',N) 0.00/0.21 Number of strict rules: 32 0.00/0.21 Direct POLO(bPol) ... failed. 0.00/0.21 Uncurrying U11 U21 U31 0.00/0.21 C symbols: d _+_ _*_ gcd 0.00/0.21 1: 1() -> s_(0()) 0.00/0.21 2: 2() -> s_(s_(0())) 0.00/0.21 3: 3() -> s_(s_(s_(0()))) 0.00/0.21 4: 4() -> s_(s_(s_(s_(0())))) 0.00/0.21 5: 5() -> s_(s_(s_(s_(s_(0()))))) 0.00/0.21 6: 6() -> s_(s_(s_(s_(s_(s_(0())))))) 0.00/0.21 7: 7() -> s_(s_(s_(s_(s_(s_(s_(0()))))))) 0.00/0.21 8: U11^1_tt(M',N') -> U12(equal(_>_(N',M'),true()),M',N') 0.00/0.21 9: U12(tt(),M',N') -> gcd(d(N',M'),M') 0.00/0.21 10: U21^1_tt(M',N) -> U22(equal(_>_(M',N),true())) 0.00/0.21 11: U22(tt()) -> 0() 0.00/0.21 12: U31^1_tt(M',N) -> U32(equal(_>_(N,M'),true()),M',N) 0.00/0.21 13: U32(tt(),M',N) -> s_(quot(d(N,M'),M')) 0.00/0.21 14: _*_(N,0()) -> 0() 0.00/0.21 15: _*_(s_(N),s_(M)) -> s_(_+_(N,_+_(M,_*_(N,M)))) 0.00/0.21 16: _+_(N,0()) -> N 0.00/0.21 17: _+_(s_(N),s_(M)) -> s_(s_(_+_(N,M))) 0.00/0.21 18: _<_(N,M) -> _>_(M,N) 0.00/0.21 19: _>_(0(),M) -> false() 0.00/0.21 20: _>_(N',0()) -> true() 0.00/0.21 21: _>_(s_(N),s_(M)) -> _>_(N,M) 0.00/0.21 22: and(tt(),X) -> X 0.00/0.21 23: d(0(),N) -> N 0.00/0.21 24: d(s_(N),s_(M)) -> d(N,M) 0.00/0.21 25: equal(X,X) -> tt() 0.00/0.21 26: gcd(0(),N) -> 0() 0.00/0.21 27: gcd(N',M') -> U11^1_tt(M',N') 0.00/0.21 28: gcd(N',N') -> N' 0.00/0.21 29: p_(s_(N)) -> N 0.00/0.21 30: quot(M',M') -> s_(0()) 0.00/0.21 31: quot(N,M') -> U21^1_tt(M',N) 0.00/0.21 32: quot(N,M') -> U31^1_tt(M',N) 0.00/0.21 33: U31(tt(),_2,_3) ->= U31^1_tt(_2,_3) 0.00/0.21 34: U21(tt(),_2,_3) ->= U21^1_tt(_2,_3) 0.00/0.21 35: U11(tt(),_2,_3) ->= U11^1_tt(_2,_3) 0.00/0.21 Number of strict rules: 32 0.00/0.21 Direct POLO(bPol) ... failed. 0.00/0.21 Dependency Pairs: 0.00/0.21 #1: #U11(tt(),_2,_3) ->? #U11^1_tt(_2,_3) 0.00/0.21 #2: #U32(tt(),M',N) -> #quot(d(N,M'),M') 0.00/0.21 #3: #U32(tt(),M',N) -> #d(N,M') 0.00/0.21 #4: #U12(tt(),M',N') -> #gcd(d(N',M'),M') 0.00/0.21 #5: #U12(tt(),M',N') -> #d(N',M') 0.00/0.21 #6: #d(s_(N),s_(M)) -> #d(N,M) 0.00/0.21 #7: #U31^1_tt(M',N) -> #U32(equal(_>_(N,M'),true()),M',N) 0.00/0.21 #8: #U31^1_tt(M',N) -> #equal(_>_(N,M'),true()) 0.00/0.21 #9: #U31^1_tt(M',N) -> #_>_(N,M') 0.00/0.21 #10: #quot(N,M') -> #U21^1_tt(M',N) 0.00/0.21 #11: #U21^1_tt(M',N) -> #U22(equal(_>_(M',N),true())) 0.00/0.21 #12: #U21^1_tt(M',N) -> #equal(_>_(M',N),true()) 0.00/0.21 #13: #U21^1_tt(M',N) -> #_>_(M',N) 0.00/0.21 #14: #U31(tt(),_2,_3) ->? #U31^1_tt(_2,_3) 0.00/0.21 #15: #U21(tt(),_2,_3) ->? #U21^1_tt(_2,_3) 0.00/0.21 #16: #gcd(N',M') -> #U11^1_tt(M',N') 0.00/0.21 #17: #_+_(s_(N),s_(M)) -> #_+_(N,M) 0.00/0.21 #18: #quot(N,M') -> #U31^1_tt(M',N) 0.00/0.21 #19: #_>_(s_(N),s_(M)) -> #_>_(N,M) 0.00/0.21 #20: #U11^1_tt(M',N') -> #U12(equal(_>_(N',M'),true()),M',N') 0.00/0.21 #21: #U11^1_tt(M',N') -> #equal(_>_(N',M'),true()) 0.00/0.21 #22: #U11^1_tt(M',N') -> #_>_(N',M') 0.00/0.21 #23: #_*_(s_(N),s_(M)) -> #_+_(N,_+_(M,_*_(N,M)))
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