Linear.Quaternion:$c/ from linear-1.19.1.3, E

Percentage Accurate: 99.9% → 100.0%

Time: 7.0s

Alternatives: 9

Speedup: 1.8×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 99.9

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

   5. lift-+.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. associate-+l+ N/A

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

   8. +-commutative N/A

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

   9. count-2 N/A

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

   10. lower-fma.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 81.4% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 2e-67) (* x x) (fma y (+ y y) (* y y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-67) {
		tmp = x * x;
	} else {
		tmp = fma(y, (y + y), (y * y));
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 2e-67)
		tmp = Float64(x * x);
	else
		tmp = fma(y, Float64(y + y), Float64(y * y));
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 2e-67], N[(x * x), $MachinePrecision], N[(y * N[(y + y), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.99999999999999989e-67

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 30.0

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

   5. Applied rewrites 30.0%

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

   7. Applied rewrites 4.1%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 4.1%

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

   11. Taylor expanded in x around inf

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

       1. unpow2 N/A

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

       2. lower-*.f64 85.5

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

   13. Applied rewrites 85.5%

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

   if 1.99999999999999989e-67 < (*.f64 y y)

   1. Initial program 99.7%

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

      1. lift-+.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate-+l+ N/A

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

      4. +-commutative N/A

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

      1. unpow2 N/A

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

      2. lower-*.f64 84.9

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

   7. Applied rewrites 84.9%

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

Alternative 3: 81.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 2 \cdot 10^{-67}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(3 \cdot y\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 2e-67) (* x x) (* (* 3.0 y) y)))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-67) {
		tmp = x * x;
	} else {
		tmp = (3.0 * y) * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 2d-67) then
        tmp = x * x
    else
        tmp = (3.0d0 * y) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-67) {
		tmp = x * x;
	} else {
		tmp = (3.0 * y) * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 2e-67:
		tmp = x * x
	else:
		tmp = (3.0 * y) * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 2e-67)
		tmp = Float64(x * x);
	else
		tmp = Float64(Float64(3.0 * y) * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 2e-67)
		tmp = x * x;
	else
		tmp = (3.0 * y) * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 2e-67], N[(x * x), $MachinePrecision], N[(N[(3.0 * y), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.99999999999999989e-67

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 30.0

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

   5. Applied rewrites 30.0%

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

   7. Applied rewrites 4.1%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 4.1%

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

   11. Taylor expanded in x around inf

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

       1. unpow2 N/A

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

       2. lower-*.f64 85.5

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

   13. Applied rewrites 85.5%

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

   if 1.99999999999999989e-67 < (*.f64 y y)

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

   7. Applied rewrites 84.8%

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

Alternative 4: 81.3% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 2 \cdot 10^{-67}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;3 \cdot \left(y \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 2e-67) (* x x) (* 3.0 (* y y))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-67) {
		tmp = x * x;
	} else {
		tmp = 3.0 * (y * y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 2d-67) then
        tmp = x * x
    else
        tmp = 3.0d0 * (y * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 2e-67) {
		tmp = x * x;
	} else {
		tmp = 3.0 * (y * y);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 2e-67:
		tmp = x * x
	else:
		tmp = 3.0 * (y * y)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 2e-67)
		tmp = Float64(x * x);
	else
		tmp = Float64(3.0 * Float64(y * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 2e-67)
		tmp = x * x;
	else
		tmp = 3.0 * (y * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 2e-67], N[(x * x), $MachinePrecision], N[(3.0 * N[(y * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.99999999999999989e-67

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 30.0

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

   5. Applied rewrites 30.0%

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

   7. Applied rewrites 4.1%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 4.1%

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

   11. Taylor expanded in x around inf

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

       1. unpow2 N/A

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

       2. lower-*.f64 85.5

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

   13. Applied rewrites 85.5%

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

   if 1.99999999999999989e-67 < (*.f64 y y)

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 84.7

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

   5. Applied rewrites 84.7%

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

Alternative 5: 75.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+301}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(2 + y\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 5e+301) (* x x) (* (+ 2.0 y) y)))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+301) {
		tmp = x * x;
	} else {
		tmp = (2.0 + y) * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 5d+301) then
        tmp = x * x
    else
        tmp = (2.0d0 + y) * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+301) {
		tmp = x * x;
	} else {
		tmp = (2.0 + y) * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 5e+301:
		tmp = x * x
	else:
		tmp = (2.0 + y) * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e+301)
		tmp = Float64(x * x);
	else
		tmp = Float64(Float64(2.0 + y) * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 5e+301)
		tmp = x * x;
	else
		tmp = (2.0 + y) * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e+301], N[(x * x), $MachinePrecision], N[(N[(2.0 + y), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 5.0000000000000004e301

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 46.6

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

   5. Applied rewrites 46.6%

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

   7. Applied rewrites 7.2%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 3.8%

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

   11. Taylor expanded in x around inf

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

       1. unpow2 N/A

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

       2. lower-*.f64 63.8

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

   13. Applied rewrites 63.8%

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

   if 5.0000000000000004e301 < (*.f64 y y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   7. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{y}, 2 \cdot y\right) \]
   8. Step-by-step derivation

   9. Applied rewrites 98.8%

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

Alternative 6: 75.2% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 5 \cdot 10^{+301}:\\ \;\;\;\;x \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= (* y y) 5e+301) (* x x) (* y y)))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+301) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y * y) <= 5d+301) then
        tmp = x * x
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y * y) <= 5e+301) {
		tmp = x * x;
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 5e+301:
		tmp = x * x
	else:
		tmp = y * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 5e+301)
		tmp = Float64(x * x);
	else
		tmp = Float64(y * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 5e+301)
		tmp = x * x;
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 5e+301], N[(x * x), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 5.0000000000000004e301

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 46.6

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

   5. Applied rewrites 46.6%

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

   7. Applied rewrites 7.2%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 3.8%

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

   11. Taylor expanded in x around inf

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

       1. unpow2 N/A

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

       2. lower-*.f64 63.8

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

   13. Applied rewrites 63.8%

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

   if 5.0000000000000004e301 < (*.f64 y y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. distribute-lft1-in N/A

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

      2. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

      4. unpow2 N/A

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

      5. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

   7. Applied rewrites 98.8%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 2.7%

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

   11. Taylor expanded in y around inf

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

   13. Applied rewrites 98.8%

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

Alternative 7: 99.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(3 \cdot y, y, x \cdot x\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (fma (* 3.0 y) y (* x x)))

C

double code(double x, double y) {
	return fma((3.0 * y), y, (x * x));
}

Julia

function code(x, y)
	return fma(Float64(3.0 * y), y, Float64(x * x))
end

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. associate-+r+ N/A

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

   3. distribute-lft1-in N/A

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

   4. metadata-eval N/A

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

   5. unpow2 N/A

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

   6. associate-*r* N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-*.f64 N/A

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

   9. unpow2 N/A

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

   10. lower-*.f64 99.9

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

5. Applied rewrites 99.9%

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

Alternative 8: 37.9% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ y \cdot y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in x around 0

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

   1. distribute-lft1-in N/A

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

   2. metadata-eval N/A

      \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

   4. unpow2 N/A

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

   5. lower-*.f64 60.6

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

5. Applied rewrites 60.6%

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

7. Applied rewrites 31.1%

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

8. Taylor expanded in y around 0

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

10. Applied rewrites 3.5%

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

11. Taylor expanded in y around inf

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

13. Applied rewrites 38.2%

    \[\leadsto y \cdot \color{blue}{y} \]
14. Add Preprocessing

Alternative 9: 3.6% accurate, 7.5× speedup

Math

\[\begin{array}{l} \\ y + y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in x around 0

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

   1. distribute-lft1-in N/A

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

   2. metadata-eval N/A

      \[\leadsto \color{blue}{3} \cdot {y}^{2} \]

   3. lower-*.f64 N/A

      \[\leadsto \color{blue}{3 \cdot {y}^{2}} \]

   4. unpow2 N/A

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

   5. lower-*.f64 60.6

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

5. Applied rewrites 60.6%

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

7. Applied rewrites 31.1%

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

8. Taylor expanded in y around 0

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

10. Applied rewrites 3.5%

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

12. Applied rewrites 3.5%

    \[\leadsto y + y \]
13. Add Preprocessing

Developer Target 1: 99.9% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024326 
(FPCore (x y)
  :name "Linear.Quaternion:$c/ from linear-1.19.1.3, E"
  :precision binary64

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

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