/export/starexec/sandbox/solver/bin/starexec_run_tct_rci /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1),?) * Step 1: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond,odd,p} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond,odd,p} and constructors {0,false,s,true} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:2: DecreasingLoops. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond,odd,p} and constructors {0,false,s,true} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: odd(x){x -> s(s(x))} = odd(s(s(x))) ->^+ odd(x) = C[odd(x) = odd(x){}] ** Step 1.b:1: DependencyPairs. MAYBE + Considered Problem: - Strict TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1} / {0/0,false/0,s/1,true/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond,odd,p} and constructors {0,false,s,true} + Applied Processor: DependencyPairs {dpKind_ = DT} + Details: We add the following dependency tuples: Strict DPs cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) odd#(0()) -> c_2() odd#(s(0())) -> c_3() odd#(s(s(x))) -> c_4(odd#(x)) p#(0()) -> c_5() p#(s(x)) -> c_6() Weak DPs and mark the set of starting terms. ** Step 1.b:2: PredecessorEstimation. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) odd#(0()) -> c_2() odd#(s(0())) -> c_3() odd#(s(s(x))) -> c_4(odd#(x)) p#(0()) -> c_5() p#(s(x)) -> c_6() - Weak TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: PredecessorEstimation {onSelection = all simple predecessor estimation selector} + Details: We estimate the number of application of {2,3,5,6} by application of Pre({2,3,5,6}) = {1,4}. Here rules are labelled as follows: 1: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) 2: odd#(0()) -> c_2() 3: odd#(s(0())) -> c_3() 4: odd#(s(s(x))) -> c_4(odd#(x)) 5: p#(0()) -> c_5() 6: p#(s(x)) -> c_6() ** Step 1.b:3: RemoveWeakSuffixes. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) odd#(s(s(x))) -> c_4(odd#(x)) - Weak DPs: odd#(0()) -> c_2() odd#(s(0())) -> c_3() p#(0()) -> c_5() p#(s(x)) -> c_6() - Weak TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: RemoveWeakSuffixes + Details: Consider the dependency graph 1:S:cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) -->_2 odd#(s(s(x))) -> c_4(odd#(x)):2 -->_3 p#(s(x)) -> c_6():6 -->_3 p#(0()) -> c_5():5 -->_2 odd#(s(0())) -> c_3():4 -->_2 odd#(0()) -> c_2():3 -->_1 cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)):1 2:S:odd#(s(s(x))) -> c_4(odd#(x)) -->_1 odd#(s(0())) -> c_3():4 -->_1 odd#(0()) -> c_2():3 -->_1 odd#(s(s(x))) -> c_4(odd#(x)):2 3:W:odd#(0()) -> c_2() 4:W:odd#(s(0())) -> c_3() 5:W:p#(0()) -> c_5() 6:W:p#(s(x)) -> c_6() The following weak DPs constitute a sub-graph of the DG that is closed under successors. The DPs are removed. 5: p#(0()) -> c_5() 6: p#(s(x)) -> c_6() 3: odd#(0()) -> c_2() 4: odd#(s(0())) -> c_3() ** Step 1.b:4: SimplifyRHS. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) odd#(s(s(x))) -> c_4(odd#(x)) - Weak TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/3,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)) -->_2 odd#(s(s(x))) -> c_4(odd#(x)):2 -->_1 cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x),p#(x)):1 2:S:odd#(s(s(x))) -> c_4(odd#(x)) -->_1 odd#(s(s(x))) -> c_4(odd#(x)):2 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) ** Step 1.b:5: UsableRules. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) odd#(s(s(x))) -> c_4(odd#(x)) - Weak TRS: cond(true(),x) -> cond(odd(x),p(x)) odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: UsableRules + Details: We replace rewrite rules by usable rules: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) odd#(s(s(x))) -> c_4(odd#(x)) ** Step 1.b:6: DecomposeDG. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) odd#(s(s(x))) -> c_4(odd#(x)) - Weak TRS: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: DecomposeDG {onSelection = all below first cut in WDG, onUpper = Nothing, onLower = Nothing} + Details: We decompose the input problem according to the dependency graph into the upper component cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) and a lower component odd#(s(s(x))) -> c_4(odd#(x)) Further, following extension rules are added to the lower component. cond#(true(),x) -> cond#(odd(x),p(x)) cond#(true(),x) -> odd#(x) *** Step 1.b:6.a:1: SimplifyRHS. MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) - Weak TRS: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: SimplifyRHS + Details: Consider the dependency graph 1:S:cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)) -->_1 cond#(true(),x) -> c_1(cond#(odd(x),p(x)),odd#(x)):1 Due to missing edges in the depndency graph, the right-hand sides of following rules could be simplified: cond#(true(),x) -> c_1(cond#(odd(x),p(x))) *** Step 1.b:6.a:2: Failure MAYBE + Considered Problem: - Strict DPs: cond#(true(),x) -> c_1(cond#(odd(x),p(x))) - Weak TRS: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/1,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: EmptyProcessor + Details: The problem is still open. *** Step 1.b:6.b:1: WeightGap. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict DPs: odd#(s(s(x))) -> c_4(odd#(x)) - Weak DPs: cond#(true(),x) -> cond#(odd(x),p(x)) cond#(true(),x) -> odd#(x) - Weak TRS: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: WeightGap {wgDimension = 1, wgDegree = 1, wgKind = Algebraic, wgUArgs = UArgs, wgOn = WgOnAny} + Details: The weightgap principle applies using the following constant growth matrix-interpretation: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(cond#) = {1,2}, uargs(c_4) = {1} Following symbols are considered usable: all TcT has computed the following interpretation: p(0) = [0] p(cond) = [1] x1 + [2] x2 + [0] p(false) = [1] p(odd) = [4] p(p) = [1] x1 + [0] p(s) = [1] x1 + [4] p(true) = [4] p(cond#) = [1] x1 + [1] x2 + [0] p(odd#) = [1] x1 + [1] p(p#) = [0] p(c_1) = [0] p(c_2) = [0] p(c_3) = [0] p(c_4) = [1] x1 + [7] p(c_5) = [1] p(c_6) = [8] Following rules are strictly oriented: odd#(s(s(x))) = [1] x + [9] > [1] x + [8] = c_4(odd#(x)) Following rules are (at-least) weakly oriented: cond#(true(),x) = [1] x + [4] >= [1] x + [4] = cond#(odd(x),p(x)) cond#(true(),x) = [1] x + [4] >= [1] x + [1] = odd#(x) odd(0()) = [4] >= [1] = false() odd(s(0())) = [4] >= [4] = true() odd(s(s(x))) = [4] >= [4] = odd(x) p(0()) = [0] >= [0] = 0() p(s(x)) = [1] x + [4] >= [1] x + [0] = x Further, it can be verified that all rules not oriented are covered by the weightgap condition. *** Step 1.b:6.b:2: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak DPs: cond#(true(),x) -> cond#(odd(x),p(x)) cond#(true(),x) -> odd#(x) odd#(s(s(x))) -> c_4(odd#(x)) - Weak TRS: odd(0()) -> false() odd(s(0())) -> true() odd(s(s(x))) -> odd(x) p(0()) -> 0() p(s(x)) -> x - Signature: {cond/2,odd/1,p/1,cond#/2,odd#/1,p#/1} / {0/0,false/0,s/1,true/0,c_1/2,c_2/0,c_3/0,c_4/1,c_5/0,c_6/0} - Obligation: innermost runtime complexity wrt. defined symbols {cond#,odd#,p#} and constructors {0,false,s,true} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(Omega(n^1),?)