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