Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919077
details
property
value
status
complete
benchmark
Applicative_05__Hamming.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n036.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0851039886475 seconds
cpu usage
0.089707672
max memory
1.2791808E7
stage attributes
key
value
output-size
24854
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE 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: if(true(),X,Y) -> X 2: if(false(),U,V) -> V 3: lt(s(W),s(P)) -> lt(W,P) 4: lt(0(),s(X1)) -> true() 5: lt(Y1,0()) -> false() 6: eq(U1,U1) -> true() 7: eq(s(V1),0()) -> false() 8: eq(0(),s(W1)) -> false() 9: merge(P1,nil()) -> P1 10: merge(nil(),X2) -> X2 11: merge(cons(Y2,U2),cons(V2,W2)) -> if(lt(Y2,V2),cons(Y2,merge(U2,cons(V2,W2))),if(eq(Y2,V2),cons(Y2,merge(U2,W2)),cons(V2,merge(cons(Y2,U2),W2)))) 12: mult(0(),V3) -> 0() 13: mult(s(W3),P3) -> plus(P3,mult(W3,P3)) 14: plus(0(),X4) -> 0() 15: plus(s(Y4),U4) -> s(plus(Y4,U4)) 16: _(X1,X2) -> X1 17: _(X1,X2) -> X2 Number of strict rules: 17 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mult(s(W3),P3) -> #plus(P3,mult(W3,P3)) #2: #mult(s(W3),P3) -> #mult(W3,P3) #3: #merge(cons(Y2,U2),cons(V2,W2)) -> #if(lt(Y2,V2),cons(Y2,merge(U2,cons(V2,W2))),if(eq(Y2,V2),cons(Y2,merge(U2,W2)),cons(V2,merge(cons(Y2,U2),W2)))) #4: #merge(cons(Y2,U2),cons(V2,W2)) -> #lt(Y2,V2) #5: #merge(cons(Y2,U2),cons(V2,W2)) -> #merge(U2,cons(V2,W2)) #6: #merge(cons(Y2,U2),cons(V2,W2)) -> #if(eq(Y2,V2),cons(Y2,merge(U2,W2)),cons(V2,merge(cons(Y2,U2),W2))) #7: #merge(cons(Y2,U2),cons(V2,W2)) -> #eq(Y2,V2) #8: #merge(cons(Y2,U2),cons(V2,W2)) -> #merge(U2,W2) #9: #merge(cons(Y2,U2),cons(V2,W2)) -> #merge(cons(Y2,U2),W2) #10: #lt(s(W),s(P)) -> #lt(W,P) #11: #plus(s(Y4),U4) -> #plus(Y4,U4) Number of SCCs: 4, DPs: 6 SCC { #2 } POLO(Sum)... succeeded. merge w: 0 s w: x1 + 1 #lt w: 0 #plus w: 0 eq w: 0 false w: 0 #merge w: 0 _ w: 0 true w: 0 #eq w: 0 mult w: 0 if w: 0 0 w: 0 nil w: 0 #_ w: 0 plus w: 0 cons w: 0 #if w: 0 lt w: 0 #mult w: x1 USABLE RULES: { } Removed DPs: #2 Number of SCCs: 3, DPs: 5 SCC { #11 } POLO(Sum)... succeeded. merge w: 0 s w: x1 + 1 #lt w: 0 #plus w: x1 eq w: 0 false w: 0 #merge w: 0 _ w: 0 true w: 0 #eq w: 0 mult w: 0 if w: 0 0 w: 0 nil w: 0 #_ w: 0 plus w: 0 cons w: 0 #if w: 0 lt w: 0 #mult w: 0 USABLE RULES: { } Removed DPs: #11 Number of SCCs: 2, DPs: 4 SCC { #10 } POLO(Sum)... succeeded. merge w: 0 s w: x1 + 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631