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	n107.star.cs.uiowa.edu
space	Mixed_relative_TRS

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.176496 seconds
cpu usage	0.074248
user time	0.05493
system time	0.019318
max virtual memory	113176.0
max residence set size	6132.0

stage attributes

key	value
starexec-result	NO

output

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

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

job log

popout

actions

all output return to TRS_Relative 2019-03-21 03.54