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

Percentage Accurate: 100.0% → 100.0%

Time: 3.6s

Alternatives: 7

Speedup: 1.2×

• 43.8% 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: 100.0% 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: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

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

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

   2. distribute-lft-out N/A

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

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

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

   4. +-commutative N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

   6. *-lowering-*.f64 100.0%

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

3. Simplified 100.0%

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

Alternative 2: 98.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (+ (* y y) (* x x))))
   (if (<= x -2.0) t_0 (if (<= x 2.0) (+ (* y y) (* x 2.0)) t_0))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2 or 2 < x

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 98.7%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{*.f64}\left(\color{blue}{y}, y\right)\right) \]

   7. Simplified 98.7%

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

   if -2 < x < 2

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0

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

      1. fma-define N/A

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

      2. *-lft-identity N/A

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

      3. lft-mult-inverse N/A

         \[\leadsto \mathsf{fma}\left(2, \left(\frac{1}{x} \cdot x\right) \cdot x, {y}^{2}\right) \]

      4. associate-*r* N/A

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

      5. unpow2 N/A

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

      6. *-rgt-identity N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{1}{x} \cdot {x}^{2}, {y}^{2} \cdot 1\right) \]

      7. *-inverses N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{1}{x} \cdot {x}^{2}, {y}^{2} \cdot \frac{{x}^{2}}{{x}^{2}}\right) \]

      8. associate-/l* N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{1}{x} \cdot {x}^{2}, \frac{{y}^{2} \cdot {x}^{2}}{{x}^{2}}\right) \]

      9. associate-*l/ N/A

         \[\leadsto \mathsf{fma}\left(2, \frac{1}{x} \cdot {x}^{2}, \frac{{y}^{2}}{{x}^{2}} \cdot {x}^{2}\right) \]

      10. fma-define N/A

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

      11. associate-*l* N/A

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

      12. associate-*l/ N/A

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

      13. associate-/l* N/A

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

      14. *-inverses N/A

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

      15. *-rgt-identity N/A

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

      16. +-commutative N/A

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

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

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

      18. unpow2 N/A

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

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

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

      20. associate-*l* N/A

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

      21. unpow2 N/A

          \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(y, y\right), \left(2 \cdot \left(\frac{1}{x} \cdot \left(x \cdot \color{blue}{x}\right)\right)\right)\right) \]

      22. associate-*r* N/A

          \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(y, y\right), \left(2 \cdot \left(\left(\frac{1}{x} \cdot x\right) \cdot \color{blue}{x}\right)\right)\right) \]

      23. lft-mult-inverse N/A

          \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(y, y\right), \left(2 \cdot \left(1 \cdot x\right)\right)\right) \]

   7. Simplified 99.6%

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

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2:\\ \;\;\;\;y \cdot y + x \cdot x\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;y \cdot y + x \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 96.4% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 6e-158

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*l* N/A

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

      4. *-lft-identity N/A

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

      5. fma-define N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. lft-mult-inverse N/A

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

      9. *-lft-identity N/A

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

      10. fma-define N/A

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

      11. unpow2 N/A

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

      12. distribute-rgt-in N/A

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

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

          \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(2 + x\right)}\right) \]

      14. +-lowering-+.f64 95.5%

          \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(2, \color{blue}{x}\right)\right) \]

   7. Simplified 95.5%

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

   if 6e-158 < (*.f64 y y)

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 97.4%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, x\right), \mathsf{*.f64}\left(\color{blue}{y}, y\right)\right) \]

   7. Simplified 97.4%

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

4. Final simplification 96.7%

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

Alternative 4: 70.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -240000000000:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{+132}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -240000000000.0) (* x x) (if (<= x 7.8e+132) (* y y) (* x x))))

C

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

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -240000000000.0) {
		tmp = x * x;
	} else if (x <= 7.8e+132) {
		tmp = y * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -240000000000.0:
		tmp = x * x
	elif x <= 7.8e+132:
		tmp = y * y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -240000000000.0)
		tmp = Float64(x * x);
	elseif (x <= 7.8e+132)
		tmp = Float64(y * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -240000000000.0)
		tmp = x * x;
	elseif (x <= 7.8e+132)
		tmp = y * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.4e11 or 7.80000000000000002e132 < x

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 92.6%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{x}\right) \]

   7. Simplified 92.6%

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

   if -2.4e11 < x < 7.80000000000000002e132

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 62.3%

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{y}\right) \]

   7. Simplified 62.3%

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

Alternative 5: 58.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-31}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4e-31) (* x x) (if (<= x 2.0) (* x 2.0) (* x x))))

C

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

Python

def code(x, y):
	tmp = 0
	if x <= -4e-31:
		tmp = x * x
	elif x <= 2.0:
		tmp = x * 2.0
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4e-31)
		tmp = Float64(x * x);
	elseif (x <= 2.0)
		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 (x <= -4e-31)
		tmp = x * x;
	elseif (x <= 2.0)
		tmp = x * 2.0;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -4e-31 or 2 < x

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 79.3%

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{x}\right) \]

   7. Simplified 79.3%

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

   if -4e-31 < x < 2

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*l* N/A

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

      4. *-lft-identity N/A

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

      5. fma-define N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. lft-mult-inverse N/A

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

      9. *-lft-identity N/A

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

      10. fma-define N/A

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

      11. unpow2 N/A

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

      12. distribute-rgt-in N/A

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

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

          \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(2 + x\right)}\right) \]

      14. +-lowering-+.f64 39.6%

          \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(2, \color{blue}{x}\right)\right) \]

   7. Simplified 39.6%

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

   8. Taylor expanded in x around 0

      \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{2}\right) \]
   9. Step-by-step derivation

   10. Simplified 39.1%

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

Alternative 6: 85.1% accurate, 0.9× speedup

Math

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

FPCore

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

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 1.55e-27) {
		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) <= 1.55d-27) 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) <= 1.55e-27) {
		tmp = x * (x + 2.0);
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

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

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 1.55e-27)
		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) <= 1.55e-27)
		tmp = x * (x + 2.0);
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 1.5499999999999999e-27

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. associate-*l* N/A

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

      4. *-lft-identity N/A

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

      5. fma-define N/A

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

      6. unpow2 N/A

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

      7. associate-*r* N/A

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

      8. lft-mult-inverse N/A

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

      9. *-lft-identity N/A

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

      10. fma-define N/A

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

      11. unpow2 N/A

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

      12. distribute-rgt-in N/A

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

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

          \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(2 + x\right)}\right) \]

      14. +-lowering-+.f64 90.4%

          \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(2, \color{blue}{x}\right)\right) \]

   7. Simplified 90.4%

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

   if 1.5499999999999999e-27 < (*.f64 y y)

   1. Initial program 100.0%

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

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

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

      2. distribute-lft-out N/A

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

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

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

      4. +-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

      6. *-lowering-*.f64 100.0%

         \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

   3. Simplified 100.0%

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

   5. Taylor expanded in x around 0

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

      1. unpow2 N/A

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

      2. *-lowering-*.f64 84.0%

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{y}\right) \]

   7. Simplified 84.0%

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

4. Final simplification 87.1%

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

Alternative 7: 20.7% 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. Step-by-step derivation

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

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

   2. distribute-lft-out N/A

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

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

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

   4. +-commutative N/A

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \left(x + 2\right)\right), \left(y \cdot y\right)\right) \]

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

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \left(y \cdot y\right)\right) \]

   6. *-lowering-*.f64 100.0%

      \[\leadsto \mathsf{+.f64}\left(\mathsf{*.f64}\left(x, \mathsf{+.f64}\left(x, 2\right)\right), \mathsf{*.f64}\left(y, \color{blue}{y}\right)\right) \]

3. Simplified 100.0%

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

5. Taylor expanded in x around inf

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

   1. +-commutative N/A

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

   2. distribute-rgt-in N/A

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

   3. associate-*l* N/A

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

   4. *-lft-identity N/A

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

   5. fma-define N/A

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

   6. unpow2 N/A

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

   7. associate-*r* N/A

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

   8. lft-mult-inverse N/A

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

   9. *-lft-identity N/A

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

   10. fma-define N/A

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

   11. unpow2 N/A

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

   12. distribute-rgt-in N/A

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

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

       \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(2 + x\right)}\right) \]

   14. +-lowering-+.f64 59.1%

       \[\leadsto \mathsf{*.f64}\left(x, \mathsf{+.f64}\left(2, \color{blue}{x}\right)\right) \]

7. Simplified 59.1%

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

8. Taylor expanded in x around 0

   \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{2}\right) \]
9. Step-by-step derivation

10. Simplified 22.4%

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

Developer Target 1: 100.0% 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 2024163 
(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)))