Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710849
details
property
value
status
complete
benchmark
aprove3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.146868944168 seconds
cpu usage
0.173408826
max memory
1.4876672E7
stage attributes
key
value
output-size
3796
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: function(iszero(),0(),dummy,dummy2) -> true() 2: function(iszero(),s(x),dummy,dummy2) -> false() 3: function(p(),0(),dummy,dummy2) -> 0() 4: function(p(),s(0()),dummy,dummy2) -> 0() 5: function(p(),s(s(x)),dummy,dummy2) -> s(function(p(),s(x),x,x)) 6: function(plus(),dummy,x,y) -> function(if(),function(iszero(),x,x,x),x,y) 7: function(if(),true(),x,y) -> y 8: function(if(),false(),x,y) -> function(plus(),function(third(),x,y,y),function(p(),x,x,y),s(y)) 9: function(third(),x,y,z) -> z Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying function 1: function^1_iszero(0(),dummy,dummy2) -> true() 2: function^1_iszero(s(x),dummy,dummy2) -> false() 3: function^1_p(0(),dummy,dummy2) -> 0() 4: function^1_p(s(0()),dummy,dummy2) -> 0() 5: function^1_p(s(s(x)),dummy,dummy2) -> s(function^1_p(s(x),x,x)) 6: function^1_plus(dummy,x,y) -> function^1_if(function^1_iszero(x,x,x),x,y) 7: function^1_if(true(),x,y) -> y 8: function^1_if(false(),x,y) -> function^1_plus(function^1_third(x,y,y),function^1_p(x,x,y),s(y)) 9: function^1_third(x,y,z) -> z 10: function(plus(),_3,_4,_5) ->= function^1_plus(_3,_4,_5) 11: function(p(),_3,_4,_5) ->= function^1_p(_3,_4,_5) 12: function(if(),_3,_4,_5) ->= function^1_if(_3,_4,_5) 13: function(third(),_3,_4,_5) ->= function^1_third(_3,_4,_5) 14: function(iszero(),_3,_4,_5) ->= function^1_iszero(_3,_4,_5) Number of strict rules: 9 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #function^1_plus(dummy,x,y) -> #function^1_if(function^1_iszero(x,x,x),x,y) #2: #function^1_plus(dummy,x,y) -> #function^1_iszero(x,x,x) #3: #function(third(),_3,_4,_5) ->? #function^1_third(_3,_4,_5) #4: #function(p(),_3,_4,_5) ->? #function^1_p(_3,_4,_5) #5: #function(if(),_3,_4,_5) ->? #function^1_if(_3,_4,_5) #6: #function(iszero(),_3,_4,_5) ->? #function^1_iszero(_3,_4,_5) #7: #function(plus(),_3,_4,_5) ->? #function^1_plus(_3,_4,_5) #8: #function^1_p(s(s(x)),dummy,dummy2) -> #function^1_p(s(x),x,x) #9: #function^1_if(false(),x,y) -> #function^1_plus(function^1_third(x,y,y),function^1_p(x,x,y),s(y)) #10: #function^1_if(false(),x,y) -> #function^1_third(x,y,y) #11: #function^1_if(false(),x,y) -> #function^1_p(x,x,y) Number of SCCs: 2, DPs: 3 SCC { #8 } POLO(Sum)... succeeded. s w: x1 + 1 function^1_third w: 0 false w: 0 #function w: 0 third w: 0 function^1_p w: 0 iszero w: 0 true w: 0 function w: 0 function^1_plus w: 0 p w: 0 0 w: 0 if w: 0 function^1_iszero w: 0 function^1_if w: 0 #function^1_iszero w: 0 #function^1_plus w: 0 plus w: 0 #function^1_third w: 0 #function^1_p w: x1 #function^1_if w: 0 USABLE RULES: { } Removed DPs: #8 Number of SCCs: 1, DPs: 2 SCC { #1 #9 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. s w: max(x1 + 6, 0) function^1_third w: max(x3 + 2, 0) false w: 4 #function w: max(x3 - 1, 0) third w: 0 function^1_p w: max(x1 - 1, 0) iszero w: 0 true w: 0 function w: max(x2 - 1, 0) function^1_plus w: 0 p w: 0 0 w: 0 if w: 0 function^1_iszero w: max(x1 - 2, 0) function^1_if w: 0 #function^1_iszero w: 0 #function^1_plus w: max(x2 - 2, 0) plus w: 0 #function^1_third w: 0 #function^1_p w: 0 #function^1_if w: max(x1 - 1, x2 - 2, 0) USABLE RULES: { 1..5 } Removed DPs: #9
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472