details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	1.84757900238 seconds
cpu usage	1.618957242
max memory	1.4491648E7

stage attributes

key	value
output-size	12868
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 z) (RULES minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ) Problem 1: Dependency Pairs Processor: -> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) PLUS(minus(x,s(0)),minus(y,s(s(z)))) -> PLUS(minus(y,s(s(z))),minus(x,s(0))) PLUS(plus(x,s(0)),plus(y,s(s(z)))) -> PLUS(plus(y,s(s(z))),plus(x,s(0))) PLUS(s(x),y) -> PLUS(x,y) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) -> Rules: minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) Problem 1: SCC Processor: -> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) PLUS(minus(x,s(0)),minus(y,s(s(z)))) -> PLUS(minus(y,s(s(z))),minus(x,s(0))) PLUS(plus(x,s(0)),plus(y,s(s(z)))) -> PLUS(plus(y,s(s(z))),plus(x,s(0))) PLUS(s(x),y) -> PLUS(x,y) QUOT(s(x),s(y)) -> MINUS(x,y) QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) -> Rules: minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(minus(x,s(0)),minus(y,s(s(z)))) -> PLUS(minus(y,s(s(z))),minus(x,s(0))) PLUS(plus(x,s(0)),plus(y,s(s(z)))) -> PLUS(plus(y,s(s(z))),plus(x,s(0))) PLUS(s(x),y) -> PLUS(x,y) ->->-> Rules: minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->->Cycle: ->->-> Pairs: MINUS(s(x),s(y)) -> MINUS(x,y) ->->-> Rules: minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) ->->Cycle: ->->-> Pairs: QUOT(s(x),s(y)) -> QUOT(minus(x,y),s(y)) ->->-> Rules: minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x plus(minus(x,s(0)),minus(y,s(s(z)))) -> plus(minus(y,s(s(z))),minus(x,s(0))) plus(plus(x,s(0)),plus(y,s(s(z)))) -> plus(plus(y,s(s(z))),plus(x,s(0))) plus(0,y) -> y plus(s(x),y) -> s(plus(x,y)) quot(0,s(y)) -> 0 quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) popout

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

job log

popout

actions

all output return to TRS Stand 20472