details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.196552991867 seconds
cpu usage	0.180443803
max memory	5.59104E7

stage attributes

key	value
output-size	7904
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 q r x y) (RULES less(0,s(x)) -> true less(s(x),s(y)) -> less(x,y) less(x,0) -> false minus(0,s(y)) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x quotrem(0,s(y)) -> pair(0,0) quotrem(s(x),s(y)) -> pair(0,s(x)) | less(x,y) -> true quotrem(s(x),s(y)) -> pair(s(q),r) | less(x,y) -> false, quotrem(minus(x,y),s(y)) -> pair(q,r) ) Problem 1: Valid CTRS Processor: -> Rules: less(0,s(x)) -> true less(s(x),s(y)) -> less(x,y) less(x,0) -> false minus(0,s(y)) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x quotrem(0,s(y)) -> pair(0,0) quotrem(s(x),s(y)) -> pair(0,s(x)) | less(x,y) -> true quotrem(s(x),s(y)) -> pair(s(q),r) | less(x,y) -> false, quotrem(minus(x,y),s(y)) -> pair(q,r) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: LESS(s(x),s(y)) -> LESS(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) -> QPairs: Empty -> Rules: less(0,s(x)) -> true less(s(x),s(y)) -> less(x,y) less(x,0) -> false minus(0,s(y)) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x quotrem(0,s(y)) -> pair(0,0) quotrem(s(x),s(y)) -> pair(0,s(x)) | less(x,y) -> true quotrem(s(x),s(y)) -> pair(s(q),r) | less(x,y) -> false, quotrem(minus(x,y),s(y)) -> pair(q,r) Conditional Termination Problem 2: -> Pairs: QUOTREM(s(x),s(y)) -> LESS(x,y) QUOTREM(s(x),s(y)) -> MINUS(x,y) | less(x,y) -> false QUOTREM(s(x),s(y)) -> QUOTREM(minus(x,y),s(y)) | less(x,y) -> false -> QPairs: LESS(s(x),s(y)) -> LESS(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) -> Rules: less(0,s(x)) -> true less(s(x),s(y)) -> less(x,y) less(x,0) -> false minus(0,s(y)) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x quotrem(0,s(y)) -> pair(0,0) quotrem(s(x),s(y)) -> pair(0,s(x)) | less(x,y) -> true quotrem(s(x),s(y)) -> pair(s(q),r) | less(x,y) -> false, quotrem(minus(x,y),s(y)) -> pair(q,r) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: LESS(s(x),s(y)) -> LESS(x,y) MINUS(s(x),s(y)) -> MINUS(x,y) -> QPairs: Empty -> Rules: less(0,s(x)) -> true less(s(x),s(y)) -> less(x,y) less(x,0) -> false minus(0,s(y)) -> 0 minus(s(x),s(y)) -> minus(x,y) minus(x,0) -> x quotrem(0,s(y)) -> pair(0,0) quotrem(s(x),s(y)) -> pair(0,s(x)) | less(x,y) -> true quotrem(s(x),s(y)) -> pair(s(q),r) | less(x,y) -> false, quotrem(minus(x,y),s(y)) -> pair(q,r) ->Strongly Connected Components: ->->Cycle: popout

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

job log

popout

actions

all output return to TRS Condi 20667