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

Percentage Accurate: 100.0% → 100.0%

Time: 3.0s

Alternatives: 6

Speedup: 1.2×

• 43.3% 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} \\ y \cdot y + x \cdot \left(x + 2\right) \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.6%

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

   1. distribute-lft-out 100.0%

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

3. Simplified 100.0%

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

4. Final simplification 100.0%

   \[\leadsto y \cdot y + x \cdot \left(x + 2\right) \]

Alternative 2: 83.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \cdot y \leq 6.6 \cdot 10^{-124} \lor \neg \left(y \cdot y \leq 6.8 \cdot 10^{-17}\right) \land y \cdot y \leq 1.4 \cdot 10^{+52}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= (* y y) 6.6e-124)
         (and (not (<= (* y y) 6.8e-17)) (<= (* y y) 1.4e+52)))
   (* x (+ x 2.0))
   (* y y)))

C

double code(double x, double y) {
	double tmp;
	if (((y * y) <= 6.6e-124) || (!((y * y) <= 6.8e-17) && ((y * y) <= 1.4e+52))) {
		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) <= 6.6d-124) .or. (.not. ((y * y) <= 6.8d-17)) .and. ((y * y) <= 1.4d+52)) 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) <= 6.6e-124) || (!((y * y) <= 6.8e-17) && ((y * y) <= 1.4e+52))) {
		tmp = x * (x + 2.0);
	} else {
		tmp = y * y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if ((y * y) <= 6.6e-124) or (not ((y * y) <= 6.8e-17) and ((y * y) <= 1.4e+52)):
		tmp = x * (x + 2.0)
	else:
		tmp = y * y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((Float64(y * y) <= 6.6e-124) || (!(Float64(y * y) <= 6.8e-17) && (Float64(y * y) <= 1.4e+52)))
		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) <= 6.6e-124) || (~(((y * y) <= 6.8e-17)) && ((y * y) <= 1.4e+52)))
		tmp = x * (x + 2.0);
	else
		tmp = y * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[N[(y * y), $MachinePrecision], 6.6e-124], And[N[Not[LessEqual[N[(y * y), $MachinePrecision], 6.8e-17]], $MachinePrecision], LessEqual[N[(y * y), $MachinePrecision], 1.4e+52]]], N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision], N[(y * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y y) < 6.59999999999999969e-124 or 6.7999999999999996e-17 < (*.f64 y y) < 1.4e52

   1. Initial program 99.1%

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

      1. distribute-lft-out 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 92.7%

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

   if 6.59999999999999969e-124 < (*.f64 y y) < 6.7999999999999996e-17 or 1.4e52 < (*.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. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 86.6%

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

      1. unpow2 86.6%

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

   6. Simplified 86.6%

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

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot y \leq 6.6 \cdot 10^{-124} \lor \neg \left(y \cdot y \leq 6.8 \cdot 10^{-17}\right) \land y \cdot y \leq 1.4 \cdot 10^{+52}:\\ \;\;\;\;x \cdot \left(x + 2\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot y\\ \end{array} \]

Alternative 3: 90.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -8.5e+19)
   (* x x)
   (if (<= x 3.2e-10) (+ (* y y) (+ x x)) (* x (+ x 2.0)))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -8.5e+19) {
		tmp = x * x;
	} else if (x <= 3.2e-10) {
		tmp = (y * y) + (x + x);
	} else {
		tmp = x * (x + 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-8.5d+19)) then
        tmp = x * x
    else if (x <= 3.2d-10) then
        tmp = (y * y) + (x + x)
    else
        tmp = x * (x + 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -8.5e+19) {
		tmp = x * x;
	} else if (x <= 3.2e-10) {
		tmp = (y * y) + (x + x);
	} else {
		tmp = x * (x + 2.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -8.5e+19:
		tmp = x * x
	elif x <= 3.2e-10:
		tmp = (y * y) + (x + x)
	else:
		tmp = x * (x + 2.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -8.5e+19)
		tmp = Float64(x * x);
	elseif (x <= 3.2e-10)
		tmp = Float64(Float64(y * y) + Float64(x + x));
	else
		tmp = Float64(x * Float64(x + 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -8.5e+19)
		tmp = x * x;
	elseif (x <= 3.2e-10)
		tmp = (y * y) + (x + x);
	else
		tmp = x * (x + 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -8.5e+19], N[(x * x), $MachinePrecision], If[LessEqual[x, 3.2e-10], N[(N[(y * y), $MachinePrecision] + N[(x + x), $MachinePrecision]), $MachinePrecision], N[(x * N[(x + 2.0), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -8.5e19

   1. Initial program 98.2%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 91.1%

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

      1. unpow2 91.1%

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

   6. Simplified 91.1%

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

   if -8.5e19 < x < 3.19999999999999981e-10

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 98.8%

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

      1. count-2 98.8%

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

   6. Simplified 98.8%

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

   if 3.19999999999999981e-10 < x

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in y around 0 84.2%

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

4. Final simplification 93.7%

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

Alternative 4: 71.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{+17}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-88}:\\ \;\;\;\;y \cdot y\\ \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 -4.8e+17)
   (* x x)
   (if (<= x 7.8e-88) (* y y) (if (<= x 2.0) (* x 2.0) (* x x)))))

C

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

Python

def code(x, y):
	tmp = 0
	if x <= -4.8e+17:
		tmp = x * x
	elif x <= 7.8e-88:
		tmp = y * y
	elif x <= 2.0:
		tmp = x * 2.0
	else:
		tmp = x * x
	return tmp

Julia

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

Wolfram

code[x_, y_] := If[LessEqual[x, -4.8e+17], N[(x * x), $MachinePrecision], If[LessEqual[x, 7.8e-88], N[(y * y), $MachinePrecision], If[LessEqual[x, 2.0], N[(x * 2.0), $MachinePrecision], N[(x * x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.8e17 or 2 < x

   1. Initial program 99.1%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 88.5%

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

      1. unpow2 88.5%

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

   6. Simplified 88.5%

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

   if -4.8e17 < x < 7.79999999999999985e-88

   1. Initial program 100.0%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around 0 67.0%

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

      1. unpow2 67.0%

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

   6. Simplified 67.0%

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

   if 7.79999999999999985e-88 < x < 2

   1. Initial program 100.0%

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

      1. distribute-lft-out 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 71.9%

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

   5. Taylor expanded in x around 0 58.5%

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

4. Final simplification 75.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.8 \cdot 10^{+17}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 7.8 \cdot 10^{-88}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq 2:\\ \;\;\;\;x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 5: 59.2% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2:\\ \;\;\;\;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 -2.0) (* x x) (if (<= x 2.0) (* x 2.0) (* x x))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.0) {
		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 <= (-2.0d0)) 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 <= -2.0) {
		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 <= -2.0:
		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 <= -2.0)
		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 <= -2.0)
		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, -2.0], 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 < -2 or 2 < x

   1. Initial program 99.1%

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

      1. distribute-lft-out 100.0%

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

   3. Simplified 100.0%

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

   4. Taylor expanded in x around inf 86.5%

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

      1. unpow2 86.5%

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

   6. Simplified 86.5%

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

   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. distribute-lft-out 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in y around 0 38.7%

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

   5. Taylor expanded in x around 0 36.5%

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

4. Final simplification 58.7%

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

Alternative 6: 20.4% 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 99.6%

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

   1. distribute-lft-out 100.0%

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

3. Simplified 100.0%

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

4. Taylor expanded in y around 0 60.0%

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

5. Taylor expanded in x around 0 21.7%

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

6. Final simplification 21.7%

   \[\leadsto x \cdot 2 \]

Developer target: 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 2023207 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

  :herbie-target
  (+ (* y y) (+ (* 2.0 x) (* x x)))

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