details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0482621192932 seconds
cpu usage	0.041823085
max memory	3473408.0

stage attributes

key	value
output-size	3954
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 x y) (RULES if(false,x,y) -> y if(true,x,y) -> x le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y))))) p(0) -> 0 p(s(x)) -> x ) Problem 1: Innermost Equivalent Processor: -> Rules: if(false,x,y) -> y if(true,x,y) -> x le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y))))) p(0) -> 0 p(s(x)) -> x -> 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(x,s(y)) -> IF(le(x,s(y)),0,p(minus(x,p(s(y))))) MINUS(x,s(y)) -> LE(x,s(y)) MINUS(x,s(y)) -> MINUS(x,p(s(y))) MINUS(x,s(y)) -> P(minus(x,p(s(y)))) MINUS(x,s(y)) -> P(s(y)) -> Rules: if(false,x,y) -> y if(true,x,y) -> x le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y))))) p(0) -> 0 p(s(x)) -> x Problem 1: SCC Processor: -> Pairs: LE(s(x),s(y)) -> LE(x,y) MINUS(x,s(y)) -> IF(le(x,s(y)),0,p(minus(x,p(s(y))))) MINUS(x,s(y)) -> LE(x,s(y)) MINUS(x,s(y)) -> MINUS(x,p(s(y))) MINUS(x,s(y)) -> P(minus(x,p(s(y)))) MINUS(x,s(y)) -> P(s(y)) -> Rules: if(false,x,y) -> y if(true,x,y) -> x le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y))))) p(0) -> 0 p(s(x)) -> x ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: LE(s(x),s(y)) -> LE(x,y) ->->-> Rules: if(false,x,y) -> y if(true,x,y) -> x le(0,y) -> true le(s(x),0) -> false le(s(x),s(y)) -> le(x,y) minus(x,0) -> x minus(x,s(y)) -> if(le(x,s(y)),0,p(minus(x,p(s(y))))) p(0) -> 0 p(s(x)) -> x ->->Cycle: ->->-> Pairs: MINUS(x,s(y)) -> MINUS(x,p(s(y))) ->->-> Rules: if(false,x,y) -> y if(true,x,y) -> x popout

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

job log

popout

actions

all output return to TRS Stand 20472