Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487070691
details
property
value
status
complete
benchmark
PALINDROME_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n177.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.393666 seconds
cpu usage
0.039172
user time
0.022083
system time
0.017089
max virtual memory
113188.0
max residence set size
6944.0
stage attributes
key
value
starexec-result
YES
output
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(isNePal(__(I,__(P,I)))) -> mark(tt()) 6: active(__(X1,X2)) -> __(active(X1),X2) 7: active(__(X1,X2)) -> __(X1,active(X2)) 8: active(and(X1,X2)) -> and(active(X1),X2) 9: active(isNePal(X)) -> isNePal(active(X)) 10: __(mark(X1),X2) -> mark(__(X1,X2)) 11: __(X1,mark(X2)) -> mark(__(X1,X2)) 12: and(mark(X1),X2) -> mark(and(X1,X2)) 13: isNePal(mark(X)) -> mark(isNePal(X)) 14: proper(__(X1,X2)) -> __(proper(X1),proper(X2)) 15: proper(nil()) -> ok(nil()) 16: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 17: proper(tt()) -> ok(tt()) 18: proper(isNePal(X)) -> isNePal(proper(X)) 19: __(ok(X1),ok(X2)) -> ok(__(X1,X2)) 20: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 21: isNePal(ok(X)) -> ok(isNePal(X)) 22: top(mark(X)) -> top(proper(X)) 23: top(ok(X)) -> top(active(X)) Number of strict rules: 23 Direct POLO(bPol) ... removes: 4 1 3 22 5 10 2 top w: x1 + 25191 and w: x1 + x2 + 1 isNePal w: x1 + 3566 proper w: x1 ok w: x1 nil w: 1 mark w: x1 + 1 active w: x1 tt w: 1 __ w: 2 * x1 + x2 + 2 Number of strict rules: 16 Direct POLO(bPol) ... removes: 12 top w: x1 + 27751 and w: 2 * x1 + x2 + 26666 isNePal w: x1 proper w: x1 ok w: x1 nil w: 15538 mark w: x1 + 1 active w: x1 tt w: 0 __ w: 2 * x1 + x2 + 1 Number of strict rules: 15 Direct POLO(bPol) ... removes: 13 top w: x1 + 27751 and w: 2 * x1 + x2 + 26666 isNePal w: 2 * x1 proper w: x1 ok w: x1 nil w: 19456 mark w: x1 + 1 active w: x1 tt w: 0 __ w: 2 * x1 + x2 + 1 Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #active(__(X1,X2)) -> #__(active(X1),X2) #2: #active(__(X1,X2)) -> #active(X1) #3: #active(isNePal(X)) -> #isNePal(active(X)) #4: #active(isNePal(X)) -> #active(X) #5: #__(X1,mark(X2)) -> #__(X1,X2) #6: #top(ok(X)) -> #top(active(X)) #7: #top(ok(X)) -> #active(X) #8: #proper(__(X1,X2)) -> #__(proper(X1),proper(X2)) #9: #proper(__(X1,X2)) -> #proper(X1) #10: #proper(__(X1,X2)) -> #proper(X2) #11: #and(ok(X1),ok(X2)) -> #and(X1,X2) #12: #active(__(X1,X2)) -> #__(X1,active(X2)) #13: #active(__(X1,X2)) -> #active(X2) #14: #__(ok(X1),ok(X2)) -> #__(X1,X2) #15: #isNePal(ok(X)) -> #isNePal(X) #16: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2)) #17: #proper(and(X1,X2)) -> #proper(X1) #18: #proper(and(X1,X2)) -> #proper(X2) #19: #active(and(X1,X2)) -> #and(active(X1),X2) #20: #active(and(X1,X2)) -> #active(X1) #21: #proper(isNePal(X)) -> #isNePal(proper(X)) #22: #proper(isNePal(X)) -> #proper(X) Number of SCCs: 6, DPs: 14 SCC { #15 } POLO(Sum)... succeeded. top w: 0 and w: 0 #top w: 0 #__ w: 0 isNePal w: 0 proper w: 0 ok w: x1 + 1 #isNePal w: x1 nil w: 0 mark w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard