Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734698
details
property
value
status
complete
benchmark
Applicative_05__mapDivMinus.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n097.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
default
runtime (wallclock)
0.0574510097504 seconds
cpu usage
0.056899623
max memory
8368128.0
stage attributes
key
value
output-size
6587
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /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: minus(W,0()) -> W 2: minus(s(P),s(X1)) -> minus(P,X1) 3: div(0(),s(Y1)) -> 0() 4: div(s(U1),s(V1)) -> s(div(minus(U1,V1),s(V1))) 5: _(X1,X2) -> X1 6: _(X1,X2) -> X2 Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(P),s(X1)) -> #minus(P,X1) #2: #div(s(U1),s(V1)) -> #div(minus(U1,V1),s(V1)) #3: #div(s(U1),s(V1)) -> #minus(U1,V1) Number of SCCs: 2, DPs: 2 SCC { #1 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 minus w: 0 div w: 0 _ w: 0 0 w: 0 #minus w: x1 + x2 #_ w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... succeeded. #div w: x1 s w: x1 + 2 minus w: x1 + 1 div w: 0 _ w: 0 0 w: 1 #minus w: 0 #_ w: 0 USABLE RULES: { 1 2 } Removed DPs: #2 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: minus(W,0()) -> W 2: minus(s(P),s(X1)) -> minus(P,X1) 3: div(0(),s(Y1)) -> 0() 4: div(s(U1),s(V1)) -> s(div(minus(U1,V1),s(V1))) 5: _(X1,X2) -> X1 6: _(X1,X2) -> X2 Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(P),s(X1)) -> #minus(P,X1) #2: #div(s(U1),s(V1)) -> #div(minus(U1,V1),s(V1)) #3: #div(s(U1),s(V1)) -> #minus(U1,V1) Number of SCCs: 2, DPs: 2 SCC { #1 } POLO(Sum)... succeeded. #div w: 0 s w: x1 + 1 minus w: 0 div w: 0 _ w: 0 0 w: 0 #minus w: x1 + x2 #_ w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... succeeded. #div w: x1 s w: x1 + 2 minus w: x1 + 1 div w: 0 _ w: 0 0 w: 1 #minus w: 0 #_ w: 0 USABLE RULES: { 1 2 } Removed DPs: #2 Number of SCCs: 0, DPs: 0 >>YES ******** Signature ******** map : ((a -> a),b) -> b
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688