Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904942
details
property
value
status
complete
benchmark
#3.42.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
2.17690491676 seconds
cpu usage
9.337071115
max memory
1.1589632E8
stage attributes
key
value
output-size
3642
starexec-result
WORST_CASE(Omega(n^1),O(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),O(n^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: conv(0()) -> cons(nil(),0()) conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x))) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) lastbit(0()) -> 0() lastbit(s(0())) -> s(0()) lastbit(s(s(x))) -> lastbit(x) - Signature: {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: conv(0()) -> cons(nil(),0()) conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x))) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) lastbit(0()) -> 0() lastbit(s(0())) -> s(0()) lastbit(s(s(x))) -> lastbit(x) - Signature: {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: half(x){x -> s(s(x))} = half(s(s(x))) ->^+ s(half(x)) = C[half(x) = half(x){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: conv(0()) -> cons(nil(),0()) conv(s(x)) -> cons(conv(half(s(x))),lastbit(s(x))) half(0()) -> 0() half(s(0())) -> 0() half(s(s(x))) -> s(half(x)) lastbit(0()) -> 0() lastbit(s(0())) -> s(0()) lastbit(s(s(x))) -> lastbit(x) - Signature: {conv/1,half/1,lastbit/1} / {0/0,cons/2,nil/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {conv,half,lastbit} and constructors {0,cons,nil,s} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- 0 :: [] -(0)-> "A"(9) 0 :: [] -(0)-> "A"(5) 0 :: [] -(0)-> "A"(1) 0 :: [] -(0)-> "A"(0) cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0) conv :: ["A"(9)] -(1)-> "A"(0) half :: ["A"(5)] -(1)-> "A"(9) lastbit :: ["A"(1)] -(1)-> "A"(0) nil :: [] -(0)-> "A"(0) s :: ["A"(9)] -(9)-> "A"(9) s :: ["A"(5)] -(5)-> "A"(5) s :: ["A"(1)] -(1)-> "A"(1) s :: ["A"(0)] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "0_A" :: [] -(0)-> "A"(0) "cons_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(0) "nil_A" :: [] -(0)-> "A"(0) "s_A" :: ["A"(0)] -(0)-> "A"(0) WORST_CASE(Omega(n^1),O(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