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

Percentage Accurate: 99.9% → 99.9%

Time: 5.5s

Alternatives: 7

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, y + x, z + x\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(2.0 * N[(y + x), $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. Add Preprocessing

Alternative 2: 84.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.4 \cdot 10^{+162}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{elif}\;x \leq -55:\\ \;\;\;\;\mathsf{fma}\left(3, x, y + y\right)\\ \mathbf{elif}\;x \leq 1.52 \cdot 10^{+140}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.4e+162)
   (fma 3.0 x z)
   (if (<= x -55.0)
     (fma 3.0 x (+ y y))
     (if (<= x 1.52e+140) (fma 2.0 y z) (fma 3.0 x z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.4e+162) {
		tmp = fma(3.0, x, z);
	} else if (x <= -55.0) {
		tmp = fma(3.0, x, (y + y));
	} else if (x <= 1.52e+140) {
		tmp = fma(2.0, y, z);
	} else {
		tmp = fma(3.0, x, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.4e+162)
		tmp = fma(3.0, x, z);
	elseif (x <= -55.0)
		tmp = fma(3.0, x, Float64(y + y));
	elseif (x <= 1.52e+140)
		tmp = fma(2.0, y, z);
	else
		tmp = fma(3.0, x, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.4e+162], N[(3.0 * x + z), $MachinePrecision], If[LessEqual[x, -55.0], N[(3.0 * x + N[(y + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 1.52e+140], N[(2.0 * y + z), $MachinePrecision], N[(3.0 * x + z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.4000000000000004e162 or 1.52e140 < 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 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 94.1

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

   5. Applied rewrites 94.1%

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

   if -4.4000000000000004e162 < x < -55

   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 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. lower-*.f64 81.1

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

   5. Applied rewrites 81.1%

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

   7. Applied rewrites 81.1%

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

   if -55 < x < 1.52e140

   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. lower-fma.f64 89.5

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

   5. Applied rewrites 89.5%

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

Alternative 3: 84.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+134} \lor \neg \left(x \leq 1.52 \cdot 10^{+140}\right):\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.38e+134) (not (<= x 1.52e+140)))
   (fma 3.0 x z)
   (fma 2.0 y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.38e+134) || !(x <= 1.52e+140)) {
		tmp = fma(3.0, x, z);
	} else {
		tmp = fma(2.0, y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.38e+134) || !(x <= 1.52e+140))
		tmp = fma(3.0, x, z);
	else
		tmp = fma(2.0, y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.38e+134], N[Not[LessEqual[x, 1.52e+140]], $MachinePrecision]], N[(3.0 * x + z), $MachinePrecision], N[(2.0 * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.38e134 or 1.52e140 < 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 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 94.4

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

   5. Applied rewrites 94.4%

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

   if -1.38e134 < x < 1.52e140

   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. lower-fma.f64 84.6

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

   5. Applied rewrites 84.6%

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

4. Final simplification 87.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+134} \lor \neg \left(x \leq 1.52 \cdot 10^{+140}\right):\\ \;\;\;\;\mathsf{fma}\left(3, x, z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+134} \lor \neg \left(x \leq 2.05 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.5e+134) (not (<= x 2.05e+140))) (* 3.0 x) (fma 2.0 y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.5e+134) || !(x <= 2.05e+140)) {
		tmp = 3.0 * x;
	} else {
		tmp = fma(2.0, y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.5e+134) || !(x <= 2.05e+140))
		tmp = Float64(3.0 * x);
	else
		tmp = fma(2.0, y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.5e+134], N[Not[LessEqual[x, 2.05e+140]], $MachinePrecision]], N[(3.0 * x), $MachinePrecision], N[(2.0 * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.49999999999999998e134 or 2.0499999999999999e140 < 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 79.6

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

   5. Applied rewrites 79.6%

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

   if -1.49999999999999998e134 < x < 2.0499999999999999e140

   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. lower-fma.f64 84.6

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

   5. Applied rewrites 84.6%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+134} \lor \neg \left(x \leq 2.05 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(2, y, z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+134} \lor \neg \left(x \leq 2.05 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(z + y\right) + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.5e+134) (not (<= x 2.05e+140))) (* 3.0 x) (+ (+ z y) y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.5e+134) || !(x <= 2.05e+140)) {
		tmp = 3.0 * x;
	} else {
		tmp = (z + y) + y;
	}
	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 <= (-1.5d+134)) .or. (.not. (x <= 2.05d+140))) then
        tmp = 3.0d0 * x
    else
        tmp = (z + y) + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.5e+134) || !(x <= 2.05e+140)) {
		tmp = 3.0 * x;
	} else {
		tmp = (z + y) + y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.5e+134) or not (x <= 2.05e+140):
		tmp = 3.0 * x
	else:
		tmp = (z + y) + y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.5e+134) || !(x <= 2.05e+140))
		tmp = Float64(3.0 * x);
	else
		tmp = Float64(Float64(z + y) + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.5e+134) || ~((x <= 2.05e+140)))
		tmp = 3.0 * x;
	else
		tmp = (z + y) + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.5e+134], N[Not[LessEqual[x, 2.05e+140]], $MachinePrecision]], N[(3.0 * x), $MachinePrecision], N[(N[(z + y), $MachinePrecision] + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.49999999999999998e134 or 2.0499999999999999e140 < 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 79.6

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

   5. Applied rewrites 79.6%

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

   if -1.49999999999999998e134 < x < 2.0499999999999999e140

   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. lower-fma.f64 84.6

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

   5. Applied rewrites 84.6%

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

   7. Applied rewrites 84.6%

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

4. Final simplification 83.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+134} \lor \neg \left(x \leq 2.05 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(z + y\right) + y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 51.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+134} \lor \neg \left(x \leq 1.52 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;y + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.38e+134) (not (<= x 1.52e+140))) (* 3.0 x) (+ y y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.38e+134) || !(x <= 1.52e+140)) {
		tmp = 3.0 * x;
	} else {
		tmp = y + y;
	}
	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 <= (-1.38d+134)) .or. (.not. (x <= 1.52d+140))) then
        tmp = 3.0d0 * x
    else
        tmp = y + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.38e+134) || !(x <= 1.52e+140)) {
		tmp = 3.0 * x;
	} else {
		tmp = y + y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.38e+134) or not (x <= 1.52e+140):
		tmp = 3.0 * x
	else:
		tmp = y + y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.38e+134) || !(x <= 1.52e+140))
		tmp = Float64(3.0 * x);
	else
		tmp = Float64(y + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.38e+134) || ~((x <= 1.52e+140)))
		tmp = 3.0 * x;
	else
		tmp = y + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.38e+134], N[Not[LessEqual[x, 1.52e+140]], $MachinePrecision]], N[(3.0 * x), $MachinePrecision], N[(y + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.38e134 or 1.52e140 < 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 79.6

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

   5. Applied rewrites 79.6%

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

   if -1.38e134 < x < 1.52e140

   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 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. lower-*.f64 61.8

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

   5. Applied rewrites 61.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 46.7%

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

   10. Applied rewrites 46.7%

       \[\leadsto y + y \]
3. Recombined 2 regimes into one program.

4. Final simplification 56.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{+134} \lor \neg \left(x \leq 1.52 \cdot 10^{+140}\right):\\ \;\;\;\;3 \cdot x\\ \mathbf{else}:\\ \;\;\;\;y + y\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 34.0% 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 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. lower-*.f64 68.9

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

5. Applied rewrites 68.9%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 34.8%

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

10. Applied rewrites 34.8%

    \[\leadsto y + y \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024337 
(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))