details

property	value
status	complete
benchmark	filter.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n058.star.cs.uiowa.edu
space	Mixed_HO_10

run statistics

property	value
solver	sol 37957
configuration	default
runtime (wallclock)	0.0215620994568 seconds
cpu usage	0.017449842
max memory	2195456.0

stage attributes

key	value
output-size	2179
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 ******** General Schema criterion ******** Found constructors: s, false, true, nil, 0, cons Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) rand(X) => X (meta X)[is acc in X] [is acc in X] >>True Checking (2) rand(s(X)) => rand(X) (fun rand=rand) subterm comparison of args w. LR LR (meta X)[is acc in s(X)] [is positive in s(X)] [is acc in X] >>True Checking (3) bool(0) => false (fun bool>false) >>True Checking (4) bool(s(0)) => true (fun bool>true) >>True Checking (5) filter(F,nil) => nil (fun filter>nil) >>True Checking (6) filter(F,cons(H,T)) => consif(F[H],H,filter(F,T)) (fun filter>consif) (meta F)[is acc in F,cons(H,T)] [is acc in F] (meta H)[is acc in F,cons(H,T)] [is positive in cons(H,T)] [is acc in H] (meta H)[is acc in F,cons(H,T)] [is positive in cons(H,T)] [is acc in H] (fun filter=filter) subterm comparison of args w. Arg [1,2] Arg [1,2] (meta F)[is acc in F,cons(H,T)] [is acc in F] (meta T)[is acc in F,cons(H,T)] [is positive in cons(H,T)] [is acc in T] >>True Checking (7) consif(true,H,T) => cons(H,T) (fun consif>cons) (meta H)[is acc in true,H,T] [is positive in true] [is acc in H] (meta T)[is acc in true,H,T] [is positive in true] [is acc in T] >>True Checking (8) consif(false,H,T) => T (meta T)[is acc in false,H,T] [is positive in false] [is acc in T] >>True #SN! ******** Signature ******** rand : nat -> nat s : nat -> nat bool : nat -> boolean false : boolean true : boolean filter : ((nat -> boolean),list) -> list nil : list 0 : nat cons : (nat,list) -> list consif : (boolean,nat,list) -> list ******** Computation Rules ******** (1) rand(X) => X (2) rand(s(X)) => rand(X) (3) bool(0) => false (4) bool(s(0)) => true (5) filter(F,nil) => nil (6) filter(F,cons(H,T)) => consif(F[H],H,filter(F,T)) (7) consif(true,H,T) => cons(H,T) (8) consif(false,H,T) => T YES popout

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

job log

popout

actions

all output return to HRS union beta 16688