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	n071.star.cs.uiowa.edu
space	Strategy_removed_AG01

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.149551868439 seconds
cpu usage	0.054571765
max memory	3375104.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Standard