Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713461
details
property
value
status
complete
benchmark
mapDivMinus.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Applicative_05
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0513589382172 seconds
cpu usage
0.057856373
max memory
9277440.0
stage attributes
key
value
output-size
3574
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(map(),f),nil()) -> nil() 2: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 3: app(app(minus(),x),0()) -> x 4: app(app(minus(),app(s(),x)),app(s(),y)) -> app(app(minus(),x),y) 5: app(app(div(),0()),app(s(),y)) -> 0() 6: app(app(div(),app(s(),x)),app(s(),y)) -> app(s(),app(app(div(),app(app(minus(),x),y)),app(s(),y))) Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_map(f,nil()) -> nil() 2: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 3: app^2_minus(x,0()) -> x 4: app^2_minus(app^1_s(x),app^1_s(y)) -> app^2_minus(x,y) 5: app^2_div(0(),app^1_s(y)) -> 0() 6: app^2_div(app^1_s(x),app^1_s(y)) -> app^1_s(app^2_div(app^2_minus(x,y),app^1_s(y))) 7: app(cons(),_1) ->= app^1_cons(_1) 8: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 9: app(div(),_1) ->= app^1_div(_1) 10: app(app^1_div(_1),_2) ->= app^2_div(_1,_2) 11: app(s(),_1) ->= app^1_s(_1) 12: app(minus(),_1) ->= app^1_minus(_1) 13: app(app^1_minus(_1),_2) ->= app^2_minus(_1,_2) 14: app(map(),_1) ->= app^1_map(_1) 15: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) Number of strict rules: 6 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #2: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) #3: #app^2_div(app^1_s(x),app^1_s(y)) -> #app^2_div(app^2_minus(x,y),app^1_s(y)) #4: #app^2_div(app^1_s(x),app^1_s(y)) -> #app^2_minus(x,y) #5: #app(app^1_minus(_1),_2) ->? #app^2_minus(_1,_2) #6: #app(app^1_div(_1),_2) ->? #app^2_div(_1,_2) #7: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #8: #app^2_minus(app^1_s(x),app^1_s(y)) -> #app^2_minus(x,y) Number of SCCs: 3, DPs: 5 SCC { #8 } POLO(Sum)... succeeded. app^1_div w: 0 #app^2_minus w: x1 + x2 s w: 0 app^1_cons w: 0 #app^2_map w: 0 minus w: 0 div w: 0 0 w: 0 nil w: 0 #app w: 0 #app^2_div w: 0 app^2_minus w: 0 map w: 0 app^2_div w: 0 cons w: 0 app^1_minus w: 0 app^1_map w: 0 app^2_cons w: 0 app^1_s w: x1 + 1 app^2_map w: 0 app w: 0 USABLE RULES: { } Removed DPs: #8 Number of SCCs: 2, DPs: 4 SCC { #3 } POLO(Sum)... succeeded. app^1_div w: 0 #app^2_minus w: 0 s w: 0 app^1_cons w: 0 #app^2_map w: 0 minus w: 0 div w: 0 0 w: 1 nil w: 0 #app w: 0 #app^2_div w: x1 app^2_minus w: x1 + 1 map w: 0 app^2_div w: 0 cons w: 0 app^1_minus w: 0 app^1_map w: 0 app^2_cons w: 0 app^1_s w: x1 + 2 app^2_map w: 0 app w: 0 USABLE RULES: { 3 4 } Removed DPs: #3 Number of SCCs: 1, DPs: 3 SCC { #1 #2 #7 } POLO(Sum)... succeeded. app^1_div w: 0 #app^2_minus w: 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472