details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.649623155594 seconds
cpu usage	0.61039813
max memory	7983104.0

stage attributes

key	value
output-size	31878
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 x) (STRATEGY CONTEXTSENSITIVE (*top*_0 1) (f_0 1) (f_1) (g_0 1) (b_0) (g_1) ) (RULES *top*_0(f_0(f_1(f_0(g_0(x))))) -> *top*_0(f_0(x)) *top*_0(f_1(f_0(g_0(x)))) -> *top*_0(x) *top*_0(f_1(f_0(g_1(x)))) -> *top*_0(x) *top*_0(g_1(b_0)) -> *top*_0(f_0(g_1(b_0))) f_0(f_0(f_1(f_0(g_0(x))))) -> f_1(f_0(x)) f_0(f_1(f_0(g_0(x)))) -> f_1(x) f_0(f_1(f_0(g_1(x)))) -> f_0(x) f_0(g_1(b_0)) -> f_1(f_0(g_1(b_0))) f_1(f_0(g_0(x))) -> x g_0(f_0(f_1(f_0(g_0(x))))) -> g_0(f_0(x)) g_0(f_1(f_0(g_0(x)))) -> g_0(x) g_0(f_1(f_0(g_1(x)))) -> g_1(x) g_0(g_1(b_0)) -> g_0(f_0(g_1(b_0))) ) Problem 1: Dependency Pairs Processor: -> Pairs: *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> *TOP*_0(f_0(x)) *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> F_0(x) *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> x *TOP*_0(f_1(f_0(g_0(x)))) -> *TOP*_0(x) *TOP*_0(f_1(f_0(g_0(x)))) -> x *TOP*_0(f_1(f_0(g_1(x)))) -> *TOP*_0(x) *TOP*_0(f_1(f_0(g_1(x)))) -> x *TOP*_0(g_1(b_0)) -> *TOP*_0(f_0(g_1(b_0))) *TOP*_0(g_1(b_0)) -> F_0(g_1(b_0)) F_0(f_0(f_1(f_0(g_0(x))))) -> F_1(f_0(x)) F_0(f_1(f_0(g_0(x)))) -> F_1(x) F_0(f_1(f_0(g_1(x)))) -> F_0(x) F_0(f_1(f_0(g_1(x)))) -> x F_1(f_0(g_0(x))) -> x G_0(f_0(f_1(f_0(g_0(x))))) -> F_0(x) G_0(f_0(f_1(f_0(g_0(x))))) -> G_0(f_0(x)) G_0(f_0(f_1(f_0(g_0(x))))) -> x G_0(f_1(f_0(g_0(x)))) -> G_0(x) G_0(f_1(f_0(g_0(x)))) -> x G_0(g_1(b_0)) -> F_0(g_1(b_0)) G_0(g_1(b_0)) -> G_0(f_0(g_1(b_0))) -> Rules: *top*_0(f_0(f_1(f_0(g_0(x))))) -> *top*_0(f_0(x)) *top*_0(f_1(f_0(g_0(x)))) -> *top*_0(x) *top*_0(f_1(f_0(g_1(x)))) -> *top*_0(x) *top*_0(g_1(b_0)) -> *top*_0(f_0(g_1(b_0))) f_0(f_0(f_1(f_0(g_0(x))))) -> f_1(f_0(x)) f_0(f_1(f_0(g_0(x)))) -> f_1(x) f_0(f_1(f_0(g_1(x)))) -> f_0(x) f_0(g_1(b_0)) -> f_1(f_0(g_1(b_0))) f_1(f_0(g_0(x))) -> x g_0(f_0(f_1(f_0(g_0(x))))) -> g_0(f_0(x)) g_0(f_1(f_0(g_0(x)))) -> g_0(x) g_0(f_1(f_0(g_1(x)))) -> g_1(x) g_0(g_1(b_0)) -> g_0(f_0(g_1(b_0))) -> Unhiding Rules: f_0(g_1(b_0)) -> F_0(g_1(b_0)) f_0(x) -> F_0(x) f_0(x1) -> x1 Problem 1: SCC Processor: -> Pairs: *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> *TOP*_0(f_0(x)) *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> F_0(x) *TOP*_0(f_0(f_1(f_0(g_0(x))))) -> x *TOP*_0(f_1(f_0(g_0(x)))) -> *TOP*_0(x) *TOP*_0(f_1(f_0(g_0(x)))) -> x *TOP*_0(f_1(f_0(g_1(x)))) -> *TOP*_0(x) *TOP*_0(f_1(f_0(g_1(x)))) -> x *TOP*_0(g_1(b_0)) -> *TOP*_0(f_0(g_1(b_0))) *TOP*_0(g_1(b_0)) -> F_0(g_1(b_0)) F_0(f_0(f_1(f_0(g_0(x))))) -> F_1(f_0(x)) F_0(f_1(f_0(g_0(x)))) -> F_1(x) F_0(f_1(f_0(g_1(x)))) -> F_0(x) F_0(f_1(f_0(g_1(x)))) -> x F_1(f_0(g_0(x))) -> x G_0(f_0(f_1(f_0(g_0(x))))) -> F_0(x) G_0(f_0(f_1(f_0(g_0(x))))) -> G_0(f_0(x)) G_0(f_0(f_1(f_0(g_0(x))))) -> x popout

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

job log

popout

actions

all output return to TRS Context Sensitive