Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904768
details
property
value
status
complete
benchmark
evenodd.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.36468911171 seconds
cpu usage
1.368460777
max memory
4.1721856E7
stage attributes
key
value
output-size
2659
starexec-result
WORST_CASE(?,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(?,O(n^1)) * Step 1: Sum WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: even(Cons(x,xs)) -> odd(xs) even(Nil()) -> True() evenodd(x) -> even(x) notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() odd(Cons(x,xs)) -> even(xs) odd(Nil()) -> False() - Signature: {even/1,evenodd/1,notEmpty/1,odd/1} / {Cons/2,False/0,Nil/0,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {even,evenodd,notEmpty,odd} and constructors {Cons,False ,Nil,True} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: even(Cons(x,xs)) -> odd(xs) even(Nil()) -> True() evenodd(x) -> even(x) notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() odd(Cons(x,xs)) -> even(xs) odd(Nil()) -> False() - Signature: {even/1,evenodd/1,notEmpty/1,odd/1} / {Cons/2,False/0,Nil/0,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {even,evenodd,notEmpty,odd} and constructors {Cons,False ,Nil,True} + Applied Processor: Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing} + Details: Signatures used: ---------------- Cons :: ["A"(0) x "A"(15)] -(15)-> "A"(15) Cons :: ["A"(0) x "A"(3)] -(3)-> "A"(3) False :: [] -(0)-> "A"(14) Nil :: [] -(0)-> "A"(15) Nil :: [] -(0)-> "A"(3) True :: [] -(0)-> "A"(14) True :: [] -(0)-> "A"(6) even :: ["A"(15)] -(15)-> "A"(14) evenodd :: ["A"(15)] -(16)-> "A"(0) notEmpty :: ["A"(3)] -(5)-> "A"(0) odd :: ["A"(15)] -(15)-> "A"(14) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "Cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1) "False_A" :: [] -(0)-> "A"(1) "Nil_A" :: [] -(0)-> "A"(1) "True_A" :: [] -(0)-> "A"(1) WORST_CASE(?,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