Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903101
details
property
value
status
complete
benchmark
Ex15_Luc06_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rc
runtime (wallclock)
0.101664066315 seconds
cpu usage
0.346444362
max memory
1.5060992E7
stage attributes
key
value
output-size
5359
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: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) activate(n__g(X)) -> g(activate(X)) f(X) -> n__f(X) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,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: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) activate(n__g(X)) -> g(activate(X)) f(X) -> n__f(X) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: activate(x){x -> n__g(x)} = activate(n__g(x)) ->^+ g(activate(x)) = C[activate(x) = activate(x){}] ** Step 1.b:1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) activate(n__g(X)) -> g(activate(X)) f(X) -> n__f(X) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules ** Step 1.b:2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: a() -> n__a() activate(X) -> X activate(n__a()) -> a() activate(n__f(X)) -> f(X) activate(n__g(X)) -> g(activate(X)) f(X) -> n__f(X) f(n__f(n__a())) -> f(n__g(n__f(n__a()))) g(X) -> n__g(X) - Signature: {a/0,activate/1,f/1,g/1} / {n__a/0,n__f/1,n__g/1} - Obligation: innermost runtime complexity wrt. defined symbols {a,activate,f,g} and constructors {n__a,n__f,n__g} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 3. The enriched problem is compatible with follwoing automaton. a_0() -> 1 a_1() -> 1 a_1() -> 3 activate_0(2) -> 1 activate_1(2) -> 3 activate_1(4) -> 3 activate_2(4) -> 5 f_0(2) -> 1 f_1(2) -> 1 f_1(2) -> 3 f_1(3) -> 5 f_2(1) -> 3
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127