details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.126323223114 seconds
cpu usage	0.08759448
max memory	1.5208448E7

stage attributes

key	value
output-size	1419
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: from(X) -> cons(X,from(s(X))) 2: 2ndspos(0(),Z) -> rnil() 3: 2ndspos(s(N),cons(X,cons(Y,Z))) -> rcons(posrecip(Y),2ndsneg(N,Z)) 4: 2ndsneg(0(),Z) -> rnil() 5: 2ndsneg(s(N),cons(X,cons(Y,Z))) -> rcons(negrecip(Y),2ndspos(N,Z)) 6: pi(X) -> 2ndspos(X,from(0())) 7: plus(0(),Y) -> Y 8: plus(s(X),Y) -> s(plus(X,Y)) 9: times(0(),Y) -> 0() 10: times(s(X),Y) -> plus(Y,times(X,Y)) 11: square(X) -> times(X,X) Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #pi(X) -> #2ndspos(X,from(0())) #2: #pi(X) -> #from(0()) #3: #square(X) -> #times(X,X) #4: #times(s(X),Y) -> #plus(Y,times(X,Y)) #5: #times(s(X),Y) -> #times(X,Y) #6: #2ndsneg(s(N),cons(X,cons(Y,Z))) -> #2ndspos(N,Z) #7: #2ndspos(s(N),cons(X,cons(Y,Z))) -> #2ndsneg(N,Z) #8: #from(X) -> #from(s(X)) #9: #plus(s(X),Y) -> #plus(X,Y) Number of SCCs: 4, DPs: 5 SCC { #8 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... found. #from(X) -#8-> #from(s(X)) --->* #from(s(X)) Looping with: [ X := s(X); ] popout

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

job log

popout

actions

all output return to TRS Standard