Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919131
details
property
value
status
complete
benchmark
Applicative_first_order_05__#3.22.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0560410022736 seconds
cpu usage
0.056440696
max memory
9818112.0
stage attributes
key
value
output-size
6867
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: times(X,plus(Y,s(U))) -> plus(times(X,plus(Y,times(s(U),0()))),times(X,s(U))) 2: times(V,0()) -> 0() 3: times(W,s(P)) -> plus(times(W,P),W) 4: plus(X1,0()) -> X1 5: plus(Y1,s(U1)) -> s(plus(Y1,U1)) 6: _(X1,X2) -> X1 7: _(X1,X2) -> X2 Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #plus(Y1,s(U1)) -> #plus(Y1,U1) #2: #times(W,s(P)) -> #plus(times(W,P),W) #3: #times(W,s(P)) -> #times(W,P) #4: #times(X,plus(Y,s(U))) -> #plus(times(X,plus(Y,times(s(U),0()))),times(X,s(U))) #5: #times(X,plus(Y,s(U))) -> #times(X,plus(Y,times(s(U),0()))) #6: #times(X,plus(Y,s(U))) -> #plus(Y,times(s(U),0())) #7: #times(X,plus(Y,s(U))) -> #times(s(U),0()) #8: #times(X,plus(Y,s(U))) -> #times(X,s(U)) Number of SCCs: 2, DPs: 4 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 #plus w: x2 _ w: 0 #times w: 0 0 w: 0 times w: 0 #_ w: 0 plus w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 3 SCC { #3 #5 #8 } POLO(Sum)... succeeded. s w: x1 + 2439 #plus w: 0 _ w: 0 #times w: x2 0 w: 1 times w: 2438 #_ w: 0 plus w: x1 + x2 + 1797 USABLE RULES: { 2 4 5 } Removed DPs: #3 #5 #8 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: times(X,plus(Y,s(U))) -> plus(times(X,plus(Y,times(s(U),0()))),times(X,s(U))) 2: times(V,0()) -> 0() 3: times(W,s(P)) -> plus(times(W,P),W) 4: plus(X1,0()) -> X1 5: plus(Y1,s(U1)) -> s(plus(Y1,U1)) 6: _(X1,X2) -> X1 7: _(X1,X2) -> X2 Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #plus(Y1,s(U1)) -> #plus(Y1,U1) #2: #times(W,s(P)) -> #plus(times(W,P),W) #3: #times(W,s(P)) -> #times(W,P) #4: #times(X,plus(Y,s(U))) -> #plus(times(X,plus(Y,times(s(U),0()))),times(X,s(U))) #5: #times(X,plus(Y,s(U))) -> #times(X,plus(Y,times(s(U),0()))) #6: #times(X,plus(Y,s(U))) -> #plus(Y,times(s(U),0())) #7: #times(X,plus(Y,s(U))) -> #times(s(U),0()) #8: #times(X,plus(Y,s(U))) -> #times(X,s(U)) Number of SCCs: 2, DPs: 4 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 #plus w: x2 _ w: 0 #times w: 0 0 w: 0 times w: 0 #_ w: 0 plus w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 3 SCC { #3 #5 #8 } POLO(Sum)... succeeded. s w: x1 + 2439 #plus w: 0 _ w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631