Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072446
details
property
value
status
complete
benchmark
#3.13.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n190.star.cs.uiowa.edu
space
Applicative_first_order_05
run statistics
property
value
solver
NaTT v.1.6c
configuration
Default
runtime (wallclock)
0.259617 seconds
cpu usage
0.084619
user time
0.059442
system time
0.025177
max virtual memory
113188.0
max residence set size
9280.0
stage attributes
key
value
starexec-result
YES
output
YES Input TRS: 1: app(app(eq(),0()),0()) -> true() 2: app(app(eq(),0()),app(s(),x)) -> false() 3: app(app(eq(),app(s(),x)),0()) -> false() 4: app(app(eq(),app(s(),x)),app(s(),y)) -> app(app(eq(),x),y) 5: app(app(or(),true()),y) -> true() 6: app(app(or(),false()),y) -> y 7: app(app(union(),empty()),h) -> h 8: app(app(union(),app(app(app(edge(),x),y),i)),h) -> app(app(app(edge(),x),y),app(app(union(),i),h)) 9: app(app(app(app(reach(),x),y),empty()),h) -> false() 10: app(app(app(app(reach(),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(app(if_reach_1(),app(app(eq(),x),u)),x),y),app(app(app(edge(),u),v),i)),h) 11: app(app(app(app(app(if_reach_1(),true()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(app(if_reach_2(),app(app(eq(),y),v)),x),y),app(app(app(edge(),u),v),i)),h) 12: app(app(app(app(app(if_reach_1(),false()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(app(app(reach(),x),y),i),app(app(app(edge(),u),v),h)) 13: app(app(app(app(app(if_reach_2(),true()),x),y),app(app(app(edge(),u),v),i)),h) -> true() 14: app(app(app(app(app(if_reach_2(),false()),x),y),app(app(app(edge(),u),v),i)),h) -> app(app(or(),app(app(app(app(reach(),x),y),i),h)),app(app(app(app(reach(),v),y),app(app(union(),i),h)),empty())) 15: app(app(map(),f),nil()) -> nil() 16: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 17: app(app(filter(),f),nil()) -> nil() 18: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 19: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 20: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_eq(0(),0()) -> true() 2: app^2_eq(0(),app^1_s(x)) -> false() 3: app^2_eq(app^1_s(x),0()) -> false() 4: app^2_eq(app^1_s(x),app^1_s(y)) -> app^2_eq(x,y) 5: app^2_or(true(),y) -> true() 6: app^2_or(false(),y) -> y 7: app^2_union(empty(),h) -> h 8: app^2_union(app^3_edge(x,y,i),h) -> app^3_edge(x,y,app^2_union(i,h)) 9: app^4_reach(x,y,empty(),h) -> false() 10: app^4_reach(x,y,app^3_edge(u,v,i),h) -> app^5_if_reach_1(app^2_eq(x,u),x,y,app^3_edge(u,v,i),h) 11: app^5_if_reach_1(true(),x,y,app^3_edge(u,v,i),h) -> app^5_if_reach_2(app^2_eq(y,v),x,y,app^3_edge(u,v,i),h) 12: app^5_if_reach_1(false(),x,y,app^3_edge(u,v,i),h) -> app^4_reach(x,y,i,app^3_edge(u,v,h)) 13: app^5_if_reach_2(true(),x,y,app^3_edge(u,v,i),h) -> true() 14: app^5_if_reach_2(false(),x,y,app^3_edge(u,v,i),h) -> app^2_or(app^4_reach(x,y,i,h),app^4_reach(v,y,app^2_union(i,h),empty())) 15: app^2_map(f,nil()) -> nil() 16: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 17: app^2_filter(f,nil()) -> nil() 18: app^2_filter(f,app^2_cons(x,xs)) -> app^4_filter2(app(f,x),f,x,xs) 19: app^4_filter2(true(),f,x,xs) -> app^2_cons(x,app^2_filter(f,xs)) 20: app^4_filter2(false(),f,x,xs) -> app^2_filter(f,xs) 21: app(eq(),_1) ->= app^1_eq(_1) 22: app(app^1_eq(_1),_2) ->= app^2_eq(_1,_2) 23: app(cons(),_1) ->= app^1_cons(_1) 24: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 25: app(s(),_1) ->= app^1_s(_1) 26: app(union(),_1) ->= app^1_union(_1) 27: app(app^1_union(_1),_2) ->= app^2_union(_1,_2) 28: app(filter(),_1) ->= app^1_filter(_1) 29: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 30: app(if_reach_1(),_1) ->= app^1_if_reach_1(_1) 31: app(app^1_if_reach_1(_1),_2) ->= app^2_if_reach_1(_1,_2) 32: app(app^2_if_reach_1(_1,_2),_3) ->= app^3_if_reach_1(_1,_2,_3) 33: app(app^3_if_reach_1(_1,_2,_3),_4) ->= app^4_if_reach_1(_1,_2,_3,_4) 34: app(app^4_if_reach_1(_1,_2,_3,_4),_5) ->= app^5_if_reach_1(_1,_2,_3,_4,_5) 35: app(or(),_1) ->= app^1_or(_1) 36: app(app^1_or(_1),_2) ->= app^2_or(_1,_2) 37: app(map(),_1) ->= app^1_map(_1) 38: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 39: app(edge(),_1) ->= app^1_edge(_1) 40: app(app^1_edge(_1),_2) ->= app^2_edge(_1,_2) 41: app(app^2_edge(_1,_2),_3) ->= app^3_edge(_1,_2,_3) 42: app(reach(),_1) ->= app^1_reach(_1) 43: app(app^1_reach(_1),_2) ->= app^2_reach(_1,_2) 44: app(app^2_reach(_1,_2),_3) ->= app^3_reach(_1,_2,_3) 45: app(app^3_reach(_1,_2,_3),_4) ->= app^4_reach(_1,_2,_3,_4) 46: app(if_reach_2(),_1) ->= app^1_if_reach_2(_1) 47: app(app^1_if_reach_2(_1),_2) ->= app^2_if_reach_2(_1,_2) 48: app(app^2_if_reach_2(_1,_2),_3) ->= app^3_if_reach_2(_1,_2,_3) 49: app(app^3_if_reach_2(_1,_2,_3),_4) ->= app^4_if_reach_2(_1,_2,_3,_4) 50: app(app^4_if_reach_2(_1,_2,_3,_4),_5) ->= app^5_if_reach_2(_1,_2,_3,_4,_5) 51: app(filter2(),_1) ->= app^1_filter2(_1) 52: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 53: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 54: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) Number of strict rules: 20 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #2: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #3: #app^5_if_reach_1(true(),x,y,app^3_edge(u,v,i),h) -> #app^5_if_reach_2(app^2_eq(y,v),x,y,app^3_edge(u,v,i),h) #4: #app^5_if_reach_1(true(),x,y,app^3_edge(u,v,i),h) -> #app^2_eq(y,v) #5: #app(app^3_reach(_1,_2,_3),_4) ->? #app^4_reach(_1,_2,_3,_4) #6: #app^5_if_reach_1(false(),x,y,app^3_edge(u,v,i),h) -> #app^4_reach(x,y,i,app^3_edge(u,v,h)) #7: #app^5_if_reach_2(false(),x,y,app^3_edge(u,v,i),h) -> #app^2_or(app^4_reach(x,y,i,h),app^4_reach(v,y,app^2_union(i,h),empty())) #8: #app^5_if_reach_2(false(),x,y,app^3_edge(u,v,i),h) -> #app^4_reach(x,y,i,h) #9: #app^5_if_reach_2(false(),x,y,app^3_edge(u,v,i),h) -> #app^4_reach(v,y,app^2_union(i,h),empty()) #10: #app^5_if_reach_2(false(),x,y,app^3_edge(u,v,i),h) -> #app^2_union(i,h) #11: #app^4_filter2(false(),f,x,xs) -> #app^2_filter(f,xs) #12: #app^4_reach(x,y,app^3_edge(u,v,i),h) -> #app^5_if_reach_1(app^2_eq(x,u),x,y,app^3_edge(u,v,i),h) #13: #app^4_reach(x,y,app^3_edge(u,v,i),h) -> #app^2_eq(x,u) #14: #app(app^1_eq(_1),_2) ->? #app^2_eq(_1,_2) #15: #app(app^4_if_reach_1(_1,_2,_3,_4),_5) ->? #app^5_if_reach_1(_1,_2,_3,_4,_5) #16: #app(app^1_union(_1),_2) ->? #app^2_union(_1,_2) #17: #app^4_filter2(true(),f,x,xs) -> #app^2_filter(f,xs) #18: #app(app^1_or(_1),_2) ->? #app^2_or(_1,_2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard