details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	1.13507 seconds
cpu usage	1.13
user time	1.07
system time	0.06
max virtual memory	371372.0
max residence set size	6912.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: app(nil(),y) -> y 9: app(add(n,x),y) -> add(n,app(x,y)) 10: min(add(n,nil())) -> n 11: min(add(n,add(m,x))) -> if_min(le(n,m),add(n,add(m,x))) 12: if_min(true(),add(n,add(m,x))) -> min(add(n,x)) 13: if_min(false(),add(n,add(m,x))) -> min(add(m,x)) 14: head(add(n,x)) -> n 15: tail(add(n,x)) -> x 16: tail(nil()) -> nil() 17: null(nil()) -> true() 18: null(add(n,x)) -> false() 19: rm(n,nil()) -> nil() 20: rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 21: if_rm(true(),n,add(m,x)) -> rm(n,x) 22: if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 23: minsort(x) -> mins(x,nil(),nil()) 24: mins(x,y,z) -> if(null(x),x,y,z) 25: if(true(),x,y,z) -> z 26: if(false(),x,y,z) -> if2(eq(head(x),min(x)),x,y,z) 27: if2(true(),x,y,z) -> mins(app(rm(head(x),tail(x)),y),nil(),app(z,add(head(x),nil()))) 28: if2(false(),x,y,z) -> mins(tail(x),add(head(x),y),z) Number of strict rules: 28 Direct POLO(bPol) ... failed. Uncurrying min 1: eq(0(),0()) -> true() 2: eq(0(),s(x)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: app(nil(),y) -> y 9: app(add(n,x),y) -> add(n,app(x,y)) 10: min^1_add(n,nil()) -> n 11: min^1_add(n,add(m,x)) -> if_min(le(n,m),add(n,add(m,x))) 12: if_min(true(),add(n,add(m,x))) -> min^1_add(n,x) 13: if_min(false(),add(n,add(m,x))) -> min^1_add(m,x) 14: head(add(n,x)) -> n 15: tail(add(n,x)) -> x 16: tail(nil()) -> nil() 17: null(nil()) -> true() 18: null(add(n,x)) -> false() 19: rm(n,nil()) -> nil() 20: rm(n,add(m,x)) -> if_rm(eq(n,m),n,add(m,x)) 21: if_rm(true(),n,add(m,x)) -> rm(n,x) 22: if_rm(false(),n,add(m,x)) -> add(m,rm(n,x)) 23: minsort(x) -> mins(x,nil(),nil()) 24: mins(x,y,z) -> if(null(x),x,y,z) 25: if(true(),x,y,z) -> z 26: if(false(),x,y,z) -> if2(eq(head(x),min(x)),x,y,z) 27: if2(true(),x,y,z) -> mins(app(rm(head(x),tail(x)),y),nil(),app(z,add(head(x),nil()))) 28: if2(false(),x,y,z) -> mins(tail(x),add(head(x),y),z) 29: min(add(_1,_2)) ->= min^1_add(_1,_2) Number of strict rules: 28 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #min(add(_1,_2)) ->? #min^1_add(_1,_2) #2: #if_min(false(),add(n,add(m,x))) -> #min^1_add(m,x) #3: #app(add(n,x),y) -> #app(x,y) #4: #min^1_add(n,add(m,x)) -> #if_min(le(n,m),add(n,add(m,x))) #5: #min^1_add(n,add(m,x)) -> #le(n,m) #6: #mins(x,y,z) -> #if(null(x),x,y,z) #7: #mins(x,y,z) -> #null(x) #8: #minsort(x) -> #mins(x,nil(),nil()) #9: #if_min(true(),add(n,add(m,x))) -> #min^1_add(n,x) #10: #rm(n,add(m,x)) -> #if_rm(eq(n,m),n,add(m,x)) #11: #rm(n,add(m,x)) -> #eq(n,m) #12: #le(s(x),s(y)) -> #le(x,y) #13: #if2(false(),x,y,z) -> #mins(tail(x),add(head(x),y),z) #14: #if2(false(),x,y,z) -> #tail(x) #15: #if2(false(),x,y,z) -> #head(x) #16: #if_rm(false(),n,add(m,x)) -> #rm(n,x) #17: #if2(true(),x,y,z) -> #mins(app(rm(head(x),tail(x)),y),nil(),app(z,add(head(x),nil()))) #18: #if2(true(),x,y,z) -> #app(rm(head(x),tail(x)),y) #19: #if2(true(),x,y,z) -> #rm(head(x),tail(x)) #20: #if2(true(),x,y,z) -> #head(x) #21: #if2(true(),x,y,z) -> #tail(x) #22: #if2(true(),x,y,z) -> #app(z,add(head(x),nil())) #23: #if2(true(),x,y,z) -> #head(x) #24: #if(false(),x,y,z) -> #if2(eq(head(x),min(x)),x,y,z) #25: #if(false(),x,y,z) -> #eq(head(x),min(x)) #26: #if(false(),x,y,z) -> #head(x) #27: #if(false(),x,y,z) -> #min(x) #28: #if_rm(true(),n,add(m,x)) -> #rm(n,x) #29: #eq(s(x),s(y)) -> #eq(x,y) Number of SCCs: 6, DPs: 13 SCC { #3 } POLO(Sum)... succeeded. le w: 0 if_rm w: 0 s w: 0 popout

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

job log

popout

actions

all output return to TRS Standard