details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.197925 seconds
cpu usage	0.069382
user time	0.037831
system time	0.031551
max virtual memory	113188.0
max residence set size	9340.0

stage attributes

key	value
starexec-result	NO

output

NO Input TRS: 1: min(x,0()) -> 0() 2: min(0(),y) -> 0() 3: min(s(x),s(y)) -> s(min(x,y)) 4: max(x,0()) -> x 5: max(0(),y) -> y 6: max(s(x),s(y)) -> s(max(x,y)) 7: -(x,0()) -> x 8: -(s(x),s(y)) -> -(x,y) 9: gcd(nil()) -> 0() 10: gcd(cons(x,nil())) -> x 11: gcd(cons(0(),y)) -> gcd(y) 12: gcd(cons(x,cons(y,z))) -> gcd(cons(-(x,y),cons(y,z))) 13: gcd(cons(x,cons(y,z))) ->= gcd(cons(max(x,y),cons(min(x,y),z))) Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying gcd 1: min(x,0()) -> 0() 2: min(0(),y) -> 0() 3: min(s(x),s(y)) -> s(min(x,y)) 4: max(x,0()) -> x 5: max(0(),y) -> y 6: max(s(x),s(y)) -> s(max(x,y)) 7: -(x,0()) -> x 8: -(s(x),s(y)) -> -(x,y) 9: gcd^1_nil() -> 0() 10: gcd^1_cons(x,nil()) -> x 11: gcd^1_cons(0(),y) -> gcd(y) 12: gcd^1_cons(x,cons(y,z)) -> gcd^1_cons(-(x,y),cons(y,z)) 13: gcd^1_cons(x,cons(y,z)) ->= gcd^1_cons(max(x,y),cons(min(x,y),z)) 14: gcd(cons(_1,_2)) ->= gcd^1_cons(_1,_2) 15: gcd(nil()) ->= gcd^1_nil() Number of strict rules: 12 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #max(s(x),s(y)) -> #max(x,y) #2: #gcd^1_cons(x,cons(y,z)) ->? #gcd^1_cons(max(x,y),cons(min(x,y),z)) #3: #gcd^1_cons(x,cons(y,z)) ->? #max(x,y) #4: #gcd^1_cons(x,cons(y,z)) ->? #min(x,y) #5: #gcd^1_cons(0(),y) -> #gcd(y) #6: #gcd^1_cons(x,cons(y,z)) -> #gcd^1_cons(-(x,y),cons(y,z)) #7: #gcd^1_cons(x,cons(y,z)) -> #-(x,y) #8: #gcd(cons(_1,_2)) ->? #gcd^1_cons(_1,_2) #9: #min(s(x),s(y)) -> #min(x,y) #10: #-(s(x),s(y)) -> #-(x,y) #11: #gcd(nil()) ->? #gcd^1_nil() Number of SCCs: 4, DPs: 7 SCC { #1 } POLO(Sum)... succeeded. s w: x1 + 1 gcd w: 0 gcd^1_nil w: 0 #min w: 0 #gcd^1_nil w: 0 0 w: 0 max w: 0 nil w: 0 #max w: x2 - w: 0 gcd^1_cons w: 0 min w: 0 #gcd^1_cons w: 0 #- w: 0 cons w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 3, DPs: 6 SCC { #9 } POLO(Sum)... succeeded. s w: x1 + 1 gcd w: 0 gcd^1_nil w: 0 #min w: x2 #gcd^1_nil w: 0 0 w: 0 max w: 0 nil w: 0 #max w: 0 - w: 0 gcd^1_cons w: 0 min w: 0 #gcd^1_cons w: 0 #- w: 0 cons w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 2, DPs: 5 SCC { #10 } POLO(Sum)... succeeded. s w: x1 + 1 gcd w: 0 gcd^1_nil w: 0 #min w: 0 #gcd^1_nil w: 0 0 w: 0 max w: 0 nil w: 0 popout

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

job log

popout

actions

all output return to TRS Relative