Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734665
details
property
value
status
complete
benchmark
zipWith.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Mixed_HO_10
run statistics
property
value
solver
sol 37957
configuration
default
runtime (wallclock)
0.0730230808258 seconds
cpu usage
0.07432753
max memory
8974336.0
stage attributes
key
value
output-size
9758
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: le(0(),Y) -> true() 2: le(s(X),0()) -> false() 3: le(s(X),s(Y)) -> le(X,Y) 4: minus(X,0()) -> X 5: minus(s(X),s(Y)) -> minus(X,Y) 6: gcd(0(),Y) -> 0() 7: gcd(s(X),0()) -> 0() 8: gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y)) 9: if(true(),s(X),s(Y)) -> gcd(minus(X,Y),s(Y)) 10: if(false(),s(X),s(Y)) -> gcd(minus(Y,X),s(X)) 11: _(X1,X2) -> X1 12: _(X1,X2) -> X2 Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #if(true(),s(X),s(Y)) -> #gcd(minus(X,Y),s(Y)) #2: #if(true(),s(X),s(Y)) -> #minus(X,Y) #3: #if(false(),s(X),s(Y)) -> #gcd(minus(Y,X),s(X)) #4: #if(false(),s(X),s(Y)) -> #minus(Y,X) #5: #minus(s(X),s(Y)) -> #minus(X,Y) #6: #le(s(X),s(Y)) -> #le(X,Y) #7: #gcd(s(X),s(Y)) -> #if(le(Y,X),s(X),s(Y)) #8: #gcd(s(X),s(Y)) -> #le(Y,X) Number of SCCs: 3, DPs: 5 SCC { #6 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: x1 minus w: 0 gcd w: 0 false w: 0 _ w: 0 true w: 0 0 w: 0 if w: 0 #minus w: 0 #_ w: 0 #if w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #6 Number of SCCs: 2, DPs: 4 SCC { #5 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 minus w: 0 gcd w: 0 false w: 0 _ w: 0 true w: 0 0 w: 0 if w: 0 #minus w: x1 #_ w: 0 #if w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 1, DPs: 3 SCC { #1 #3 #7 } POLO(Sum)... succeeded. le w: x1 + x2 + 1 s w: x1 + 3 #le w: 0 minus w: x1 + 1 gcd w: 0 false w: 1148 _ w: 0 true w: 1145 0 w: 1143 if w: 0 #minus w: 0 #_ w: 0 #if w: x2 + x3 #gcd w: x1 + x2 + 1 USABLE RULES: { 4 5 } Removed DPs: #1 #3 #7 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: le(0(),Y) -> true() 2: le(s(X),0()) -> false()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688