Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4

Percentage Accurate: 99.9% → 99.9%

Time: 6.0s

Alternatives: 8

Speedup: 1.2×

Specification

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (+ (+ (+ (+ x y) y) x) z) x))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return ((((x + y) + y) + x) + z) + x

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x + y) + y) + x) + z) + x)
end

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (+ (+ (+ (+ (+ x y) y) x) z) x))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return ((((x + y) + y) + x) + z) + x

Julia

function code(x, y, z)
	return Float64(Float64(Float64(Float64(Float64(x + y) + y) + x) + z) + x)
end

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. associate-+l+ N/A

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

   4. lift-+.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. associate-+l+ N/A

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

   7. +-commutative N/A

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

   8. lift-+.f64 N/A

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

   9. count-2 N/A

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

   10. +-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. lift-+.f64 N/A

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

   13. +-commutative N/A

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

   14. lower-+.f64 N/A

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

   15. +-commutative N/A

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

   16. lower-+.f64 99.9

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

4. Applied rewrites 99.9%

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

5. Final simplification 99.9%

   \[\leadsto \mathsf{fma}\left(2, x + y, z + x\right) \]
6. Add Preprocessing

Alternative 2: 86.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(\left(z + y\right) + \left(x + y\right)\right) + x\\ \mathbf{if}\;z \leq -5.4 \cdot 10^{-46}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+110}:\\ \;\;\;\;\mathsf{fma}\left(3, x, y + y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ (+ (+ z y) (+ x y)) x)))
   (if (<= z -5.4e-46) t_0 (if (<= z 1.05e+110) (fma 3.0 x (+ y y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = ((z + y) + (x + y)) + x;
	double tmp;
	if (z <= -5.4e-46) {
		tmp = t_0;
	} else if (z <= 1.05e+110) {
		tmp = fma(3.0, x, (y + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(z + y) + Float64(x + y)) + x)
	tmp = 0.0
	if (z <= -5.4e-46)
		tmp = t_0;
	elseif (z <= 1.05e+110)
		tmp = fma(3.0, x, Float64(y + y));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(z + y), $MachinePrecision] + N[(x + y), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[z, -5.4e-46], t$95$0, If[LessEqual[z, 1.05e+110], N[(3.0 * x + N[(y + y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.4e-46 or 1.05000000000000007e110 < z

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-+.f64 N/A

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

      4. lift-+.f64 N/A

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

      5. associate-+l+ N/A

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

      6. +-commutative N/A

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

      7. lift-+.f64 N/A

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

      8. associate-+r+ N/A

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

      9. lower-+.f64 N/A

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

      10. lower-+.f64 99.9

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lower-+.f64 99.9

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

      14. lift-+.f64 N/A

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

      15. +-commutative N/A

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

      16. lower-+.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 88.4

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

   7. Applied rewrites 88.4%

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

   if -5.4e-46 < z < 1.05000000000000007e110

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 92.2

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

   5. Applied rewrites 92.2%

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

   7. Applied rewrites 92.2%

      \[\leadsto \mathsf{fma}\left(3, x, y + y\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 90.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.4 \cdot 10^{-46}:\\ \;\;\;\;\left(\left(z + y\right) + \left(x + y\right)\right) + x\\ \mathbf{elif}\;z \leq 1.05 \cdot 10^{+110}:\\ \;\;\;\;\mathsf{fma}\left(3, x, y + y\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(z + y\right) + \left(x + y\right)\right) + x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 83.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(3, x, y + y\right)\\ \mathbf{if}\;x \leq -1.7 \cdot 10^{+149}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-21}:\\ \;\;\;\;\mathsf{fma}\left(y, 2, z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma 3.0 x (+ y y))))
   (if (<= x -1.7e+149) t_0 (if (<= x 3.8e-21) (fma y 2.0 z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(3.0, x, (y + y));
	double tmp;
	if (x <= -1.7e+149) {
		tmp = t_0;
	} else if (x <= 3.8e-21) {
		tmp = fma(y, 2.0, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(3.0, x, Float64(y + y))
	tmp = 0.0
	if (x <= -1.7e+149)
		tmp = t_0;
	elseif (x <= 3.8e-21)
		tmp = fma(y, 2.0, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(3.0 * x + N[(y + y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -1.7e+149], t$95$0, If[LessEqual[x, 3.8e-21], N[(y * 2.0 + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.6999999999999999e149 or 3.7999999999999998e-21 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. associate-+r+ N/A

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

      2. distribute-rgt1-in N/A

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

      3. metadata-eval N/A

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

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 85.2

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

   5. Applied rewrites 85.2%

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

   7. Applied rewrites 85.2%

      \[\leadsto \mathsf{fma}\left(3, x, y + y\right) \]

   if -1.6999999999999999e149 < x < 3.7999999999999998e-21

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot y + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot 2} + z \]

      3. lower-fma.f64 92.5

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

   5. Applied rewrites 92.5%

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

Alternative 4: 83.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.4e+166)
   (fma 3.0 x z)
   (if (<= x 8e+19) (fma y 2.0 z) (fma 3.0 x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.4e+166) {
		tmp = fma(3.0, x, z);
	} else if (x <= 8e+19) {
		tmp = fma(y, 2.0, z);
	} else {
		tmp = fma(3.0, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.4e+166)
		tmp = fma(3.0, x, z);
	elseif (x <= 8e+19)
		tmp = fma(y, 2.0, z);
	else
		tmp = fma(3.0, x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.4e+166], N[(3.0 * x + z), $MachinePrecision], If[LessEqual[x, 8e+19], N[(y * 2.0 + z), $MachinePrecision], N[(3.0 * x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.40000000000000023e166 or 8e19 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. distribute-rgt1-in N/A

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

      4. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot x + z \]

      5. lower-fma.f64 84.6

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

   5. Applied rewrites 84.6%

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

   if -5.40000000000000023e166 < x < 8e19

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot y + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot 2} + z \]

      3. lower-fma.f64 90.9

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

   5. Applied rewrites 90.9%

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

Alternative 5: 83.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.4 \cdot 10^{+166}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+19}:\\ \;\;\;\;\left(z + y\right) + y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.4e+166)
   (fma 3.0 x z)
   (if (<= x 8e+19) (+ (+ z y) y) (fma 3.0 x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.4e+166) {
		tmp = fma(3.0, x, z);
	} else if (x <= 8e+19) {
		tmp = (z + y) + y;
	} else {
		tmp = fma(3.0, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.4e+166)
		tmp = fma(3.0, x, z);
	elseif (x <= 8e+19)
		tmp = Float64(Float64(z + y) + y);
	else
		tmp = fma(3.0, x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.4e+166], N[(3.0 * x + z), $MachinePrecision], If[LessEqual[x, 8e+19], N[(N[(z + y), $MachinePrecision] + y), $MachinePrecision], N[(3.0 * x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.40000000000000023e166 or 8e19 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. associate-+r+ N/A

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

      3. distribute-rgt1-in N/A

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

      4. metadata-eval N/A

         \[\leadsto \color{blue}{3} \cdot x + z \]

      5. lower-fma.f64 84.6

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

   5. Applied rewrites 84.6%

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

   if -5.40000000000000023e166 < x < 8e19

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot y + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot 2} + z \]

      3. lower-fma.f64 90.9

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

   5. Applied rewrites 90.9%

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

   7. Applied rewrites 90.8%

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

4. Final simplification 88.6%

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

Alternative 6: 79.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{+166}:\\ \;\;\;\;3 \cdot x\\ \mathbf{elif}\;x \leq 9.6 \cdot 10^{+145}:\\ \;\;\;\;\left(z + y\right) + y\\ \mathbf{else}:\\ \;\;\;\;3 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -9.5e+166) (* 3.0 x) (if (<= x 9.6e+145) (+ (+ z y) y) (* 3.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e+166) {
		tmp = 3.0 * x;
	} else if (x <= 9.6e+145) {
		tmp = (z + y) + y;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-9.5d+166)) then
        tmp = 3.0d0 * x
    else if (x <= 9.6d+145) then
        tmp = (z + y) + y
    else
        tmp = 3.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -9.5e+166) {
		tmp = 3.0 * x;
	} else if (x <= 9.6e+145) {
		tmp = (z + y) + y;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -9.5e+166:
		tmp = 3.0 * x
	elif x <= 9.6e+145:
		tmp = (z + y) + y
	else:
		tmp = 3.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -9.5e+166)
		tmp = Float64(3.0 * x);
	elseif (x <= 9.6e+145)
		tmp = Float64(Float64(z + y) + y);
	else
		tmp = Float64(3.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -9.5e+166)
		tmp = 3.0 * x;
	elseif (x <= 9.6e+145)
		tmp = (z + y) + y;
	else
		tmp = 3.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -9.5e+166], N[(3.0 * x), $MachinePrecision], If[LessEqual[x, 9.6e+145], N[(N[(z + y), $MachinePrecision] + y), $MachinePrecision], N[(3.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -9.49999999999999984e166 or 9.59999999999999967e145 < x

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 78.5

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

   5. Applied rewrites 78.5%

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

   if -9.49999999999999984e166 < x < 9.59999999999999967e145

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \color{blue}{2 \cdot y + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot 2} + z \]

      3. lower-fma.f64 86.1

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

   5. Applied rewrites 86.1%

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

   7. Applied rewrites 86.1%

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

4. Final simplification 84.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{+166}:\\ \;\;\;\;3 \cdot x\\ \mathbf{elif}\;x \leq 9.6 \cdot 10^{+145}:\\ \;\;\;\;\left(z + y\right) + y\\ \mathbf{else}:\\ \;\;\;\;3 \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 50.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.4 \cdot 10^{+166}:\\ \;\;\;\;3 \cdot x\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+19}:\\ \;\;\;\;y + y\\ \mathbf{else}:\\ \;\;\;\;3 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.4e+166) (* 3.0 x) (if (<= x 8e+19) (+ y y) (* 3.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.4e+166) {
		tmp = 3.0 * x;
	} else if (x <= 8e+19) {
		tmp = y + y;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-5.4d+166)) then
        tmp = 3.0d0 * x
    else if (x <= 8d+19) then
        tmp = y + y
    else
        tmp = 3.0d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.4e+166) {
		tmp = 3.0 * x;
	} else if (x <= 8e+19) {
		tmp = y + y;
	} else {
		tmp = 3.0 * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -5.4e+166:
		tmp = 3.0 * x
	elif x <= 8e+19:
		tmp = y + y
	else:
		tmp = 3.0 * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.4e+166)
		tmp = Float64(3.0 * x);
	elseif (x <= 8e+19)
		tmp = Float64(y + y);
	else
		tmp = Float64(3.0 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -5.4e+166)
		tmp = 3.0 * x;
	elseif (x <= 8e+19)
		tmp = y + y;
	else
		tmp = 3.0 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.4e+166], N[(3.0 * x), $MachinePrecision], If[LessEqual[x, 8e+19], N[(y + y), $MachinePrecision], N[(3.0 * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.40000000000000023e166 or 8e19 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 69.0

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

   5. Applied rewrites 69.0%

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

   if -5.40000000000000023e166 < x < 8e19

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 50.5

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

   5. Applied rewrites 50.5%

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

   7. Applied rewrites 50.5%

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

Alternative 8: 34.1% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ y + y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ y y))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return y + y

Julia

function code(x, y, z)
	return Float64(y + y)
end

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(y + y), $MachinePrecision]

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 37.9

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

5. Applied rewrites 37.9%

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

7. Applied rewrites 37.9%

   \[\leadsto y + \color{blue}{y} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024243 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4"
  :precision binary64
  (+ (+ (+ (+ (+ x y) y) x) z) x))