Examples.Basics.ProofTests:f4 from sbv-4.4

Percentage Accurate: 93.0% → 96.4%

Time: 5.0s

Alternatives: 5

Speedup: 1.2×

• 44.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))

C

double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * x) + ((x * 2.0d0) * y)) + (y * y)
end function

Java

public static double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}

Python

def code(x, y):
	return ((x * x) + ((x * 2.0) * y)) + (y * y)

Julia

function code(x, y)
	return Float64(Float64(Float64(x * x) + Float64(Float64(x * 2.0) * y)) + Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * x) + ((x * 2.0) * y)) + (y * y);
end

Wolfram

code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))

C

double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * x) + ((x * 2.0d0) * y)) + (y * y)
end function

Java

public static double code(double x, double y) {
	return ((x * x) + ((x * 2.0) * y)) + (y * y);
}

Python

def code(x, y):
	return ((x * x) + ((x * 2.0) * y)) + (y * y)

Julia

function code(x, y)
	return Float64(Float64(Float64(x * x) + Float64(Float64(x * 2.0) * y)) + Float64(y * y))
end

MATLAB

function tmp = code(x, y)
	tmp = ((x * x) + ((x * 2.0) * y)) + (y * y);
end

Wolfram

code[x_, y_] := N[(N[(N[(x * x), $MachinePrecision] + N[(N[(x * 2.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.4% accurate, 0.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right) \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (fma y y (* x (+ x (* y 2.0)))))

C

assert(x < y);
double code(double x, double y) {
	return fma(y, y, (x * (x + (y * 2.0))));
}

Julia

x, y = sort([x, y])
function code(x, y)
	return fma(y, y, Float64(x * Float64(x + Float64(y * 2.0))))
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y * y + N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
2. Step-by-step derivation

   1. associate-+l+ 94.9%

      \[\leadsto \color{blue}{x \cdot x + \left(\left(x \cdot 2\right) \cdot y + y \cdot y\right)} \]

   2. associate-*l* 94.9%

      \[\leadsto x \cdot x + \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + y \cdot y\right) \]

   3. *-commutative 94.9%

      \[\leadsto x \cdot x + \left(x \cdot \color{blue}{\left(y \cdot 2\right)} + y \cdot y\right) \]

   4. *-commutative 94.9%

      \[\leadsto x \cdot x + \left(\color{blue}{\left(y \cdot 2\right) \cdot x} + y \cdot y\right) \]

   5. +-commutative 94.9%

      \[\leadsto x \cdot x + \color{blue}{\left(y \cdot y + \left(y \cdot 2\right) \cdot x\right)} \]

   6. fma-def 94.9%

      \[\leadsto x \cdot x + \color{blue}{\mathsf{fma}\left(y, y, \left(y \cdot 2\right) \cdot x\right)} \]

   7. *-commutative 94.9%

      \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(y \cdot 2\right)}\right) \]

   8. *-commutative 94.9%

      \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, x \cdot \color{blue}{\left(2 \cdot y\right)}\right) \]

3. Simplified 94.9%

   \[\leadsto \color{blue}{x \cdot x + \mathsf{fma}\left(y, y, x \cdot \left(2 \cdot y\right)\right)} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. +-commutative 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, x \cdot \left(2 \cdot y\right)\right) + x \cdot x} \]

   2. fma-udef 94.9%

      \[\leadsto \color{blue}{\left(y \cdot y + x \cdot \left(2 \cdot y\right)\right)} + x \cdot x \]

   3. associate-*r* 94.9%

      \[\leadsto \left(y \cdot y + \color{blue}{\left(x \cdot 2\right) \cdot y}\right) + x \cdot x \]

   4. associate-+r+ 94.9%

      \[\leadsto \color{blue}{y \cdot y + \left(\left(x \cdot 2\right) \cdot y + x \cdot x\right)} \]

   5. +-commutative 94.9%

      \[\leadsto y \cdot y + \color{blue}{\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right)} \]

   6. fma-def 94.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, x \cdot x + \left(x \cdot 2\right) \cdot y\right)} \]

   7. associate-*r* 94.9%

      \[\leadsto \mathsf{fma}\left(y, y, x \cdot x + \color{blue}{x \cdot \left(2 \cdot y\right)}\right) \]

   8. distribute-lft-out 97.7%

      \[\leadsto \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(x + 2 \cdot y\right)}\right) \]

   9. *-commutative 97.7%

      \[\leadsto \mathsf{fma}\left(y, y, x \cdot \left(x + \color{blue}{y \cdot 2}\right)\right) \]

6. Applied egg-rr 97.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right)} \]

7. Final simplification 97.7%

   \[\leadsto \mathsf{fma}\left(y, y, x \cdot \left(x + y \cdot 2\right)\right) \]
8. Add Preprocessing

Alternative 2: 82.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -2.3 \cdot 10^{-108}:\\ \;\;\;\;x \cdot x + 2 \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y + x \cdot 2\right)\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= x -2.3e-108) (+ (* x x) (* 2.0 (* y x))) (* y (+ y (* x 2.0)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -2.3e-108) {
		tmp = (x * x) + (2.0 * (y * x));
	} else {
		tmp = y * (y + (x * 2.0));
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-2.3d-108)) then
        tmp = (x * x) + (2.0d0 * (y * x))
    else
        tmp = y * (y + (x * 2.0d0))
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (x <= -2.3e-108) {
		tmp = (x * x) + (2.0 * (y * x));
	} else {
		tmp = y * (y + (x * 2.0));
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -2.3e-108:
		tmp = (x * x) + (2.0 * (y * x))
	else:
		tmp = y * (y + (x * 2.0))
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -2.3e-108)
		tmp = Float64(Float64(x * x) + Float64(2.0 * Float64(y * x)));
	else
		tmp = Float64(y * Float64(y + Float64(x * 2.0)));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.3e-108)
		tmp = (x * x) + (2.0 * (y * x));
	else
		tmp = y * (y + (x * 2.0));
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[x, -2.3e-108], N[(N[(x * x), $MachinePrecision] + N[(2.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y * N[(y + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.29999999999999996e-108

   1. Initial program 94.2%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
   2. Step-by-step derivation

      1. associate-+l+ 94.2%

         \[\leadsto \color{blue}{x \cdot x + \left(\left(x \cdot 2\right) \cdot y + y \cdot y\right)} \]

      2. associate-*l* 94.2%

         \[\leadsto x \cdot x + \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + y \cdot y\right) \]

      3. *-commutative 94.2%

         \[\leadsto x \cdot x + \left(x \cdot \color{blue}{\left(y \cdot 2\right)} + y \cdot y\right) \]

      4. *-commutative 94.2%

         \[\leadsto x \cdot x + \left(\color{blue}{\left(y \cdot 2\right) \cdot x} + y \cdot y\right) \]

      5. +-commutative 94.2%

         \[\leadsto x \cdot x + \color{blue}{\left(y \cdot y + \left(y \cdot 2\right) \cdot x\right)} \]

      6. fma-def 94.2%

         \[\leadsto x \cdot x + \color{blue}{\mathsf{fma}\left(y, y, \left(y \cdot 2\right) \cdot x\right)} \]

      7. *-commutative 94.2%

         \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(y \cdot 2\right)}\right) \]

      8. *-commutative 94.2%

         \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, x \cdot \color{blue}{\left(2 \cdot y\right)}\right) \]

   3. Simplified 94.2%

      \[\leadsto \color{blue}{x \cdot x + \mathsf{fma}\left(y, y, x \cdot \left(2 \cdot y\right)\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 69.2%

      \[\leadsto x \cdot x + \color{blue}{2 \cdot \left(x \cdot y\right)} \]
   6. Step-by-step derivation

      1. *-commutative 69.2%

         \[\leadsto x \cdot x + 2 \cdot \color{blue}{\left(y \cdot x\right)} \]

   7. Simplified 69.2%

      \[\leadsto x \cdot x + \color{blue}{2 \cdot \left(y \cdot x\right)} \]

   if -2.29999999999999996e-108 < x

   1. Initial program 95.3%

      \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 95.3%

         \[\leadsto \color{blue}{\left(\left(x \cdot 2\right) \cdot y + x \cdot x\right)} + y \cdot y \]

      2. associate-*r* 95.3%

         \[\leadsto \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + x \cdot x\right) + y \cdot y \]

      3. distribute-lft-out 97.0%

         \[\leadsto \color{blue}{x \cdot \left(2 \cdot y + x\right)} + y \cdot y \]

      4. *-commutative 97.0%

         \[\leadsto x \cdot \left(\color{blue}{y \cdot 2} + x\right) + y \cdot y \]

   4. Applied egg-rr 97.0%

      \[\leadsto \color{blue}{x \cdot \left(y \cdot 2 + x\right)} + y \cdot y \]

   5. Taylor expanded in x around 0 66.0%

      \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right) + {y}^{2}} \]
   6. Step-by-step derivation

      1. +-commutative 66.0%

         \[\leadsto \color{blue}{{y}^{2} + 2 \cdot \left(x \cdot y\right)} \]

      2. unpow2 66.0%

         \[\leadsto \color{blue}{y \cdot y} + 2 \cdot \left(x \cdot y\right) \]

      3. associate-*r* 66.0%

         \[\leadsto y \cdot y + \color{blue}{\left(2 \cdot x\right) \cdot y} \]

      4. distribute-rgt-out 68.9%

         \[\leadsto \color{blue}{y \cdot \left(y + 2 \cdot x\right)} \]

   7. Simplified 68.9%

      \[\leadsto \color{blue}{y \cdot \left(y + 2 \cdot x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.3 \cdot 10^{-108}:\\ \;\;\;\;x \cdot x + 2 \cdot \left(y \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(y + x \cdot 2\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ x \cdot \left(x + y \cdot 2\right) + y \cdot y \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (+ (* x (+ x (* y 2.0))) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	return (x * (x + (y * 2.0))) + (y * y);
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * (x + (y * 2.0d0))) + (y * y)
end function

Java

assert x < y;
public static double code(double x, double y) {
	return (x * (x + (y * 2.0))) + (y * y);
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return (x * (x + (y * 2.0))) + (y * y)

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(Float64(x * Float64(x + Float64(y * 2.0))) + Float64(y * y))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = (x * (x + (y * 2.0))) + (y * y);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(N[(x * N[(x + N[(y * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
2. Add Preprocessing
3. Step-by-step derivation

   1. +-commutative 94.9%

      \[\leadsto \color{blue}{\left(\left(x \cdot 2\right) \cdot y + x \cdot x\right)} + y \cdot y \]

   2. associate-*r* 94.9%

      \[\leadsto \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + x \cdot x\right) + y \cdot y \]

   3. distribute-lft-out 97.6%

      \[\leadsto \color{blue}{x \cdot \left(2 \cdot y + x\right)} + y \cdot y \]

   4. *-commutative 97.6%

      \[\leadsto x \cdot \left(\color{blue}{y \cdot 2} + x\right) + y \cdot y \]

4. Applied egg-rr 97.6%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot 2 + x\right)} + y \cdot y \]

5. Final simplification 97.6%

   \[\leadsto x \cdot \left(x + y \cdot 2\right) + y \cdot y \]
6. Add Preprocessing

Alternative 4: 57.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ y \cdot \left(y + x \cdot 2\right) \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (* y (+ y (* x 2.0))))

C

assert(x < y);
double code(double x, double y) {
	return y * (y + (x * 2.0));
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y * (y + (x * 2.0d0))
end function

Java

assert x < y;
public static double code(double x, double y) {
	return y * (y + (x * 2.0));
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return y * (y + (x * 2.0))

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(y * Float64(y + Float64(x * 2.0)))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = y * (y + (x * 2.0));
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y * N[(y + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
2. Add Preprocessing
3. Step-by-step derivation

   1. +-commutative 94.9%

      \[\leadsto \color{blue}{\left(\left(x \cdot 2\right) \cdot y + x \cdot x\right)} + y \cdot y \]

   2. associate-*r* 94.9%

      \[\leadsto \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + x \cdot x\right) + y \cdot y \]

   3. distribute-lft-out 97.6%

      \[\leadsto \color{blue}{x \cdot \left(2 \cdot y + x\right)} + y \cdot y \]

   4. *-commutative 97.6%

      \[\leadsto x \cdot \left(\color{blue}{y \cdot 2} + x\right) + y \cdot y \]

4. Applied egg-rr 97.6%

   \[\leadsto \color{blue}{x \cdot \left(y \cdot 2 + x\right)} + y \cdot y \]

5. Taylor expanded in x around 0 57.1%

   \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right) + {y}^{2}} \]
6. Step-by-step derivation

   1. +-commutative 57.1%

      \[\leadsto \color{blue}{{y}^{2} + 2 \cdot \left(x \cdot y\right)} \]

   2. unpow2 57.1%

      \[\leadsto \color{blue}{y \cdot y} + 2 \cdot \left(x \cdot y\right) \]

   3. associate-*r* 57.1%

      \[\leadsto y \cdot y + \color{blue}{\left(2 \cdot x\right) \cdot y} \]

   4. distribute-rgt-out 59.4%

      \[\leadsto \color{blue}{y \cdot \left(y + 2 \cdot x\right)} \]

7. Simplified 59.4%

   \[\leadsto \color{blue}{y \cdot \left(y + 2 \cdot x\right)} \]

8. Final simplification 59.4%

   \[\leadsto y \cdot \left(y + x \cdot 2\right) \]
9. Add Preprocessing

Alternative 5: 15.0% accurate, 2.6× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ 2 \cdot \left(y \cdot x\right) \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (* 2.0 (* y x)))

C

assert(x < y);
double code(double x, double y) {
	return 2.0 * (y * x);
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 2.0d0 * (y * x)
end function

Java

assert x < y;
public static double code(double x, double y) {
	return 2.0 * (y * x);
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return 2.0 * (y * x)

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(2.0 * Float64(y * x))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = 2.0 * (y * x);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(2.0 * N[(y * x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 94.9%

   \[\left(x \cdot x + \left(x \cdot 2\right) \cdot y\right) + y \cdot y \]
2. Step-by-step derivation

   1. associate-+l+ 94.9%

      \[\leadsto \color{blue}{x \cdot x + \left(\left(x \cdot 2\right) \cdot y + y \cdot y\right)} \]

   2. associate-*l* 94.9%

      \[\leadsto x \cdot x + \left(\color{blue}{x \cdot \left(2 \cdot y\right)} + y \cdot y\right) \]

   3. *-commutative 94.9%

      \[\leadsto x \cdot x + \left(x \cdot \color{blue}{\left(y \cdot 2\right)} + y \cdot y\right) \]

   4. *-commutative 94.9%

      \[\leadsto x \cdot x + \left(\color{blue}{\left(y \cdot 2\right) \cdot x} + y \cdot y\right) \]

   5. +-commutative 94.9%

      \[\leadsto x \cdot x + \color{blue}{\left(y \cdot y + \left(y \cdot 2\right) \cdot x\right)} \]

   6. fma-def 94.9%

      \[\leadsto x \cdot x + \color{blue}{\mathsf{fma}\left(y, y, \left(y \cdot 2\right) \cdot x\right)} \]

   7. *-commutative 94.9%

      \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, \color{blue}{x \cdot \left(y \cdot 2\right)}\right) \]

   8. *-commutative 94.9%

      \[\leadsto x \cdot x + \mathsf{fma}\left(y, y, x \cdot \color{blue}{\left(2 \cdot y\right)}\right) \]

3. Simplified 94.9%

   \[\leadsto \color{blue}{x \cdot x + \mathsf{fma}\left(y, y, x \cdot \left(2 \cdot y\right)\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 54.3%

   \[\leadsto x \cdot x + \color{blue}{2 \cdot \left(x \cdot y\right)} \]
6. Step-by-step derivation

   1. *-commutative 54.3%

      \[\leadsto x \cdot x + 2 \cdot \color{blue}{\left(y \cdot x\right)} \]

7. Simplified 54.3%

   \[\leadsto x \cdot x + \color{blue}{2 \cdot \left(y \cdot x\right)} \]

8. Taylor expanded in x around 0 17.1%

   \[\leadsto \color{blue}{2 \cdot \left(x \cdot y\right)} \]

9. Final simplification 17.1%

   \[\leadsto 2 \cdot \left(y \cdot x\right) \]
10. Add Preprocessing

Developer target: 93.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot x + \left(y \cdot y + \left(x \cdot y\right) \cdot 2\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (+ (* x x) (+ (* y y) (* (* x y) 2.0))))

C

double code(double x, double y) {
	return (x * x) + ((y * y) + ((x * y) * 2.0));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x * x) + ((y * y) + ((x * y) * 2.0d0))
end function

Java

public static double code(double x, double y) {
	return (x * x) + ((y * y) + ((x * y) * 2.0));
}

Python

def code(x, y):
	return (x * x) + ((y * y) + ((x * y) * 2.0))

Julia

function code(x, y)
	return Float64(Float64(x * x) + Float64(Float64(y * y) + Float64(Float64(x * y) * 2.0)))
end

MATLAB

function tmp = code(x, y)
	tmp = (x * x) + ((y * y) + ((x * y) * 2.0));
end

Wolfram

code[x_, y_] := N[(N[(x * x), $MachinePrecision] + N[(N[(y * y), $MachinePrecision] + N[(N[(x * y), $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024040 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

  :herbie-target
  (+ (* x x) (+ (* y y) (* (* x y) 2.0)))

  (+ (+ (* x x) (* (* x 2.0) y)) (* y y)))