Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904403
details
property
value
status
complete
benchmark
isort-fold.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
hoca
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
7.06361818314 seconds
cpu usage
41.948295931
max memory
1.6447488E8
stage attributes
key
value
output-size
62994
starexec-result
WORST_CASE(Omega(n^1),O(n^3))
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^3)) * Step 1: Sum WORST_CASE(Omega(n^1),O(n^3)) + Considered Problem: - Strict TRS: cond_insert_ord_x_ys_1(False(),x0,x5,x2) -> Cons(x5,insert_ord#2(leq(),x0,x2)) cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1)) fold#3(insert_ord(x2),Nil()) -> Nil() fold#3(insert_ord(x6),Cons(x4,x2)) -> insert_ord#2(x6,x4,fold#3(insert_ord(x6),x2)) insert_ord#2(leq(),x2,Nil()) -> Cons(x2,Nil()) insert_ord#2(leq(),x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2) leq#2(0(),x8) -> True() leq#2(S(x12),0()) -> False() leq#2(S(x4),S(x2)) -> leq#2(x4,x2) main(x3) -> fold#3(insert_ord(leq()),x3) - Signature: {cond_insert_ord_x_ys_1/4,fold#3/2,insert_ord#2/3,leq#2/2,main/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0 ,insert_ord/1,leq/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,fold#3,insert_ord#2,leq#2 ,main} and constructors {0,Cons,False,Nil,S,True,insert_ord,leq} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond_insert_ord_x_ys_1(False(),x0,x5,x2) -> Cons(x5,insert_ord#2(leq(),x0,x2)) cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1)) fold#3(insert_ord(x2),Nil()) -> Nil() fold#3(insert_ord(x6),Cons(x4,x2)) -> insert_ord#2(x6,x4,fold#3(insert_ord(x6),x2)) insert_ord#2(leq(),x2,Nil()) -> Cons(x2,Nil()) insert_ord#2(leq(),x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2) leq#2(0(),x8) -> True() leq#2(S(x12),0()) -> False() leq#2(S(x4),S(x2)) -> leq#2(x4,x2) main(x3) -> fold#3(insert_ord(leq()),x3) - Signature: {cond_insert_ord_x_ys_1/4,fold#3/2,insert_ord#2/3,leq#2/2,main/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0 ,insert_ord/1,leq/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,fold#3,insert_ord#2,leq#2 ,main} and constructors {0,Cons,False,Nil,S,True,insert_ord,leq} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: fold#3(insert_ord(x),z){z -> Cons(y,z)} = fold#3(insert_ord(x),Cons(y,z)) ->^+ insert_ord#2(x,y,fold#3(insert_ord(x),z)) = C[fold#3(insert_ord(x),z) = fold#3(insert_ord(x),z){}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^3)) + Considered Problem: - Strict TRS: cond_insert_ord_x_ys_1(False(),x0,x5,x2) -> Cons(x5,insert_ord#2(leq(),x0,x2)) cond_insert_ord_x_ys_1(True(),x3,x2,x1) -> Cons(x3,Cons(x2,x1)) fold#3(insert_ord(x2),Nil()) -> Nil() fold#3(insert_ord(x6),Cons(x4,x2)) -> insert_ord#2(x6,x4,fold#3(insert_ord(x6),x2)) insert_ord#2(leq(),x2,Nil()) -> Cons(x2,Nil()) insert_ord#2(leq(),x6,Cons(x4,x2)) -> cond_insert_ord_x_ys_1(leq#2(x6,x4),x6,x4,x2) leq#2(0(),x8) -> True() leq#2(S(x12),0()) -> False() leq#2(S(x4),S(x2)) -> leq#2(x4,x2) main(x3) -> fold#3(insert_ord(leq()),x3) - Signature: {cond_insert_ord_x_ys_1/4,fold#3/2,insert_ord#2/3,leq#2/2,main/1} / {0/0,Cons/2,False/0,Nil/0,S/1,True/0 ,insert_ord/1,leq/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond_insert_ord_x_ys_1,fold#3,insert_ord#2,leq#2 ,main} and constructors {0,Cons,False,Nil,S,True,insert_ord,leq} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs cond_insert_ord_x_ys_1#(False(),x0,x5,x2) -> c_1(insert_ord#2#(leq(),x0,x2)) cond_insert_ord_x_ys_1#(True(),x3,x2,x1) -> c_2() fold#3#(insert_ord(x2),Nil()) -> c_3() fold#3#(insert_ord(x6),Cons(x4,x2)) -> c_4(insert_ord#2#(x6,x4,fold#3(insert_ord(x6),x2)) ,fold#3#(insert_ord(x6),x2)) insert_ord#2#(leq(),x2,Nil()) -> c_5() insert_ord#2#(leq(),x6,Cons(x4,x2)) -> c_6(cond_insert_ord_x_ys_1#(leq#2(x6,x4),x6,x4,x2),leq#2#(x6,x4)) leq#2#(0(),x8) -> c_7() leq#2#(S(x12),0()) -> c_8() leq#2#(S(x4),S(x2)) -> c_9(leq#2#(x4,x2)) main#(x3) -> c_10(fold#3#(insert_ord(leq()),x3)) Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^3)) + Considered Problem: - Strict DPs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807