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

Percentage Accurate: 99.9% → 100.0%

Time: 5.0s

Alternatives: 10

Speedup: 1.1×

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(z * 5.0 + N[(x * N[(y + z), $MachinePrecision]), $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. Final simplification 100.0%

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

Alternative 2: 98.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y + z\right)\\ \mathbf{if}\;x \leq -5:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 5:\\ \;\;\;\;5 \cdot z + x \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (+ y z))))
   (if (<= x -5.0) t_0 (if (<= x 5.0) (+ (* 5.0 z) (* x y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y + z);
	double tmp;
	if (x <= -5.0) {
		tmp = t_0;
	} else if (x <= 5.0) {
		tmp = (5.0 * z) + (x * y);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x * (y + z)
    if (x <= (-5.0d0)) then
        tmp = t_0
    else if (x <= 5.0d0) then
        tmp = (5.0d0 * z) + (x * y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = x * (y + z)
	tmp = 0
	if x <= -5.0:
		tmp = t_0
	elif x <= 5.0:
		tmp = (5.0 * z) + (x * y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(y + z))
	tmp = 0.0
	if (x <= -5.0)
		tmp = t_0;
	elseif (x <= 5.0)
		tmp = Float64(Float64(5.0 * z) + Float64(x * y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (y + z);
	tmp = 0.0;
	if (x <= -5.0)
		tmp = t_0;
	elseif (x <= 5.0)
		tmp = (5.0 * z) + (x * y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -5 or 5 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y + z\right)} \]
   4. 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 99.3

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

   5. Applied rewrites 99.3%

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

   if -5 < x < 5

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 98.7

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

   5. Applied rewrites 98.7%

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

4. Final simplification 99.0%

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

Alternative 3: 98.8% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (+ y z))))
   (if (<= x -5.0) t_0 (if (<= x 5.0) (fma z 5.0 (* x y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y + z);
	double tmp;
	if (x <= -5.0) {
		tmp = t_0;
	} else if (x <= 5.0) {
		tmp = fma(z, 5.0, (x * y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(y + z))
	tmp = 0.0
	if (x <= -5.0)
		tmp = t_0;
	elseif (x <= 5.0)
		tmp = fma(z, 5.0, Float64(x * y));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -5 or 5 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y + z\right)} \]
   4. 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 99.3

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

   5. Applied rewrites 99.3%

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

   if -5 < x < 5

   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. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 98.6

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

   7. Applied rewrites 98.6%

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

4. Final simplification 98.9%

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

Alternative 4: 79.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - -5\right) \cdot z\\ \mathbf{if}\;z \leq -2.6 \cdot 10^{+49}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{-36}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x -5.0) z)))
   (if (<= z -2.6e+49) t_0 (if (<= z 2.65e-36) (fma z x (* x y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x - -5.0) * z;
	double tmp;
	if (z <= -2.6e+49) {
		tmp = t_0;
	} else if (z <= 2.65e-36) {
		tmp = fma(z, x, (x * y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - -5.0) * z)
	tmp = 0.0
	if (z <= -2.6e+49)
		tmp = t_0;
	elseif (z <= 2.65e-36)
		tmp = fma(z, x, Float64(x * y));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - -5.0), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -2.6e+49], t$95$0, If[LessEqual[z, 2.65e-36], N[(z * x + N[(x * y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.59999999999999989e49 or 2.6499999999999999e-36 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. metadata-eval N/A

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

      5. sub-neg N/A

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

      6. lower--.f64 88.9

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

   5. Applied rewrites 88.9%

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

   if -2.59999999999999989e49 < z < 2.6499999999999999e-36

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y + z\right)} \]
   4. 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 83.1

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

   5. Applied rewrites 83.1%

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

   7. Applied rewrites 83.2%

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

Alternative 5: 79.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(x - -5\right) \cdot z\\ \mathbf{if}\;z \leq -2.6 \cdot 10^{+49}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{-36}:\\ \;\;\;\;x \cdot \left(y + z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* (- x -5.0) z)))
   (if (<= z -2.6e+49) t_0 (if (<= z 2.65e-36) (* x (+ y z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x - -5.0) * z;
	double tmp;
	if (z <= -2.6e+49) {
		tmp = t_0;
	} else if (z <= 2.65e-36) {
		tmp = x * (y + z);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = (x - (-5.0d0)) * z
    if (z <= (-2.6d+49)) then
        tmp = t_0
    else if (z <= 2.65d-36) then
        tmp = x * (y + z)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x - -5.0) * z;
	double tmp;
	if (z <= -2.6e+49) {
		tmp = t_0;
	} else if (z <= 2.65e-36) {
		tmp = x * (y + z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x - -5.0) * z
	tmp = 0
	if z <= -2.6e+49:
		tmp = t_0
	elif z <= 2.65e-36:
		tmp = x * (y + z)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x - -5.0) * z)
	tmp = 0.0
	if (z <= -2.6e+49)
		tmp = t_0;
	elseif (z <= 2.65e-36)
		tmp = Float64(x * Float64(y + z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x - -5.0) * z;
	tmp = 0.0;
	if (z <= -2.6e+49)
		tmp = t_0;
	elseif (z <= 2.65e-36)
		tmp = x * (y + z);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x - -5.0), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -2.6e+49], t$95$0, If[LessEqual[z, 2.65e-36], N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.59999999999999989e49 or 2.6499999999999999e-36 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. metadata-eval N/A

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

      5. sub-neg N/A

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

      6. lower--.f64 88.9

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

   5. Applied rewrites 88.9%

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

   if -2.59999999999999989e49 < z < 2.6499999999999999e-36

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y + z\right)} \]
   4. 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 83.1

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

   5. Applied rewrites 83.1%

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

4. Final simplification 86.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2.6 \cdot 10^{+49}:\\ \;\;\;\;\left(x - -5\right) \cdot z\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{-36}:\\ \;\;\;\;x \cdot \left(y + z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x - -5\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 84.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \left(y + z\right)\\ \mathbf{if}\;x \leq -6.6 \cdot 10^{-72}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 7 \cdot 10^{-61}:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (+ y z))))
   (if (<= x -6.6e-72) t_0 (if (<= x 7e-61) (* 5.0 z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x * (y + z);
	double tmp;
	if (x <= -6.6e-72) {
		tmp = t_0;
	} else if (x <= 7e-61) {
		tmp = 5.0 * z;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x * (y + z)
    if (x <= (-6.6d-72)) then
        tmp = t_0
    else if (x <= 7d-61) then
        tmp = 5.0d0 * z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * (y + z);
	double tmp;
	if (x <= -6.6e-72) {
		tmp = t_0;
	} else if (x <= 7e-61) {
		tmp = 5.0 * z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * (y + z)
	tmp = 0
	if x <= -6.6e-72:
		tmp = t_0
	elif x <= 7e-61:
		tmp = 5.0 * z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * Float64(y + z))
	tmp = 0.0
	if (x <= -6.6e-72)
		tmp = t_0;
	elseif (x <= 7e-61)
		tmp = Float64(5.0 * z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * (y + z);
	tmp = 0.0;
	if (x <= -6.6e-72)
		tmp = t_0;
	elseif (x <= 7e-61)
		tmp = 5.0 * z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[(y + z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -6.6e-72], t$95$0, If[LessEqual[x, 7e-61], N[(5.0 * z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.6e-72 or 7.0000000000000006e-61 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \left(y + z\right)} \]
   4. 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 92.1

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

   5. Applied rewrites 92.1%

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

   if -6.6e-72 < x < 7.0000000000000006e-61

   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 76.2

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

   5. Applied rewrites 76.2%

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

4. Final simplification 85.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{-72}:\\ \;\;\;\;x \cdot \left(y + z\right)\\ \mathbf{elif}\;x \leq 7 \cdot 10^{-61}:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y + z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 61.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{-72}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 24000:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -6.6e-72) (* x y) (if (<= x 24000.0) (* 5.0 z) (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -6.6e-72) {
		tmp = x * y;
	} else if (x <= 24000.0) {
		tmp = 5.0 * z;
	} else {
		tmp = x * 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 <= (-6.6d-72)) then
        tmp = x * y
    else if (x <= 24000.0d0) then
        tmp = 5.0d0 * z
    else
        tmp = x * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -6.6e-72) {
		tmp = x * y;
	} else if (x <= 24000.0) {
		tmp = 5.0 * z;
	} else {
		tmp = x * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -6.6e-72:
		tmp = x * y
	elif x <= 24000.0:
		tmp = 5.0 * z
	else:
		tmp = x * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -6.6e-72)
		tmp = Float64(x * y);
	elseif (x <= 24000.0)
		tmp = Float64(5.0 * z);
	else
		tmp = Float64(x * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -6.6e-72)
		tmp = x * y;
	elseif (x <= 24000.0)
		tmp = 5.0 * z;
	else
		tmp = x * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -6.6e-72], N[(x * y), $MachinePrecision], If[LessEqual[x, 24000.0], N[(5.0 * z), $MachinePrecision], N[(x * z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -6.6e-72

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 55.2

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

   5. Applied rewrites 55.2%

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

   if -6.6e-72 < x < 24000

   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 71.2

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

   5. Applied rewrites 71.2%

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

   if 24000 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. metadata-eval N/A

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

      5. sub-neg N/A

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

      6. lower--.f64 65.9

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

   5. Applied rewrites 65.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 65.9%

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

4. Final simplification 65.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{-72}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 24000:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 61.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 24000:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -5.0) (* x z) (if (<= x 24000.0) (* 5.0 z) (* x z))))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if x <= -5.0:
		tmp = x * z
	elif x <= 24000.0:
		tmp = 5.0 * z
	else:
		tmp = x * z
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -5 or 24000 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. metadata-eval N/A

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

      5. sub-neg N/A

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

      6. lower--.f64 56.5

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

   5. Applied rewrites 56.5%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 55.9%

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

   if -5 < x < 24000

   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 67.1

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

   5. Applied rewrites 67.1%

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

4. Final simplification 61.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;x \leq 24000:\\ \;\;\;\;5 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 98.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(y * x + N[(N[(x + 5.0), $MachinePrecision] * z), $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. lift-*.f64 N/A

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

   3. lift-+.f64 N/A

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

   4. distribute-rgt-in N/A

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

   5. associate-+l+ N/A

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

   6. lower-fma.f64 N/A

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

   7. lift-*.f64 N/A

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

   8. distribute-lft-out N/A

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

   9. lower-*.f64 N/A

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

   10. lower-+.f64 99.6

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

4. Applied rewrites 99.6%

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

5. Final simplification 99.6%

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

Alternative 10: 27.7% 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 z around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. metadata-eval N/A

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

   5. sub-neg N/A

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

   6. lower--.f64 62.4

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

5. Applied rewrites 62.4%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 29.1%

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

9. Final simplification 29.1%

   \[\leadsto x \cdot z \]
10. Add Preprocessing

Developer Target 1: 97.8% 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 2024276 
(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)))