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	n138.star.cs.uiowa.edu
space	COPS

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.127568006516 seconds
cpu usage	0.077747858
max memory	3739648.0

stage attributes

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

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

job log

popout

actions

all output return to TRS Conditional