Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904556
details
property
value
status
complete
benchmark
dfs-flatten.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
hoca
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.499948978424 seconds
cpu usage
2.033904887
max memory
5.6889344E7
stage attributes
key
value
output-size
3671
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: dfsAcc#3(Leaf(x8),x16) -> Cons(x8,x16) dfsAcc#3(Node(x6,x4),x2) -> dfsAcc#3(x4,dfsAcc#3(x6,x2)) main(x1) -> revApp#2(dfsAcc#3(x1,Nil()),Nil()) revApp#2(Cons(x6,x4),x2) -> revApp#2(x4,Cons(x6,x2)) revApp#2(Nil(),x16) -> x16 - Signature: {dfsAcc#3/2,main/1,revApp#2/2} / {Cons/2,Leaf/1,Nil/0,Node/2} - Obligation: innermost runtime complexity wrt. defined symbols {dfsAcc#3,main,revApp#2} and constructors {Cons,Leaf,Nil ,Node} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: dfsAcc#3(Leaf(x8),x16) -> Cons(x8,x16) dfsAcc#3(Node(x6,x4),x2) -> dfsAcc#3(x4,dfsAcc#3(x6,x2)) main(x1) -> revApp#2(dfsAcc#3(x1,Nil()),Nil()) revApp#2(Cons(x6,x4),x2) -> revApp#2(x4,Cons(x6,x2)) revApp#2(Nil(),x16) -> x16 - Signature: {dfsAcc#3/2,main/1,revApp#2/2} / {Cons/2,Leaf/1,Nil/0,Node/2} - Obligation: innermost runtime complexity wrt. defined symbols {dfsAcc#3,main,revApp#2} and constructors {Cons,Leaf,Nil ,Node} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: dfsAcc#3(y,z){y -> Node(x,y)} = dfsAcc#3(Node(x,y),z) ->^+ dfsAcc#3(y,dfsAcc#3(x,z)) = C[dfsAcc#3(y,dfsAcc#3(x,z)) = dfsAcc#3(y,z){z -> dfsAcc#3(x,z)}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: dfsAcc#3(Leaf(x8),x16) -> Cons(x8,x16) dfsAcc#3(Node(x6,x4),x2) -> dfsAcc#3(x4,dfsAcc#3(x6,x2)) main(x1) -> revApp#2(dfsAcc#3(x1,Nil()),Nil()) revApp#2(Cons(x6,x4),x2) -> revApp#2(x4,Cons(x6,x2)) revApp#2(Nil(),x16) -> x16 - Signature: {dfsAcc#3/2,main/1,revApp#2/2} / {Cons/2,Leaf/1,Nil/0,Node/2} - Obligation: innermost runtime complexity wrt. defined symbols {dfsAcc#3,main,revApp#2} and constructors {Cons,Leaf,Nil ,Node} + 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"(0)] -(0)-> "A"(0) Leaf :: ["A"(0)] -(15)-> "A"(15) Nil :: [] -(0)-> "A"(15) Nil :: [] -(0)-> "A"(8) Node :: ["A"(15) x "A"(15)] -(15)-> "A"(15) dfsAcc#3 :: ["A"(15) x "A"(15)] -(1)-> "A"(15) main :: ["A"(15)] -(8)-> "A"(0) revApp#2 :: ["A"(15) x "A"(0)] -(1)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "Cons_A" :: ["A"(0) x "A"(1)] -(1)-> "A"(1) "Leaf_A" :: ["A"(0)] -(1)-> "A"(1) "Nil_A" :: [] -(0)-> "A"(1) "Node_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1) 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