Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713209
details
property
value
status
complete
benchmark
#3.36.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n014.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.084547996521 seconds
cpu usage
0.090578093
max memory
1.0391552E7
stage attributes
key
value
output-size
6320
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app(app(minus(),x),0()) -> x 2: app(app(minus(),app(s(),x)),app(s(),y)) -> app(app(minus(),x),y) 3: app(f(),0()) -> app(s(),0()) 4: app(f(),app(s(),x)) -> app(app(minus(),app(s(),x)),app(g(),app(f(),x))) 5: app(g(),0()) -> 0() 6: app(g(),app(s(),x)) -> app(app(minus(),app(s(),x)),app(f(),app(g(),x))) 7: app(app(map(),fun),nil()) -> nil() 8: app(app(map(),fun),app(app(cons(),x),xs)) -> app(app(cons(),app(fun,x)),app(app(map(),fun),xs)) 9: app(app(filter(),fun),nil()) -> nil() 10: app(app(filter(),fun),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(fun,x)),fun),x),xs) 11: app(app(app(app(filter2(),true()),fun),x),xs) -> app(app(cons(),x),app(app(filter(),fun),xs)) 12: app(app(app(app(filter2(),false()),fun),x),xs) -> app(app(filter(),fun),xs) Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_minus(x,0()) -> x 2: app^2_minus(app^1_s(x),app^1_s(y)) -> app^2_minus(x,y) 3: app^1_f(0()) -> app^1_s(0()) 4: app^1_f(app^1_s(x)) -> app^2_minus(app^1_s(x),app^1_g(app^1_f(x))) 5: app^1_g(0()) -> 0() 6: app^1_g(app^1_s(x)) -> app^2_minus(app^1_s(x),app^1_f(app^1_g(x))) 7: app^2_map(fun,nil()) -> nil() 8: app^2_map(fun,app^2_cons(x,xs)) -> app^2_cons(app(fun,x),app^2_map(fun,xs)) 9: app^2_filter(fun,nil()) -> nil() 10: app^2_filter(fun,app^2_cons(x,xs)) -> app^4_filter2(app(fun,x),fun,x,xs) 11: app^4_filter2(true(),fun,x,xs) -> app^2_cons(x,app^2_filter(fun,xs)) 12: app^4_filter2(false(),fun,x,xs) -> app^2_filter(fun,xs) 13: app(cons(),_1) ->= app^1_cons(_1) 14: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 15: app(s(),_1) ->= app^1_s(_1) 16: app(filter(),_1) ->= app^1_filter(_1) 17: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 18: app(map(),_1) ->= app^1_map(_1) 19: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 20: app(minus(),_1) ->= app^1_minus(_1) 21: app(app^1_minus(_1),_2) ->= app^2_minus(_1,_2) 22: app(g(),_1) ->= app^1_g(_1) 23: app(f(),_1) ->= app^1_f(_1) 24: app(filter2(),_1) ->= app^1_filter2(_1) 25: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 26: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 27: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) Number of strict rules: 12 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^2_minus(app^1_s(x),app^1_s(y)) -> #app^2_minus(x,y) #2: #app^1_g(app^1_s(x)) -> #app^2_minus(app^1_s(x),app^1_f(app^1_g(x))) #3: #app^1_g(app^1_s(x)) -> #app^1_f(app^1_g(x)) #4: #app^1_g(app^1_s(x)) -> #app^1_g(x) #5: #app^4_filter2(true(),fun,x,xs) -> #app^2_filter(fun,xs) #6: #app(f(),_1) ->? #app^1_f(_1) #7: #app^4_filter2(false(),fun,x,xs) -> #app^2_filter(fun,xs) #8: #app^2_filter(fun,app^2_cons(x,xs)) -> #app^4_filter2(app(fun,x),fun,x,xs) #9: #app^2_filter(fun,app^2_cons(x,xs)) -> #app(fun,x) #10: #app(g(),_1) ->? #app^1_g(_1) #11: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #12: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #13: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #14: #app(app^1_minus(_1),_2) ->? #app^2_minus(_1,_2) #15: #app^2_map(fun,app^2_cons(x,xs)) -> #app(fun,x) #16: #app^2_map(fun,app^2_cons(x,xs)) -> #app^2_map(fun,xs) #17: #app^1_f(app^1_s(x)) -> #app^2_minus(app^1_s(x),app^1_g(app^1_f(x))) #18: #app^1_f(app^1_s(x)) -> #app^1_g(app^1_f(x)) #19: #app^1_f(app^1_s(x)) -> #app^1_f(x) Number of SCCs: 3, DPs: 14 SCC { #1 } POLO(Sum)... succeeded. #app^2_minus w: x1 + x2 s w: 0 app^1_cons w: 0 #app^2_map w: 0 minus w: 0 #app^1_g 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: 0 #app w: 0 app^2_minus w: 0 map w: 0 app^1_filter w: 0 cons w: 0 app^1_f w: 0 filter w: 0 app^1_minus w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472