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

Percentage Accurate: 100.0% → 100.0%

Time: 4.0s

Alternatives: 6

Speedup: 1.5×

• 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.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_] := N[(y * y + N[(N[(2.0 + x), $MachinePrecision] * x), $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. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 100.0

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

   5. lift-+.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. lift-*.f64 N/A

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

   8. distribute-lft-out N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 4.6 \cdot 10^{-30}:\\ \;\;\;\;\left(x - -2\right) \cdot x\\ \mathbf{elif}\;y \cdot y \leq 2.35 \cdot 10^{+79} \lor \neg \left(y \cdot y \leq 3.2 \cdot 10^{+134}\right):\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 4.6e-30)
   (* (- x -2.0) x)
   (if (or (<= (* y y) 2.35e+79) (not (<= (* y y) 3.2e+134)))
     (* y y)
     (* x x))))

C

double code(double x, double y) {
	double tmp;
	if ((y * y) <= 4.6e-30) {
		tmp = (x - -2.0) * x;
	} else if (((y * y) <= 2.35e+79) || !((y * y) <= 3.2e+134)) {
		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 ((y * y) <= 4.6d-30) then
        tmp = (x - (-2.0d0)) * x
    else if (((y * y) <= 2.35d+79) .or. (.not. ((y * y) <= 3.2d+134))) 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 ((y * y) <= 4.6e-30) {
		tmp = (x - -2.0) * x;
	} else if (((y * y) <= 2.35e+79) || !((y * y) <= 3.2e+134)) {
		tmp = y * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y * y) <= 4.6e-30:
		tmp = (x - -2.0) * x
	elif ((y * y) <= 2.35e+79) or not ((y * y) <= 3.2e+134):
		tmp = y * y
	else:
		tmp = x * x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (Float64(y * y) <= 4.6e-30)
		tmp = Float64(Float64(x - -2.0) * x);
	elseif ((Float64(y * y) <= 2.35e+79) || !(Float64(y * y) <= 3.2e+134))
		tmp = Float64(y * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y * y) <= 4.6e-30)
		tmp = (x - -2.0) * x;
	elseif (((y * y) <= 2.35e+79) || ~(((y * y) <= 3.2e+134)))
		tmp = y * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[N[(y * y), $MachinePrecision], 4.6e-30], N[(N[(x - -2.0), $MachinePrecision] * x), $MachinePrecision], If[Or[LessEqual[N[(y * y), $MachinePrecision], 2.35e+79], N[Not[LessEqual[N[(y * y), $MachinePrecision], 3.2e+134]], $MachinePrecision]], N[(y * y), $MachinePrecision], N[(x * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 y y) < 4.59999999999999968e-30

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. unpow2 N/A

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

      2. distribute-rgt-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. metadata-eval 85.5

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

   5. Applied rewrites 85.5%

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

   if 4.59999999999999968e-30 < (*.f64 y y) < 2.35000000000000011e79 or 3.2000000000000001e134 < (*.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. unpow2 N/A

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

      2. lower-*.f64 86.2

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

   5. Applied rewrites 86.2%

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

   if 2.35000000000000011e79 < (*.f64 y y) < 3.2000000000000001e134

   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. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 72.6

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

   7. Applied rewrites 72.6%

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

4. Final simplification 84.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 4.6 \cdot 10^{-30}:\\ \;\;\;\;\left(x - -2\right) \cdot x\\ \mathbf{elif}\;y \cdot y \leq 2.35 \cdot 10^{+79} \lor \neg \left(y \cdot y \leq 3.2 \cdot 10^{+134}\right):\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 9.9999999999999996e86

   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. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 97.1%

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

   if 9.9999999999999996e86 < (+.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 y around 0

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

      1. unpow2 N/A

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

      2. distribute-rgt-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. metadata-eval 88.9

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

   5. Applied rewrites 88.9%

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

4. Final simplification 93.6%

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

Alternative 4: 89.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 9.9999999999999996e86

   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. lower-fma.f64 N/A

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

      2. unpow2 N/A

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

      3. lower-*.f64 97.1

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

   5. Applied rewrites 97.1%

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

   if 9.9999999999999996e86 < (+.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 y around 0

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

      1. unpow2 N/A

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

      2. distribute-rgt-in N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. +-commutative N/A

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

      6. metadata-eval N/A

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

      7. metadata-eval N/A

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

      8. sub-neg N/A

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

      9. lower--.f64 N/A

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

      10. metadata-eval 88.9

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

   5. Applied rewrites 88.9%

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

4. Final simplification 93.6%

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

Alternative 5: 72.5% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 9.9999999999999996e86

   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. unpow2 N/A

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

      2. lower-*.f64 64.9

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

   5. Applied rewrites 64.9%

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

   if 9.9999999999999996e86 < (+.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. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. distribute-lft-out N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in x around inf

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

      1. unpow2 N/A

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

      2. lower-*.f64 88.9

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

   7. Applied rewrites 88.9%

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

4. Final simplification 75.1%

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

Alternative 6: 42.6% accurate, 3.7× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_] := N[(x * x), $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. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 100.0

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

   5. lift-+.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. lift-*.f64 N/A

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

   8. distribute-lft-out N/A

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Taylor expanded in x around inf

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

   1. unpow2 N/A

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

   2. lower-*.f64 41.2

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

7. Applied rewrites 41.2%

   \[\leadsto \color{blue}{x \cdot x} \]
8. 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 2024314 
(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)))