details

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

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	0.0567989349365 seconds
cpu usage	0.053039966
max memory	7409664.0

stage attributes

key	value
output-size	5118
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /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(g(X)) -> g(f(f(X))) 2: f(h(Y)) -> h(g(Y)) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 4 3 h w: x1 + 8856 _ w: 2 * x1 + x2 + 1 f w: x1 g w: x1 Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(g(X)) -> #f(f(X)) #2: #f(g(X)) -> #f(X) Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... succeeded. h w: 1 _ w: 0 f w: x1 #f w: x1 g w: x1 + 1237 USABLE RULES: { 1 2 } Removed DPs: #1 #2 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: f(g(X)) -> g(f(f(X))) 2: f(h(Y)) -> h(g(Y)) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 4 3 h w: x1 + 8856 _ w: 2 * x1 + x2 + 1 f w: x1 g w: x1 Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(g(X)) -> #f(f(X)) #2: #f(g(X)) -> #f(X) Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... succeeded. h w: 1 _ w: 0 f w: x1 #f w: x1 g w: x1 + 1237 USABLE RULES: { 1 2 } Removed DPs: #1 #2 Number of SCCs: 0, DPs: 0 >>YES ******** Signature ******** map : ((c -> c),d) -> d nil : d cons : (c,d) -> d filter : ((c -> b),d) -> d filter2 : (b,(c -> b),c,d) -> d true : b false : b ******** Computation rules ******** (3) map(G,nil) => nil (4) map(H,cons(W,P)) => cons(H[W],map(H,P)) (5) filter(F1,nil) => nil (6) filter(Z1,cons(U1,V1)) => filter2(Z1[U1],Z1,U1,V1) (7) filter2(true,I1,P1,X2) => cons(P1,filter(I1,X2)) (8) filter2(false,Z2,U2,V2) => filter(Z2,V2) ******** General Schema criterion ******** Found constructors: cons, false, g, h, nil, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: filter2, filter Checking (1) f(g(X)) => g(f(f(X))) (fun f>g) (fun f=f) subterm comparison of args w. LR LR >>False Try again using status RL Checking (1) f(g(X)) => g(f(f(X))) popout

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

job log

popout

actions

all output return to HRS union beta 16688