details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.498162031174 seconds
cpu usage	0.485975398
max memory	6213632.0

stage attributes

key	value
output-size	7301
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 y z) (RULES *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) ) Problem 1: Dependency Pairs Processor: -> Pairs: *#(*(x,y),z) -> *#(x,*(y,z)) *#(*(x,y),z) -> *#(y,z) *#(+(y,z),x) -> *#(x,y) *#(+(y,z),x) -> *#(x,z) *#(+(y,z),x) -> +#(*(x,y),*(x,z)) *#(x,+(y,z)) -> *#(x,y) *#(x,+(y,z)) -> *#(x,z) *#(x,+(y,z)) -> +#(*(x,y),*(x,z)) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) -> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) Problem 1: SCC Processor: -> Pairs: *#(*(x,y),z) -> *#(x,*(y,z)) *#(*(x,y),z) -> *#(y,z) *#(+(y,z),x) -> *#(x,y) *#(+(y,z),x) -> *#(x,z) *#(+(y,z),x) -> +#(*(x,y),*(x,z)) *#(x,+(y,z)) -> *#(x,y) *#(x,+(y,z)) -> *#(x,z) *#(x,+(y,z)) -> +#(*(x,y),*(x,z)) +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) -> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) ->->-> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) ->->Cycle: ->->-> Pairs: *#(*(x,y),z) -> *#(x,*(y,z)) *#(*(x,y),z) -> *#(y,z) *#(+(y,z),x) -> *#(x,y) *#(+(y,z),x) -> *#(x,z) *#(x,+(y,z)) -> *#(x,y) *#(x,+(y,z)) -> *#(x,z) ->->-> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: +#(+(x,y),z) -> +#(x,+(y,z)) +#(+(x,y),z) -> +#(y,z) -> Rules: *(*(x,y),z) -> *(x,*(y,z)) *(+(y,z),x) -> +(*(x,y),*(x,z)) *(x,+(y,z)) -> +(*(x,y),*(x,z)) +(+(x,y),z) -> +(x,+(y,z)) ->Projection: pi(+#) = 1 Problem 1.1: popout

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

job log

popout

actions

all output return to TRS Stand 20472