details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.0932490825653 seconds
cpu usage	0.064393181
max memory	9949184.0

stage attributes

key	value
output-size	4158
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: minus(0(),y) -> 0() 2: minus(s(x),0()) -> s(x) 3: minus(s(x),s(y)) -> minus(x,y) 4: le(0(),y) -> true() 5: le(s(x),0()) -> false() 6: le(s(x),s(y)) -> le(x,y) 7: if(true(),x,y) -> x 8: if(false(),x,y) -> y 9: perfectp(0()) -> false() 10: perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) 11: f(0(),y,0(),u) -> true() 12: f(0(),y,s(z),u) -> false() 13: f(s(x),0(),z,u) -> f(x,u,minus(z,s(x)),u) 14: f(s(x),s(y),z,u) -> if(le(x,y),f(s(x),minus(y,x),z,u),f(x,u,z,u)) Number of strict rules: 14 Direct poly ... failed. Freezing f 1: minus(0(),y) -> 0() 2: minus(s(x),0()) -> s(x) 3: minus(s(x),s(y)) -> minus(x,y) 4: le(0(),y) -> true() 5: le(s(x),0()) -> false() 6: le(s(x),s(y)) -> le(x,y) 7: if(true(),x,y) -> x 8: if(false(),x,y) -> y 9: perfectp(0()) -> false() 10: perfectp(s(x)) -> f(x,s(0()),s(x),s(x)) 11: f❆1_0(y,0(),u) -> true() 12: f❆1_0(y,s(z),u) -> false() 13: f❆1_s(x,0(),z,u) -> f(x,u,minus(z,s(x)),u) 14: f❆1_s(x,s(y),z,u) -> if(le(x,y),f❆1_s(x,minus(y,x),z,u),f(x,u,z,u)) 15: f(0(),_3,_4,_5) ->= f❆1_0(_3,_4,_5) 16: f(s(_1),_4,_5,_6) ->= f❆1_s(_1,_4,_5,_6) Number of strict rules: 14 Direct poly ... failed. Dependency Pairs: #1: #le(s(x),s(y)) -> #le(x,y) #2: #f❆1_s(x,0(),z,u) -> #f(x,u,minus(z,s(x)),u) #3: #f❆1_s(x,0(),z,u) -> #minus(z,s(x)) #4: #f❆1_s(x,s(y),z,u) -> #if(le(x,y),f❆1_s(x,minus(y,x),z,u),f(x,u,z,u)) #5: #f❆1_s(x,s(y),z,u) -> #le(x,y) #6: #f❆1_s(x,s(y),z,u) -> #f❆1_s(x,minus(y,x),z,u) #7: #f❆1_s(x,s(y),z,u) -> #minus(y,x) #8: #f❆1_s(x,s(y),z,u) -> #f(x,u,z,u) #9: #perfectp(s(x)) -> #f(x,s(0()),s(x),s(x)) #10: #f(s(_1),_4,_5,_6) ->? #f❆1_s(_1,_4,_5,_6) #11: #minus(s(x),s(y)) -> #minus(x,y) #12: #f(0(),_3,_4,_5) ->? #f❆1_0(_3,_4,_5) Number of SCCs: 3, DPs: 6 SCC { #1 } Sum... succeeded. #f❆1_s(x1,x2,x3,x4) w: (0) le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (x2) minus(x1,x2) w: (0) #perfectp(x1) w: (0) false() w: (0) true() w: (0) f❆1_s(x1,x2,x3,x4) w: (0) f(x1,x2,x3,x4) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #f❆1_0(x1,x2,x3) w: (0) #f(x1,x2,x3,x4) w: (0) #minus(x1,x2) w: (0) #if(x1,x2,x3) w: (0) perfectp(x1) w: (0) f❆1_0(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 5 SCC { #11 } Sum... succeeded. #f❆1_s(x1,x2,x3,x4) w: (0) le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (0) minus(x1,x2) w: (0) #perfectp(x1) w: (0) false() w: (0) true() w: (0) f❆1_s(x1,x2,x3,x4) w: (0) f(x1,x2,x3,x4) w: (0) 0() w: (0) if(x1,x2,x3) w: (0) #f❆1_0(x1,x2,x3) w: (0) #f(x1,x2,x3,x4) w: (0) #minus(x1,x2) w: (x2) #if(x1,x2,x3) w: (0) perfectp(x1) w: (0) f❆1_0(x1,x2,x3) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard