TRS Inner 89993 pair #381733561

details

property	value
status	complete
benchmark	#4.2.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	Applicative_AG01_innermost

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0289578437805 seconds
cpu usage	0.026579521
max memory	2342912.0

stage attributes

key	value
output-size	8800
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

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(f,app(g,x)),app(s,0)),y) -> app(app(app(f,y),y),app(g,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(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(g,app(s,x)) -> app(s,app(g,x))
app(g,0) -> 0
) 
(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(app(f,app(g,x)),app(s,0)),y) -> APP(app(app(f,y),y),app(g,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),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(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(g,app(s,x)) -> APP(g,x)
 APP(g,app(s,x)) -> APP(s,app(g,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(f,app(g,x)),app(s,0)),y) -> app(app(app(f,y),y),app(g,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(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(g,app(s,x)) -> app(s,app(g,x))
 app(g,0) -> 0

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(app(f,app(g,x)),app(s,0)),y) -> APP(app(app(f,y),y),app(g,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),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(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(g,app(s,x)) -> APP(g,x)
 APP(g,app(s,x)) -> APP(s,app(g,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(f,app(g,x)),app(s,0)),y) -> app(app(app(f,y),y),app(g,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(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(g,app(s,x)) -> app(s,app(g,x))
 app(g,0) -> 0
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 APP(g,app(s,x)) -> APP(g,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(f,app(g,x)),app(s,0)),y) -> app(app(app(f,y),y),app(g,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(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(g,app(s,x)) -> app(s,app(g,x))
 app(g,0) -> 0
->->Cycle:
->->-> Pairs:
 APP(app(app(app(filter2,false),fun),x),xs) -> APP(app(filter,fun),xs)

popout

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

job log

popout

actions all output return to TRS Inner 89993