details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.126559019089 seconds
cpu usage	0.054185265
max memory	3379200.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Standard