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