details

property	value
status	complete
benchmark	Applicative_first_order_05__#3.18.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	Uncurried_Applicative_11

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0665791034698 seconds
cpu usage	0.069072996
max memory	1.2406784E7

stage attributes

key	value
output-size	10448
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_hrs /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: double(0()) -> 0() 4: double(s(V)) -> s(s(double(V))) 5: plus(0(),W) -> W 6: plus(s(P),X1) -> s(plus(P,X1)) 7: plus(s(Y1),U1) -> plus(Y1,s(U1)) 8: plus(s(V1),W1) -> s(plus(minus(V1,W1),double(W1))) 9: _(X1,X2) -> X1 10: _(X1,X2) -> X2 Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(Y),s(U)) -> #minus(Y,U) #2: #plus(s(P),X1) -> #plus(P,X1) #3: #plus(s(Y1),U1) -> #plus(Y1,s(U1)) #4: #plus(s(V1),W1) -> #plus(minus(V1,W1),double(W1)) #5: #plus(s(V1),W1) -> #minus(V1,W1) #6: #plus(s(V1),W1) -> #double(W1) #7: #double(s(V)) -> #double(V) Number of SCCs: 3, DPs: 5 SCC { #7 } POLO(Sum)... succeeded. s w: x1 + 1 minus w: 0 #plus w: 0 _ w: 0 0 w: 0 #double w: x1 double w: 0 #minus w: 0 #_ w: 0 plus w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 2, DPs: 4 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 minus w: 0 #plus w: 0 _ w: 0 0 w: 0 #double w: 0 double w: 0 #minus w: x2 #_ w: 0 plus w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 3 SCC { #2..4 } POLO(Sum)... succeeded. s w: x1 + 2 minus w: x1 + 1 #plus w: x1 _ w: 0 0 w: 1238 #double w: 0 double w: 1237 #minus w: 0 #_ w: 0 plus w: 0 USABLE RULES: { 1 2 } Removed DPs: #2..4 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: minus(X,0()) -> X 2: minus(s(Y),s(U)) -> minus(Y,U) 3: double(0()) -> 0() 4: double(s(V)) -> s(s(double(V))) 5: plus(0(),W) -> W 6: plus(s(P),X1) -> s(plus(P,X1)) 7: plus(s(Y1),U1) -> plus(Y1,s(U1)) 8: plus(s(V1),W1) -> s(plus(minus(V1,W1),double(W1))) 9: _(X1,X2) -> X1 10: _(X1,X2) -> X2 Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(s(Y),s(U)) -> #minus(Y,U) #2: #plus(s(P),X1) -> #plus(P,X1) #3: #plus(s(Y1),U1) -> #plus(Y1,s(U1)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to HRS 58631