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

Percentage Accurate: 100.0% → 100.0%

Time: 7.9s

Alternatives: 7

Speedup: 1.0×

• 43.0% 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.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]

Derivation

1. Initial program 100.0%

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

Alternative 2: 72.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot 2 + x \cdot x\\ \mathbf{if}\;t\_0 \leq -2 \cdot 10^{-60}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;t\_0 \leq -2 \cdot 10^{-102}:\\ \;\;\;\;x \cdot 2\\ \mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+31}:\\ \;\;\;\;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 -2e-60)
     (* y y)
     (if (<= t_0 -2e-102) (* x 2.0) (if (<= t_0 4e+31) (* y y) (* x x))))))

C

double code(double x, double y) {
	double t_0 = (x * 2.0) + (x * x);
	double tmp;
	if (t_0 <= -2e-60) {
		tmp = y * y;
	} else if (t_0 <= -2e-102) {
		tmp = x * 2.0;
	} else if (t_0 <= 4e+31) {
		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 <= (-2d-60)) then
        tmp = y * y
    else if (t_0 <= (-2d-102)) then
        tmp = x * 2.0d0
    else if (t_0 <= 4d+31) 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 <= -2e-60) {
		tmp = y * y;
	} else if (t_0 <= -2e-102) {
		tmp = x * 2.0;
	} else if (t_0 <= 4e+31) {
		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 <= -2e-60:
		tmp = y * y
	elif t_0 <= -2e-102:
		tmp = x * 2.0
	elif t_0 <= 4e+31:
		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 <= -2e-60)
		tmp = Float64(y * y);
	elseif (t_0 <= -2e-102)
		tmp = Float64(x * 2.0);
	elseif (t_0 <= 4e+31)
		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 <= -2e-60)
		tmp = y * y;
	elseif (t_0 <= -2e-102)
		tmp = x * 2.0;
	elseif (t_0 <= 4e+31)
		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, -2e-60], N[(y * y), $MachinePrecision], If[LessEqual[t$95$0, -2e-102], N[(x * 2.0), $MachinePrecision], If[LessEqual[t$95$0, 4e+31], 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)) < -1.9999999999999999e-60 or -1.99999999999999987e-102 < (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 3.9999999999999999e31

   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. *-lowering-*.f64 62.7

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

   5. Simplified 62.7%

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

   if -1.9999999999999999e-60 < (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < -1.99999999999999987e-102

   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 100.0

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

   5. Simplified 100.0%

      \[\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 100.0%

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

   if 3.9999999999999999e31 < (+.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. unpow2 N/A

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

      2. *-lowering-*.f64 88.8

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

   5. Simplified 88.8%

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

Alternative 3: 59.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (+ (+ (* x 2.0) (* x x)) (* y y)) 5.0) (* x 2.0) (* x x)))

C

double code(double x, double y) {
	double tmp;
	if ((((x * 2.0) + (x * x)) + (y * y)) <= 5.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 * 2.0d0) + (x * x)) + (y * y)) <= 5.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 * 2.0) + (x * x)) + (y * y)) <= 5.0) {
		tmp = x * 2.0;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

code[x_, y_] := If[LessEqual[N[(N[(N[(x * 2.0), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision] + N[(y * y), $MachinePrecision]), $MachinePrecision], 5.0], 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)) < 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 86.5

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

   5. Simplified 86.5%

      \[\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 83.3%

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

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

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

      2. *-lowering-*.f64 55.7

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

   5. Simplified 55.7%

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

Alternative 4: 98.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 1.00000000000000008e-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 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. unpow2 N/A

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

      3. *-lowering-*.f64 98.3

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

   5. Simplified 98.3%

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

   if 1.00000000000000008e-5 < (+.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}} + y \cdot y \]
   4. Step-by-step derivation

      1. unpow2 N/A

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

      2. *-lowering-*.f64 99.5

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

   5. Simplified 99.5%

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

      1. +-commutative N/A

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

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

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

      3. *-lowering-*.f64 99.5

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

   7. Applied egg-rr 99.5%

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

Alternative 5: 90.3% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (+ (* x 2.0) (* x x)) 12000000000000.0)
   (fma 2.0 x (* y y))
   (* x (+ x 2.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (*.f64 x #s(literal 2 binary64)) (*.f64 x x)) < 1.2e13

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

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

      3. *-lowering-*.f64 98.4

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

   5. Simplified 98.4%

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

   if 1.2e13 < (+.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} \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 87.6

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

   5. Simplified 87.6%

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

4. Final simplification 93.4%

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

Alternative 6: 85.1% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= (* y y) 0.00032) (* x (+ x 2.0)) (* y y)))

C

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 3.20000000000000026e-4

   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 93.5

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

   5. Simplified 93.5%

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

   if 3.20000000000000026e-4 < (*.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. *-lowering-*.f64 82.8

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

   5. Simplified 82.8%

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

4. Final simplification 88.3%

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

Alternative 7: 20.6% 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 64.3

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

5. Simplified 64.3%

   \[\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 24.9%

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