details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.529200077057 seconds
cpu usage	0.536953708
max memory	8957952.0

stage attributes

key	value
output-size	8672
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) 2: a____(X,nil()) -> mark(X) 3: a____(nil(),X) -> mark(X) 4: a__U11(tt()) -> tt() 5: a__U21(tt(),V2) -> a__U22(a__isList(V2)) 6: a__U22(tt()) -> tt() 7: a__U31(tt()) -> tt() 8: a__U41(tt(),V2) -> a__U42(a__isNeList(V2)) 9: a__U42(tt()) -> tt() 10: a__U51(tt(),V2) -> a__U52(a__isList(V2)) 11: a__U52(tt()) -> tt() 12: a__U61(tt()) -> tt() 13: a__U71(tt(),P) -> a__U72(a__isPal(P)) 14: a__U72(tt()) -> tt() 15: a__U81(tt()) -> tt() 16: a__isList(V) -> a__U11(a__isNeList(V)) 17: a__isList(nil()) -> tt() 18: a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2) 19: a__isNeList(V) -> a__U31(a__isQid(V)) 20: a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2) 21: a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2) 22: a__isNePal(V) -> a__U61(a__isQid(V)) 23: a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P) 24: a__isPal(V) -> a__U81(a__isNePal(V)) 25: a__isPal(nil()) -> tt() 26: a__isQid(a()) -> tt() 27: a__isQid(e()) -> tt() 28: a__isQid(i()) -> tt() 29: a__isQid(o()) -> tt() 30: a__isQid(u()) -> tt() 31: mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) 32: mark(U11(X)) -> a__U11(mark(X)) 33: mark(U21(X1,X2)) -> a__U21(mark(X1),X2) 34: mark(U22(X)) -> a__U22(mark(X)) 35: mark(isList(X)) -> a__isList(X) 36: mark(U31(X)) -> a__U31(mark(X)) 37: mark(U41(X1,X2)) -> a__U41(mark(X1),X2) 38: mark(U42(X)) -> a__U42(mark(X)) 39: mark(isNeList(X)) -> a__isNeList(X) 40: mark(U51(X1,X2)) -> a__U51(mark(X1),X2) 41: mark(U52(X)) -> a__U52(mark(X)) 42: mark(U61(X)) -> a__U61(mark(X)) 43: mark(U71(X1,X2)) -> a__U71(mark(X1),X2) 44: mark(U72(X)) -> a__U72(mark(X)) 45: mark(isPal(X)) -> a__isPal(X) 46: mark(U81(X)) -> a__U81(mark(X)) 47: mark(isQid(X)) -> a__isQid(X) 48: mark(isNePal(X)) -> a__isNePal(X) 49: mark(nil()) -> nil() 50: mark(tt()) -> tt() 51: mark(a()) -> a() 52: mark(e()) -> e() 53: mark(i()) -> i() 54: mark(o()) -> o() 55: mark(u()) -> u() 56: a____(X1,X2) -> __(X1,X2) 57: a__U11(X) -> U11(X) 58: a__U21(X1,X2) -> U21(X1,X2) 59: a__U22(X) -> U22(X) 60: a__isList(X) -> isList(X) 61: a__U31(X) -> U31(X) 62: a__U41(X1,X2) -> U41(X1,X2) 63: a__U42(X) -> U42(X) 64: a__isNeList(X) -> isNeList(X) 65: a__U51(X1,X2) -> U51(X1,X2) 66: a__U52(X) -> U52(X) 67: a__U61(X) -> U61(X) 68: a__U71(X1,X2) -> U71(X1,X2) 69: a__U72(X) -> U72(X) 70: a__isPal(X) -> isPal(X) 71: a__U81(X) -> U81(X) 72: a__isQid(X) -> isQid(X) 73: a__isNePal(X) -> isNePal(X) Number of strict rules: 73 Direct POLO(bPol) ... removes: 18 4 15 8 1 3 16 21 26 19 17 27 22 28 5 10 7 20 25 30 14 12 23 24 11 9 13 6 29 2 a w: 1 U21 w: x1 + 2 * x2 + 6 U11 w: x1 + 1 isNeList w: 2 * x1 + 3 isPal w: 2 * x1 + 5 U42 w: x1 + 1 u w: 1 U71 w: x1 + 2 * x2 + 11 a__U22 w: x1 + 1 isNePal w: 2 * x1 + 3 U72 w: x1 + 1 a__U31 w: x1 + 1 a__U51 w: x1 + 2 * x2 + 8 a__U81 w: x1 + 1 isQid w: x1 + 1 a____ w: 2 * x1 + x2 + 5 a__U41 w: x1 + 2 * x2 + 4 popout

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

job log

popout

actions

all output return to TRS Stand 20472