details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	1.52513194084 seconds
cpu usage	1.770965166
max memory	2.11767296E8

stage attributes

key	value
output-size	4367
starexec-result	"MAYBE"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: le(0(),y,z) -> greater(y,z) 2: le(s(x),0(),z) -> false() 3: le(s(x),s(y),0()) -> false() 4: le(s(x),s(y),s(z)) -> le(x,y,z) 5: greater(x,0()) -> first() 6: greater(0(),s(y)) -> second() 7: greater(s(x),s(y)) -> greater(x,y) 8: double(0()) -> 0() 9: double(s(x)) -> s(s(double(x))) 10: triple(x) -> if(le(x,x,double(x)),x,0(),0()) 11: if(false(),x,y,z) -> true() 12: if(first(),x,y,z) -> if(le(s(x),y,s(z)),s(x),y,s(z)) 13: if(second(),x,y,z) -> if(le(s(x),s(y),z),s(x),s(y),z) Number of strict rules: 13 Direct Order(PosReal,>,Poly) ... failed. Freezing le 1: le❆1_0(y,z) -> greater(y,z) 2: le❆1_s(x,0(),z) -> false() 3: le❆1_s(x,s(y),0()) -> false() 4: le❆1_s(x,s(y),s(z)) -> le(x,y,z) 5: greater(x,0()) -> first() 6: greater(0(),s(y)) -> second() 7: greater(s(x),s(y)) -> greater(x,y) 8: double(0()) -> 0() 9: double(s(x)) -> s(s(double(x))) 10: triple(x) -> if(le(x,x,double(x)),x,0(),0()) 11: if(false(),x,y,z) -> true() 12: if(first(),x,y,z) -> if(le❆1_s(x,y,s(z)),s(x),y,s(z)) 13: if(second(),x,y,z) -> if(le❆1_s(x,s(y),z),s(x),s(y),z) 14: le(0(),_2,_3) ->= le❆1_0(_2,_3) 15: le(s(_1),_3,_4) ->= le❆1_s(_1,_3,_4) Number of strict rules: 13 Direct Order(PosReal,>,Poly) ... failed. Dependency Pairs: #1: #if(second(),x,y,z) -> #if(le❆1_s(x,s(y),z),s(x),s(y),z) #2: #if(second(),x,y,z) -> #le❆1_s(x,s(y),z) #3: #double(s(x)) -> #double(x) #4: #if(first(),x,y,z) -> #if(le❆1_s(x,y,s(z)),s(x),y,s(z)) #5: #if(first(),x,y,z) -> #le❆1_s(x,y,s(z)) #6: #le(0(),_2,_3) ->? #le❆1_0(_2,_3) #7: #greater(s(x),s(y)) -> #greater(x,y) #8: #triple(x) -> #if(le(x,x,double(x)),x,0(),0()) #9: #triple(x) -> #le(x,x,double(x)) #10: #triple(x) -> #double(x) #11: #le❆1_0(y,z) -> #greater(y,z) #12: #le(s(_1),_3,_4) ->? #le❆1_s(_1,_3,_4) #13: #le❆1_s(x,s(y),s(z)) -> #le(x,y,z) Number of SCCs: 4, DPs: 6, edges: 8 SCC { #3 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2,x3) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2,x3) weight: 0 #triple(x1) weight: 0 greater(x1,x2) weight: 0 false() weight: 0 triple(x1) weight: 0 second() weight: 0 true() weight: 0 #le❆1_0(x1,x2) weight: 0 le❆1_s(x1,x2,x3) weight: 0 0() weight: 0 if(x1,x2,x3,x4) weight: 0 #double(x1) weight: x1 double(x1) weight: 0 #le❆1_s(x1,x2,x3) weight: 0 first() weight: 0 #greater(x1,x2) weight: 0 #if(x1,x2,x3,x4) weight: 0 le❆1_0(x1,x2) weight: 0 Usable rules: { } Removed DPs: #3 Number of SCCs: 3, DPs: 5, edges: 7 SCC { #7 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2,x3) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2,x3) weight: 0 #triple(x1) weight: 0 greater(x1,x2) weight: 0 false() weight: 0 triple(x1) weight: 0 second() weight: 0 true() weight: 0 #le❆1_0(x1,x2) weight: 0 le❆1_s(x1,x2,x3) weight: 0 0() weight: 0 if(x1,x2,x3,x4) weight: 0 #double(x1) weight: 0 double(x1) weight: 0 #le❆1_s(x1,x2,x3) weight: 0 first() weight: 0 popout

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

job log

popout

actions

all output return to TRS Standard