details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	5.63666510582 seconds
cpu usage	5.685838619
max memory	4.306944E7

stage attributes

key	value
output-size	3091
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: cond1(true(),x,y,z) -> cond2(gr(y,z),x,y,z) 2: cond2(true(),x,y,z) -> cond2(gr(y,z),p(x),p(y),z) 3: cond2(false(),x,y,z) -> cond1(and(eq(x,y),gr(x,z)),x,y,z) 4: gr(0(),x) -> false() 5: gr(s(x),0()) -> true() 6: gr(s(x),s(y)) -> gr(x,y) 7: p(0()) -> 0() 8: p(s(x)) -> x 9: eq(0(),0()) -> true() 10: eq(s(x),0()) -> false() 11: eq(0(),s(x)) -> false() 12: eq(s(x),s(y)) -> eq(x,y) 13: and(true(),true()) -> true() 14: and(false(),x) -> false() 15: and(x,false()) -> false() Number of strict rules: 15 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #cond2(true(),x,y,z) -> #cond2(gr(y,z),p(x),p(y),z) #2: #cond2(true(),x,y,z) -> #gr(y,z) #3: #cond2(true(),x,y,z) -> #p(x) #4: #cond2(true(),x,y,z) -> #p(y) #5: #gr(s(x),s(y)) -> #gr(x,y) #6: #eq(s(x),s(y)) -> #eq(x,y) #7: #cond2(false(),x,y,z) -> #cond1(and(eq(x,y),gr(x,z)),x,y,z) #8: #cond2(false(),x,y,z) -> #and(eq(x,y),gr(x,z)) #9: #cond2(false(),x,y,z) -> #eq(x,y) #10: #cond2(false(),x,y,z) -> #gr(x,z) #11: #cond1(true(),x,y,z) -> #cond2(gr(y,z),x,y,z) #12: #cond1(true(),x,y,z) -> #gr(y,z) Number of SCCs: 3, DPs: 5 SCC { #6 } Sum... succeeded. cond2(x1,x2,x3,x4) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3,x4) w: (0) and(x1,x2) w: (0) eq(x1,x2) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) cond1(x1,x2,x3,x4) w: (0) #eq(x1,x2) w: (x2) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (0) #cond2(x1,x2,x3,x4) w: (0) gr(x1,x2) w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #6 Number of SCCs: 2, DPs: 4 SCC { #5 } Sum... succeeded. cond2(x1,x2,x3,x4) w: (0) s(x1) w: (1 + x1) #cond1(x1,x2,x3,x4) w: (0) and(x1,x2) w: (0) eq(x1,x2) w: (0) false() w: (0) #p(x1) w: (0) true() w: (0) cond1(x1,x2,x3,x4) w: (0) #eq(x1,x2) w: (0) p(x1) w: (0) 0() w: (0) #gr(x1,x2) w: (x2) #cond2(x1,x2,x3,x4) w: (0) gr(x1,x2) w: (0) #and(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #5 Number of SCCs: 1, DPs: 3 SCC { #1 #7 #11 } Sum... Max... QLPOpS... NegMaxSum... succeeded. cond2(x1,x2,x3,x4) w: (0) s(x1) w: (max{0, 61945 + x1}) #cond1(x1,x2,x3,x4) w: (max{0, 26288 + x3}) and(x1,x2) w: (max{0, -2 + x2}) eq(x1,x2) w: (0) false() w: (1) #p(x1) w: (0) true() w: (5) cond1(x1,x2,x3,x4) w: (0) #eq(x1,x2) w: (0) p(x1) w: (max{0, -61945 + x1}) 0() w: (0) #gr(x1,x2) w: (0) #cond2(x1,x2,x3,x4) w: (max{0, 26288 + x3, 26286 + x1}) gr(x1,x2) w: (max{0, 1 + x1}) #and(x1,x2) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard