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