details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	1.14942884445 seconds
cpu usage	1.022014396
max memory	5005312.0

stage attributes

key	value
output-size	15728
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 x0 y z) (STRATEGY CONTEXTSENSITIVE (*top*_0 1) (cons_0 1 2) (cons_1) (s_0 1) (big_0) (inf_1) ) (RULES *top*_0(inf_1(x)) -> *top*_0(cons_0(x,inf_1(s_0(x)))) cons_0(inf_1(x),x0) -> cons_0(cons_0(x,inf_1(s_0(x))),x0) cons_0(x0,inf_1(x)) -> cons_1(x0,cons_0(x,inf_1(s_0(x)))) cons_1(x,cons_0(y,z)) -> big_0 cons_1(x,cons_1(y,z)) -> big_0 s_0(inf_1(x)) -> s_0(cons_0(x,inf_1(s_0(x)))) ) Problem 1: Dependency Pairs Processor: -> Pairs: *TOP*_0(inf_1(x)) -> *TOP*_0(cons_0(x,inf_1(s_0(x)))) *TOP*_0(inf_1(x)) -> CONS_0(x,inf_1(s_0(x))) *TOP*_0(inf_1(x)) -> x CONS_0(inf_1(x),x0) -> CONS_0(cons_0(x,inf_1(s_0(x))),x0) CONS_0(inf_1(x),x0) -> CONS_0(x,inf_1(s_0(x))) CONS_0(inf_1(x),x0) -> x CONS_0(x0,inf_1(x)) -> CONS_1(x0,cons_0(x,inf_1(s_0(x)))) S_0(inf_1(x)) -> CONS_0(x,inf_1(s_0(x))) S_0(inf_1(x)) -> S_0(cons_0(x,inf_1(s_0(x)))) S_0(inf_1(x)) -> x -> Rules: *top*_0(inf_1(x)) -> *top*_0(cons_0(x,inf_1(s_0(x)))) cons_0(inf_1(x),x0) -> cons_0(cons_0(x,inf_1(s_0(x))),x0) cons_0(x0,inf_1(x)) -> cons_1(x0,cons_0(x,inf_1(s_0(x)))) cons_1(x,cons_0(y,z)) -> big_0 cons_1(x,cons_1(y,z)) -> big_0 s_0(inf_1(x)) -> s_0(cons_0(x,inf_1(s_0(x)))) -> Unhiding Rules: cons_0(x,inf_1(s_0(x))) -> CONS_0(x,inf_1(s_0(x))) cons_0(x,inf_1(s_0(x4))) -> x4 cons_0(x4,inf_1(s_0(x))) -> x4 s_0(x) -> S_0(x) Problem 1: SCC Processor: -> Pairs: *TOP*_0(inf_1(x)) -> *TOP*_0(cons_0(x,inf_1(s_0(x)))) *TOP*_0(inf_1(x)) -> CONS_0(x,inf_1(s_0(x))) *TOP*_0(inf_1(x)) -> x CONS_0(inf_1(x),x0) -> CONS_0(cons_0(x,inf_1(s_0(x))),x0) CONS_0(inf_1(x),x0) -> CONS_0(x,inf_1(s_0(x))) CONS_0(inf_1(x),x0) -> x CONS_0(x0,inf_1(x)) -> CONS_1(x0,cons_0(x,inf_1(s_0(x)))) S_0(inf_1(x)) -> CONS_0(x,inf_1(s_0(x))) S_0(inf_1(x)) -> S_0(cons_0(x,inf_1(s_0(x)))) S_0(inf_1(x)) -> x -> Rules: *top*_0(inf_1(x)) -> *top*_0(cons_0(x,inf_1(s_0(x)))) cons_0(inf_1(x),x0) -> cons_0(cons_0(x,inf_1(s_0(x))),x0) cons_0(x0,inf_1(x)) -> cons_1(x0,cons_0(x,inf_1(s_0(x)))) cons_1(x,cons_0(y,z)) -> big_0 cons_1(x,cons_1(y,z)) -> big_0 s_0(inf_1(x)) -> s_0(cons_0(x,inf_1(s_0(x)))) -> Unhiding rules: cons_0(x,inf_1(s_0(x))) -> CONS_0(x,inf_1(s_0(x))) cons_0(x,inf_1(s_0(x4))) -> x4 cons_0(x4,inf_1(s_0(x))) -> x4 s_0(x) -> S_0(x) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: CONS_0(inf_1(x),x0) -> CONS_0(cons_0(x,inf_1(s_0(x))),x0) CONS_0(inf_1(x),x0) -> CONS_0(x,inf_1(s_0(x))) CONS_0(inf_1(x),x0) -> x S_0(inf_1(x)) -> CONS_0(x,inf_1(s_0(x))) S_0(inf_1(x)) -> S_0(cons_0(x,inf_1(s_0(x)))) S_0(inf_1(x)) -> x ->->-> Rules: *top*_0(inf_1(x)) -> *top*_0(cons_0(x,inf_1(s_0(x)))) cons_0(inf_1(x),x0) -> cons_0(cons_0(x,inf_1(s_0(x))),x0) cons_0(x0,inf_1(x)) -> cons_1(x0,cons_0(x,inf_1(s_0(x)))) cons_1(x,cons_0(y,z)) -> big_0 cons_1(x,cons_1(y,z)) -> big_0 s_0(inf_1(x)) -> s_0(cons_0(x,inf_1(s_0(x)))) ->->-> Unhiding rules: cons_0(x,inf_1(s_0(x))) -> CONS_0(x,inf_1(s_0(x))) cons_0(x,inf_1(s_0(x4))) -> x4 popout

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

job log

popout

actions

all output return to TRS Context Sensitive