Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381905290
details
property
value
status
complete
benchmark
ExConc_Zan97_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n049.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.282037973404 seconds
cpu usage
1.065624233
max memory
2.28352E7
stage attributes
key
value
output-size
3112
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: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__h(X)) -> h(activate(X)) f(X) -> g(n__h(n__f(X))) f(X) -> n__f(X) h(X) -> n__h(X) - Signature: {activate/1,f/1,h/1} / {g/1,n__f/1,n__h/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,h} and constructors {g,n__f,n__h} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__h(X)) -> h(activate(X)) f(X) -> g(n__h(n__f(X))) f(X) -> n__f(X) h(X) -> n__h(X) - Signature: {activate/1,f/1,h/1} / {g/1,n__f/1,n__h/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,h} and constructors {g,n__f,n__h} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__f(x)} = activate(n__f(x)) ->^+ f(activate(x)) = C[activate(x) = activate(x){}] ** Step 1.b:1: Ara WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__f(X)) -> f(activate(X)) activate(n__h(X)) -> h(activate(X)) f(X) -> g(n__h(n__f(X))) f(X) -> n__f(X) h(X) -> n__h(X) - Signature: {activate/1,f/1,h/1} / {g/1,n__f/1,n__h/1} - Obligation: innermost runtime complexity wrt. defined symbols {activate,f,h} and constructors {g,n__f,n__h} + Applied Processor: Ara {araHeuristics = Heuristics, minDegree = 1, maxDegree = 2, araTimeout = 3, araRuleShifting = Nothing} + Details: Signatures used: ---------------- activate :: ["A"(2)] -(1)-> "A"(0) f :: ["A"(0)] -(1)-> "A"(0) g :: ["A"(0)] -(0)-> "A"(0) h :: ["A"(0)] -(1)-> "A"(0) n__f :: ["A"(2)] -(2)-> "A"(2) n__f :: ["A"(0)] -(0)-> "A"(0) n__h :: ["A"(2)] -(2)-> "A"(2) n__h :: ["A"(0)] -(0)-> "A"(0) Cost-free Signatures used: -------------------------- Base Constructor Signatures used: --------------------------------- "g_A" :: ["A"(0)] -(0)-> "A"(0) "n__f_A" :: ["A"(0)] -(0)-> "A"(0) "n__h_A" :: ["A"(0)] -(0)-> "A"(0) 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