details

property	value
status	complete
benchmark	ttt1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n051.star.cs.uiowa.edu
space	Secret_05_TRS

run statistics

property	value
solver	tct 2018-07-13
configuration	tct_rc
runtime (wallclock)	0.33834695816 seconds
cpu usage	1.281289642
max memory	4.8111616E7

stage attributes

key	value
output-size	11871
starexec-result	WORST_CASE(?,O(1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?,O(1)) * Step 1: Sum WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: cons(x,y) -> x cons(x,y) -> y f(s(a()),s(b()),x) -> f(x,x,x) g(f(s(x),s(y),z)) -> g(f(x,y,z)) - Signature: {cons/2,f/3,g/1} / {a/0,b/0,s/1} - Obligation: runtime complexity wrt. defined symbols {cons,f,g} and constructors {a,b,s} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () * Step 2: DependencyPairs WORST_CASE(?,O(1)) + Considered Problem: - Strict TRS: cons(x,y) -> x cons(x,y) -> y f(s(a()),s(b()),x) -> f(x,x,x) g(f(s(x),s(y),z)) -> g(f(x,y,z)) - Signature: {cons/2,f/3,g/1} / {a/0,b/0,s/1} - Obligation: runtime complexity wrt. defined symbols {cons,f,g} and constructors {a,b,s} + Applied Processor: DependencyPairs {dpKind_ = WIDP} + Details: We add the following weak dependency pairs: Strict DPs cons#(x,y) -> c_1(x) cons#(x,y) -> c_2(y) f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) g#(f(s(x),s(y),z)) -> c_4(g#(f(x,y,z))) Weak DPs and mark the set of starting terms. * Step 3: UsableRules WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: cons#(x,y) -> c_1(x) cons#(x,y) -> c_2(y) f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) g#(f(s(x),s(y),z)) -> c_4(g#(f(x,y,z))) - Strict TRS: cons(x,y) -> x cons(x,y) -> y f(s(a()),s(b()),x) -> f(x,x,x) g(f(s(x),s(y),z)) -> g(f(x,y,z)) - Signature: {cons/2,f/3,g/1,cons#/2,f#/3,g#/1} / {a/0,b/0,s/1,c_1/1,c_2/1,c_3/1,c_4/1} - Obligation: runtime complexity wrt. defined symbols {cons#,f#,g#} and constructors {a,b,s} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: cons#(x,y) -> c_1(x) cons#(x,y) -> c_2(y) f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) * Step 4: PredecessorEstimationCP WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: cons#(x,y) -> c_1(x) cons#(x,y) -> c_2(y) f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) - Signature: {cons/2,f/3,g/1,cons#/2,f#/3,g#/1} / {a/0,b/0,s/1,c_1/1,c_2/1,c_3/1,c_4/1} - Obligation: runtime complexity wrt. defined symbols {cons#,f#,g#} and constructors {a,b,s} + Applied Processor: PredecessorEstimationCP {onSelectionCP = any intersect of rules of CDG leaf and strict-rules, withComplexityPair = NaturalMI {miDimension = 1, miDegree = 0, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing}} + Details: We first use the processor NaturalMI {miDimension = 1, miDegree = 0, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Nothing} to orient following rules strictly: 3: f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) The strictly oriented rules are moved into the weak component. ** Step 4.a:1: NaturalMI WORST_CASE(?,O(1)) + Considered Problem: - Strict DPs: cons#(x,y) -> c_1(x) cons#(x,y) -> c_2(y) f#(s(a()),s(b()),x) -> c_3(f#(x,x,x)) - Signature: {cons/2,f/3,g/1,cons#/2,f#/3,g#/1} / {a/0,b/0,s/1,c_1/1,c_2/1,c_3/1,c_4/1} - Obligation: runtime complexity wrt. defined symbols {cons#,f#,g#} and constructors {a,b,s} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 0, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just first alternative for predecessorEstimation on any intersect of rules of CDG leaf and strict-rules} + Details: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Full Rewri 10127