details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0614669 seconds
cpu usage	0.066562
user time	0.034987
system time	0.031575
max virtual memory	113176.0
max residence set size	7472.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.05 YES 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 0.00/0.05 (VAR v_NonEmpty:S x:S y:S) 0.00/0.05 (RULES 0.00/0.05 gcd(0,s(y:S)) -> s(y:S) 0.00/0.05 gcd(s(x:S),0) -> s(x:S) 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 gcd(x:S,x:S) -> x:S 0.00/0.05 less(0,s(x:S)) -> ttrue 0.00/0.05 less(s(x:S),s(y:S)) -> less(x:S,y:S) 0.00/0.05 less(x:S,0) -> ffalse 0.00/0.05 minus(0,s(y:S)) -> 0 0.00/0.05 minus(s(x:S),s(y:S)) -> minus(x:S,y:S) 0.00/0.05 minus(x:S,0) -> x:S 0.00/0.05 ) 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 Valid CTRS Processor: 0.00/0.05 -> Rules: 0.00/0.05 gcd(0,s(y:S)) -> s(y:S) 0.00/0.05 gcd(s(x:S),0) -> s(x:S) 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 gcd(x:S,x:S) -> x:S 0.00/0.05 less(0,s(x:S)) -> ttrue 0.00/0.05 less(s(x:S),s(y:S)) -> less(x:S,y:S) 0.00/0.05 less(x:S,0) -> ffalse 0.00/0.05 minus(0,s(y:S)) -> 0 0.00/0.05 minus(s(x:S),s(y:S)) -> minus(x:S,y:S) 0.00/0.05 minus(x:S,0) -> x:S 0.00/0.05 -> The system is a deterministic 3-CTRS. 0.00/0.05 0.00/0.05 Problem 1: 0.00/0.05 0.00/0.05 Dependency Pairs Processor: 0.00/0.05 0.00/0.05 Conditional Termination Problem 1: 0.00/0.05 -> Pairs: 0.00/0.05 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> MINUS(x:S,y:S) | less(y:S,x:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> MINUS(y:S,x:S) | less(x:S,y:S) ->* ttrue 0.00/0.05 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S) 0.00/0.05 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) 0.00/0.05 -> QPairs: 0.00/0.05 Empty 0.00/0.05 -> Rules: 0.00/0.05 gcd(0,s(y:S)) -> s(y:S) 0.00/0.05 gcd(s(x:S),0) -> s(x:S) 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 gcd(x:S,x:S) -> x:S 0.00/0.05 less(0,s(x:S)) -> ttrue 0.00/0.05 less(s(x:S),s(y:S)) -> less(x:S,y:S) 0.00/0.05 less(x:S,0) -> ffalse 0.00/0.05 minus(0,s(y:S)) -> 0 0.00/0.05 minus(s(x:S),s(y:S)) -> minus(x:S,y:S) 0.00/0.05 minus(x:S,0) -> x:S 0.00/0.05 0.00/0.05 Conditional Termination Problem 2: 0.00/0.05 -> Pairs: 0.00/0.05 GCD(s(x:S),s(y:S)) -> LESS(x:S,y:S) 0.00/0.05 GCD(s(x:S),s(y:S)) -> LESS(y:S,x:S) 0.00/0.05 -> QPairs: 0.00/0.05 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S) 0.00/0.05 -> Rules: 0.00/0.05 gcd(0,s(y:S)) -> s(y:S) 0.00/0.05 gcd(s(x:S),0) -> s(x:S) 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 gcd(x:S,x:S) -> x:S 0.00/0.05 less(0,s(x:S)) -> ttrue 0.00/0.05 less(s(x:S),s(y:S)) -> less(x:S,y:S) 0.00/0.05 less(x:S,0) -> ffalse 0.00/0.05 minus(0,s(y:S)) -> 0 0.00/0.05 minus(s(x:S),s(y:S)) -> minus(x:S,y:S) 0.00/0.05 minus(x:S,0) -> x:S 0.00/0.05 0.00/0.05 0.00/0.05 The problem is decomposed in 2 subproblems. 0.00/0.05 0.00/0.05 Problem 1.1: 0.00/0.05 0.00/0.05 SCC Processor: 0.00/0.05 -> Pairs: 0.00/0.05 GCD(s(x:S),s(y:S)) -> GCD(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> GCD(s(x:S),minus(y:S,x:S)) | less(x:S,y:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> MINUS(x:S,y:S) | less(y:S,x:S) ->* ttrue 0.00/0.05 GCD(s(x:S),s(y:S)) -> MINUS(y:S,x:S) | less(x:S,y:S) ->* ttrue 0.00/0.05 LESS(s(x:S),s(y:S)) -> LESS(x:S,y:S) 0.00/0.05 MINUS(s(x:S),s(y:S)) -> MINUS(x:S,y:S) 0.00/0.05 -> QPairs: 0.00/0.05 Empty 0.00/0.05 -> Rules: 0.00/0.05 gcd(0,s(y:S)) -> s(y:S) 0.00/0.05 gcd(s(x:S),0) -> s(x:S) 0.00/0.05 gcd(s(x:S),s(y:S)) -> gcd(minus(x:S,y:S),s(y:S)) | less(y:S,x:S) ->* ttrue popout

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

job log

popout

actions

all output return to TRS_Conditional 2019-03-28 22.59