details

property	value
status	complete
benchmark	#3.22.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	AG01

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.489807844162 seconds
cpu usage	0.411378765
max memory	1.3963264E7

stage attributes

key	value
output-size	5806
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 z:S) (RULES plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: PLUS(x:S,s(y:S)) -> PLUS(x:S,y:S) TIMES(x:S,plus(y:S,s(z:S))) -> PLUS(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) TIMES(x:S,plus(y:S,s(z:S))) -> PLUS(y:S,times(s(z:S),0)) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(s(z:S),0) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,plus(y:S,times(s(z:S),0))) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,s(z:S)) TIMES(x:S,s(y:S)) -> PLUS(times(x:S,y:S),x:S) TIMES(x:S,s(y:S)) -> TIMES(x:S,y:S) -> Rules: plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) Problem 1: SCC Processor: -> Pairs: PLUS(x:S,s(y:S)) -> PLUS(x:S,y:S) TIMES(x:S,plus(y:S,s(z:S))) -> PLUS(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) TIMES(x:S,plus(y:S,s(z:S))) -> PLUS(y:S,times(s(z:S),0)) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(s(z:S),0) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,plus(y:S,times(s(z:S),0))) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,s(z:S)) TIMES(x:S,s(y:S)) -> PLUS(times(x:S,y:S),x:S) TIMES(x:S,s(y:S)) -> TIMES(x:S,y:S) -> Rules: plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(x:S,s(y:S)) -> PLUS(x:S,y:S) ->->-> Rules: plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) ->->Cycle: ->->-> Pairs: TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,plus(y:S,times(s(z:S),0))) TIMES(x:S,plus(y:S,s(z:S))) -> TIMES(x:S,s(z:S)) TIMES(x:S,s(y:S)) -> TIMES(x:S,y:S) ->->-> Rules: plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: PLUS(x:S,s(y:S)) -> PLUS(x:S,y:S) -> Rules: plus(x:S,0) -> x:S plus(x:S,s(y:S)) -> s(plus(x:S,y:S)) times(x:S,plus(y:S,s(z:S))) -> plus(times(x:S,plus(y:S,times(s(z:S),0))),times(x:S,s(z:S))) times(x:S,0) -> 0 times(x:S,s(y:S)) -> plus(times(x:S,y:S),x:S) ->Projection: pi(PLUS) = 2 Problem 1.1: SCC Processor: -> Pairs: Empty popout

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

job log

popout

actions

all output return to TRS Standard