details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0422639846802 seconds
cpu usage	0.030500522
max memory	3579904.0

stage attributes

key	value
output-size	2454
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 x) (STRATEGY CONTEXTSENSITIVE (*top*_0 1) (f_0 1) (f_1) (g_1) (a_0) (b_0) ) (RULES *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) ) Problem 1: Dependency Pairs Processor: -> Pairs: *TOP*_0(g_1(x)) -> *TOP*_0(f_0(g_1(x))) *TOP*_0(g_1(x)) -> F_0(g_1(x)) F_0(g_1(x)) -> F_1(f_0(g_1(x))) G_1(x) -> F_1(g_1(x)) -> Rules: *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: *TOP*_0(g_1(x)) -> *TOP*_0(f_0(g_1(x))) *TOP*_0(g_1(x)) -> F_0(g_1(x)) F_0(g_1(x)) -> F_1(f_0(g_1(x))) G_1(x) -> F_1(g_1(x)) -> Rules: *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: *TOP*_0(g_1(x)) -> *TOP*_0(f_0(g_1(x))) ->->-> Rules: *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: *TOP*_0(g_1(x)) -> *TOP*_0(f_0(g_1(x))) -> Rules: *top*_0(g_1(x)) -> *top*_0(f_0(g_1(x))) f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) -> Unhiding rules: Empty -> Usable rules: f_0(g_1(x)) -> f_1(f_0(g_1(x))) f_1(f_0(x)) -> b_0 f_1(f_1(x)) -> b_0 f_1(g_1(a_0)) -> a_0 g_1(x) -> f_1(g_1(x)) ->Interpretation type: Linear ->Coefficients: popout

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

job log

popout

actions

all output return to TRS Conte Sensi 17651