details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	1.03757309914 seconds
cpu usage	1.185490114
max memory	3.6913152E7

stage attributes

key	value
output-size	2264
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: -(x,0()) -> x 2: -(s(x),s(y)) -> -(x,y) 3: min(x,0()) -> 0() 4: min(0(),y) -> 0() 5: min(s(x),s(y)) -> s(min(x,y)) 6: twice(0()) -> 0() 7: twice(s(x)) -> s(s(twice(x))) 8: f(s(x),s(y)) -> f(-(y,min(x,y)),s(twice(min(x,y)))) 9: f(s(x),s(y)) -> f(-(x,min(x,y)),s(twice(min(x,y)))) Number of strict rules: 9 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #-(s(x),s(y)) -> #-(x,y) #2: #f(s(x),s(y)) -> #f(-(x,min(x,y)),s(twice(min(x,y)))) #3: #f(s(x),s(y)) -> #-(x,min(x,y)) #4: #f(s(x),s(y)) -> #min(x,y) #5: #f(s(x),s(y)) -> #twice(min(x,y)) #6: #f(s(x),s(y)) -> #min(x,y) #7: #twice(s(x)) -> #twice(x) #8: #min(s(x),s(y)) -> #min(x,y) #9: #f(s(x),s(y)) -> #f(-(y,min(x,y)),s(twice(min(x,y)))) #10: #f(s(x),s(y)) -> #-(y,min(x,y)) #11: #f(s(x),s(y)) -> #min(x,y) #12: #f(s(x),s(y)) -> #twice(min(x,y)) #13: #f(s(x),s(y)) -> #min(x,y) Number of SCCs: 4, DPs: 5 SCC { #7 } Sum... succeeded. s(x1) w: (1 + x1) twice(x1) w: (0) #min(x1,x2) w: (0) f(x1,x2) w: (0) 0() w: (0) -(x1,x2) w: (0) #f(x1,x2) w: (0) #twice(x1) w: (x1) min(x1,x2) w: (0) #-(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #7 Number of SCCs: 3, DPs: 4 SCC { #1 } Sum... succeeded. s(x1) w: (1 + x1) twice(x1) w: (0) #min(x1,x2) w: (0) f(x1,x2) w: (0) 0() w: (0) -(x1,x2) w: (0) #f(x1,x2) w: (0) #twice(x1) w: (0) min(x1,x2) w: (0) #-(x1,x2) w: (x2) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 3 SCC { #8 } Sum... succeeded. s(x1) w: (1 + x1) twice(x1) w: (0) #min(x1,x2) w: (x2) f(x1,x2) w: (0) 0() w: (0) -(x1,x2) w: (0) #f(x1,x2) w: (0) #twice(x1) w: (0) min(x1,x2) w: (0) #-(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 1, DPs: 2 SCC { #2 #9 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Standard