details

property	value
status	complete
benchmark	fact-hard.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	CiME_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	127.181 seconds
cpu usage	125.311
user time	94.7667
system time	30.5447
max virtual memory	714544.0
max residence set size	11100.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) +(x:S,0) -> x:S +(x:S,s(y:S)) -> s(+(x:S,y:S)) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S fact(x:S) -> iffact(x:S,ge(x:S,s(s(0)))) ge(0,s(y:S)) -> ffalse ge(s(x:S),s(y:S)) -> ge(x:S,y:S) ge(x:S,0) -> ttrue iffact(x:S,ffalse) -> s(0) iffact(x:S,ttrue) -> *(x:S,fact(-(x:S,s(0)))) ) Problem 1: Innermost Equivalent Processor: -> Rules: *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) +(x:S,0) -> x:S +(x:S,s(y:S)) -> s(+(x:S,y:S)) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S fact(x:S) -> iffact(x:S,ge(x:S,s(s(0)))) ge(0,s(y:S)) -> ffalse ge(s(x:S),s(y:S)) -> ge(x:S,y:S) ge(x:S,0) -> ttrue iffact(x:S,ffalse) -> s(0) iffact(x:S,ttrue) -> *(x:S,fact(-(x:S,s(0)))) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: *#(x:S,s(y:S)) -> *#(x:S,y:S) *#(x:S,s(y:S)) -> +#(*(x:S,y:S),x:S) +#(x:S,s(y:S)) -> +#(x:S,y:S) -#(s(x:S),s(y:S)) -> -#(x:S,y:S) FACT(x:S) -> GE(x:S,s(s(0))) FACT(x:S) -> IFFACT(x:S,ge(x:S,s(s(0)))) GE(s(x:S),s(y:S)) -> GE(x:S,y:S) IFFACT(x:S,ttrue) -> *#(x:S,fact(-(x:S,s(0)))) IFFACT(x:S,ttrue) -> -#(x:S,s(0)) IFFACT(x:S,ttrue) -> FACT(-(x:S,s(0))) -> Rules: *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) +(x:S,0) -> x:S +(x:S,s(y:S)) -> s(+(x:S,y:S)) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S fact(x:S) -> iffact(x:S,ge(x:S,s(s(0)))) ge(0,s(y:S)) -> ffalse ge(s(x:S),s(y:S)) -> ge(x:S,y:S) ge(x:S,0) -> ttrue iffact(x:S,ffalse) -> s(0) iffact(x:S,ttrue) -> *(x:S,fact(-(x:S,s(0)))) Problem 1: SCC Processor: -> Pairs: *#(x:S,s(y:S)) -> *#(x:S,y:S) *#(x:S,s(y:S)) -> +#(*(x:S,y:S),x:S) +#(x:S,s(y:S)) -> +#(x:S,y:S) -#(s(x:S),s(y:S)) -> -#(x:S,y:S) FACT(x:S) -> GE(x:S,s(s(0))) FACT(x:S) -> IFFACT(x:S,ge(x:S,s(s(0)))) GE(s(x:S),s(y:S)) -> GE(x:S,y:S) IFFACT(x:S,ttrue) -> *#(x:S,fact(-(x:S,s(0)))) IFFACT(x:S,ttrue) -> -#(x:S,s(0)) IFFACT(x:S,ttrue) -> FACT(-(x:S,s(0))) -> Rules: *(x:S,0) -> 0 *(x:S,s(y:S)) -> +(*(x:S,y:S),x:S) +(x:S,0) -> x:S +(x:S,s(y:S)) -> s(+(x:S,y:S)) -(s(x:S),s(y:S)) -> -(x:S,y:S) -(x:S,0) -> x:S fact(x:S) -> iffact(x:S,ge(x:S,s(s(0)))) ge(0,s(y:S)) -> ffalse ge(s(x:S),s(y:S)) -> ge(x:S,y:S) ge(x:S,0) -> ttrue iffact(x:S,ffalse) -> s(0) iffact(x:S,ttrue) -> *(x:S,fact(-(x:S,s(0)))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: GE(s(x:S),s(y:S)) -> GE(x:S,y:S) ->->-> Rules: *(x:S,0) -> 0 popout

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

job log

popout

actions

all output return to TRS Standard