details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0788509 seconds
cpu usage	0.071982
user time	0.030108
system time	0.041874
max virtual memory	113188.0
max residence set size	5308.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR x) (STRATEGY CONTEXTSENSITIVE (*top*_0 1) (f_0 1) (f_1) (h_1) (i_1) ) (RULES *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(h_1(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> x h_1(x) -> f_1(h_1(x)) i_1(x) -> h_1(x) ) Problem 1: Dependency Pairs Processor: -> Pairs: *TOP*_0(f_1(i_1(x))) -> *TOP*_0(x) *TOP*_0(f_1(i_1(x))) -> x F_0(f_1(i_1(x))) -> F_1(x) F_1(h_1(x)) -> F_1(i_1(x)) F_1(i_1(x)) -> x H_1(x) -> F_1(h_1(x)) I_1(x) -> H_1(x) -> Rules: *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(h_1(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> x h_1(x) -> f_1(h_1(x)) i_1(x) -> h_1(x) -> Unhiding Rules: h_1(x) -> H_1(x) i_1(x) -> I_1(x) Problem 1: SCC Processor: -> Pairs: *TOP*_0(f_1(i_1(x))) -> *TOP*_0(x) *TOP*_0(f_1(i_1(x))) -> x F_0(f_1(i_1(x))) -> F_1(x) F_1(h_1(x)) -> F_1(i_1(x)) F_1(i_1(x)) -> x H_1(x) -> F_1(h_1(x)) I_1(x) -> H_1(x) -> Rules: *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(h_1(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> x h_1(x) -> f_1(h_1(x)) i_1(x) -> h_1(x) -> Unhiding rules: h_1(x) -> H_1(x) i_1(x) -> I_1(x) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F_1(h_1(x)) -> F_1(i_1(x)) F_1(i_1(x)) -> x H_1(x) -> F_1(h_1(x)) I_1(x) -> H_1(x) ->->-> Rules: *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(h_1(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> x h_1(x) -> f_1(h_1(x)) i_1(x) -> h_1(x) ->->-> Unhiding rules: h_1(x) -> H_1(x) i_1(x) -> I_1(x) ->->Cycle: ->->-> Pairs: *TOP*_0(f_1(i_1(x))) -> *TOP*_0(x) ->->-> Rules: *top*_0(f_1(i_1(x))) -> *top*_0(x) f_0(f_1(i_1(x))) -> f_1(x) f_1(h_1(x)) -> f_1(i_1(x)) f_1(i_1(x)) -> x h_1(x) -> f_1(h_1(x)) i_1(x) -> h_1(x) ->->-> Unhiding rules: Empty The problem is decomposed in 2 subproblems. Problem 1.1: Reduction Pairs Processor: popout

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

job log

popout

actions

all output return to TRS Contextsensitive