details

property	value
status	complete
benchmark	#3.8.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
configuration	Default
runtime (wallclock)	0.0923900604248 seconds
cpu usage	0.10352144
max memory	9568256.0

stage attributes

key	value
output-size	7336
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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(app(quot(),0()),app(s(),y)) -> 0() 4: app(app(quot(),app(s(),x)),app(s(),y)) -> app(s(),app(app(quot(),app(app(minus(),x),y)),app(s(),y))) 5: app(log(),app(s(),0())) -> 0() 6: app(log(),app(s(),app(s(),x))) -> app(s(),app(log(),app(s(),app(app(quot(),x),app(s(),app(s(),0())))))) 7: app(app(map(),f),nil()) -> nil() 8: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 9: app(app(filter(),f),nil()) -> nil() 10: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 11: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 12: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),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^2_quot(0(),app^1_s(y)) -> 0() 4: app^2_quot(app^1_s(x),app^1_s(y)) -> app^1_s(app^2_quot(app^2_minus(x,y),app^1_s(y))) 5: app^1_log(app^1_s(0())) -> 0() 6: app^1_log(app^1_s(app^1_s(x))) -> app^1_s(app^1_log(app^1_s(app^2_quot(x,app^1_s(app^1_s(0())))))) 7: app^2_map(f,nil()) -> nil() 8: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 9: app^2_filter(f,nil()) -> nil() 10: app^2_filter(f,app^2_cons(x,xs)) -> app^4_filter2(app(f,x),f,x,xs) 11: app^4_filter2(true(),f,x,xs) -> app^2_cons(x,app^2_filter(f,xs)) 12: app^4_filter2(false(),f,x,xs) -> app^2_filter(f,xs) 13: app(log(),_1) ->= app^1_log(_1) 14: app(cons(),_1) ->= app^1_cons(_1) 15: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 16: app(quot(),_1) ->= app^1_quot(_1) 17: app(app^1_quot(_1),_2) ->= app^2_quot(_1,_2) 18: app(s(),_1) ->= app^1_s(_1) 19: app(filter(),_1) ->= app^1_filter(_1) 20: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 21: app(map(),_1) ->= app^1_map(_1) 22: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 23: app(minus(),_1) ->= app^1_minus(_1) 24: app(app^1_minus(_1),_2) ->= app^2_minus(_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) 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_log(app^1_s(app^1_s(x))) -> #app^1_log(app^1_s(app^2_quot(x,app^1_s(app^1_s(0()))))) #3: #app^1_log(app^1_s(app^1_s(x))) -> #app^2_quot(x,app^1_s(app^1_s(0()))) #4: #app(log(),_1) ->? #app^1_log(_1) #5: #app^4_filter2(true(),f,x,xs) -> #app^2_filter(f,xs) #6: #app(app^1_minus(_1),_2) ->? #app^2_minus(_1,_2) #7: #app^4_filter2(false(),f,x,xs) -> #app^2_filter(f,xs) #8: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #9: #app^2_filter(f,app^2_cons(x,xs)) -> #app^4_filter2(app(f,x),f,x,xs) #10: #app^2_filter(f,app^2_cons(x,xs)) -> #app(f,x) #11: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #12: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #13: #app(app^1_quot(_1),_2) ->? #app^2_quot(_1,_2) #14: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #15: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) #16: #app^2_quot(app^1_s(x),app^1_s(y)) -> #app^2_quot(app^2_minus(x,y),app^1_s(y)) #17: #app^2_quot(app^1_s(x),app^1_s(y)) -> #app^2_minus(x,y) Number of SCCs: 4, DPs: 12 SCC { #1 } POLO(Sum)... succeeded. app^2_quot w: 0 #app^2_minus w: x2 s w: 0 #app^2_quot w: 0 app^1_cons w: 0 #app^2_map w: 0 #app^1_log w: 0 minus w: 0 app^1_log w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^1_filter2 w: 0 true w: 0 filter2 w: 0 log w: 0 0 w: 0 quot w: 0 #app^4_filter2 w: 0 app^1_quot w: 0 nil w: 0 #app w: 0 app^2_minus w: 0 map w: 0 app^1_filter w: 0 cons w: 0 popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Stand 20472