Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904187
details
property
value
status
complete
benchmark
JFP_Ex51.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
AProVE_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
26.4024031162 seconds
cpu usage
105.260234238
max memory
3.5213312E8
stage attributes
key
value
output-size
130175
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),O(n^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: div_active(x,y) -> div(x,y) div_active(0(),s(y)) -> 0() div_active(s(x),s(y)) -> if_active(ge_active(x,y),s(div(minus(x,y),s(y))),0()) ge_active(x,y) -> ge(x,y) ge_active(x,0()) -> true() ge_active(0(),s(y)) -> false() ge_active(s(x),s(y)) -> ge_active(x,y) if_active(x,y,z) -> if(x,y,z) if_active(false(),x,y) -> mark(y) if_active(true(),x,y) -> mark(x) mark(0()) -> 0() mark(div(x,y)) -> div_active(mark(x),y) mark(ge(x,y)) -> ge_active(x,y) mark(if(x,y,z)) -> if_active(mark(x),y,z) mark(minus(x,y)) -> minus_active(x,y) mark(s(x)) -> s(mark(x)) minus_active(x,y) -> minus(x,y) minus_active(0(),y) -> 0() minus_active(s(x),s(y)) -> minus_active(x,y) - Signature: {div_active/2,ge_active/2,if_active/3,mark/1,minus_active/2} / {0/0,div/2,false/0,ge/2,if/3,minus/2,s/1 ,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div_active,ge_active,if_active,mark ,minus_active} and constructors {0,div,false,ge,if,minus,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: div_active(x,y) -> div(x,y) div_active(0(),s(y)) -> 0() div_active(s(x),s(y)) -> if_active(ge_active(x,y),s(div(minus(x,y),s(y))),0()) ge_active(x,y) -> ge(x,y) ge_active(x,0()) -> true() ge_active(0(),s(y)) -> false() ge_active(s(x),s(y)) -> ge_active(x,y) if_active(x,y,z) -> if(x,y,z) if_active(false(),x,y) -> mark(y) if_active(true(),x,y) -> mark(x) mark(0()) -> 0() mark(div(x,y)) -> div_active(mark(x),y) mark(ge(x,y)) -> ge_active(x,y) mark(if(x,y,z)) -> if_active(mark(x),y,z) mark(minus(x,y)) -> minus_active(x,y) mark(s(x)) -> s(mark(x)) minus_active(x,y) -> minus(x,y) minus_active(0(),y) -> 0() minus_active(s(x),s(y)) -> minus_active(x,y) - Signature: {div_active/2,ge_active/2,if_active/3,mark/1,minus_active/2} / {0/0,div/2,false/0,ge/2,if/3,minus/2,s/1 ,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div_active,ge_active,if_active,mark ,minus_active} and constructors {0,div,false,ge,if,minus,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: ge_active(x,y){x -> s(x),y -> s(y)} = ge_active(s(x),s(y)) ->^+ ge_active(x,y) = C[ge_active(x,y) = ge_active(x,y){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: div_active(x,y) -> div(x,y) div_active(0(),s(y)) -> 0() div_active(s(x),s(y)) -> if_active(ge_active(x,y),s(div(minus(x,y),s(y))),0()) ge_active(x,y) -> ge(x,y) ge_active(x,0()) -> true() ge_active(0(),s(y)) -> false() ge_active(s(x),s(y)) -> ge_active(x,y) if_active(x,y,z) -> if(x,y,z) if_active(false(),x,y) -> mark(y) if_active(true(),x,y) -> mark(x) mark(0()) -> 0() mark(div(x,y)) -> div_active(mark(x),y) mark(ge(x,y)) -> ge_active(x,y) mark(if(x,y,z)) -> if_active(mark(x),y,z) mark(minus(x,y)) -> minus_active(x,y) mark(s(x)) -> s(mark(x)) minus_active(x,y) -> minus(x,y) minus_active(0(),y) -> 0() minus_active(s(x),s(y)) -> minus_active(x,y) - Signature: {div_active/2,ge_active/2,if_active/3,mark/1,minus_active/2} / {0/0,div/2,false/0,ge/2,if/3,minus/2,s/1 ,true/0}
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807