Numeric.Log:$clog1p from log-domain-0.10.2.1, A

Percentage Accurate: 99.9% → 99.9%

Time: 7.9s

Alternatives: 9

Speedup: 1.5×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. +-commutative N/A

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

   2. associate-+l+ N/A

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

   3. accelerator-lowering-fma.f64 N/A

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

   4. accelerator-lowering-fma.f64 N/A

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

   5. *-lowering-*.f64 100.0

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

4. Applied egg-rr 100.0%

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

Alternative 2: 68.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot 2 + x \cdot x\\ \mathbf{if}\;t\_0 \leq -1 \cdot 10^{-151}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;t\_0 \leq 6 \cdot 10^{+216}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* x 2.0) (* x x))))
   (if (<= t_0 -1e-151) (* x 2.0) (if (<= t_0 6e+216) (* y y) (* x x)))))

C

double code(double x, double y) {
	double t_0 = (x * 2.0) + (x * x);
	double tmp;
	if (t_0 <= -1e-151) {
		tmp = x * 2.0;
	} else if (t_0 <= 6e+216) {
		tmp = y * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x * 2.0d0) + (x * x)
    if (t_0 <= (-1d-151)) then
        tmp = x * 2.0d0
    else if (t_0 <= 6d+216) then
        tmp = y * y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = (x * 2.0) + (x * x);
	double tmp;
	if (t_0 <= -1e-151) {
		tmp = x * 2.0;
	} else if (t_0 <= 6e+216) {
		tmp = y * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = (x * 2.0) + (x * x)
	tmp = 0
	if t_0 <= -1e-151:
		tmp = x * 2.0
	elif t_0 <= 6e+216:
		tmp = y * y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(Float64(x * 2.0) + Float64(x * x))
	tmp = 0.0
	if (t_0 <= -1e-151)
		tmp = Float64(x * 2.0);
	elseif (t_0 <= 6e+216)
		tmp = Float64(y * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = (x * 2.0) + (x * x);
	tmp = 0.0;
	if (t_0 <= -1e-151)
		tmp = x * 2.0;
	elseif (t_0 <= 6e+216)
		tmp = y * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(N[(x * 2.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, -1e-151], N[(x * 2.0), $MachinePrecision], If[LessEqual[t$95$0, 6e+216], N[(y * y), $MachinePrecision], N[(x * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < -9.9999999999999994e-152

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l* N/A

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

      5. lft-mult-inverse N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-lft-identity N/A

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

      10. *-lowering-*.f64 N/A

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

      11. +-lowering-+.f64 70.2

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

   5. Simplified 70.2%

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

   6. Taylor expanded in x around 0

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

   8. Simplified 62.5%

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

   if -9.9999999999999994e-152 < (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 5.9999999999999995e216

   1. Initial program 100.0%

      \[\left(x \cdot 2 + x \cdot x\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. +-lft-identity N/A

         \[\leadsto \color{blue}{0 + {y}^{2}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{{y}^{2} + 0} \]

      3. unpow2 N/A

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

      4. accelerator-lowering-fma.f64 62.8

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

   5. Simplified 62.8%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 62.8

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

   7. Applied egg-rr 62.8%

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

   if 5.9999999999999995e216 < (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{x}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 93.8

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

   5. Simplified 93.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 93.8

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

   7. Applied egg-rr 93.8%

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

Alternative 3: 59.7% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if (((y * y) + ((x * 2.0) + (x * x))) <= 2e-5) {
		tmp = x * 2.0;
	} else {
		tmp = x * x;
	}
	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) + ((x * 2.0d0) + (x * x))) <= 2d-5) then
        tmp = x * 2.0d0
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) (*.f64 y y)) < 2.00000000000000016e-5

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l* N/A

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

      5. lft-mult-inverse N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-lft-identity N/A

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

      10. *-lowering-*.f64 N/A

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

      11. +-lowering-+.f64 74.6

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

   5. Simplified 74.6%

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

   6. Taylor expanded in x around 0

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

   8. Simplified 71.4%

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

   if 2.00000000000000016e-5 < (+.f64 (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) (*.f64 y y))

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{x}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 56.2

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

   5. Simplified 56.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 56.2

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

   7. Applied egg-rr 56.2%

      \[\leadsto \color{blue}{x \cdot x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 60.1%

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

Alternative 4: 98.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (+ (* x 2.0) (* x x)) 1e-33) (fma 2.0 x (* y y)) (fma x x (* y y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 1.0000000000000001e-33

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. accelerator-lowering-fma.f64 N/A

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

      2. +-lft-identity N/A

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

      3. +-commutative N/A

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

      4. unpow2 N/A

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

      5. accelerator-lowering-fma.f64 98.2

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

   5. Simplified 98.2%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 98.2

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

   7. Applied egg-rr 98.2%

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

   if 1.0000000000000001e-33 < (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x))

   1. Initial program 100.0%

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

      1. +-commutative N/A

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

      2. associate-+l+ N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. *-lowering-*.f64 100.0

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

   4. Applied egg-rr 100.0%

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

   5. Taylor expanded in x around 0

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

      1. +-lft-identity N/A

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

      2. +-commutative N/A

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

      3. unpow2 N/A

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

      4. accelerator-lowering-fma.f64 98.5

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

   7. Simplified 98.5%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 98.5

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

   9. Applied egg-rr 98.5%

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

Alternative 5: 89.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -3.8e-7)
   (fma x x (* x 2.0))
   (if (<= x 1.85e+129) (fma 2.0 x (* y y)) (* x x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -3.8e-7) {
		tmp = fma(x, x, (x * 2.0));
	} else if (x <= 1.85e+129) {
		tmp = fma(2.0, x, (y * y));
	} else {
		tmp = x * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -3.8e-7)
		tmp = fma(x, x, Float64(x * 2.0));
	elseif (x <= 1.85e+129)
		tmp = fma(2.0, x, Float64(y * y));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -3.8e-7], N[(x * x + N[(x * 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.85e+129], N[(2.0 * x + N[(y * y), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -3.80000000000000015e-7

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l* N/A

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

      5. lft-mult-inverse N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-lft-identity N/A

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

      10. *-lowering-*.f64 N/A

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

      11. +-lowering-+.f64 77.4

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

   5. Simplified 77.4%

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

      1. distribute-rgt-in N/A

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

      2. +-commutative N/A

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

      3. accelerator-lowering-fma.f64 N/A

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

      4. +-rgt-identity N/A

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

      5. *-commutative N/A

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

      6. accelerator-lowering-fma.f64 77.4

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

   7. Applied egg-rr 77.4%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 77.4

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

   9. Applied egg-rr 77.4%

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

   if -3.80000000000000015e-7 < x < 1.84999999999999989e129

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. accelerator-lowering-fma.f64 N/A

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

      2. +-lft-identity N/A

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

      3. +-commutative N/A

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

      4. unpow2 N/A

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

      5. accelerator-lowering-fma.f64 91.4

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

   5. Simplified 91.4%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 91.4

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

   7. Applied egg-rr 91.4%

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

   if 1.84999999999999989e129 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{x}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 98.2

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

   5. Simplified 98.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 98.2

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

   7. Applied egg-rr 98.2%

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

Alternative 6: 89.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -9.6e-8)
   (* x (+ x 2.0))
   (if (<= x 1.85e+129) (fma 2.0 x (* y y)) (* x x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -9.6e-8) {
		tmp = x * (x + 2.0);
	} else if (x <= 1.85e+129) {
		tmp = fma(2.0, x, (y * y));
	} else {
		tmp = x * x;
	}
	return tmp;
}

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -9.6e-8)
		tmp = Float64(x * Float64(x + 2.0));
	elseif (x <= 1.85e+129)
		tmp = fma(2.0, x, Float64(y * y));
	else
		tmp = Float64(x * x);
	end
	return tmp
end

Wolfram

code[x_, y_] := If[LessEqual[x, -9.6e-8], N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.85e+129], N[(2.0 * x + N[(y * y), $MachinePrecision]), $MachinePrecision], N[(x * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.59999999999999994e-8

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l* N/A

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

      5. lft-mult-inverse N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-lft-identity N/A

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

      10. *-lowering-*.f64 N/A

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

      11. +-lowering-+.f64 77.4

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

   5. Simplified 77.4%

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

   if -9.59999999999999994e-8 < x < 1.84999999999999989e129

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. accelerator-lowering-fma.f64 N/A

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

      2. +-lft-identity N/A

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

      3. +-commutative N/A

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

      4. unpow2 N/A

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

      5. accelerator-lowering-fma.f64 91.4

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

   5. Simplified 91.4%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 91.4

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

   7. Applied egg-rr 91.4%

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

   if 1.84999999999999989e129 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. +-rgt-identity N/A

         \[\leadsto \color{blue}{{x}^{2} + 0} \]

      2. unpow2 N/A

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

      3. accelerator-lowering-fma.f64 98.2

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

   5. Simplified 98.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, 0\right)} \]
   6. Step-by-step derivation

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 98.2

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

   7. Applied egg-rr 98.2%

      \[\leadsto \color{blue}{x \cdot x} \]
3. Recombined 3 regimes into one program.

4. Final simplification 89.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.6 \cdot 10^{-8}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{elif}\;x \leq 1.85 \cdot 10^{+129}:\\ \;\;\;\;\mathsf{fma}\left(2, x, y \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 84.5% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 4e+96) (* x (+ x 2.0)) (* y y)))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 4e+96) {
		tmp = x * (x + 2.0);
	} 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) <= 4d+96) then
        tmp = x * (x + 2.0d0)
    else
        tmp = y * y
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 4.0000000000000002e96

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. associate-*l* N/A

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

      3. distribute-rgt-in N/A

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

      4. associate-*l* N/A

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

      5. lft-mult-inverse N/A

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

      6. *-commutative N/A

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

      7. distribute-lft-in N/A

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

      8. +-commutative N/A

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

      9. *-lft-identity N/A

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

      10. *-lowering-*.f64 N/A

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

      11. +-lowering-+.f64 84.7

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

   5. Simplified 84.7%

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

   if 4.0000000000000002e96 < (*.f64 y y)

   1. Initial program 100.0%

      \[\left(x \cdot 2 + x \cdot x\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. +-lft-identity N/A

         \[\leadsto \color{blue}{0 + {y}^{2}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{{y}^{2} + 0} \]

      3. unpow2 N/A

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

      4. accelerator-lowering-fma.f64 88.4

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

   5. Simplified 88.4%

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

      1. +-rgt-identity N/A

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

      2. *-lowering-*.f64 88.4

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

   7. Applied egg-rr 88.4%

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

4. Final simplification 86.3%

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

Alternative 8: 100.0% accurate, 1.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. distribute-lft-out N/A

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

   2. *-commutative N/A

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

   3. accelerator-lowering-fma.f64 N/A

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

   4. +-commutative N/A

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

   5. +-lowering-+.f64 N/A

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

   6. *-lowering-*.f64 100.0

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

4. Applied egg-rr 100.0%

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

Alternative 9: 21.0% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ x \cdot 2 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. associate-*l* N/A

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

   3. distribute-rgt-in N/A

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

   4. associate-*l* N/A

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

   5. lft-mult-inverse N/A

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

   6. *-commutative N/A

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

   7. distribute-lft-in N/A

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

   8. +-commutative N/A

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

   9. *-lft-identity N/A

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

   10. *-lowering-*.f64 N/A

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

   11. +-lowering-+.f64 61.8

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

5. Simplified 61.8%

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

6. Taylor expanded in x around 0

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

8. Simplified 21.2%

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

Developer Target 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024195 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

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

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