details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	24.7792069912 seconds
cpu usage	26.014793643
max memory	2.25533952E8

stage attributes

key	value
output-size	15855
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: active(from(X)) -> mark(cons(X,from(s(X)))) 2: active(2ndspos(0(),Z)) -> mark(rnil()) 3: active(2ndspos(s(N),cons(X,Z))) -> mark(2ndspos(s(N),cons2(X,Z))) 4: active(2ndspos(s(N),cons2(X,cons(Y,Z)))) -> mark(rcons(posrecip(Y),2ndsneg(N,Z))) 5: active(2ndsneg(0(),Z)) -> mark(rnil()) 6: active(2ndsneg(s(N),cons(X,Z))) -> mark(2ndsneg(s(N),cons2(X,Z))) 7: active(2ndsneg(s(N),cons2(X,cons(Y,Z)))) -> mark(rcons(negrecip(Y),2ndspos(N,Z))) 8: active(pi(X)) -> mark(2ndspos(X,from(0()))) 9: active(plus(0(),Y)) -> mark(Y) 10: active(plus(s(X),Y)) -> mark(s(plus(X,Y))) 11: active(times(0(),Y)) -> mark(0()) 12: active(times(s(X),Y)) -> mark(plus(Y,times(X,Y))) 13: active(square(X)) -> mark(times(X,X)) 14: active(s(X)) -> s(active(X)) 15: active(posrecip(X)) -> posrecip(active(X)) 16: active(negrecip(X)) -> negrecip(active(X)) 17: active(cons(X1,X2)) -> cons(active(X1),X2) 18: active(cons2(X1,X2)) -> cons2(X1,active(X2)) 19: active(rcons(X1,X2)) -> rcons(active(X1),X2) 20: active(rcons(X1,X2)) -> rcons(X1,active(X2)) 21: active(from(X)) -> from(active(X)) 22: active(2ndspos(X1,X2)) -> 2ndspos(active(X1),X2) 23: active(2ndspos(X1,X2)) -> 2ndspos(X1,active(X2)) 24: active(2ndsneg(X1,X2)) -> 2ndsneg(active(X1),X2) 25: active(2ndsneg(X1,X2)) -> 2ndsneg(X1,active(X2)) 26: active(pi(X)) -> pi(active(X)) 27: active(plus(X1,X2)) -> plus(active(X1),X2) 28: active(plus(X1,X2)) -> plus(X1,active(X2)) 29: active(times(X1,X2)) -> times(active(X1),X2) 30: active(times(X1,X2)) -> times(X1,active(X2)) 31: active(square(X)) -> square(active(X)) 32: s(mark(X)) -> mark(s(X)) 33: posrecip(mark(X)) -> mark(posrecip(X)) 34: negrecip(mark(X)) -> mark(negrecip(X)) 35: cons(mark(X1),X2) -> mark(cons(X1,X2)) 36: cons2(X1,mark(X2)) -> mark(cons2(X1,X2)) 37: rcons(mark(X1),X2) -> mark(rcons(X1,X2)) 38: rcons(X1,mark(X2)) -> mark(rcons(X1,X2)) 39: from(mark(X)) -> mark(from(X)) 40: 2ndspos(mark(X1),X2) -> mark(2ndspos(X1,X2)) 41: 2ndspos(X1,mark(X2)) -> mark(2ndspos(X1,X2)) 42: 2ndsneg(mark(X1),X2) -> mark(2ndsneg(X1,X2)) 43: 2ndsneg(X1,mark(X2)) -> mark(2ndsneg(X1,X2)) 44: pi(mark(X)) -> mark(pi(X)) 45: plus(mark(X1),X2) -> mark(plus(X1,X2)) 46: plus(X1,mark(X2)) -> mark(plus(X1,X2)) 47: times(mark(X1),X2) -> mark(times(X1,X2)) 48: times(X1,mark(X2)) -> mark(times(X1,X2)) 49: square(mark(X)) -> mark(square(X)) 50: proper(0()) -> ok(0()) 51: proper(s(X)) -> s(proper(X)) 52: proper(posrecip(X)) -> posrecip(proper(X)) 53: proper(negrecip(X)) -> negrecip(proper(X)) 54: proper(nil()) -> ok(nil()) 55: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 56: proper(cons2(X1,X2)) -> cons2(proper(X1),proper(X2)) 57: proper(rnil()) -> ok(rnil()) 58: proper(rcons(X1,X2)) -> rcons(proper(X1),proper(X2)) 59: proper(from(X)) -> from(proper(X)) 60: proper(2ndspos(X1,X2)) -> 2ndspos(proper(X1),proper(X2)) 61: proper(2ndsneg(X1,X2)) -> 2ndsneg(proper(X1),proper(X2)) 62: proper(pi(X)) -> pi(proper(X)) 63: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) 64: proper(times(X1,X2)) -> times(proper(X1),proper(X2)) 65: proper(square(X)) -> square(proper(X)) 66: s(ok(X)) -> ok(s(X)) 67: posrecip(ok(X)) -> ok(posrecip(X)) 68: negrecip(ok(X)) -> ok(negrecip(X)) 69: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 70: cons2(ok(X1),ok(X2)) -> ok(cons2(X1,X2)) 71: rcons(ok(X1),ok(X2)) -> ok(rcons(X1,X2)) 72: from(ok(X)) -> ok(from(X)) 73: 2ndspos(ok(X1),ok(X2)) -> ok(2ndspos(X1,X2)) 74: 2ndsneg(ok(X1),ok(X2)) -> ok(2ndsneg(X1,X2)) 75: pi(ok(X)) -> ok(pi(X)) 76: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) 77: times(ok(X1),ok(X2)) -> ok(times(X1,X2)) 78: square(ok(X)) -> ok(square(X)) 79: top(mark(X)) -> top(proper(X)) 80: top(ok(X)) -> top(active(X)) Number of strict rules: 80 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #2ndsneg(X1,mark(X2)) -> #2ndsneg(X1,X2) #2: #active(times(X1,X2)) -> #times(active(X1),X2) #3: #active(times(X1,X2)) -> #active(X1) #4: #cons(mark(X1),X2) -> #cons(X1,X2) #5: #s(ok(X)) -> #s(X) #6: #plus(X1,mark(X2)) -> #plus(X1,X2) #7: #2ndsneg(mark(X1),X2) -> #2ndsneg(X1,X2) #8: #2ndspos(X1,mark(X2)) -> #2ndspos(X1,X2) popout

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

job log

popout

actions

all output return to TRS Standard