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

Percentage Accurate: 99.9% → 99.9%

Time: 8.8s

Alternatives: 9

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 2: 46.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \left(z + z\right)\\ \mathbf{if}\;z \leq -1.95 \cdot 10^{+33}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq -5.8 \cdot 10^{-132}:\\ \;\;\;\;y \cdot 5\\ \mathbf{elif}\;z \leq 9.6 \cdot 10^{-84}:\\ \;\;\;\;x \cdot t\\ \mathbf{elif}\;z \leq 1.8 \cdot 10^{+35}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (+ z z))))
   (if (<= z -1.95e+33)
     t_1
     (if (<= z -5.8e-132)
       (* y 5.0)
       (if (<= z 9.6e-84) (* x t) (if (<= z 1.8e+35) (* y 5.0) t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * (z + z);
	double tmp;
	if (z <= -1.95e+33) {
		tmp = t_1;
	} else if (z <= -5.8e-132) {
		tmp = y * 5.0;
	} else if (z <= 9.6e-84) {
		tmp = x * t;
	} else if (z <= 1.8e+35) {
		tmp = y * 5.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * (z + z)
    if (z <= (-1.95d+33)) then
        tmp = t_1
    else if (z <= (-5.8d-132)) then
        tmp = y * 5.0d0
    else if (z <= 9.6d-84) then
        tmp = x * t
    else if (z <= 1.8d+35) then
        tmp = y * 5.0d0
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = x * (z + z);
	double tmp;
	if (z <= -1.95e+33) {
		tmp = t_1;
	} else if (z <= -5.8e-132) {
		tmp = y * 5.0;
	} else if (z <= 9.6e-84) {
		tmp = x * t;
	} else if (z <= 1.8e+35) {
		tmp = y * 5.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = x * (z + z)
	tmp = 0
	if z <= -1.95e+33:
		tmp = t_1
	elif z <= -5.8e-132:
		tmp = y * 5.0
	elif z <= 9.6e-84:
		tmp = x * t
	elif z <= 1.8e+35:
		tmp = y * 5.0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(x * Float64(z + z))
	tmp = 0.0
	if (z <= -1.95e+33)
		tmp = t_1;
	elseif (z <= -5.8e-132)
		tmp = Float64(y * 5.0);
	elseif (z <= 9.6e-84)
		tmp = Float64(x * t);
	elseif (z <= 1.8e+35)
		tmp = Float64(y * 5.0);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = x * (z + z);
	tmp = 0.0;
	if (z <= -1.95e+33)
		tmp = t_1;
	elseif (z <= -5.8e-132)
		tmp = y * 5.0;
	elseif (z <= 9.6e-84)
		tmp = x * t;
	elseif (z <= 1.8e+35)
		tmp = y * 5.0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(z + z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.95e+33], t$95$1, If[LessEqual[z, -5.8e-132], N[(y * 5.0), $MachinePrecision], If[LessEqual[z, 9.6e-84], N[(x * t), $MachinePrecision], If[LessEqual[z, 1.8e+35], N[(y * 5.0), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.9500000000000001e33 or 1.8e35 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 66.2

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

   5. Applied rewrites 66.2%

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

   7. Applied rewrites 66.2%

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

   if -1.9500000000000001e33 < z < -5.79999999999999967e-132 or 9.6000000000000007e-84 < z < 1.8e35

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 50.2

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

   5. Applied rewrites 50.2%

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

   if -5.79999999999999967e-132 < z < 9.6000000000000007e-84

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 52.2

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

   5. Applied rewrites 52.2%

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

4. Final simplification 57.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.95 \cdot 10^{+33}:\\ \;\;\;\;x \cdot \left(z + z\right)\\ \mathbf{elif}\;z \leq -5.8 \cdot 10^{-132}:\\ \;\;\;\;y \cdot 5\\ \mathbf{elif}\;z \leq 9.6 \cdot 10^{-84}:\\ \;\;\;\;x \cdot t\\ \mathbf{elif}\;z \leq 1.8 \cdot 10^{+35}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(z + z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \mathsf{fma}\left(2, y + z, t\right)\\ \mathbf{if}\;x \leq -2.5:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-23}:\\ \;\;\;\;\mathsf{fma}\left(y, 5, \mathsf{fma}\left(x, t, x \cdot \left(z + z\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (fma 2.0 (+ y z) t))))
   (if (<= x -2.5)
     t_1
     (if (<= x 2.4e-23) (fma y 5.0 (fma x t (* x (+ z z)))) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * fma(2.0, (y + z), t);
	double tmp;
	if (x <= -2.5) {
		tmp = t_1;
	} else if (x <= 2.4e-23) {
		tmp = fma(y, 5.0, fma(x, t, (x * (z + z))));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x * fma(2.0, Float64(y + z), t))
	tmp = 0.0
	if (x <= -2.5)
		tmp = t_1;
	elseif (x <= 2.4e-23)
		tmp = fma(y, 5.0, fma(x, t, Float64(x * Float64(z + z))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(2.0 * N[(y + z), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.5], t$95$1, If[LessEqual[x, 2.4e-23], N[(y * 5.0 + N[(x * t + N[(x * N[(z + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.5 or 2.39999999999999996e-23 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-out N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -2.5 < x < 2.39999999999999996e-23

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-+l+ N/A

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

      8. +-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. flip-+ N/A

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

      11. +-inverses N/A

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

      12. +-inverses N/A

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

      13. +-inverses N/A

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

      14. +-inverses N/A

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

      15. flip-+ N/A

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

      16. lower-+.f64 99.8

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

   4. Applied rewrites 99.8%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. distribute-lft-in N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 99.9

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

   6. Applied rewrites 99.9%

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

Alternative 4: 98.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \mathsf{fma}\left(2, y + z, t\right)\\ \mathbf{if}\;x \leq -2.5:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.4 \cdot 10^{-23}:\\ \;\;\;\;\mathsf{fma}\left(y, 5, x \cdot \left(t + \left(z + z\right)\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (fma 2.0 (+ y z) t))))
   (if (<= x -2.5)
     t_1
     (if (<= x 2.4e-23) (fma y 5.0 (* x (+ t (+ z z)))) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * fma(2.0, (y + z), t);
	double tmp;
	if (x <= -2.5) {
		tmp = t_1;
	} else if (x <= 2.4e-23) {
		tmp = fma(y, 5.0, (x * (t + (z + z))));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x * fma(2.0, Float64(y + z), t))
	tmp = 0.0
	if (x <= -2.5)
		tmp = t_1;
	elseif (x <= 2.4e-23)
		tmp = fma(y, 5.0, Float64(x * Float64(t + Float64(z + z))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(2.0 * N[(y + z), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.5], t$95$1, If[LessEqual[x, 2.4e-23], N[(y * 5.0 + N[(x * N[(t + N[(z + z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.5 or 2.39999999999999996e-23 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-out N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 99.5

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

   5. Applied rewrites 99.5%

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

   if -2.5 < x < 2.39999999999999996e-23

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-+l+ N/A

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

      8. +-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. flip-+ N/A

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

      11. +-inverses N/A

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

      12. +-inverses N/A

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

      13. +-inverses N/A

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

      14. +-inverses N/A

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

      15. flip-+ N/A

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

      16. lower-+.f64 99.8

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

   4. Applied rewrites 99.8%

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

4. Final simplification 99.7%

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

Alternative 5: 88.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \mathsf{fma}\left(2, y + z, t\right)\\ \mathbf{if}\;x \leq -2.85 \cdot 10^{-83}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{-49}:\\ \;\;\;\;\mathsf{fma}\left(y, 5, x \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (fma 2.0 (+ y z) t))))
   (if (<= x -2.85e-83) t_1 (if (<= x 1.55e-49) (fma y 5.0 (* x t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * fma(2.0, (y + z), t);
	double tmp;
	if (x <= -2.85e-83) {
		tmp = t_1;
	} else if (x <= 1.55e-49) {
		tmp = fma(y, 5.0, (x * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x * fma(2.0, Float64(y + z), t))
	tmp = 0.0
	if (x <= -2.85e-83)
		tmp = t_1;
	elseif (x <= 1.55e-49)
		tmp = fma(y, 5.0, Float64(x * t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(2.0 * N[(y + z), $MachinePrecision] + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -2.85e-83], t$95$1, If[LessEqual[x, 1.55e-49], N[(y * 5.0 + N[(x * t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.85e-83 or 1.55e-49 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-lft-out N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-+.f64 96.6

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

   5. Applied rewrites 96.6%

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

   if -2.85e-83 < x < 1.55e-49

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 100.0

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. associate-+l+ N/A

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

      8. +-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. flip-+ N/A

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

      11. +-inverses N/A

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

      12. +-inverses N/A

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

      13. +-inverses N/A

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

      14. +-inverses N/A

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

      15. flip-+ N/A

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

      16. lower-+.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 84.7

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

   7. Applied rewrites 84.7%

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

Alternative 6: 78.2% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \mathsf{fma}\left(x, 2, 5\right)\\ \mathbf{if}\;y \leq -1.1 \cdot 10^{+112}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+30}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(2, z, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* y (fma x 2.0 5.0))))
   (if (<= y -1.1e+112) t_1 (if (<= y 2.4e+30) (* x (fma 2.0 z t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = y * fma(x, 2.0, 5.0);
	double tmp;
	if (y <= -1.1e+112) {
		tmp = t_1;
	} else if (y <= 2.4e+30) {
		tmp = x * fma(2.0, z, t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(y * fma(x, 2.0, 5.0))
	tmp = 0.0
	if (y <= -1.1e+112)
		tmp = t_1;
	elseif (y <= 2.4e+30)
		tmp = Float64(x * fma(2.0, z, t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * N[(x * 2.0 + 5.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.1e+112], t$95$1, If[LessEqual[y, 2.4e+30], N[(x * N[(2.0 * z + t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -1.1e112 or 2.3999999999999999e30 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around inf

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

      1. +-commutative N/A

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

      2. metadata-eval N/A

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

      3. distribute-lft-neg-in N/A

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

      4. neg-sub0 N/A

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

      5. associate--r- N/A

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

      6. neg-sub0 N/A

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

      7. lower-*.f64 N/A

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

      8. neg-sub0 N/A

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

      9. associate--r- N/A

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

      10. neg-sub0 N/A

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

      11. distribute-lft-neg-in N/A

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

      12. metadata-eval N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 81.4

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

   5. Applied rewrites 81.4%

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

   if -1.1e112 < y < 2.3999999999999999e30

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 81.8

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

   5. Applied rewrites 81.8%

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

Alternative 7: 66.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \mathsf{fma}\left(2, z, t\right)\\ \mathbf{if}\;x \leq -6.5 \cdot 10^{-99}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 2.25 \cdot 10^{-51}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* x (fma 2.0 z t))))
   (if (<= x -6.5e-99) t_1 (if (<= x 2.25e-51) (* y 5.0) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = x * fma(2.0, z, t);
	double tmp;
	if (x <= -6.5e-99) {
		tmp = t_1;
	} else if (x <= 2.25e-51) {
		tmp = y * 5.0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(x * fma(2.0, z, t))
	tmp = 0.0
	if (x <= -6.5e-99)
		tmp = t_1;
	elseif (x <= 2.25e-51)
		tmp = Float64(y * 5.0);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(x * N[(2.0 * z + t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -6.5e-99], t$95$1, If[LessEqual[x, 2.25e-51], N[(y * 5.0), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -6.50000000000000033e-99 or 2.24999999999999987e-51 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 75.7

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

   5. Applied rewrites 75.7%

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

   if -6.50000000000000033e-99 < x < 2.24999999999999987e-51

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 63.9

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

   5. Applied rewrites 63.9%

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

4. Final simplification 71.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -6.5 \cdot 10^{-99}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(2, z, t\right)\\ \mathbf{elif}\;x \leq 2.25 \cdot 10^{-51}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(2, z, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 45.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.85 \cdot 10^{-83}:\\ \;\;\;\;x \cdot t\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{-50}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.85e-83) (* x t) (if (<= x 2.9e-50) (* y 5.0) (* x t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.85e-83) {
		tmp = x * t;
	} else if (x <= 2.9e-50) {
		tmp = y * 5.0;
	} else {
		tmp = x * t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= (-2.85d-83)) then
        tmp = x * t
    else if (x <= 2.9d-50) then
        tmp = y * 5.0d0
    else
        tmp = x * t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.85e-83) {
		tmp = x * t;
	} else if (x <= 2.9e-50) {
		tmp = y * 5.0;
	} else {
		tmp = x * t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.85e-83:
		tmp = x * t
	elif x <= 2.9e-50:
		tmp = y * 5.0
	else:
		tmp = x * t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.85e-83)
		tmp = Float64(x * t);
	elseif (x <= 2.9e-50)
		tmp = Float64(y * 5.0);
	else
		tmp = Float64(x * t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.85e-83)
		tmp = x * t;
	elseif (x <= 2.9e-50)
		tmp = y * 5.0;
	else
		tmp = x * t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.85e-83], N[(x * t), $MachinePrecision], If[LessEqual[x, 2.9e-50], N[(y * 5.0), $MachinePrecision], N[(x * t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.85e-83 or 2.90000000000000008e-50 < x

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 39.4

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

   5. Applied rewrites 39.4%

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

   if -2.85e-83 < x < 2.90000000000000008e-50

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 63.4

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

   5. Applied rewrites 63.4%

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

4. Final simplification 48.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.85 \cdot 10^{-83}:\\ \;\;\;\;x \cdot t\\ \mathbf{elif}\;x \leq 2.9 \cdot 10^{-50}:\\ \;\;\;\;y \cdot 5\\ \mathbf{else}:\\ \;\;\;\;x \cdot t\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 28.8% accurate, 4.3× speedup

Math

\[\begin{array}{l} \\ y \cdot 5 \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = y * 5.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around 0

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

   1. lower-*.f64 26.4

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

5. Applied rewrites 26.4%

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

6. Final simplification 26.4%

   \[\leadsto y \cdot 5 \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024222 
(FPCore (x y z t)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, B"
  :precision binary64
  (+ (* x (+ (+ (+ (+ y z) z) y) t)) (* y 5.0)))