Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, C

Percentage Accurate: 99.9% → 100.0%

Time: 4.5s

Alternatives: 7

Speedup: 1.1×

• 21.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

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 + z)) + (z * 5.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 + z)) + (z * 5.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma z 5.0 (* (+ z y) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 100.0

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

   5. lift-*.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 100.0

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

   8. lift-+.f64 N/A

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

   9. +-commutative N/A

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

   10. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 61.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{+140}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq -1.26 \cdot 10^{+95}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.5e+140)
   (* y x)
   (if (<= x -1.26e+95)
     (* x z)
     (if (or (<= x -5.3e-58) (not (<= x 1.05e-59))) (* y x) (* 5.0 z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.5e+140) {
		tmp = y * x;
	} else if (x <= -1.26e+95) {
		tmp = x * z;
	} else if ((x <= -5.3e-58) || !(x <= 1.05e-59)) {
		tmp = y * x;
	} else {
		tmp = 5.0 * z;
	}
	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.5d+140)) then
        tmp = y * x
    else if (x <= (-1.26d+95)) then
        tmp = x * z
    else if ((x <= (-5.3d-58)) .or. (.not. (x <= 1.05d-59))) then
        tmp = y * x
    else
        tmp = 5.0d0 * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -5.5e+140) {
		tmp = y * x;
	} else if (x <= -1.26e+95) {
		tmp = x * z;
	} else if ((x <= -5.3e-58) || !(x <= 1.05e-59)) {
		tmp = y * x;
	} else {
		tmp = 5.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -5.5e+140:
		tmp = y * x
	elif x <= -1.26e+95:
		tmp = x * z
	elif (x <= -5.3e-58) or not (x <= 1.05e-59):
		tmp = y * x
	else:
		tmp = 5.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -5.5e+140)
		tmp = Float64(y * x);
	elseif (x <= -1.26e+95)
		tmp = Float64(x * z);
	elseif ((x <= -5.3e-58) || !(x <= 1.05e-59))
		tmp = Float64(y * x);
	else
		tmp = Float64(5.0 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -5.5e+140)
		tmp = y * x;
	elseif (x <= -1.26e+95)
		tmp = x * z;
	elseif ((x <= -5.3e-58) || ~((x <= 1.05e-59)))
		tmp = y * x;
	else
		tmp = 5.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -5.5e+140], N[(y * x), $MachinePrecision], If[LessEqual[x, -1.26e+95], N[(x * z), $MachinePrecision], If[Or[LessEqual[x, -5.3e-58], N[Not[LessEqual[x, 1.05e-59]], $MachinePrecision]], N[(y * x), $MachinePrecision], N[(5.0 * z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -5.5e140 or -1.26e95 < x < -5.3000000000000003e-58 or 1.04999999999999998e-59 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 59.3

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

   5. Applied rewrites 59.3%

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

   if -5.5e140 < x < -1.26e95

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 91.7

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

   5. Applied rewrites 91.7%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 91.7%

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

   if -5.3000000000000003e-58 < x < 1.04999999999999998e-59

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 81.1

         \[\leadsto \color{blue}{5 \cdot z} \]

   5. Applied rewrites 81.1%

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

4. Final simplification 69.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.5 \cdot 10^{+140}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq -1.26 \cdot 10^{+95}:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;\left(z + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, 5, x \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.3e-58) (not (<= x 1.05e-59)))
   (* (+ z y) x)
   (fma z 5.0 (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.3e-58) || !(x <= 1.05e-59)) {
		tmp = (z + y) * x;
	} else {
		tmp = fma(z, 5.0, (x * z));
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.3e-58) || !(x <= 1.05e-59))
		tmp = Float64(Float64(z + y) * x);
	else
		tmp = fma(z, 5.0, Float64(x * z));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.3e-58], N[Not[LessEqual[x, 1.05e-59]], $MachinePrecision]], N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision], N[(z * 5.0 + N[(x * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.3000000000000003e-58 or 1.04999999999999998e-59 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 48.4

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

   5. Applied rewrites 48.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 42.3%

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

   9. Taylor expanded in x around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. lower-+.f64 93.9

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

   11. Applied rewrites 93.9%

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

   if -5.3000000000000003e-58 < x < 1.04999999999999998e-59

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 81.1

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

   5. Applied rewrites 81.1%

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

   7. Applied rewrites 81.2%

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

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;\left(z + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, 5, x \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 84.1% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;\left(z + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.3e-58) (not (<= x 1.05e-59))) (* (+ z y) x) (* 5.0 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.3e-58) || !(x <= 1.05e-59)) {
		tmp = (z + y) * x;
	} else {
		tmp = 5.0 * z;
	}
	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.3d-58)) .or. (.not. (x <= 1.05d-59))) then
        tmp = (z + y) * x
    else
        tmp = 5.0d0 * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.3e-58) || !(x <= 1.05e-59)) {
		tmp = (z + y) * x;
	} else {
		tmp = 5.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -5.3e-58) or not (x <= 1.05e-59):
		tmp = (z + y) * x
	else:
		tmp = 5.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.3e-58) || !(x <= 1.05e-59))
		tmp = Float64(Float64(z + y) * x);
	else
		tmp = Float64(5.0 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.3e-58) || ~((x <= 1.05e-59)))
		tmp = (z + y) * x;
	else
		tmp = 5.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.3e-58], N[Not[LessEqual[x, 1.05e-59]], $MachinePrecision]], N[(N[(z + y), $MachinePrecision] * x), $MachinePrecision], N[(5.0 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.3000000000000003e-58 or 1.04999999999999998e-59 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 48.4

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

   5. Applied rewrites 48.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 42.3%

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

   9. Taylor expanded in x around inf

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

       1. *-commutative N/A

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

       2. lower-*.f64 N/A

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

       3. +-commutative N/A

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

       4. lower-+.f64 93.9

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

   11. Applied rewrites 93.9%

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

   if -5.3000000000000003e-58 < x < 1.04999999999999998e-59

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 81.1

         \[\leadsto \color{blue}{5 \cdot z} \]

   5. Applied rewrites 81.1%

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

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5.3 \cdot 10^{-58} \lor \neg \left(x \leq 1.05 \cdot 10^{-59}\right):\\ \;\;\;\;\left(z + y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.6 \cdot 10^{-17} \lor \neg \left(z \leq 2.7 \cdot 10^{-114}\right):\\ \;\;\;\;\left(5 + x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -5.6e-17) (not (<= z 2.7e-114))) (* (+ 5.0 x) z) (* y x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -5.6e-17) || !(z <= 2.7e-114)) {
		tmp = (5.0 + x) * z;
	} else {
		tmp = y * 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 ((z <= (-5.6d-17)) .or. (.not. (z <= 2.7d-114))) then
        tmp = (5.0d0 + x) * z
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -5.6e-17) || !(z <= 2.7e-114)) {
		tmp = (5.0 + x) * z;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -5.6e-17) or not (z <= 2.7e-114):
		tmp = (5.0 + x) * z
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -5.6e-17) || !(z <= 2.7e-114))
		tmp = Float64(Float64(5.0 + x) * z);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -5.6e-17) || ~((z <= 2.7e-114)))
		tmp = (5.0 + x) * z;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -5.6e-17], N[Not[LessEqual[z, 2.7e-114]], $MachinePrecision]], N[(N[(5.0 + x), $MachinePrecision] * z), $MachinePrecision], N[(y * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -5.5999999999999998e-17 or 2.7e-114 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 85.5

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

   5. Applied rewrites 85.5%

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

   if -5.5999999999999998e-17 < z < 2.7e-114

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 73.0

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

   5. Applied rewrites 73.0%

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

4. Final simplification 80.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.6 \cdot 10^{-17} \lor \neg \left(z \leq 2.7 \cdot 10^{-114}\right):\\ \;\;\;\;\left(5 + x\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 61.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5 \lor \neg \left(x \leq 600\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.0) (not (<= x 600.0))) (* x z) (* 5.0 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.0) || !(x <= 600.0)) {
		tmp = x * z;
	} else {
		tmp = 5.0 * z;
	}
	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.0d0)) .or. (.not. (x <= 600.0d0))) then
        tmp = x * z
    else
        tmp = 5.0d0 * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.0) || !(x <= 600.0)) {
		tmp = x * z;
	} else {
		tmp = 5.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -5.0) or not (x <= 600.0):
		tmp = x * z
	else:
		tmp = 5.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.0) || !(x <= 600.0))
		tmp = Float64(x * z);
	else
		tmp = Float64(5.0 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -5.0) || ~((x <= 600.0)))
		tmp = x * z;
	else
		tmp = 5.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.0], N[Not[LessEqual[x, 600.0]], $MachinePrecision]], N[(x * z), $MachinePrecision], N[(5.0 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5 or 600 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. distribute-rgt-in N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-+.f64 50.4

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

   5. Applied rewrites 50.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 49.1%

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

   if -5 < x < 600

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 72.7

         \[\leadsto \color{blue}{5 \cdot z} \]

   5. Applied rewrites 72.7%

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

4. Final simplification 60.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5 \lor \neg \left(x \leq 600\right):\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;5 \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 27.6% accurate, 2.8× speedup

Math

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

FPCore

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

C

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

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 * z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

   1. distribute-rgt-in N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower-+.f64 61.6

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

5. Applied rewrites 61.6%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 26.7%

   \[\leadsto x \cdot \color{blue}{z} \]
9. Add Preprocessing

Developer Target 1: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return ((x + 5.0) * z) + (x * 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 = ((x + 5.0d0) * z) + (x * y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024329 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, C"
  :precision binary64

  :alt
  (! :herbie-platform default (+ (* (+ x 5) z) (* x y)))

  (+ (* x (+ y z)) (* z 5.0)))