Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734441
details
property
value
status
complete
benchmark
AotoYamada_05__016.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n021.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
default
runtime (wallclock)
0.0463099479675 seconds
cpu usage
0.041316945
max memory
7507968.0
stage attributes
key
value
output-size
6128
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 Using the interpretation [[filtersub]](B,J,cons(X1,Y1)) = ifo(B,cons(X1,filter(J,Y1)),filter(J,Y1)) given system is strictly simulated by (1) neq(0,0) => false (2) neq(0,s(X)) => true (3) neq(s(Y),0) => true (4) neq(s(U),s(V)) => neq(U,V) (5) filter(I,nil) => nil (6if) filter(J,cons(X1,Y1)) => ifo(J[X1],cons(X1,filter(J,Y1)),filter(J,Y1)) (9) nonzero => filter(neq(0)) (ift) ifo(true,T,E) => T (iff) ifo(false,T,E) => E Hene we try to show SN of this. ******** General Schema criterion ******** Found constructors: 0, cons, false, nil, s, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: nonzero, filter, filtersub Checking (1) neq(0,0) => false (fun neq>false) >>True Checking (2) neq(0,s(X)) => true (fun neq>true) >>True Checking (3) neq(s(Y),0) => true (fun neq>true) >>True Checking (4) neq(s(U),s(V)) => neq(U,V) (fun neq=neq) subterm comparison of args w. LR LR (meta U)[is acc in s(U),s(V)] [is positive in s(U)] [is acc in U] (meta V)[is acc in s(U),s(V)] [is positive in s(U)] [is positive in s(V)] [is acc in V] >>True Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Try again using status RL Checking (1) neq(0,0) => false (fun neq>false) >>True Checking (2) neq(0,s(X)) => true (fun neq>true) >>True Checking (3) neq(s(Y),0) => true (fun neq>true) >>True Checking (4) neq(s(U),s(V)) => neq(U,V) (fun neq=neq) subterm comparison of args w. RL RL (meta U)[is acc in s(U),s(V)] [is positive in s(U)] [is acc in U] (meta V)[is acc in s(U),s(V)] [is positive in s(U)] [is positive in s(V)] [is acc in V] >>True Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Try again using status Mul Checking (1) neq(0,0) => false (fun neq>false) >>True Checking (2) neq(0,s(X)) => true (fun neq>true) >>True Checking (3) neq(s(Y),0) => true (fun neq>true) >>True Checking (4) neq(s(U),s(V)) => neq(U,V) (fun neq=neq) subterm comparison of args w. Mul Mul (meta U)[is acc in s(U),s(V)] [is positive in s(U)] [is acc in U] (meta V)[is acc in s(U),s(V)] [is positive in s(U)] [is positive in s(V)] [is acc in V] >>True Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Found constructors: nil, cons, true, false, neq, 0 Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>Regared as equal: nonzero, filter, filtersub Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Try again using status RL Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Try again using status Mul Checking (5) filter(I,nil) => nil (fun filter>nil) >>True Checking (6) filter(J,cons(X1,Y1)) => filtersub(J[X1],J,cons(X1,Y1)) (fun filter=filtersub) subterm comparison of args w. Arg [1,2] Arg [2,3,1] >>False Found constructors: 0, cons, false, filtersub, nil, s, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) neq(0,0) => false (fun neq>false) >>True Checking (2) neq(0,s(X)) => true (fun neq>true) >>True
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688