Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903598
details
property
value
status
complete
benchmark
Ex25_Luc06_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.104431867599 seconds
cpu usage
0.379709095
max memory
2.2962176E7
stage attributes
key
value
output-size
6819
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_tct_rc /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__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) g(X) -> n__g(X) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,g/1,h/1} / {n__d/1,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,g,h} and constructors {n__d,n__f,n__g} + 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__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) g(X) -> n__g(X) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,g/1,h/1} / {n__d/1,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,g,h} and constructors {n__d,n__f,n__g} + 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: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: activate(X) -> X activate(n__d(X)) -> d(X) activate(n__f(X)) -> f(activate(X)) activate(n__g(X)) -> g(X) c(X) -> d(activate(X)) d(X) -> n__d(X) f(X) -> n__f(X) f(f(X)) -> c(n__f(n__g(n__f(X)))) g(X) -> n__g(X) h(X) -> c(n__d(X)) - Signature: {activate/1,c/1,d/1,f/1,g/1,h/1} / {n__d/1,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {activate,c,d,f,g,h} and constructors {n__d,n__f,n__g} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 4. The enriched problem is compatible with follwoing automaton. activate_0(7) -> 1 activate_0(8) -> 1 activate_0(9) -> 1 activate_1(7) -> 10 activate_1(8) -> 10 activate_1(9) -> 10 activate_2(3) -> 11 activate_3(12) -> 14 activate_3(13) -> 15 c_0(7) -> 2 c_0(8) -> 2 c_0(9) -> 2 c_1(3) -> 6 c_2(12) -> 1 c_2(12) -> 10 d_0(7) -> 3 d_0(7) -> 11 d_0(8) -> 3 d_0(8) -> 11 d_0(9) -> 3 d_0(9) -> 11 d_1(7) -> 1 d_1(7) -> 10 d_1(8) -> 1 d_1(8) -> 10
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127