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