Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919162
details
property
value
status
complete
benchmark
Applicative_first_order_05__perfect.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0762569904327 seconds
cpu usage
0.070528781
max memory
1.0125312E7
stage attributes
key
value
output-size
9879
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_hrs /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: perfectp(0()) -> false() 2: perfectp(s(X)) -> f(X,s(0()),s(X),s(X)) 3: f(0(),U,0(),Y) -> true() 4: f(0(),W,s(P),V) -> false() 5: f(s(Y1),0(),U1,X1) -> f(Y1,X1,minus(U1,s(Y1)),X1) 6: f(s(W1),s(P1),X2,V1) -> if(le(W1,P1),f(s(W1),minus(P1,W1),X2,V1),f(W1,V1,X2,V1)) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 Number of strict rules: 8 Direct POLO(bPol) ... failed. Uncurrying f 1: perfectp(0()) -> false() 2: perfectp(s(X)) -> f(X,s(0()),s(X),s(X)) 3: f^1_0(U,0(),Y) -> true() 4: f^1_0(W,s(P),V) -> false() 5: f^1_s(Y1,0(),U1,X1) -> f(Y1,X1,minus(U1,s(Y1)),X1) 6: f^1_s(W1,s(P1),X2,V1) -> if(le(W1,P1),f^1_s(W1,minus(P1,W1),X2,V1),f(W1,V1,X2,V1)) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 9: f(0(),_3,_4,_5) ->= f^1_0(_3,_4,_5) 10: f(s(_1),_4,_5,_6) ->= f^1_s(_1,_4,_5,_6) Number of strict rules: 8 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #perfectp(s(X)) -> #f(X,s(0()),s(X),s(X)) #2: #f^1_s(W1,s(P1),X2,V1) -> #f^1_s(W1,minus(P1,W1),X2,V1) #3: #f^1_s(W1,s(P1),X2,V1) -> #f(W1,V1,X2,V1) #4: #f(0(),_3,_4,_5) ->? #f^1_0(_3,_4,_5) #5: #f(s(_1),_4,_5,_6) ->? #f^1_s(_1,_4,_5,_6) #6: #f^1_s(Y1,0(),U1,X1) -> #f(Y1,X1,minus(U1,s(Y1)),X1) Number of SCCs: 1, DPs: 3 SCC { #3 #5 #6 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 2 minus w: x2 #f^1_s w: x1 + 1 #perfectp w: 0 false w: 0 _ w: 0 true w: 0 f w: 0 0 w: 1 if w: 0 #f w: x1 #f^1_0 w: 0 #_ w: 0 perfectp w: 0 f^1_0 w: 0 f^1_s w: 0 USABLE RULES: { } Removed DPs: #3 #5 #6 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: perfectp(0()) -> false() 2: perfectp(s(X)) -> f(X,s(0()),s(X),s(X)) 3: f(0(),U,0(),Y) -> true() 4: f(0(),W,s(P),V) -> false() 5: f(s(Y1),0(),U1,X1) -> f(Y1,X1,minus(U1,s(Y1)),X1) 6: f(s(W1),s(P1),X2,V1) -> if(le(W1,P1),f(s(W1),minus(P1,W1),X2,V1),f(W1,V1,X2,V1)) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 Number of strict rules: 8 Direct POLO(bPol) ... failed. Uncurrying f 1: perfectp(0()) -> false() 2: perfectp(s(X)) -> f(X,s(0()),s(X),s(X)) 3: f^1_0(U,0(),Y) -> true() 4: f^1_0(W,s(P),V) -> false() 5: f^1_s(Y1,0(),U1,X1) -> f(Y1,X1,minus(U1,s(Y1)),X1) 6: f^1_s(W1,s(P1),X2,V1) -> if(le(W1,P1),f^1_s(W1,minus(P1,W1),X2,V1),f(W1,V1,X2,V1)) 7: _(X1,X2) -> X1 8: _(X1,X2) -> X2 9: f(0(),_3,_4,_5) ->= f^1_0(_3,_4,_5) 10: f(s(_1),_4,_5,_6) ->= f^1_s(_1,_4,_5,_6) Number of strict rules: 8 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #perfectp(s(X)) -> #f(X,s(0()),s(X),s(X)) #2: #f^1_s(W1,s(P1),X2,V1) -> #f^1_s(W1,minus(P1,W1),X2,V1) #3: #f^1_s(W1,s(P1),X2,V1) -> #f(W1,V1,X2,V1) #4: #f(0(),_3,_4,_5) ->? #f^1_0(_3,_4,_5) #5: #f(s(_1),_4,_5,_6) ->? #f^1_s(_1,_4,_5,_6) #6: #f^1_s(Y1,0(),U1,X1) -> #f(Y1,X1,minus(U1,s(Y1)),X1) Number of SCCs: 1, DPs: 3
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631