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