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