details

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

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	0.0684859752655 seconds
cpu usage	0.069572343
max memory	9568256.0

stage attributes

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

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

job log

popout

actions

all output return to HRS union beta 16688