Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904197
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
n035.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
198.109009981 seconds
cpu usage
771.463045046
max memory
3.851321344E9
stage attributes
key
value
output-size
2621
starexec-result
WORST_CASE(Omega(n^1),?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: function(if(),false(),x,y) -> function(plus(),function(third(),x,y,y),function(p(),x,x,y),s(y)) function(if(),true(),x,y) -> y function(iszero(),0(),dummy,dummy2) -> true() function(iszero(),s(x),dummy,dummy2) -> false() function(p(),0(),dummy,dummy2) -> 0() function(p(),s(0()),dummy,dummy2) -> 0() function(p(),s(s(x)),dummy,dummy2) -> s(function(p(),s(x),x,x)) function(plus(),dummy,x,y) -> function(if(),function(iszero(),x,x,x),x,y) function(third(),x,y,z) -> z - Signature: {function/4} / {0/0,false/0,if/0,iszero/0,p/0,plus/0,s/1,third/0,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {function} and constructors {0,false,if,iszero,p,plus,s ,third,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: function(if(),false(),x,y) -> function(plus(),function(third(),x,y,y),function(p(),x,x,y),s(y)) function(if(),true(),x,y) -> y function(iszero(),0(),dummy,dummy2) -> true() function(iszero(),s(x),dummy,dummy2) -> false() function(p(),0(),dummy,dummy2) -> 0() function(p(),s(0()),dummy,dummy2) -> 0() function(p(),s(s(x)),dummy,dummy2) -> s(function(p(),s(x),x,x)) function(plus(),dummy,x,y) -> function(if(),function(iszero(),x,x,x),x,y) function(third(),x,y,z) -> z - Signature: {function/4} / {0/0,false/0,if/0,iszero/0,p/0,plus/0,s/1,third/0,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {function} and constructors {0,false,if,iszero,p,plus,s ,third,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: function(p(),s(x),y,z){x -> s(x)} = function(p(),s(s(x)),y,z) ->^+ s(function(p(),s(x),x,x)) = C[function(p(),s(x),x,x) = function(p(),s(x),y,z){y -> x,z -> x}] WORST_CASE(Omega(n^1),?)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807