Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713569
details
property
value
status
complete
benchmark
21.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n007.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.117592811584 seconds
cpu usage
0.138965842
max memory
1.4741504E7
stage attributes
key
value
output-size
7477
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(p(),app(s(),x)) -> x 2: app(fact(),0()) -> app(s(),0()) 3: app(fact(),app(s(),x)) -> app(app(*(),app(s(),x)),app(fact(),app(p(),app(s(),x)))) 4: app(app(*(),0()),y) -> 0() 5: app(app(*(),app(s(),x)),y) -> app(app(+(),app(app(*(),x),y)),y) 6: app(app(+(),x),0()) -> x 7: app(app(+(),x),app(s(),y)) -> app(s(),app(app(+(),x),y)) 8: app(app(map(),f),nil()) -> nil() 9: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 10: app(app(filter(),f),nil()) -> nil() 11: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 12: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 13: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying app 1: app^1_p(app^1_s(x)) -> x 2: app^1_fact(0()) -> app^1_s(0()) 3: app^1_fact(app^1_s(x)) -> app^2_*(app^1_s(x),app^1_fact(app^1_p(app^1_s(x)))) 4: app^2_*(0(),y) -> 0() 5: app^2_*(app^1_s(x),y) -> app^2_+(app^2_*(x,y),y) 6: app^2_+(x,0()) -> x 7: app^2_+(x,app^1_s(y)) -> app^1_s(app^2_+(x,y)) 8: app^2_map(f,nil()) -> nil() 9: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 10: app^2_filter(f,nil()) -> nil() 11: app^2_filter(f,app^2_cons(x,xs)) -> app^4_filter2(app(f,x),f,x,xs) 12: app^4_filter2(true(),f,x,xs) -> app^2_cons(x,app^2_filter(f,xs)) 13: app^4_filter2(false(),f,x,xs) -> app^2_filter(f,xs) 14: app(p(),_1) ->= app^1_p(_1) 15: app(cons(),_1) ->= app^1_cons(_1) 16: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 17: app(s(),_1) ->= app^1_s(_1) 18: app(filter(),_1) ->= app^1_filter(_1) 19: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 20: app(fact(),_1) ->= app^1_fact(_1) 21: app(+(),_1) ->= app^1_+(_1) 22: app(app^1_+(_1),_2) ->= app^2_+(_1,_2) 23: app(map(),_1) ->= app^1_map(_1) 24: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 25: app(filter2(),_1) ->= app^1_filter2(_1) 26: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 27: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 28: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) 29: app(*(),_1) ->= app^1_*(_1) 30: app(app^1_*(_1),_2) ->= app^2_*(_1,_2) Number of strict rules: 13 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^4_filter2(false(),f,x,xs) -> #app^2_filter(f,xs) #2: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #3: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) #4: #app^2_filter(f,app^2_cons(x,xs)) -> #app^4_filter2(app(f,x),f,x,xs) #5: #app^2_filter(f,app^2_cons(x,xs)) -> #app(f,x) #6: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #7: #app^4_filter2(true(),f,x,xs) -> #app^2_filter(f,xs) #8: #app(p(),_1) ->? #app^1_p(_1) #9: #app(app^1_*(_1),_2) ->? #app^2_*(_1,_2) #10: #app(fact(),_1) ->? #app^1_fact(_1) #11: #app^2_+(x,app^1_s(y)) -> #app^2_+(x,y) #12: #app^2_*(app^1_s(x),y) -> #app^2_+(app^2_*(x,y),y) #13: #app^2_*(app^1_s(x),y) -> #app^2_*(x,y) #14: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #15: #app(app^1_+(_1),_2) ->? #app^2_+(_1,_2) #16: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #17: #app^1_fact(app^1_s(x)) -> #app^2_*(app^1_s(x),app^1_fact(app^1_p(app^1_s(x)))) #18: #app^1_fact(app^1_s(x)) -> #app^1_fact(app^1_p(app^1_s(x))) #19: #app^1_fact(app^1_s(x)) -> #app^1_p(app^1_s(x)) Number of SCCs: 4, DPs: 12 SCC { #18 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. s w: 0 app^1_cons w: 0 app^1_+ w: max(x1 - 1, 0) #app^2_map w: 0 #app^1_p w: max(x1 - 1, 0) app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^1_* w: max(x1 - 1, 0) app^2_* w: 0 app^1_filter2 w: 0 true w: 0 #app^1_fact w: max(x1 - 2, 0) filter2 w: 0 app^1_fact w: 0 app^1_p w: max(x1 - 2, 0) p w: 0 0 w: 0 #app^4_filter2 w: 0 nil w: 0 fact w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472