Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904438
details
property
value
status
timeout (wallclock)
benchmark
thiemann34.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
space
AProVE_07
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
294.589622974 seconds
cpu usage
1208.11229067
max memory
3.760349184E9
stage attributes
unavailable
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: div(0(),0(),z) -> true() div(0(),s(x),z) -> false() div(s(x),0(),s(z)) -> div(s(x),s(z),s(z)) div(s(x),s(y),z) -> div(x,y,z) divides(x,y) -> div(x,y,y) gt(0(),y) -> false() gt(s(x),0()) -> true() gt(s(x),s(y)) -> gt(x,y) if1(false(),x,y) -> true() if1(true(),x,y) -> if2(divides(x,y),x,y) if2(false(),x,y) -> test(x,s(y)) if2(true(),x,y) -> false() prime(x) -> test(x,s(s(0()))) test(x,y) -> if1(gt(x,y),x,y) - Signature: {div/3,divides/2,gt/2,if1/3,if2/3,prime/1,test/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div,divides,gt,if1,if2,prime,test} and constructors {0 ,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: div(0(),0(),z) -> true() div(0(),s(x),z) -> false() div(s(x),0(),s(z)) -> div(s(x),s(z),s(z)) div(s(x),s(y),z) -> div(x,y,z) divides(x,y) -> div(x,y,y) gt(0(),y) -> false() gt(s(x),0()) -> true() gt(s(x),s(y)) -> gt(x,y) if1(false(),x,y) -> true() if1(true(),x,y) -> if2(divides(x,y),x,y) if2(false(),x,y) -> test(x,s(y)) if2(true(),x,y) -> false() prime(x) -> test(x,s(s(0()))) test(x,y) -> if1(gt(x,y),x,y) - Signature: {div/3,divides/2,gt/2,if1/3,if2/3,prime/1,test/2} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {div,divides,gt,if1,if2,prime,test} and constructors {0 ,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: div(x,y,z){x -> s(x),y -> s(y)} = div(s(x),s(y),z) ->^+ div(x,y,z) = C[div(x,y,z) = div(x,y,z){}] 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