Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072401
details
property
value
status
complete
benchmark
#3.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.0557379 seconds
cpu usage
0.029133
user time
0.013862
system time
0.015271
max virtual memory
113188.0
max residence set size
9276.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: app(f(),app(f(),x)) -> app(g(),app(f(),x)) 2: app(g(),app(g(),x)) -> app(f(),x) 3: app(app(map(),fun),nil()) -> nil() 4: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) 5: app(app(filter(),fun),nil()) -> nil() 6: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) 7: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) 8: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Number of strict rules: 8 Direct POLO(bPol) ... failed. Uncurrying app 1: app^1_f(app^1_f(x)) -> app^1_g(app^1_f(x)) 2: app^1_g(app^1_g(x)) -> app^1_f(x) 3: app^2_map(fun,nil()) -> nil() 4: app^2_map(fun,app^2_cons(x,xs)) -> app^2_cons(app(fun,x),app^2_map(fun,xs)) 5: app^2_filter(fun,nil()) -> nil() 6: app^2_filter(fun,app^2_cons(x,xs)) -> app^4_filter2(app(fun,x),fun,x,xs) 7: app^4_filter2(true(),fun,x,xs) -> app^2_cons(x,app^2_filter(fun,xs)) 8: app^4_filter2(false(),fun,x,xs) -> app^2_filter(fun,xs) 9: app(cons(),_1) ->= app^1_cons(_1) 10: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 11: app(filter(),_1) ->= app^1_filter(_1) 12: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 13: app(map(),_1) ->= app^1_map(_1) 14: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 15: app(g(),_1) ->= app^1_g(_1) 16: app(f(),_1) ->= app^1_f(_1) 17: app(filter2(),_1) ->= app^1_filter2(_1) 18: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 19: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 20: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) Number of strict rules: 8 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^1_g(app^1_g(x)) -> #app^1_f(x) #2: #app^2_filter(fun,app^2_cons(x,xs)) -> #app^4_filter2(app(fun,x),fun,x,xs) #3: #app^2_filter(fun,app^2_cons(x,xs)) -> #app(fun,x) #4: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #5: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #6: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #7: #app^4_filter2(true(),fun,x,xs) -> #app^2_filter(fun,xs) #8: #app(f(),_1) ->? #app^1_f(_1) #9: #app^1_f(app^1_f(x)) -> #app^1_g(app^1_f(x)) #10: #app^4_filter2(false(),fun,x,xs) -> #app^2_filter(fun,xs) #11: #app(g(),_1) ->? #app^1_g(_1) #12: #app^2_map(fun,app^2_cons(x,xs)) -> #app(fun,x) #13: #app^2_map(fun,app^2_cons(x,xs)) -> #app^2_map(fun,xs) Number of SCCs: 2, DPs: 10 SCC { #1 #9 } POLO(Sum)... succeeded. app^1_cons w: 0 #app^2_map w: 0 #app^1_g w: x1 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 #app^1_f w: x1 + 1 app^1_filter2 w: 0 true w: 0 f w: 0 filter2 w: 0 #app^4_filter2 w: 0 nil w: 0 #app w: 0 map w: 0 app^1_filter w: 0 cons w: 0 app^1_f w: x1 + 2 filter w: 0 app^3_filter2 w: 0 app^2_filter w: 0 g w: 0 app^1_map w: 0 app^2_cons w: 0 app^2_map w: 0 #app^2_filter w: 0 app w: 0 app^1_g w: x1 + 2 USABLE RULES: { 1 2 } Removed DPs: #1 #9 Number of SCCs: 1, DPs: 8 SCC { #3..7 #10 #12 #13 } POLO(Sum)... succeeded. app^1_cons w: 0 #app^2_map w: x1 + x2 #app^1_g w: x1 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 1 #app^1_f w: 1 app^1_filter2 w: 0 true w: 1 f w: 0 filter2 w: 0 #app^4_filter2 w: x2 + x4 + 1 nil w: 0 #app w: x1 + x2 + 816 map w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard