Examples.Basics.ProofTests:f4 from sbv-4.4

Percentage Accurate: 93.9% → 99.8%

Time: 3.9s

Alternatives: 5

Speedup: 1.1×

• 43.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.9% 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: 99.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq 6.3 \cdot 10^{+140}:\\ \;\;\;\;\mathsf{fma}\left(y, y, \mathsf{fma}\left(y, 2, x\right) \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \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 (<= y 6.3e+140) (fma y y (* (fma y 2.0 x) x)) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= 6.3e+140) {
		tmp = fma(y, y, (fma(y, 2.0, x) * x));
	} else {
		tmp = y * y;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.29999999999999972e140

   1. Initial program 93.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. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 93.3

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. lift-*.f64 N/A

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

      9. associate-*l* N/A

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

      10. distribute-lft-out N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. +-commutative N/A

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

      14. *-commutative N/A

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

      15. lower-fma.f64 97.8

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

   4. Applied rewrites 97.8%

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

   if 6.29999999999999972e140 < y

   1. Initial program 78.8%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{y}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{y \cdot y} \]

      2. lower-*.f64 100.0

         \[\leadsto \color{blue}{y \cdot y} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{y \cdot y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 99.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+186}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, x, \mathsf{fma}\left(2, x, y\right) \cdot y\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 -1e+186) (* x x) (fma x x (* (fma 2.0 x y) y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -9.9999999999999998e185

   1. Initial program 74.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{y}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{y \cdot y} \]

      2. lower-*.f64 35.7

         \[\leadsto \color{blue}{y \cdot y} \]

   5. Applied rewrites 35.7%

      \[\leadsto \color{blue}{y \cdot y} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{x \cdot x} \]

      2. lower-*.f64 100.0

         \[\leadsto \color{blue}{x \cdot x} \]

   8. Applied rewrites 100.0%

      \[\leadsto \color{blue}{x \cdot x} \]

   if -9.9999999999999998e185 < x

   1. Initial program 93.4%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. lift-*.f64 N/A

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

      5. lower-fma.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-rgt-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lift-*.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-fma.f64 96.9

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

   4. Applied rewrites 96.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, \mathsf{fma}\left(2, x, y\right) \cdot y\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 86.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-20}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, x, y\right) \cdot y\\ \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 -8.5e-20) (* x x) (* (fma 2.0 x y) y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -8.5e-20) {
		tmp = x * x;
	} else {
		tmp = fma(2.0, x, y) * y;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -8.5000000000000005e-20

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{y}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{y \cdot y} \]

      2. lower-*.f64 39.7

         \[\leadsto \color{blue}{y \cdot y} \]

   5. Applied rewrites 39.7%

      \[\leadsto \color{blue}{y \cdot y} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{x \cdot x} \]

      2. lower-*.f64 80.1

         \[\leadsto \color{blue}{x \cdot x} \]

   8. Applied rewrites 80.1%

      \[\leadsto \color{blue}{x \cdot x} \]

   if -8.5000000000000005e-20 < x

   1. Initial program 93.5%

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

   3. Taylor expanded in x around 0

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

      1. *-rgt-identity N/A

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

      2. *-inverses N/A

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

      3. associate-/l* N/A

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

      4. unpow2 N/A

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

      5. associate-/l* N/A

         \[\leadsto 2 \cdot \color{blue}{\frac{x \cdot {y}^{2}}{y}} + {y}^{2} \]

      6. associate-*l/ N/A

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

      7. associate-*l* N/A

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

      8. distribute-lft1-in N/A

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

      9. +-commutative N/A

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

      10. unpow2 N/A

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

      11. associate-*r* N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   5. Applied rewrites 65.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(2, x, y\right) \cdot y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 86.4% accurate, 2.2× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -8.5 \cdot 10^{-20}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \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 -8.5e-20) (* x x) (* y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -8.5e-20) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	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 <= (-8.5d-20)) then
        tmp = x * x
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (x <= -8.5e-20) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if x <= -8.5e-20:
		tmp = x * x
	else:
		tmp = y * y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (x <= -8.5e-20)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -8.5e-20)
		tmp = x * x;
	else
		tmp = y * y;
	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, -8.5e-20], N[(x * x), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.5000000000000005e-20

   1. Initial program 86.1%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{y}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{y \cdot y} \]

      2. lower-*.f64 39.7

         \[\leadsto \color{blue}{y \cdot y} \]

   5. Applied rewrites 39.7%

      \[\leadsto \color{blue}{y \cdot y} \]

   6. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   7. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{x \cdot x} \]

      2. lower-*.f64 80.1

         \[\leadsto \color{blue}{x \cdot x} \]

   8. Applied rewrites 80.1%

      \[\leadsto \color{blue}{x \cdot x} \]

   if -8.5000000000000005e-20 < x

   1. Initial program 93.5%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{y}^{2}} \]
   4. Step-by-step derivation

      1. unpow2 N/A

         \[\leadsto \color{blue}{y \cdot y} \]

      2. lower-*.f64 67.7

         \[\leadsto \color{blue}{y \cdot y} \]

   5. Applied rewrites 67.7%

      \[\leadsto \color{blue}{y \cdot y} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 57.2% accurate, 4.5× speedup

Math

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

FPCore

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

C

assert(x < y);
double code(double x, double y) {
	return x * 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 = x * x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 91.4%

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

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{{y}^{2}} \]
4. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto \color{blue}{y \cdot y} \]

   2. lower-*.f64 59.8

      \[\leadsto \color{blue}{y \cdot y} \]

5. Applied rewrites 59.8%

   \[\leadsto \color{blue}{y \cdot y} \]

6. Taylor expanded in x around inf

   \[\leadsto \color{blue}{{x}^{2}} \]
7. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto \color{blue}{x \cdot x} \]

   2. lower-*.f64 57.5

      \[\leadsto \color{blue}{x \cdot x} \]

8. Applied rewrites 57.5%

   \[\leadsto \color{blue}{x \cdot x} \]
9. Add Preprocessing

Developer Target 1: 94.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 2024295 
(FPCore (x y)
  :name "Examples.Basics.ProofTests:f4 from sbv-4.4"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (* x x) (+ (* y y) (* (* x y) 2))))

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