details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.237459182739 seconds
cpu usage	0.128990339
max memory	3805184.0

stage attributes

key	value
output-size	5644
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) (a_1) (c_0) ) (RULES *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(a_1) -> *top*_0(f_0(a_1)) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 ) Problem 1: Dependency Pairs Processor: -> Pairs: *TOP*_0(f_0(f_0(a_1))) -> *TOP*_0(f_0(f_0(f_0(a_1)))) *TOP*_0(f_0(f_0(a_1))) -> F_0(f_0(f_0(a_1))) *TOP*_0(f_0(a_1)) -> *TOP*_0(f_0(f_0(a_1))) *TOP*_0(a_1) -> *TOP*_0(f_0(a_1)) F_0(f_0(f_0(a_1))) -> F_1(f_0(f_0(f_0(a_1)))) -> Rules: *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(a_1) -> *top*_0(f_0(a_1)) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 -> Unhiding Rules: Empty Problem 1: SCC Processor: -> Pairs: *TOP*_0(f_0(f_0(a_1))) -> *TOP*_0(f_0(f_0(f_0(a_1)))) *TOP*_0(f_0(f_0(a_1))) -> F_0(f_0(f_0(a_1))) *TOP*_0(f_0(a_1)) -> *TOP*_0(f_0(f_0(a_1))) *TOP*_0(a_1) -> *TOP*_0(f_0(a_1)) F_0(f_0(f_0(a_1))) -> F_1(f_0(f_0(f_0(a_1)))) -> Rules: *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(a_1) -> *top*_0(f_0(a_1)) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 -> Unhiding rules: Empty ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: *TOP*_0(f_0(f_0(a_1))) -> *TOP*_0(f_0(f_0(f_0(a_1)))) *TOP*_0(f_0(a_1)) -> *TOP*_0(f_0(f_0(a_1))) *TOP*_0(a_1) -> *TOP*_0(f_0(a_1)) ->->-> Rules: *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(a_1) -> *top*_0(f_0(a_1)) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) f_1(f_0(f_0(f_0(x)))) -> c_0 f_1(f_1(f_0(f_0(x)))) -> c_0 f_1(f_1(f_1(f_0(x)))) -> c_0 f_1(f_1(f_1(f_1(x)))) -> c_0 ->->-> Unhiding rules: Empty Problem 1: Reduction Pairs Processor: -> Pairs: *TOP*_0(f_0(f_0(a_1))) -> *TOP*_0(f_0(f_0(f_0(a_1)))) *TOP*_0(f_0(a_1)) -> *TOP*_0(f_0(f_0(a_1))) *TOP*_0(a_1) -> *TOP*_0(f_0(a_1)) -> Rules: *top*_0(f_0(f_0(a_1))) -> *top*_0(f_0(f_0(f_0(a_1)))) *top*_0(f_0(a_1)) -> *top*_0(f_0(f_0(a_1))) *top*_0(a_1) -> *top*_0(f_0(a_1)) f_0(f_0(f_0(a_1))) -> f_1(f_0(f_0(f_0(a_1)))) popout

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

job log

popout

actions

all output return to TRS Context Sensitive