details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.264933824539 seconds
cpu usage	0.236919929
max memory	4.1705472E7

stage attributes

key	value
output-size	6739
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 add(0,y) -> y add(s(x),y) -> s(add(x,y)) gcd(add(x,y),y) -> gcd(x,y) gcd(0,x) -> x gcd(x,0) -> x gcd(x,y) -> gcd(y,x) | leq(y,x) -> false gcd(y,add(x,y)) -> gcd(x,y) ) Problem 1: Valid CTRS Processor: -> Rules: add(0,y) -> y add(s(x),y) -> s(add(x,y)) gcd(add(x,y),y) -> gcd(x,y) gcd(0,x) -> x gcd(x,0) -> x gcd(x,y) -> gcd(y,x) | leq(y,x) -> false gcd(y,add(x,y)) -> gcd(x,y) -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: ADD(s(x),y) -> ADD(x,y) GCD(add(x,y),y) -> GCD(x,y) GCD(x,y) -> GCD(y,x) | leq(y,x) -> false GCD(y,add(x,y)) -> GCD(x,y) -> QPairs: Empty -> Rules: add(0,y) -> y add(s(x),y) -> s(add(x,y)) gcd(add(x,y),y) -> gcd(x,y) gcd(0,x) -> x gcd(x,0) -> x gcd(x,y) -> gcd(y,x) | leq(y,x) -> false gcd(y,add(x,y)) -> gcd(x,y) Conditional Termination Problem 2: -> Pairs: Empty -> QPairs: ADD(s(x),y) -> ADD(x,y) GCD(add(x,y),y) -> GCD(x,y) GCD(x,y) -> GCD(y,x) | leq(y,x) -> false GCD(y,add(x,y)) -> GCD(x,y) -> Rules: add(0,y) -> y add(s(x),y) -> s(add(x,y)) gcd(add(x,y),y) -> gcd(x,y) gcd(0,x) -> x gcd(x,0) -> x gcd(x,y) -> gcd(y,x) | leq(y,x) -> false gcd(y,add(x,y)) -> gcd(x,y) The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: ADD(s(x),y) -> ADD(x,y) GCD(add(x,y),y) -> GCD(x,y) GCD(x,y) -> GCD(y,x) | leq(y,x) -> false GCD(y,add(x,y)) -> GCD(x,y) -> QPairs: Empty -> Rules: add(0,y) -> y add(s(x),y) -> s(add(x,y)) gcd(add(x,y),y) -> gcd(x,y) gcd(0,x) -> x gcd(x,0) -> x gcd(x,y) -> gcd(y,x) | leq(y,x) -> false gcd(y,add(x,y)) -> gcd(x,y) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: GCD(add(x,y),y) -> GCD(x,y) GCD(x,y) -> GCD(y,x) | leq(y,x) -> false GCD(y,add(x,y)) -> GCD(x,y) ->->-> Rules: add(0,y) -> y popout

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

job log

popout

actions

all output return to TRS Condi 20667