details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.35082 seconds
cpu usage	0.0822
user time	0.059342
system time	0.022858
max virtual memory	113188.0
max residence set size	6452.0

stage attributes

key	value
starexec-result	MAYBE

output

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(xs) -> if3(empty(xs),xs) 15: if3(true(),xs) -> nil() 16: if3(false(),xs) -> sort(del(max(xs),xs)) 17: empty(nil()) -> true() 18: empty(cons(x,xs)) -> false() 19: ge(x,0()) -> true() 20: ge(0(),s(x)) -> false() 21: ge(s(x),s(y)) -> ge(x,y) Number of strict rules: 21 Direct POLO(bPol) ... failed. Uncurrying 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(xs) -> if3(empty(xs),xs) 15: if3(true(),xs) -> nil() 16: if3(false(),xs) -> sort(del(max(xs),xs)) 17: empty(nil()) -> true() 18: empty(cons(x,xs)) -> false() 19: ge(x,0()) -> true() 20: ge(0(),s(x)) -> false() 21: ge(s(x),s(y)) -> ge(x,y) 22: max(cons(_1,_2)) ->= max^1_cons(_1,_2) 23: max(nil()) ->= max^1_nil() Number of strict rules: 21 Direct POLO(bPol) ... 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: #sort(xs) -> #if3(empty(xs),xs) #5: #sort(xs) -> #empty(xs) #6: #del(x,cons(y,xs)) -> #if2(eq(x,y),x,y,xs) #7: #del(x,cons(y,xs)) -> #eq(x,y) #8: #if1(false(),x,y,xs) -> #max^1_cons(y,xs) #9: #max(cons(_1,_2)) ->? #max^1_cons(_1,_2) #10: #ge(s(x),s(y)) -> #ge(x,y) #11: #if3(false(),xs) -> #sort(del(max(xs),xs)) #12: #if3(false(),xs) -> #del(max(xs),xs) #13: #if3(false(),xs) -> #max(xs) #14: #max^1_cons(x,cons(y,xs)) -> #if1(ge(x,y),x,y,xs) #15: #max^1_cons(x,cons(y,xs)) -> #ge(x,y) #16: #if1(true(),x,y,xs) -> #max^1_cons(x,xs) Number of SCCs: 5, DPs: 9 SCC { #10 } POLO(Sum)... succeeded. #del w: 0 #empty w: 0 s w: x1 + 1 max^1_cons w: 0 #max^1_cons w: 0 eq w: 0 if1 w: 0 false w: 0 max^1_nil w: 0 #ge w: x1 + x2 true w: 0 #eq w: 0 #if1 w: 0 #sort w: 0 if2 w: 0 #if3 w: 0 0 w: 0 ge w: 0 del w: 0 max w: 0 nil w: 0 #max w: 0 sort w: 0 #max^1_nil w: 0 if3 w: 0 cons w: 0 empty w: 0 #if2 w: 0 USABLE RULES: { } popout

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

job log

popout

actions

all output return to TRS Standard