Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904647
details
property
value
status
complete
benchmark
lte.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.766319990158 seconds
cpu usage
3.078288648
max memory
5.2297728E7
stage attributes
key
value
output-size
4671
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
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^1)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^1)) + Considered Problem: - Strict TRS: even(Cons(x,Nil())) -> False() even(Cons(x',Cons(x,xs))) -> even(xs) even(Nil()) -> True() goal(x,y) -> and(lte(x,y),even(x)) lte(Cons(x,xs),Nil()) -> False() lte(Cons(x',xs'),Cons(x,xs)) -> lte(xs',xs) lte(Nil(),y) -> True() notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() - Weak TRS: and(False(),False()) -> False() and(False(),True()) -> False() and(True(),False()) -> False() and(True(),True()) -> True() - Signature: {and/2,even/1,goal/2,lte/2,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {and,even,goal,lte,notEmpty} and constructors {Cons,False ,Nil,True} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: even(Cons(x,Nil())) -> False() even(Cons(x',Cons(x,xs))) -> even(xs) even(Nil()) -> True() goal(x,y) -> and(lte(x,y),even(x)) lte(Cons(x,xs),Nil()) -> False() lte(Cons(x',xs'),Cons(x,xs)) -> lte(xs',xs) lte(Nil(),y) -> True() notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() - Weak TRS: and(False(),False()) -> False() and(False(),True()) -> False() and(True(),False()) -> False() and(True(),True()) -> True() - Signature: {and/2,even/1,goal/2,lte/2,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {and,even,goal,lte,notEmpty} and constructors {Cons,False ,Nil,True} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: even(z){z -> Cons(x,Cons(y,z))} = even(Cons(x,Cons(y,z))) ->^+ even(z) = C[even(z) = even(z){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: even(Cons(x,Nil())) -> False() even(Cons(x',Cons(x,xs))) -> even(xs) even(Nil()) -> True() goal(x,y) -> and(lte(x,y),even(x)) lte(Cons(x,xs),Nil()) -> False() lte(Cons(x',xs'),Cons(x,xs)) -> lte(xs',xs) lte(Nil(),y) -> True() notEmpty(Cons(x,xs)) -> True() notEmpty(Nil()) -> False() - Weak TRS: and(False(),False()) -> False() and(False(),True()) -> False() and(True(),False()) -> False() and(True(),True()) -> True() - Signature: {and/2,even/1,goal/2,lte/2,notEmpty/1} / {Cons/2,False/0,Nil/0,True/0} - Obligation: innermost runtime complexity wrt. defined symbols {and,even,goal,lte,notEmpty} and constructors {Cons,False ,Nil,True} + Applied Processor: Ara {araHeuristics = NoHeuristics, minDegree = 1, maxDegree = 2, araTimeout = 5, araRuleShifting = Nothing} + Details: Signatures used: ---------------- Cons :: ["A"(1) x "A"(1)] -(1)-> "A"(1) Cons :: ["A"(0) x "A"(0)] -(0)-> "A"(0) Cons :: ["A"(4) x "A"(4)] -(4)-> "A"(4) False :: [] -(0)-> "A"(0) Nil :: [] -(0)-> "A"(1) Nil :: [] -(0)-> "A"(4) Nil :: [] -(0)-> "A"(0) True :: [] -(0)-> "A"(0) and :: ["A"(0) x "A"(0)] -(0)-> "A"(0) even :: ["A"(1)] -(5)-> "A"(0)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807