Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734948
details
property
value
status
complete
benchmark
Applicative_first_order_05__perfect2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
default
runtime (wallclock)
0.0981950759888 seconds
cpu usage
0.104462665
max memory
1.2169216E7
stage attributes
key
value
output-size
17765
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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(0(),X) -> 0() 2: minus(s(Y),0()) -> s(Y) 3: minus(s(U),s(V)) -> minus(U,V) 4: le(0(),W) -> true() 5: le(s(P),0()) -> false() 6: le(s(X1),s(Y1)) -> le(X1,Y1) 7: if(true(),U1,V1) -> U1 8: if(false(),W1,P1) -> P1 9: perfectp(0()) -> false() 10: perfectp(s(X2)) -> f(X2,s(0()),s(X2),s(X2)) 11: f(0(),U2,0(),Y2) -> true() 12: f(0(),W2,s(P2),V2) -> false() 13: f(s(Y3),0(),U3,X3) -> f(Y3,X3,minus(U3,s(Y3)),X3) 14: f(s(W3),s(P3),X4,V3) -> if(le(W3,P3),f(s(W3),minus(P3,W3),X4,V3),f(W3,V3,X4,V3)) 15: _(X1,X2) -> X1 16: _(X1,X2) -> X2 Number of strict rules: 16 Direct POLO(bPol) ... failed. Uncurrying f 1: minus(0(),X) -> 0() 2: minus(s(Y),0()) -> s(Y) 3: minus(s(U),s(V)) -> minus(U,V) 4: le(0(),W) -> true() 5: le(s(P),0()) -> false() 6: le(s(X1),s(Y1)) -> le(X1,Y1) 7: if(true(),U1,V1) -> U1 8: if(false(),W1,P1) -> P1 9: perfectp(0()) -> false() 10: perfectp(s(X2)) -> f(X2,s(0()),s(X2),s(X2)) 11: f^1_0(U2,0(),Y2) -> true() 12: f^1_0(W2,s(P2),V2) -> false() 13: f^1_s(Y3,0(),U3,X3) -> f(Y3,X3,minus(U3,s(Y3)),X3) 14: f^1_s(W3,s(P3),X4,V3) -> if(le(W3,P3),f^1_s(W3,minus(P3,W3),X4,V3),f(W3,V3,X4,V3)) 15: _(X1,X2) -> X1 16: _(X1,X2) -> X2 17: f(0(),_3,_4,_5) ->= f^1_0(_3,_4,_5) 18: f(s(_1),_4,_5,_6) ->= f^1_s(_1,_4,_5,_6) Number of strict rules: 16 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #le(s(X1),s(Y1)) -> #le(X1,Y1) #2: #f^1_s(Y3,0(),U3,X3) -> #f(Y3,X3,minus(U3,s(Y3)),X3) #3: #f^1_s(Y3,0(),U3,X3) -> #minus(U3,s(Y3)) #4: #f^1_s(W3,s(P3),X4,V3) -> #if(le(W3,P3),f^1_s(W3,minus(P3,W3),X4,V3),f(W3,V3,X4,V3)) #5: #f^1_s(W3,s(P3),X4,V3) -> #le(W3,P3) #6: #f^1_s(W3,s(P3),X4,V3) -> #f^1_s(W3,minus(P3,W3),X4,V3) #7: #f^1_s(W3,s(P3),X4,V3) -> #minus(P3,W3) #8: #f^1_s(W3,s(P3),X4,V3) -> #f(W3,V3,X4,V3) #9: #perfectp(s(X2)) -> #f(X2,s(0()),s(X2),s(X2)) #10: #f(0(),_3,_4,_5) ->? #f^1_0(_3,_4,_5) #11: #minus(s(U),s(V)) -> #minus(U,V) #12: #f(s(_1),_4,_5,_6) ->? #f^1_s(_1,_4,_5,_6) Number of SCCs: 3, DPs: 6 SCC { #1 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: x1 + x2 minus w: 0 #f^1_s w: 0 #perfectp w: 0 false w: 0 _ w: 0 true w: 0 f w: 0 0 w: 0 if w: 0 #f w: 0 #minus w: 0 #f^1_0 w: 0 #_ w: 0 #if w: 0 perfectp w: 0 f^1_0 w: 0 f^1_s w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 5 SCC { #11 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 minus w: 0 #f^1_s w: 0 #perfectp w: 0 false w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688