details

property	value
status	complete
benchmark	#4.30a.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n071.star.cs.uiowa.edu
space	Strategy_removed_AG01

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.211750984192 seconds
cpu usage	0.144118436
max memory	4739072.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Stand 20472