details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.822914123535 seconds
cpu usage	0.714338996
max memory	2.2556672E7

stage attributes

key	value
output-size	17812
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 Problem 1: (VAR fun x xs y) (RULES app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(app(if,false),x),y) -> y app(app(app(if,true),x),y) -> x app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(g,app(s,x)),app(s,y)) -> app(app(app(if,app(f,x)),app(s,x)),app(s,y)) app(app(g,x),app(c,y)) -> app(app(g,x),app(app(g,app(s,app(c,y))),y)) app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil app(f,app(s,x)) -> app(f,x) app(f,0) -> true app(f,1) -> false ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: APP(app(app(app(filter2,false),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(cons,x),app(app(filter,fun),xs)) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(app(filter2,app(fun,x)),fun),x),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(filter2,app(fun,x)),fun),x) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(filter2,app(fun,x)),fun) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(filter2,app(fun,x)) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(app(g,app(s,x)),app(s,y)) -> APP(app(app(if,app(f,x)),app(s,x)),app(s,y)) APP(app(g,app(s,x)),app(s,y)) -> APP(app(if,app(f,x)),app(s,x)) APP(app(g,app(s,x)),app(s,y)) -> APP(f,x) APP(app(g,app(s,x)),app(s,y)) -> APP(if,app(f,x)) APP(app(g,x),app(c,y)) -> APP(app(g,app(s,app(c,y))),y) APP(app(g,x),app(c,y)) -> APP(app(g,x),app(app(g,app(s,app(c,y))),y)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(cons,app(fun,x)),app(app(map,fun),xs)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(map,fun),xs) APP(app(map,fun),app(app(cons,x),xs)) -> APP(cons,app(fun,x)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(f,app(s,x)) -> APP(f,x) -> Rules: app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(app(if,false),x),y) -> y app(app(app(if,true),x),y) -> x app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(g,app(s,x)),app(s,y)) -> app(app(app(if,app(f,x)),app(s,x)),app(s,y)) app(app(g,x),app(c,y)) -> app(app(g,x),app(app(g,app(s,app(c,y))),y)) app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil app(f,app(s,x)) -> app(f,x) app(f,0) -> true app(f,1) -> false Problem 1: SCC Processor: -> Pairs: APP(app(app(app(filter2,false),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(cons,x),app(app(filter,fun),xs)) APP(app(app(app(filter2,true),fun),x),xs) -> APP(app(filter,fun),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(app(filter2,app(fun,x)),fun),x),xs) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(app(filter2,app(fun,x)),fun),x) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(app(filter2,app(fun,x)),fun) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(filter2,app(fun,x)) APP(app(filter,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(app(g,app(s,x)),app(s,y)) -> APP(app(app(if,app(f,x)),app(s,x)),app(s,y)) APP(app(g,app(s,x)),app(s,y)) -> APP(app(if,app(f,x)),app(s,x)) APP(app(g,app(s,x)),app(s,y)) -> APP(f,x) APP(app(g,app(s,x)),app(s,y)) -> APP(if,app(f,x)) APP(app(g,x),app(c,y)) -> APP(app(g,app(s,app(c,y))),y) APP(app(g,x),app(c,y)) -> APP(app(g,x),app(app(g,app(s,app(c,y))),y)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(cons,app(fun,x)),app(app(map,fun),xs)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(app(map,fun),xs) APP(app(map,fun),app(app(cons,x),xs)) -> APP(cons,app(fun,x)) APP(app(map,fun),app(app(cons,x),xs)) -> APP(fun,x) APP(f,app(s,x)) -> APP(f,x) -> Rules: app(app(app(app(filter2,false),fun),x),xs) -> app(app(filter,fun),xs) app(app(app(app(filter2,true),fun),x),xs) -> app(app(cons,x),app(app(filter,fun),xs)) app(app(app(if,false),x),y) -> y app(app(app(if,true),x),y) -> x app(app(filter,fun),app(app(cons,x),xs)) -> app(app(app(app(filter2,app(fun,x)),fun),x),xs) app(app(filter,fun),nil) -> nil app(app(g,app(s,x)),app(s,y)) -> app(app(app(if,app(f,x)),app(s,x)),app(s,y)) app(app(g,x),app(c,y)) -> app(app(g,x),app(app(g,app(s,app(c,y))),y)) app(app(map,fun),app(app(cons,x),xs)) -> app(app(cons,app(fun,x)),app(app(map,fun),xs)) app(app(map,fun),nil) -> nil popout

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

job log

popout

actions

all output return to TRS Inner 89993