Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904511
details
property
value
status
complete
benchmark
#3.53b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
tct 2018-07-13
configuration
tct_rci
runtime (wallclock)
0.608240842819 seconds
cpu usage
2.541326119
max memory
3.8559744E7
stage attributes
key
value
output-size
9624
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: f(x,y,s(z)) -> s(f(0(),1(),z)) f(0(),1(),x) -> f(s(x),x,x) g(x,y) -> x g(x,y) -> y - Signature: {f/3,g/2} / {0/0,1/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,1,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: DecreasingLoops WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: f(x,y,s(z)) -> s(f(0(),1(),z)) f(0(),1(),x) -> f(s(x),x,x) g(x,y) -> x g(x,y) -> y - Signature: {f/3,g/2} / {0/0,1/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,1,s} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: f(x,y,z){z -> s(z)} = f(x,y,s(z)) ->^+ s(f(0(),1(),z)) = C[f(0(),1(),z) = f(x,y,z){x -> 0(),y -> 1()}] ** Step 1.b:1: DependencyPairs WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(x,y,s(z)) -> s(f(0(),1(),z)) f(0(),1(),x) -> f(s(x),x,x) g(x,y) -> x g(x,y) -> y - Signature: {f/3,g/2} / {0/0,1/0,s/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {0,1,s} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs f#(x,y,s(z)) -> c_1(f#(0(),1(),z)) f#(0(),1(),x) -> c_2(f#(s(x),x,x)) g#(x,y) -> c_3() g#(x,y) -> c_4() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: f#(x,y,s(z)) -> c_1(f#(0(),1(),z)) f#(0(),1(),x) -> c_2(f#(s(x),x,x)) g#(x,y) -> c_3() g#(x,y) -> c_4() - Weak TRS: f(x,y,s(z)) -> s(f(0(),1(),z)) f(0(),1(),x) -> f(s(x),x,x) g(x,y) -> x g(x,y) -> y - Signature: {f/3,g/2,f#/3,g#/2} / {0/0,1/0,s/1,c_1/1,c_2/1,c_3/0,c_4/0} - Obligation: innermost runtime complexity wrt. defined symbols {f#,g#} and constructors {0,1,s} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {3,4} by application of Pre({3,4}) = {}. Here rules are labelled as follows: 1: f#(x,y,s(z)) -> c_1(f#(0(),1(),z)) 2: f#(0(),1(),x) -> c_2(f#(s(x),x,x)) 3: g#(x,y) -> c_3() 4: g#(x,y) -> c_4() ** Step 1.b:3: RemoveWeakSuffixes WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: f#(x,y,s(z)) -> c_1(f#(0(),1(),z)) f#(0(),1(),x) -> c_2(f#(s(x),x,x)) - Weak DPs:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807