details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0179970264435 seconds
cpu usage	0.015419388
max memory	1863680.0

stage attributes

key	value
output-size	4884
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) (RULES *(0,y) -> 0 *(p(x),y) -> +(*(x,y),minus(y)) *(s(x),y) -> +(*(x,y),y) +(0,y) -> y +(p(x),y) -> p(+(x,y)) +(s(x),y) -> s(+(x,y)) minus(0) -> 0 minus(p(x)) -> s(minus(x)) minus(s(x)) -> p(minus(x)) ) Problem 1: Innermost Equivalent Processor: -> Rules: *(0,y) -> 0 *(p(x),y) -> +(*(x,y),minus(y)) *(s(x),y) -> +(*(x,y),y) +(0,y) -> y +(p(x),y) -> p(+(x,y)) +(s(x),y) -> s(+(x,y)) minus(0) -> 0 minus(p(x)) -> s(minus(x)) minus(s(x)) -> p(minus(x)) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: *#(p(x),y) -> *#(x,y) *#(p(x),y) -> +#(*(x,y),minus(y)) *#(p(x),y) -> MINUS(y) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(p(x),y) -> +#(x,y) +#(s(x),y) -> +#(x,y) MINUS(p(x)) -> MINUS(x) MINUS(s(x)) -> MINUS(x) -> Rules: *(0,y) -> 0 *(p(x),y) -> +(*(x,y),minus(y)) *(s(x),y) -> +(*(x,y),y) +(0,y) -> y +(p(x),y) -> p(+(x,y)) +(s(x),y) -> s(+(x,y)) minus(0) -> 0 minus(p(x)) -> s(minus(x)) minus(s(x)) -> p(minus(x)) Problem 1: SCC Processor: -> Pairs: *#(p(x),y) -> *#(x,y) *#(p(x),y) -> +#(*(x,y),minus(y)) *#(p(x),y) -> MINUS(y) *#(s(x),y) -> *#(x,y) *#(s(x),y) -> +#(*(x,y),y) +#(p(x),y) -> +#(x,y) +#(s(x),y) -> +#(x,y) MINUS(p(x)) -> MINUS(x) MINUS(s(x)) -> MINUS(x) -> Rules: *(0,y) -> 0 *(p(x),y) -> +(*(x,y),minus(y)) *(s(x),y) -> +(*(x,y),y) +(0,y) -> y +(p(x),y) -> p(+(x,y)) +(s(x),y) -> s(+(x,y)) minus(0) -> 0 minus(p(x)) -> s(minus(x)) minus(s(x)) -> p(minus(x)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(p(x)) -> MINUS(x) MINUS(s(x)) -> MINUS(x) ->->-> Rules: *(0,y) -> 0 *(p(x),y) -> +(*(x,y),minus(y)) *(s(x),y) -> +(*(x,y),y) +(0,y) -> y +(p(x),y) -> p(+(x,y)) +(s(x),y) -> s(+(x,y)) minus(0) -> 0 minus(p(x)) -> s(minus(x)) popout

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

job log

popout

actions

all output return to TRS Stand 20472