details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	4.3592710495 seconds
cpu usage	4.162321044
max memory	1.0514432E7

stage attributes

key	value
output-size	8370
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 if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: IF_QUOT(true,x,y) -> MINUS(x,y) IF_QUOT(true,x,y) -> QUOT(minus(x,y),y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) QUOT(x,s(y)) -> IF_QUOT(le(s(y),x),x,s(y)) QUOT(x,s(y)) -> LE(s(y),x) -> Rules: if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) Problem 1: SCC Processor: -> Pairs: IF_QUOT(true,x,y) -> MINUS(x,y) IF_QUOT(true,x,y) -> QUOT(minus(x,y),y) LE(s(x),s(y)) -> LE(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) QUOT(x,s(y)) -> IF_QUOT(le(s(y),x),x,s(y)) QUOT(x,s(y)) -> LE(s(y),x) -> Rules: if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) ->->-> Rules: if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) ->->Cycle: ->->-> Pairs: LE(s(x),s(y)) -> LE(x,y) ->->-> Rules: if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) ->->Cycle: ->->-> Pairs: IF_QUOT(true,x,y) -> QUOT(minus(x,y),y) QUOT(x,s(y)) -> IF_QUOT(le(s(y),x),x,s(y)) ->->-> Rules: if_quot(false,x,y) -> 0 if_quot(true,x,y) -> s(quot(minus(x,y),y)) 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(x,s(y)) -> if_quot(le(s(y),x),x,s(y)) popout

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

job log

popout

actions

all output return to TRS Inner 89993