/export/starexec/sandbox2/solver/bin/starexec_run_tct_rc /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: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:1: Sum. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: Sum {left = someStrategy, right = someStrategy} + Details: () ** Step 1.a:2: DecreasingLoops. WORST_CASE(Omega(n^1),?) + Considered Problem: - Strict TRS: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: DecreasingLoops {bound = AnyLoop, narrow = 10} + Details: The system has following decreasing Loops: ++(x,y){y -> g(y,z)} = ++(x,g(y,z)) ->^+ g(++(x,y),z) = C[++(x,y) = ++(x,y){}] ** Step 1.b:1: NaturalMI. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(g) = {1}, uargs(max') = {1}, uargs(not) = {1}, uargs(or) = {2} Following symbols are considered usable: all TcT has computed the following interpretation: p(++) = [4] x1 + [6] x2 + [4] p(=) = [0] p(f) = [1] x1 + [12] x2 + [4] p(false) = [0] p(g) = [1] x1 + [1] x2 + [2] p(max) = [1] x1 + [8] p(max') = [1] x1 + [1] x2 + [2] p(mem) = [8] x1 + [12] p(nil) = [1] p(not) = [1] x1 + [1] p(null) = [2] x1 + [8] p(or) = [1] x2 + [0] p(true) = [0] p(u) = [10] Following rules are strictly oriented: ++(x,g(y,z)) = [4] x + [6] y + [6] z + [16] > [4] x + [6] y + [1] z + [6] = g(++(x,y),z) ++(x,nil()) = [4] x + [10] > [1] x + [0] = x f(x,g(y,z)) = [1] x + [12] y + [12] z + [28] > [1] x + [12] y + [1] z + [6] = g(f(x,y),z) f(x,nil()) = [1] x + [16] > [1] x + [3] = g(nil(),x) max(g(g(nil(),x),y)) = [1] x + [1] y + [13] > [1] x + [1] y + [2] = max'(x,y) mem(x,max(x)) = [8] x + [12] > [2] x + [9] = not(null(x)) mem(g(x,y),z) = [8] x + [8] y + [28] > [8] x + [12] = or(=(y,z),mem(x,z)) mem(nil(),y) = [20] > [0] = false() null(g(x,y)) = [2] x + [2] y + [12] > [0] = false() null(nil()) = [10] > [0] = true() Following rules are (at-least) weakly oriented: max(g(g(g(x,y),z),u())) = [1] x + [1] y + [1] z + [24] >= [1] x + [1] y + [1] z + [24] = max'(max(g(g(x,y),z)),u()) ** Step 1.b:2: NaturalMI. WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) - Weak TRS: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: NaturalMI {miDimension = 1, miDegree = 1, miKind = Algebraic, uargs = UArgs, urules = URules, selector = Just any strict-rules} + Details: We apply a matrix interpretation of kind constructor based matrix interpretation: The following argument positions are considered usable: uargs(g) = {1}, uargs(max') = {1}, uargs(not) = {1}, uargs(or) = {2} Following symbols are considered usable: all TcT has computed the following interpretation: p(++) = [4] x1 + [3] x2 + [12] p(=) = [0] p(f) = [8] x1 + [4] x2 + [12] p(false) = [3] p(g) = [1] x1 + [1] x2 + [1] p(max) = [4] x1 + [1] p(max') = [1] x1 + [2] p(mem) = [4] x1 + [12] p(nil) = [4] p(not) = [1] x1 + [5] p(null) = [3] p(or) = [1] x1 + [1] x2 + [0] p(true) = [3] p(u) = [1] Following rules are strictly oriented: max(g(g(g(x,y),z),u())) = [4] x + [4] y + [4] z + [17] > [4] x + [4] y + [4] z + [11] = max'(max(g(g(x,y),z)),u()) Following rules are (at-least) weakly oriented: ++(x,g(y,z)) = [4] x + [3] y + [3] z + [15] >= [4] x + [3] y + [1] z + [13] = g(++(x,y),z) ++(x,nil()) = [4] x + [24] >= [1] x + [0] = x f(x,g(y,z)) = [8] x + [4] y + [4] z + [16] >= [8] x + [4] y + [1] z + [13] = g(f(x,y),z) f(x,nil()) = [8] x + [28] >= [1] x + [5] = g(nil(),x) max(g(g(nil(),x),y)) = [4] x + [4] y + [25] >= [1] x + [2] = max'(x,y) mem(x,max(x)) = [4] x + [12] >= [8] = not(null(x)) mem(g(x,y),z) = [4] x + [4] y + [16] >= [4] x + [12] = or(=(y,z),mem(x,z)) mem(nil(),y) = [28] >= [3] = false() null(g(x,y)) = [3] >= [3] = false() null(nil()) = [3] >= [3] = true() ** Step 1.b:3: EmptyProcessor. WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: ++(x,g(y,z)) -> g(++(x,y),z) ++(x,nil()) -> x f(x,g(y,z)) -> g(f(x,y),z) f(x,nil()) -> g(nil(),x) max(g(g(g(x,y),z),u())) -> max'(max(g(g(x,y),z)),u()) max(g(g(nil(),x),y)) -> max'(x,y) mem(x,max(x)) -> not(null(x)) mem(g(x,y),z) -> or(=(y,z),mem(x,z)) mem(nil(),y) -> false() null(g(x,y)) -> false() null(nil()) -> true() - Signature: {++/2,f/2,max/1,mem/2,null/1} / {=/2,false/0,g/2,max'/2,nil/0,not/1,or/2,true/0,u/0} - Obligation: runtime complexity wrt. defined symbols {++,f,max,mem,null} and constructors {=,false,g,max',nil,not,or ,true,u} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(Omega(n^1),O(n^1))