Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919140
details
property
value
status
complete
benchmark
Applicative_first_order_05__#3.52.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0494430065155 seconds
cpu usage
0.04996492
max memory
8994816.0
stage attributes
key
value
output-size
4968
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(),1(),X) -> f(s(X),X,X) 2: f(Y,U,s(V)) -> s(f(0(),1(),V)) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(Y,U,s(V)) -> #f(0(),1(),V) #2: #f(0(),1(),X) -> #f(s(X),X,X) Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... succeeded. 1 w: 1 s w: x1 + 2 _ w: 0 f w: 0 0 w: 1 #f w: x3 #_ w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 0, DPs: 0 ... Input TRS: 1: f(0(),1(),X) -> f(s(X),X,X) 2: f(Y,U,s(V)) -> s(f(0(),1(),V)) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #f(Y,U,s(V)) -> #f(0(),1(),V) #2: #f(0(),1(),X) -> #f(s(X),X,X) Number of SCCs: 1, DPs: 2 SCC { #1 #2 } POLO(Sum)... succeeded. 1 w: 1 s w: x1 + 2 _ w: 0 f w: 0 0 w: 1 #f w: x3 #_ w: 0 USABLE RULES: { } Removed DPs: #1 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(I,nil) => nil (4) map(J,cons(X1,Y1)) => cons(J[X1],map(J,Y1)) (5) filter(G1,nil) => nil (6) filter(H1,cons(W1,P1)) => filter2(H1[W1],H1,W1,P1) (7) filter2(true,F2,Y2,U2) => cons(Y2,filter(F2,U2)) (8) filter2(false,H2,W2,P2) => filter(H2,P2) ******** General Schema criterion ******** Found constructors: 0, 1, cons, false, nil, s, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: filter2, filter Checking (1) f(0,1,X) => f(s(X),X,X) (fun f=f) subterm comparison of args w. LR LR >>False Try again using status RL Checking (1) f(0,1,X) => f(s(X),X,X) (fun f=f) subterm comparison of args w. RL RL >>False Try again using status Mul Checking (1) f(0,1,X) => f(s(X),X,X) (fun f=f) subterm comparison of args w. Mul Mul >>False Found constructors: nil, cons, true, false Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: filter2, filter
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631