details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.780724048615 seconds
cpu usage	0.898144854
max memory	3.9755776E7

stage attributes

key	value
output-size	3932
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: max(nil()) -> 0() 2: max(cons(x,nil())) -> x 3: max(cons(x,cons(y,xs))) -> if1(ge(x,y),x,y,xs) 4: if1(true(),x,y,xs) -> max(cons(x,xs)) 5: if1(false(),x,y,xs) -> max(cons(y,xs)) 6: del(x,nil()) -> nil() 7: del(x,cons(y,xs)) -> if2(eq(x,y),x,y,xs) 8: if2(true(),x,y,xs) -> xs 9: if2(false(),x,y,xs) -> cons(y,del(x,xs)) 10: eq(0(),0()) -> true() 11: eq(0(),s(y)) -> false() 12: eq(s(x),0()) -> false() 13: eq(s(x),s(y)) -> eq(x,y) 14: sort(nil()) -> nil() 15: sort(cons(x,xs)) -> cons(max(cons(x,xs)),sort(del(max(cons(x,xs)),cons(x,xs)))) 16: ge(x,0()) -> true() 17: ge(0(),s(x)) -> false() 18: ge(s(x),s(y)) -> ge(x,y) Number of strict rules: 18 Direct poly ... failed. Freezing max 1: max❆1_nil() -> 0() 2: max❆1_cons(x,nil()) -> x 3: max❆1_cons(x,cons(y,xs)) -> if1(ge(x,y),x,y,xs) 4: if1(true(),x,y,xs) -> max❆1_cons(x,xs) 5: if1(false(),x,y,xs) -> max❆1_cons(y,xs) 6: del(x,nil()) -> nil() 7: del(x,cons(y,xs)) -> if2(eq(x,y),x,y,xs) 8: if2(true(),x,y,xs) -> xs 9: if2(false(),x,y,xs) -> cons(y,del(x,xs)) 10: eq(0(),0()) -> true() 11: eq(0(),s(y)) -> false() 12: eq(s(x),0()) -> false() 13: eq(s(x),s(y)) -> eq(x,y) 14: sort(nil()) -> nil() 15: sort(cons(x,xs)) -> cons(max❆1_cons(x,xs),sort(del(max❆1_cons(x,xs),cons(x,xs)))) 16: ge(x,0()) -> true() 17: ge(0(),s(x)) -> false() 18: ge(s(x),s(y)) -> ge(x,y) 19: max(cons(_1,_2)) ->= max❆1_cons(_1,_2) 20: max(nil()) ->= max❆1_nil() Number of strict rules: 18 Direct poly ... failed. Dependency Pairs: #1: #eq(s(x),s(y)) -> #eq(x,y) #2: #if2(false(),x,y,xs) -> #del(x,xs) #3: #max(nil()) ->? #max❆1_nil() #4: #del(x,cons(y,xs)) -> #if2(eq(x,y),x,y,xs) #5: #del(x,cons(y,xs)) -> #eq(x,y) #6: #if1(false(),x,y,xs) -> #max❆1_cons(y,xs) #7: #max(cons(_1,_2)) ->? #max❆1_cons(_1,_2) #8: #max❆1_cons(x,cons(y,xs)) -> #if1(ge(x,y),x,y,xs) #9: #max❆1_cons(x,cons(y,xs)) -> #ge(x,y) #10: #sort(cons(x,xs)) -> #max❆1_cons(x,xs) #11: #sort(cons(x,xs)) -> #sort(del(max❆1_cons(x,xs),cons(x,xs))) #12: #sort(cons(x,xs)) -> #del(max❆1_cons(x,xs),cons(x,xs)) #13: #sort(cons(x,xs)) -> #max❆1_cons(x,xs) #14: #if1(true(),x,y,xs) -> #max❆1_cons(x,xs) #15: #ge(s(x),s(y)) -> #ge(x,y) Number of SCCs: 5, DPs: 8 SCC { #15 } Sum... succeeded. #del(x1,x2) w: (0) s(x1) w: (1 + x1) eq(x1,x2) w: (0) if1(x1,x2,x3,x4) w: (0) false() w: (0) #ge(x1,x2) w: (x2 + x1) true() w: (0) #eq(x1,x2) w: (0) #if1(x1,x2,x3,x4) w: (0) #sort(x1) w: (0) #max❆1_cons(x1,x2) w: (0) if2(x1,x2,x3,x4) w: (0) max❆1_cons(x1,x2) w: (0) 0() w: (0) ge(x1,x2) w: (0) del(x1,x2) w: (0) max(x1) w: (0) nil() w: (0) #max(x1) w: (0) sort(x1) w: (0) cons(x1,x2) w: (0) max❆1_nil() w: (0) #if2(x1,x2,x3,x4) w: (0) #max❆1_nil() w: (0) USABLE RULES: { } Removed DPs: #15 Number of SCCs: 4, DPs: 7 SCC { #1 } Sum... succeeded. #del(x1,x2) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard