details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	1.74845385551 seconds
cpu usage	2.024500092
max memory	2.15404544E8

stage attributes

key	value
output-size	5239
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: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: le(0(),y) -> true() 6: le(s(x),0()) -> false() 7: le(s(x),s(y)) -> le(x,y) 8: inc(s(x)) -> s(inc(x)) 9: inc(0()) -> s(0()) 10: log(x) -> logIter(x,0()) 11: logIter(x,y) -> if(le(s(0()),x),le(s(s(0())),x),quot(x,s(s(0()))),inc(y)) 12: if(false(),b,x,y) -> logZeroError() 13: if(true(),false(),x,s(y)) -> y 14: if(true(),true(),x,y) -> logIter(x,y) Number of strict rules: 14 Direct Order(PosReal,>,Poly) ... failed. Freezing le 1: minus(x,0()) -> x 2: minus(s(x),s(y)) -> minus(x,y) 3: quot(0(),s(y)) -> 0() 4: quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) 5: le❆1_0(y) -> true() 6: le❆1_s(x,0()) -> false() 7: le❆1_s(x,s(y)) -> le(x,y) 8: inc(s(x)) -> s(inc(x)) 9: inc(0()) -> s(0()) 10: log(x) -> logIter(x,0()) 11: logIter(x,y) -> if(le❆1_s(0(),x),le❆1_s(s(0()),x),quot(x,s(s(0()))),inc(y)) 12: if(false(),b,x,y) -> logZeroError() 13: if(true(),false(),x,s(y)) -> y 14: if(true(),true(),x,y) -> logIter(x,y) 15: le(0(),_1) ->= le❆1_0(_1) 16: le(s(_1),_2) ->= le❆1_s(_1,_2) Number of strict rules: 14 Direct Order(PosReal,>,Poly) ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #logIter(x,y) -> #if(le❆1_s(0(),x),le❆1_s(s(0()),x),quot(x,s(s(0()))),inc(y)) #3: #logIter(x,y) -> #le❆1_s(0(),x) #4: #logIter(x,y) -> #le❆1_s(s(0()),x) #5: #logIter(x,y) -> #quot(x,s(s(0()))) #6: #logIter(x,y) -> #inc(y) #7: #if(true(),true(),x,y) -> #logIter(x,y) #8: #le❆1_s(x,s(y)) -> #le(x,y) #9: #log(x) -> #logIter(x,0()) #10: #le(s(_1),_2) ->? #le❆1_s(_1,_2) #11: #inc(s(x)) -> #inc(x) #12: #le(0(),_1) ->? #le❆1_0(_1) #13: #quot(s(x),s(y)) -> #quot(minus(x,y),s(y)) #14: #quot(s(x),s(y)) -> #minus(x,y) Number of SCCs: 5, DPs: 7, edges: 7 SCC { #11 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2) weight: 0 minus(x1,x2) weight: 0 false() weight: 0 logZeroError() weight: 0 #log(x1) weight: 0 #inc(x1) weight: x1 inc(x1) weight: 0 true() weight: 0 #le❆1_0(x1) weight: 0 le❆1_s(x1,x2) weight: 0 log(x1) weight: 0 0() weight: 0 if(x1,x2,x3,x4) weight: 0 quot(x1,x2) weight: 0 #le❆1_s(x1,x2) weight: 0 logIter(x1,x2) weight: 0 #minus(x1,x2) weight: 0 #logIter(x1,x2) weight: 0 #if(x1,x2,x3,x4) weight: 0 #quot(x1,x2) weight: 0 le❆1_0(x1) weight: 0 Usable rules: { } Removed DPs: #11 Number of SCCs: 4, DPs: 6, edges: 6 SCC { #1 } Removing DPs: Order(PosReal,>,Sum)... succeeded. le(x1,x2) weight: 0 s(x1) weight: (/ 1 2) + x1 #le(x1,x2) weight: 0 minus(x1,x2) weight: 0 false() weight: 0 logZeroError() weight: 0 #log(x1) weight: 0 #inc(x1) weight: 0 inc(x1) weight: 0 true() weight: 0 #le❆1_0(x1) weight: 0 popout

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

job log

popout

actions

all output return to TRS Standard