details

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

run statistics

property	value
solver	sol 37957
configuration	hrs
runtime (wallclock)	0.0686750411987 seconds
cpu usage	0.069965749
max memory	8777728.0

stage attributes

key	value
output-size	9033
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: f(0()) -> true() 2: f(1()) -> false() 3: f(s(X)) -> f(X) 4: if(true(),Y,U) -> Y 5: if(false(),V,W) -> W 6: g(s(P),s(X1)) -> if(f(P),s(P),s(X1)) 7: g(Y1,c(U1)) -> g(Y1,g(s(c(U1)),U1)) 8: _(X1,X2) -> X1 9: _(X1,X2) -> X2 Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #g(s(P),s(X1)) -> #if(f(P),s(P),s(X1)) #2: #g(s(P),s(X1)) -> #f(P) #3: #g(Y1,c(U1)) -> #g(Y1,g(s(c(U1)),U1)) #4: #g(Y1,c(U1)) -> #g(s(c(U1)),U1) #5: #f(s(X)) -> #f(X) Number of SCCs: 2, DPs: 3 SCC { #5 } POLO(Sum)... succeeded. 1 w: 0 s w: x1 + 1 false w: 0 c w: 0 _ w: 0 true w: 0 f w: 0 0 w: 0 if w: 0 #f w: x1 #g w: 0 #_ w: 0 #if w: 0 g w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 1, DPs: 2 SCC { #3 #4 } POLO(Sum)... succeeded. 1 w: 1 s w: 5921 false w: 3 c w: x1 + 11843 _ w: 0 true w: 452 f w: x1 + 1 0 w: 450 if w: x2 + x3 #f w: 0 #g w: x1 + x2 #_ w: 0 #if w: 0 g w: x1 + 5921 USABLE RULES: { 4..7 } Removed DPs: #3 #4 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: f(0()) -> true() 2: f(1()) -> false() 3: f(s(X)) -> f(X) 4: if(true(),Y,U) -> Y 5: if(false(),V,W) -> W 6: g(s(P),s(X1)) -> if(f(P),s(P),s(X1)) 7: g(Y1,c(U1)) -> g(Y1,g(s(c(U1)),U1)) 8: _(X1,X2) -> X1 9: _(X1,X2) -> X2 Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #g(s(P),s(X1)) -> #if(f(P),s(P),s(X1)) #2: #g(s(P),s(X1)) -> #f(P) #3: #g(Y1,c(U1)) -> #g(Y1,g(s(c(U1)),U1)) #4: #g(Y1,c(U1)) -> #g(s(c(U1)),U1) #5: #f(s(X)) -> #f(X) Number of SCCs: 2, DPs: 3 SCC { #5 } POLO(Sum)... succeeded. 1 w: 0 s w: x1 + 1 false w: 0 c w: 0 _ w: 0 true w: 0 popout

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

job log

popout

actions

all output return to HRS 58631