Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734882
details
property
value
status
complete
benchmark
Applicative_first_order_05__#3.55.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n020.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
default
runtime (wallclock)
0.12960100174 seconds
cpu usage
0.137998776
max memory
1.120256E7
stage attributes
key
value
output-size
18667
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: minus(X,0()) -> X 2: minus(s(Y),s(U)) -> minus(Y,U) 3: quot(0(),s(V)) -> 0() 4: quot(s(W),s(P)) -> s(quot(minus(W,P),s(P))) 5: le(0(),X1) -> true() 6: le(s(Y1),0()) -> false() 7: le(s(U1),s(V1)) -> le(U1,V1) 8: app(nil(),W1) -> W1 9: app(add(P1,X2),Y2) -> add(P1,app(X2,Y2)) 10: low(U2,nil()) -> nil() 11: low(W2,add(V2,P2)) -> ifxb6220low(le(V2,W2),W2,add(V2,P2)) 12: ifxb6220low(true(),Y3,add(X3,U3)) -> add(X3,low(Y3,U3)) 13: ifxb6220low(false(),W3,add(V3,P3)) -> low(W3,P3) 14: high(X4,nil()) -> nil() 15: high(U4,add(Y4,V4)) -> ifxb6220high(le(Y4,U4),U4,add(Y4,V4)) 16: ifxb6220high(true(),P4,add(W4,X5)) -> high(P4,X5) 17: ifxb6220high(false(),U5,add(Y5,V5)) -> add(Y5,high(U5,V5)) 18: quicksort(nil()) -> nil() 19: quicksort(add(W5,P5)) -> app(quicksort(low(W5,P5)),add(W5,quicksort(high(W5,P5)))) 20: _(X1,X2) -> X1 21: _(X1,X2) -> X2 Number of strict rules: 21 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(Y),s(U)) -> #minus(Y,U) #2: #ifxb6220low(false(),W3,add(V3,P3)) -> #low(W3,P3) #3: #app(add(P1,X2),Y2) -> #app(X2,Y2) #4: #low(W2,add(V2,P2)) -> #ifxb6220low(le(V2,W2),W2,add(V2,P2)) #5: #low(W2,add(V2,P2)) -> #le(V2,W2) #6: #ifxb6220low(true(),Y3,add(X3,U3)) -> #low(Y3,U3) #7: #le(s(U1),s(V1)) -> #le(U1,V1) #8: #ifxb6220high(false(),U5,add(Y5,V5)) -> #high(U5,V5) #9: #quicksort(add(W5,P5)) -> #app(quicksort(low(W5,P5)),add(W5,quicksort(high(W5,P5)))) #10: #quicksort(add(W5,P5)) -> #quicksort(low(W5,P5)) #11: #quicksort(add(W5,P5)) -> #low(W5,P5) #12: #quicksort(add(W5,P5)) -> #quicksort(high(W5,P5)) #13: #quicksort(add(W5,P5)) -> #high(W5,P5) #14: #ifxb6220high(true(),P4,add(W4,X5)) -> #high(P4,X5) #15: #high(U4,add(Y4,V4)) -> #ifxb6220high(le(Y4,U4),U4,add(Y4,V4)) #16: #high(U4,add(Y4,V4)) -> #le(Y4,U4) #17: #quot(s(W),s(P)) -> #quot(minus(W,P),s(P)) #18: #quot(s(W),s(P)) -> #minus(W,P) Number of SCCs: 7, DPs: 12 SCC { #1 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 ifxb6220high w: 0 minus w: 0 #quicksort w: 0 #high w: 0 false w: 0 #ifxb6220high w: 0 _ w: 0 quicksort w: 0 true w: 0 0 w: 0 quot w: 0 high w: 0 nil w: 0 #app w: 0 #ifxb6220low w: 0 #minus w: x1 + x2 #_ w: 0 low w: 0 add w: 0 #quot w: 0 ifxb6220low w: 0 #low w: 0 app w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 6, DPs: 11 SCC { #3 } POLO(Sum)... succeeded. le w: 0 s w: 1 #le w: 0 ifxb6220high w: 0 minus w: 0 #quicksort w: 0 #high w: 0 false w: 0 #ifxb6220high w: 0 _ w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688