details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	123.177 seconds
cpu usage	122.896
user time	117.468
system time	5.42792
max virtual memory	712100.0
max residence set size	9052.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S u:S x:S y:S z:S) (RULES a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> A(b) F(a(x:S),y:S,s(z:S),u:S) -> F(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) -> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) Problem 1: SCC Processor: -> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> A(b) F(a(x:S),y:S,s(z:S),u:S) -> F(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) -> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> F(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) ->->-> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) Problem 1: Subterm Processor: -> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> F(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) -> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) ->Projection: pi(F) = 3 pi(G) = 3 pi(H) = 3 Problem 1: SCC Processor: -> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) -> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(a(x:S),y:S,s(z:S),u:S) -> G(x:S,y:S,s(z:S),u:S) G(x:S,y:S,z:S,u:S) -> H(x:S,y:S,z:S,u:S) H(b,y:S,z:S,u:S) -> F(y:S,y:S,z:S,u:S) ->->-> Rules: a(b) -> c f(a(x:S),y:S,s(z:S),u:S) -> f(a(b),y:S,z:S,g(x:S,y:S,s(z:S),u:S)) g(x:S,y:S,z:S,u:S) -> h(x:S,y:S,z:S,u:S) h(b,y:S,z:S,u:S) -> f(y:S,y:S,z:S,u:S) Problem 1: Forward Instantiation Processor: popout

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

job log

popout

actions

all output return to TRS Innermost