Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487071671
details
property
value
status
complete
benchmark
Ex24_Luc06_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n189.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.839225 seconds
cpu usage
0.75
user time
0.73
system time
0.02
max virtual memory
328308.0
max residence set size
7124.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: active(f(b(),X,c())) -> mark(f(X,c(),X)) 2: active(c()) -> mark(b()) 3: active(f(X1,X2,X3)) -> f(X1,active(X2),X3) 4: f(X1,mark(X2),X3) -> mark(f(X1,X2,X3)) 5: proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3)) 6: proper(b()) -> ok(b()) 7: proper(c()) -> ok(c()) 8: f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3)) 9: top(mark(X)) -> top(proper(X)) 10: top(ok(X)) -> top(active(X)) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #top(mark(X)) -> #top(proper(X)) #2: #top(mark(X)) -> #proper(X) #3: #top(ok(X)) -> #top(active(X)) #4: #top(ok(X)) -> #active(X) #5: #proper(f(X1,X2,X3)) -> #f(proper(X1),proper(X2),proper(X3)) #6: #proper(f(X1,X2,X3)) -> #proper(X1) #7: #proper(f(X1,X2,X3)) -> #proper(X2) #8: #proper(f(X1,X2,X3)) -> #proper(X3) #9: #active(f(X1,X2,X3)) -> #f(X1,active(X2),X3) #10: #active(f(X1,X2,X3)) -> #active(X2) #11: #active(f(b(),X,c())) -> #f(X,c(),X) #12: #f(ok(X1),ok(X2),ok(X3)) -> #f(X1,X2,X3) #13: #f(X1,mark(X2),X3) -> #f(X1,X2,X3) Number of SCCs: 4, DPs: 8 SCC { #10 } POLO(Sum)... succeeded. b w: 0 top w: 0 #top w: 0 c w: 0 f w: x2 + 1 proper w: 0 ok w: 0 mark w: 0 #f w: 0 #proper w: 0 active w: 0 #active w: x1 USABLE RULES: { } Removed DPs: #10 Number of SCCs: 3, DPs: 7 SCC { #1 #3 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded. b w: [0;1] top w: [0;0] #top w: [1,1;0,0] * x1 c w: [19299;0] f w: [0,1;0,1] * x1 + [1,1;1,1] * x2 + [1,0;1,0] * x3 proper w: x1 ok w: x1 mark w: x1 + [0;1] #f w: [0;0] #proper w: [0;0] active w: [0,1;1,0] * x1 #active w: [0;0] USABLE RULES: { 1..8 } Removed DPs: #1 Number of SCCs: 3, DPs: 6 SCC { #3 } POLO(Sum)... succeeded. b w: 1 top w: 0 #top w: x1 c w: 1 f w: x2 proper w: 3879 ok w: 3879 mark w: x1 + 1431 #f w: 0 #proper w: 0 active w: 1432 #active w: 0 USABLE RULES: { 1..8 } Removed DPs: #3 Number of SCCs: 2, DPs: 5 SCC { #12 #13 } POLO(Sum)... succeeded. b w: 1 top w: 0 #top w: x1 c w: 1 f w: x2 proper w: 41991 ok w: x1 + 41990 mark w: x1 + 868 #f w: x1 + x2 + x3 #proper w: 0 active w: 869 #active w: 0 USABLE RULES: { 1..8 } Removed DPs: #12 #13 Number of SCCs: 1, DPs: 3 SCC { #6..8 } POLO(Sum)... succeeded.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard