Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904699
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
n070.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.516957998276 seconds
cpu usage
2.141450689
max memory
2.6968064E7
stage attributes
key
value
output-size
15535
starexec-result
WORST_CASE(Omega(n^1),O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_tct_rci /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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: innermost 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: innermost 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: DependencyPairs 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: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs a#() -> c_1() activate#(X) -> c_2() activate#(n__a()) -> c_3(a#()) activate#(n__f(X)) -> c_4(f#(X)) activate#(n__g(X)) -> c_5(g#(activate(X)),activate#(X)) f#(X) -> c_6() f#(n__f(n__a())) -> c_7(f#(n__g(n__f(n__a())))) g#(X) -> c_8() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: a#() -> c_1() activate#(X) -> c_2() activate#(n__a()) -> c_3(a#()) activate#(n__f(X)) -> c_4(f#(X)) activate#(n__g(X)) -> c_5(g#(activate(X)),activate#(X)) f#(X) -> c_6() f#(n__f(n__a())) -> c_7(f#(n__g(n__f(n__a())))) g#(X) -> c_8() - Weak 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)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807