details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.113830089569 seconds
cpu usage	0.04065173
max memory	3457024.0

stage attributes

key	value
output-size	6398
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 v_NonEmpty:S X:S Y:S) (RULES div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) geq(0,s(Y:S)) -> ffalse geq(s(X:S),s(Y:S)) -> geq(X:S,Y:S) geq(X:S,0) -> ttrue if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S minus(0,Y:S) -> 0 minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) ) Problem 1: Innermost Equivalent Processor: -> Rules: div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) geq(0,s(Y:S)) -> ffalse geq(s(X:S),s(Y:S)) -> geq(X:S,Y:S) geq(X:S,0) -> ttrue if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S minus(0,Y:S) -> 0 minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S)) DIV(s(X:S),s(Y:S)) -> GEQ(X:S,Y:S) DIV(s(X:S),s(Y:S)) -> IF(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) DIV(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) GEQ(s(X:S),s(Y:S)) -> GEQ(X:S,Y:S) MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) -> Rules: div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) geq(0,s(Y:S)) -> ffalse geq(s(X:S),s(Y:S)) -> geq(X:S,Y:S) geq(X:S,0) -> ttrue if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S minus(0,Y:S) -> 0 minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) Problem 1: SCC Processor: -> Pairs: DIV(s(X:S),s(Y:S)) -> DIV(minus(X:S,Y:S),s(Y:S)) DIV(s(X:S),s(Y:S)) -> GEQ(X:S,Y:S) DIV(s(X:S),s(Y:S)) -> IF(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) DIV(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) GEQ(s(X:S),s(Y:S)) -> GEQ(X:S,Y:S) MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) -> Rules: div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) geq(0,s(Y:S)) -> ffalse geq(s(X:S),s(Y:S)) -> geq(X:S,Y:S) geq(X:S,0) -> ttrue if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S minus(0,Y:S) -> 0 minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(X:S),s(Y:S)) -> MINUS(X:S,Y:S) ->->-> Rules: div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) geq(0,s(Y:S)) -> ffalse geq(s(X:S),s(Y:S)) -> geq(X:S,Y:S) geq(X:S,0) -> ttrue if(ffalse,X:S,Y:S) -> Y:S if(ttrue,X:S,Y:S) -> X:S minus(0,Y:S) -> 0 minus(s(X:S),s(Y:S)) -> minus(X:S,Y:S) ->->Cycle: ->->-> Pairs: GEQ(s(X:S),s(Y:S)) -> GEQ(X:S,Y:S) ->->-> Rules: div(0,s(Y:S)) -> 0 div(s(X:S),s(Y:S)) -> if(geq(X:S,Y:S),s(div(minus(X:S,Y:S),s(Y:S))),0) popout

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

job log

popout

actions

all output return to TRS Standard