details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0366010665894 seconds
cpu usage	0.031970145
max memory	3584000.0

stage attributes

key	value
output-size	4617
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 y z) (RULES +(0,y) -> y +(s(x),y) -> s(+(x,y)) +(x,+(y,z)) -> +(+(x,y),z) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) f(g(f(x))) -> f(h(s(0),x)) f(g(h(x,y))) -> f(h(s(x),y)) f(h(x,h(y,z))) -> f(h(+(x,y),z)) ) Problem 1: Dependency Pairs Processor: -> Pairs: +#(s(x),y) -> +#(x,y) +#(x,+(y,z)) -> +#(+(x,y),z) +#(x,+(y,z)) -> +#(x,y) +#(x,s(y)) -> +#(x,y) F(g(f(x))) -> F(h(s(0),x)) F(g(h(x,y))) -> F(h(s(x),y)) F(h(x,h(y,z))) -> +#(x,y) F(h(x,h(y,z))) -> F(h(+(x,y),z)) -> Rules: +(0,y) -> y +(s(x),y) -> s(+(x,y)) +(x,+(y,z)) -> +(+(x,y),z) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) f(g(f(x))) -> f(h(s(0),x)) f(g(h(x,y))) -> f(h(s(x),y)) f(h(x,h(y,z))) -> f(h(+(x,y),z)) Problem 1: SCC Processor: -> Pairs: +#(s(x),y) -> +#(x,y) +#(x,+(y,z)) -> +#(+(x,y),z) +#(x,+(y,z)) -> +#(x,y) +#(x,s(y)) -> +#(x,y) F(g(f(x))) -> F(h(s(0),x)) F(g(h(x,y))) -> F(h(s(x),y)) F(h(x,h(y,z))) -> +#(x,y) F(h(x,h(y,z))) -> F(h(+(x,y),z)) -> Rules: +(0,y) -> y +(s(x),y) -> s(+(x,y)) +(x,+(y,z)) -> +(+(x,y),z) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) f(g(f(x))) -> f(h(s(0),x)) f(g(h(x,y))) -> f(h(s(x),y)) f(h(x,h(y,z))) -> f(h(+(x,y),z)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: +#(s(x),y) -> +#(x,y) +#(x,+(y,z)) -> +#(+(x,y),z) +#(x,+(y,z)) -> +#(x,y) +#(x,s(y)) -> +#(x,y) ->->-> Rules: +(0,y) -> y +(s(x),y) -> s(+(x,y)) +(x,+(y,z)) -> +(+(x,y),z) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) f(g(f(x))) -> f(h(s(0),x)) f(g(h(x,y))) -> f(h(s(x),y)) f(h(x,h(y,z))) -> f(h(+(x,y),z)) ->->Cycle: ->->-> Pairs: F(h(x,h(y,z))) -> F(h(+(x,y),z)) ->->-> Rules: +(0,y) -> y +(s(x),y) -> s(+(x,y)) +(x,+(y,z)) -> +(+(x,y),z) +(x,0) -> x +(x,s(y)) -> s(+(x,y)) f(g(f(x))) -> f(h(s(0),x)) f(g(h(x,y))) -> f(h(s(x),y)) f(h(x,h(y,z))) -> f(h(+(x,y),z)) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: popout

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

job log

popout

actions

all output return to TRS Stand 20472