Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713840
details
property
value
status
complete
benchmark
PALINDROME_nokinds_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
configuration
Default
runtime (wallclock)
1.06774401665 seconds
cpu usage
1.072016954
max memory
1.032192E7
stage attributes
key
value
output-size
5580
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: active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) 2: active(__(X,nil())) -> mark(X) 3: active(__(nil(),X)) -> mark(X) 4: active(and(tt(),X)) -> mark(X) 5: active(isList(V)) -> mark(isNeList(V)) 6: active(isList(nil())) -> mark(tt()) 7: active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2))) 8: active(isNeList(V)) -> mark(isQid(V)) 9: active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2))) 10: active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2))) 11: active(isNePal(V)) -> mark(isQid(V)) 12: active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P))) 13: active(isPal(V)) -> mark(isNePal(V)) 14: active(isPal(nil())) -> mark(tt()) 15: active(isQid(a())) -> mark(tt()) 16: active(isQid(e())) -> mark(tt()) 17: active(isQid(i())) -> mark(tt()) 18: active(isQid(o())) -> mark(tt()) 19: active(isQid(u())) -> mark(tt()) 20: active(__(X1,X2)) -> __(active(X1),X2) 21: active(__(X1,X2)) -> __(X1,active(X2)) 22: active(and(X1,X2)) -> and(active(X1),X2) 23: __(mark(X1),X2) -> mark(__(X1,X2)) 24: __(X1,mark(X2)) -> mark(__(X1,X2)) 25: and(mark(X1),X2) -> mark(and(X1,X2)) 26: proper(__(X1,X2)) -> __(proper(X1),proper(X2)) 27: proper(nil()) -> ok(nil()) 28: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 29: proper(tt()) -> ok(tt()) 30: proper(isList(X)) -> isList(proper(X)) 31: proper(isNeList(X)) -> isNeList(proper(X)) 32: proper(isQid(X)) -> isQid(proper(X)) 33: proper(isNePal(X)) -> isNePal(proper(X)) 34: proper(isPal(X)) -> isPal(proper(X)) 35: proper(a()) -> ok(a()) 36: proper(e()) -> ok(e()) 37: proper(i()) -> ok(i()) 38: proper(o()) -> ok(o()) 39: proper(u()) -> ok(u()) 40: __(ok(X1),ok(X2)) -> ok(__(X1,X2)) 41: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 42: isList(ok(X)) -> ok(isList(X)) 43: isNeList(ok(X)) -> ok(isNeList(X)) 44: isQid(ok(X)) -> ok(isQid(X)) 45: isNePal(ok(X)) -> ok(isNePal(X)) 46: isPal(ok(X)) -> ok(isPal(X)) 47: top(mark(X)) -> top(proper(X)) 48: top(ok(X)) -> top(active(X)) Number of strict rules: 48 Direct POLO(bPol) ... removes: 18 4 15 8 3 16 19 17 5 10 7 14 12 11 9 13 6 2 a w: 2 isNeList w: x1 + 2 isPal w: x1 + 3 u w: 1 top w: x1 and w: x1 + x2 + 2 isNePal w: x1 + 2 isQid w: x1 + 1 o w: 1 proper w: x1 ok w: x1 isList w: x1 + 3 nil w: 1 mark w: x1 i w: 1 e w: 1 active w: x1 tt w: 1 __ w: x1 + x2 + 6 Number of strict rules: 30 Direct POLO(bPol) ... removes: 1 a w: 1 isNeList w: x1 + 1 isPal w: x1 + 1 u w: 1 top w: x1 and w: x1 + x2 + 1 isNePal w: x1 + 1 isQid w: x1 o w: 1 proper w: x1 ok w: x1 isList w: x1 + 1 nil w: 1 mark w: x1 i w: 0 e w: 2 active w: x1 tt w: 1 __ w: 2 * x1 + x2 + 2 Number of strict rules: 29 Direct POLO(bPol) ... removes: 25 23 47
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472