Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919150
details
property
value
status
complete
benchmark
Applicative_first_order_05__12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0256290435791 seconds
cpu usage
0.022266508
max memory
2916352.0
stage attributes
key
value
output-size
7215
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 ******** General Schema criterion ******** Found constructors: cons, false, nil, or, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: filter2, filter Checking (1) not(not(X)) => X (meta X)[is acc in not(X)] [is positive in not(X)] [is acc in X] >>True Checking (2) not(or(Y,U)) => and(not(Y),not(U)) (fun not>and) (fun not=not) subterm comparison of args w. LR LR (meta Y)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in Y] (fun not=not) subterm comparison of args w. LR LR (meta U)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in U] >>True Checking (3) not(and(V,W)) => or(not(V),not(W)) (fun not>or) (fun not=not) subterm comparison of args w. LR LR (meta V)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in V] (fun not=not) subterm comparison of args w. LR LR (meta W)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in W] >>True Checking (4) and(P,or(X1,Y1)) => or(and(P,X1),and(P,Y1)) (fun and>or) (fun and=and) subterm comparison of args w. LR LR (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta X1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in X1] (fun and=and) subterm comparison of args w. LR LR (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta Y1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in Y1] >>True Checking (5) and(or(V1,W1),U1) => or(and(U1,V1),and(U1,W1)) (fun and>or) (fun and=and) subterm comparison of args w. LR LR >>False Try again using status RL Checking (1) not(not(X)) => X (meta X)[is acc in not(X)] [is positive in not(X)] [is acc in X] >>True Checking (2) not(or(Y,U)) => and(not(Y),not(U)) (fun not>and) (fun not=not) subterm comparison of args w. RL RL (meta Y)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in Y] (fun not=not) subterm comparison of args w. RL RL (meta U)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in U] >>True Checking (3) not(and(V,W)) => or(not(V),not(W)) (fun not>or) (fun not=not) subterm comparison of args w. RL RL (meta V)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in V] (fun not=not) subterm comparison of args w. RL RL (meta W)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in W] >>True Checking (4) and(P,or(X1,Y1)) => or(and(P,X1),and(P,Y1)) (fun and>or) (fun and=and) subterm comparison of args w. RL RL (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta X1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in X1] (fun and=and) subterm comparison of args w. RL RL (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta Y1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in Y1] >>True Checking (5) and(or(V1,W1),U1) => or(and(U1,V1),and(U1,W1)) (fun and>or) (fun and=and) subterm comparison of args w. RL RL >>False Try again using status Mul Checking (1) not(not(X)) => X (meta X)[is acc in not(X)] [is positive in not(X)] [is acc in X] >>True Checking (2) not(or(Y,U)) => and(not(Y),not(U)) (fun not>and) (fun not=not) subterm comparison of args w. Mul Mul (meta Y)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in Y] (fun not=not) subterm comparison of args w. Mul Mul (meta U)[is acc in or(Y,U)] [is positive in or(Y,U)] [is acc in U] >>True Checking (3) not(and(V,W)) => or(not(V),not(W)) (fun not>or) (fun not=not) subterm comparison of args w. Mul Mul (meta V)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in V] (fun not=not) subterm comparison of args w. Mul Mul (meta W)[is acc in and(V,W)] [is positive in and(V,W)] [is acc in W] >>True Checking (4) and(P,or(X1,Y1)) => or(and(P,X1),and(P,Y1)) (fun and>or) (fun and=and) subterm comparison of args w. Mul Mul (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta X1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in X1] (fun and=and) subterm comparison of args w. Mul Mul (meta P)[is acc in P,or(X1,Y1)] [is acc in P] (meta Y1)[is acc in P,or(X1,Y1)] [is positive in or(X1,Y1)] [is acc in Y1] >>True Checking (5) and(or(V1,W1),U1) => or(and(U1,V1),and(U1,W1)) (fun and>or) (fun and=and) subterm comparison of args w. Mul Mul (meta U1)[is acc in or(V1,W1),U1] [is positive in or(V1,W1)] [is acc in U1] (meta V1)[is acc in or(V1,W1),U1] [is positive in or(V1,W1)] [is acc in V1] (fun and=and) subterm comparison of args w. Mul Mul (meta U1)[is acc in or(V1,W1),U1] [is positive in or(V1,W1)] [is acc in U1] (meta W1)[is acc in or(V1,W1),U1] [is positive in or(V1,W1)] [is acc in W1] >>True Checking (6) map(J1,nil) => nil (fun map>nil) >>True Checking (7) map(F2,cons(Y2,U2)) => cons(F2[Y2],map(F2,U2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631