Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516960763
details
property
value
status
complete
benchmark
thiemann39.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n066.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.0775978565216 seconds
cpu usage
0.089037176
max memory
1.0727424E7
stage attributes
key
value
output-size
5577
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: a(a(divides(),0()),a(s(),y)) -> true() 2: a(a(divides(),a(s(),x)),a(s(),y)) -> a(a(a(div2(),x),a(s(),y)),y) 3: a(a(a(div2(),x),y),0()) -> a(a(divides(),x),y) 4: a(a(a(div2(),0()),y),a(s(),z)) -> false() 5: a(a(a(div2(),a(s(),x)),y),a(s(),z)) -> a(a(a(div2(),x),y),z) 6: a(a(filter(),f),nil()) -> nil() 7: a(a(filter(),f),a(a(cons(),x),xs)) -> a(a(a(if(),a(f,x)),x),a(a(filter(),f),xs)) 8: a(a(a(if(),true()),x),xs) -> a(a(cons(),x),xs) 9: a(a(a(if(),false()),x),xs) -> xs 10: a(a(not(),f),x) -> a(not2(),a(f,x)) 11: a(not2(),true()) -> false() 12: a(not2(),false()) -> true() 13: a(sieve(),nil()) -> nil() 14: a(sieve(),a(a(cons(),x),xs)) -> a(a(cons(),x),a(sieve(),a(a(filter(),a(not(),a(divides(),x))),xs))) Number of strict rules: 14 Direct poly ... failed. Freezing a 1: a❆2_divides(0(),a❆1_s(y)) -> true() 2: a❆2_divides(a❆1_s(x),a❆1_s(y)) -> a❆3_div2(x,a❆1_s(y),y) 3: a❆3_div2(x,y,0()) -> a❆2_divides(x,y) 4: a❆3_div2(0(),y,a❆1_s(z)) -> false() 5: a❆3_div2(a❆1_s(x),y,a❆1_s(z)) -> a❆3_div2(x,y,z) 6: a❆2_filter(f,nil()) -> nil() 7: a❆2_filter(f,a❆2_cons(x,xs)) -> a❆3_if(a(f,x),x,a❆2_filter(f,xs)) 8: a❆3_if(true(),x,xs) -> a❆2_cons(x,xs) 9: a❆3_if(false(),x,xs) -> xs 10: a❆2_not(f,x) -> a❆1_not2(a(f,x)) 11: a❆1_not2(true()) -> false() 12: a❆1_not2(false()) -> true() 13: a❆1_sieve(nil()) -> nil() 14: a❆1_sieve(a❆2_cons(x,xs)) -> a❆2_cons(x,a❆1_sieve(a❆2_filter(a❆1_not(a❆1_divides(x)),xs))) 15: a(if(),_1) ->= a❆1_if(_1) 16: a(a❆1_if(_1),_2) ->= a❆2_if(_1,_2) 17: a(a❆2_if(_1,_2),_3) ->= a❆3_if(_1,_2,_3) 18: a(cons(),_1) ->= a❆1_cons(_1) 19: a(a❆1_cons(_1),_2) ->= a❆2_cons(_1,_2) 20: a(s(),_1) ->= a❆1_s(_1) 21: a(div2(),_1) ->= a❆1_div2(_1) 22: a(a❆1_div2(_1),_2) ->= a❆2_div2(_1,_2) 23: a(a❆2_div2(_1,_2),_3) ->= a❆3_div2(_1,_2,_3) 24: a(filter(),_1) ->= a❆1_filter(_1) 25: a(a❆1_filter(_1),_2) ->= a❆2_filter(_1,_2) 26: a(not2(),_1) ->= a❆1_not2(_1) 27: a(divides(),_1) ->= a❆1_divides(_1) 28: a(a❆1_divides(_1),_2) ->= a❆2_divides(_1,_2) 29: a(sieve(),_1) ->= a❆1_sieve(_1) 30: a(not(),_1) ->= a❆1_not(_1) 31: a(a❆1_not(_1),_2) ->= a❆2_not(_1,_2) Number of strict rules: 14 Direct poly ... failed. Dependency Pairs: #1: #a❆2_divides(a❆1_s(x),a❆1_s(y)) -> #a❆3_div2(x,a❆1_s(y),y) #2: #a(sieve(),_1) ->? #a❆1_sieve(_1) #3: #a(a❆2_div2(_1,_2),_3) ->? #a❆3_div2(_1,_2,_3) #4: #a(a❆1_not(_1),_2) ->? #a❆2_not(_1,_2) #5: #a❆1_sieve(a❆2_cons(x,xs)) -> #a❆1_sieve(a❆2_filter(a❆1_not(a❆1_divides(x)),xs)) #6: #a❆1_sieve(a❆2_cons(x,xs)) -> #a❆2_filter(a❆1_not(a❆1_divides(x)),xs) #7: #a(a❆1_filter(_1),_2) ->? #a❆2_filter(_1,_2) #8: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a❆3_if(a(f,x),x,a❆2_filter(f,xs)) #9: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a(f,x) #10: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a❆2_filter(f,xs) #11: #a❆2_not(f,x) -> #a❆1_not2(a(f,x)) #12: #a❆2_not(f,x) -> #a(f,x) #13: #a❆3_div2(a❆1_s(x),y,a❆1_s(z)) -> #a❆3_div2(x,y,z) #14: #a(a❆1_divides(_1),_2) ->? #a❆2_divides(_1,_2) #15: #a(a❆2_if(_1,_2),_3) ->? #a❆3_if(_1,_2,_3) #16: #a(not2(),_1) ->? #a❆1_not2(_1) #17: #a❆3_div2(x,y,0()) -> #a❆2_divides(x,y) Number of SCCs: 2, DPs: 11 SCC { #1 #13 #17 } Sum... succeeded. a(x1,x2) w: (0) a❆1_filter(x1) w: (0) a❆1_div2(x1) w: (0) #a❆3_if(x1,x2,x3) w: (0) s() w: (0) a❆2_div2(x1,x2) w: (0) a❆3_if(x1,x2,x3) w: (0) a❆1_divides(x1) w: (0) false() w: (0) a❆1_cons(x1) w: (0) true() w: (0) #a❆1_not2(x1) w: (0) a❆2_if(x1,x2) w: (0) #a❆2_divides(x1,x2) w: (x1) a❆3_div2(x1,x2,x3) w: (0) a❆2_divides(x1,x2) w: (0) a❆1_s(x1) w: (2 + x1) a❆2_filter(x1,x2) w: (0) 0() w: (1) if() w: (0) a❆1_sieve(x1) w: (0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard