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

Percentage Accurate: 99.9% → 99.9%

Time: 4.0s

Alternatives: 13

Speedup: 1.1×

• 26.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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := N[(y * 5.0 + N[(N[(N[(N[(2.0 * z + y), $MachinePrecision] + y), $MachinePrecision] + t), $MachinePrecision] * x), $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. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. 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} \]

   3. 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 \]

   4. lift-+.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. lift-+.f64 N/A

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

   7. lift-+.f64 N/A

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

   8. *-commutative N/A

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

   9. +-commutative N/A

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

   10. *-commutative N/A

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

   11. lower-fma.f64 N/A

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

   12. *-commutative N/A

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

   13. lower-*.f64 N/A

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

3. Applied rewrites 99.9%

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

Alternative 2: 98.3% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_, t_] := N[(N[(2.0 * x + 5.0), $MachinePrecision] * y + N[(N[(2.0 * z + t), $MachinePrecision] * x), $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. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. lower-fma.f64 N/A

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

   4. +-commutative N/A

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

   5. lower-fma.f64 N/A

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

   6. *-commutative N/A

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

   7. lower-*.f64 N/A

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

   8. +-commutative N/A

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

   9. lower-fma.f64 98.3

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

4. Applied rewrites 98.3%

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

Alternative 3: 88.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 (+ z y) t) x)))
   (if (<= x -0.011)
     t_1
     (if (<= x 15500000000.0) (fma (fma 2.0 y t) x (* 5.0 y)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.010999999999999999 or 1.55e10 < 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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(\left(2 \cdot y + 2 \cdot z\right) + t\right) \cdot x \]

      4. distribute-lft-out N/A

         \[\leadsto \left(2 \cdot \left(y + z\right) + t\right) \cdot x \]

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 72.1

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

   4. Applied rewrites 72.1%

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

   if -0.010999999999999999 < x < 1.55e10

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.5

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

   4. Applied rewrites 74.5%

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

Alternative 4: 88.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 (+ z y) t) x)))
   (if (<= x -0.011)
     t_1
     (if (<= x 15500000000.0) (fma t x (* (fma x 2.0 5.0) y)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.010999999999999999 or 1.55e10 < 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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(\left(2 \cdot y + 2 \cdot z\right) + t\right) \cdot x \]

      4. distribute-lft-out N/A

         \[\leadsto \left(2 \cdot \left(y + z\right) + t\right) \cdot x \]

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 72.1

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

   4. Applied rewrites 72.1%

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

   if -0.010999999999999999 < x < 1.55e10

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. 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} \]

      3. 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 \]

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right) \]

      5. +-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right) \]

      6. count-2-rev N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right) \]

      7. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right) \]

      8. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) + y \cdot \left(5 + 2 \cdot x\right) \]

      9. *-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. +-commutative N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. *-commutative N/A

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

      16. +-commutative N/A

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

      17. lower-*.f64 N/A

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

   6. Applied rewrites 98.2%

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

   7. Taylor expanded in z around 0

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

   9. Applied rewrites 73.6%

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

Alternative 5: 88.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 (+ z y) t) x)))
   (if (<= x -0.011)
     t_1
     (if (<= x 15500000000.0) (fma (fma x 2.0 5.0) y (* x t)) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -0.010999999999999999 or 1.55e10 < 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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(\left(2 \cdot y + 2 \cdot z\right) + t\right) \cdot x \]

      4. distribute-lft-out N/A

         \[\leadsto \left(2 \cdot \left(y + z\right) + t\right) \cdot x \]

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 72.1

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

   4. Applied rewrites 72.1%

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

   if -0.010999999999999999 < x < 1.55e10

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.5

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

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(5 + 2 \cdot x\right) \cdot y + t \cdot x \]

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y + t \cdot x \]

      4. lower-fma.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 73.5

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

   7. Applied rewrites 73.5%

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

Alternative 6: 88.7% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 (+ z y) t) x)))
   (if (<= x -4.6e-10) t_1 (if (<= x 1.25e-14) (fma t x (* 5.0 y)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, (z + y), t) * x;
	double tmp;
	if (x <= -4.6e-10) {
		tmp = t_1;
	} else if (x <= 1.25e-14) {
		tmp = fma(t, x, (5.0 * y));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -4.60000000000000014e-10 or 1.25e-14 < 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. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(\left(2 \cdot y + 2 \cdot z\right) + t\right) \cdot x \]

      4. distribute-lft-out N/A

         \[\leadsto \left(2 \cdot \left(y + z\right) + t\right) \cdot x \]

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-+.f64 72.1

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

   4. Applied rewrites 72.1%

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

   if -4.60000000000000014e-10 < x < 1.25e-14

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. +-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-*.f64 74.5

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

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 57.8%

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

Alternative 7: 78.0% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 x 5.0) y)))
   (if (<= y -6e-28) t_1 (if (<= y 1.65e-19) (fma (+ x x) z (* t x)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, x, 5.0) * y;
	double tmp;
	if (y <= -6e-28) {
		tmp = t_1;
	} else if (y <= 1.65e-19) {
		tmp = fma((x + x), z, (t * x));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000005e-28 or 1.6499999999999999e-19 < 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. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 48.0

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

   4. Applied rewrites 48.0%

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

   if -6.00000000000000005e-28 < y < 1.6499999999999999e-19

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. 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} \]

      3. 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 \]

      4. lift-+.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-+.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. *-commutative N/A

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

      9. +-commutative N/A

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

      10. *-commutative N/A

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

      11. lower-fma.f64 N/A

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

      12. *-commutative N/A

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

      13. lower-*.f64 N/A

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

   3. Applied rewrites 99.9%

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

   4. Taylor expanded in y around 0

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

      1. *-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      2. +-commutative N/A

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

      3. *-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      4. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      5. +-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      6. count-2-rev N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      7. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      8. associate-+l+ N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      9. *-commutative N/A

         \[\leadsto x \cdot \left(t + 2 \cdot z\right) \]

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. +-commutative N/A

          \[\leadsto \left(2 \cdot z + t\right) \cdot x \]

      13. *-commutative N/A

          \[\leadsto \left(z \cdot 2 + t\right) \cdot x \]

      14. lower-fma.f64 56.8

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

   6. Applied rewrites 56.8%

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

   7. Taylor expanded in z around 0

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

      1. associate-*r* N/A

         \[\leadsto \left(2 \cdot x\right) \cdot z + t \cdot x \]

      2. lower-fma.f64 N/A

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

      3. count-2-rev N/A

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

      4. lift-+.f64 N/A

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

      5. lower-*.f64 55.8

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

   9. Applied rewrites 55.8%

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

Alternative 8: 77.5% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 x 5.0) y)))
   (if (<= y -6e-28) t_1 (if (<= y 1.65e-19) (* (fma 2.0 z t) x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, x, 5.0) * y;
	double tmp;
	if (y <= -6e-28) {
		tmp = t_1;
	} else if (y <= 1.65e-19) {
		tmp = fma(2.0, z, t) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, x, 5.0) * y)
	tmp = 0.0
	if (y <= -6e-28)
		tmp = t_1;
	elseif (y <= 1.65e-19)
		tmp = Float64(fma(2.0, z, t) * x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000005e-28 or 1.6499999999999999e-19 < 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. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 48.0

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

   4. Applied rewrites 48.0%

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

   if -6.00000000000000005e-28 < y < 1.6499999999999999e-19

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot z + t\right) \cdot x \]

      4. lower-fma.f64 56.8

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

   4. Applied rewrites 56.8%

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

Alternative 9: 59.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(2, x, 5\right) \cdot y\\ \mathbf{if}\;y \leq -6 \cdot 10^{-35}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 4.8 \cdot 10^{-55}:\\ \;\;\;\;t \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (fma 2.0 x 5.0) y)))
   (if (<= y -6e-35) t_1 (if (<= y 4.8e-55) (* t x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma(2.0, x, 5.0) * y;
	double tmp;
	if (y <= -6e-35) {
		tmp = t_1;
	} else if (y <= 4.8e-55) {
		tmp = t * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(fma(2.0, x, 5.0) * y)
	tmp = 0.0
	if (y <= -6e-35)
		tmp = t_1;
	elseif (y <= 4.8e-55)
		tmp = Float64(t * x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(2.0 * x + 5.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -6e-35], t$95$1, If[LessEqual[y, 4.8e-55], N[(t * x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -5.99999999999999978e-35 or 4.79999999999999983e-55 < 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. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 48.0

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

   4. Applied rewrites 48.0%

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

   if -5.99999999999999978e-35 < y < 4.79999999999999983e-55

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 30.7

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

   4. Applied rewrites 30.7%

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

Alternative 10: 46.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -7.8 \cdot 10^{+46}:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;t \leq -3.8 \cdot 10^{-185}:\\ \;\;\;\;5 \cdot y\\ \mathbf{elif}\;t \leq 7.2 \cdot 10^{-63}:\\ \;\;\;\;\left(x + x\right) \cdot z\\ \mathbf{elif}\;t \leq 1.5 \cdot 10^{+157}:\\ \;\;\;\;5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= t -7.8e+46)
   (* t x)
   (if (<= t -3.8e-185)
     (* 5.0 y)
     (if (<= t 7.2e-63)
       (* (+ x x) z)
       (if (<= t 1.5e+157) (* 5.0 y) (* t x))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -7.8e+46) {
		tmp = t * x;
	} else if (t <= -3.8e-185) {
		tmp = 5.0 * y;
	} else if (t <= 7.2e-63) {
		tmp = (x + x) * z;
	} else if (t <= 1.5e+157) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-7.8d+46)) then
        tmp = t * x
    else if (t <= (-3.8d-185)) then
        tmp = 5.0d0 * y
    else if (t <= 7.2d-63) then
        tmp = (x + x) * z
    else if (t <= 1.5d+157) then
        tmp = 5.0d0 * y
    else
        tmp = t * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t <= -7.8e+46) {
		tmp = t * x;
	} else if (t <= -3.8e-185) {
		tmp = 5.0 * y;
	} else if (t <= 7.2e-63) {
		tmp = (x + x) * z;
	} else if (t <= 1.5e+157) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t <= -7.8e+46:
		tmp = t * x
	elif t <= -3.8e-185:
		tmp = 5.0 * y
	elif t <= 7.2e-63:
		tmp = (x + x) * z
	elif t <= 1.5e+157:
		tmp = 5.0 * y
	else:
		tmp = t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t <= -7.8e+46)
		tmp = Float64(t * x);
	elseif (t <= -3.8e-185)
		tmp = Float64(5.0 * y);
	elseif (t <= 7.2e-63)
		tmp = Float64(Float64(x + x) * z);
	elseif (t <= 1.5e+157)
		tmp = Float64(5.0 * y);
	else
		tmp = Float64(t * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t <= -7.8e+46)
		tmp = t * x;
	elseif (t <= -3.8e-185)
		tmp = 5.0 * y;
	elseif (t <= 7.2e-63)
		tmp = (x + x) * z;
	elseif (t <= 1.5e+157)
		tmp = 5.0 * y;
	else
		tmp = t * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[t, -7.8e+46], N[(t * x), $MachinePrecision], If[LessEqual[t, -3.8e-185], N[(5.0 * y), $MachinePrecision], If[LessEqual[t, 7.2e-63], N[(N[(x + x), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[t, 1.5e+157], N[(5.0 * y), $MachinePrecision], N[(t * x), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if t < -7.7999999999999999e46 or 1.50000000000000005e157 < t

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 30.7

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

   4. Applied rewrites 30.7%

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

   if -7.7999999999999999e46 < t < -3.7999999999999999e-185 or 7.20000000000000016e-63 < t < 1.50000000000000005e157

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.5

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

   4. Applied rewrites 29.5%

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

   if -3.7999999999999999e-185 < t < 7.20000000000000016e-63

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. count-2-rev N/A

         \[\leadsto \left(x + x\right) \cdot z \]

      4. lower-+.f64 30.5

         \[\leadsto \left(x + x\right) \cdot z \]

   4. Applied rewrites 30.5%

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

Alternative 11: 44.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.5 \cdot 10^{+60}:\\ \;\;\;\;\left(x + x\right) \cdot y\\ \mathbf{elif}\;y \leq 1.4 \cdot 10^{-53}:\\ \;\;\;\;t \cdot x\\ \mathbf{else}:\\ \;\;\;\;5 \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -7.5e+60) (* (+ x x) y) (if (<= y 1.4e-53) (* t x) (* 5.0 y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.5e+60) {
		tmp = (x + x) * y;
	} else if (y <= 1.4e-53) {
		tmp = t * x;
	} else {
		tmp = 5.0 * y;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-7.5d+60)) then
        tmp = (x + x) * y
    else if (y <= 1.4d-53) then
        tmp = t * x
    else
        tmp = 5.0d0 * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.5e+60) {
		tmp = (x + x) * y;
	} else if (y <= 1.4e-53) {
		tmp = t * x;
	} else {
		tmp = 5.0 * y;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= -7.5e+60:
		tmp = (x + x) * y
	elif y <= 1.4e-53:
		tmp = t * x
	else:
		tmp = 5.0 * y
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -7.5e+60)
		tmp = Float64(Float64(x + x) * y);
	elseif (y <= 1.4e-53)
		tmp = Float64(t * x);
	else
		tmp = Float64(5.0 * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= -7.5e+60)
		tmp = (x + x) * y;
	elseif (y <= 1.4e-53)
		tmp = t * x;
	else
		tmp = 5.0 * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -7.5e+60], N[(N[(x + x), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[y, 1.4e-53], N[(t * x), $MachinePrecision], N[(5.0 * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.5e60

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(2 \cdot x + 5\right) \cdot y \]

      4. lower-fma.f64 48.0

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

   4. Applied rewrites 48.0%

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

   5. Taylor expanded in x around inf

      \[\leadsto \left(2 \cdot x\right) \cdot y \]
   6. Step-by-step derivation

      1. count-2-rev N/A

         \[\leadsto \left(x + x\right) \cdot y \]

      2. lower-+.f64 21.0

         \[\leadsto \left(x + x\right) \cdot y \]

   7. Applied rewrites 21.0%

      \[\leadsto \left(x + x\right) \cdot y \]

   if -7.5e60 < y < 1.39999999999999993e-53

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 30.7

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

   4. Applied rewrites 30.7%

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

   if 1.39999999999999993e-53 < 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. Taylor expanded in x around 0

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

      1. lower-*.f64 29.5

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

   4. Applied rewrites 29.5%

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

Alternative 12: 40.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{-104}:\\ \;\;\;\;t \cdot x\\ \mathbf{elif}\;x \leq 4.4 \cdot 10^{-11}:\\ \;\;\;\;5 \cdot y\\ \mathbf{else}:\\ \;\;\;\;t \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.6e-104) (* t x) (if (<= x 4.4e-11) (* 5.0 y) (* t x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e-104) {
		tmp = t * x;
	} else if (x <= 4.4e-11) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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.6d-104)) then
        tmp = t * x
    else if (x <= 4.4d-11) then
        tmp = 5.0d0 * y
    else
        tmp = t * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.6e-104) {
		tmp = t * x;
	} else if (x <= 4.4e-11) {
		tmp = 5.0 * y;
	} else {
		tmp = t * x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if x <= -2.6e-104:
		tmp = t * x
	elif x <= 4.4e-11:
		tmp = 5.0 * y
	else:
		tmp = t * x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.6e-104)
		tmp = Float64(t * x);
	elseif (x <= 4.4e-11)
		tmp = Float64(5.0 * y);
	else
		tmp = Float64(t * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (x <= -2.6e-104)
		tmp = t * x;
	elseif (x <= 4.4e-11)
		tmp = 5.0 * y;
	else
		tmp = t * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.6e-104], N[(t * x), $MachinePrecision], If[LessEqual[x, 4.4e-11], N[(5.0 * y), $MachinePrecision], N[(t * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -2.60000000000000003e-104 or 4.4000000000000003e-11 < 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. Taylor expanded in t around inf

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

      1. lower-*.f64 30.7

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

   4. Applied rewrites 30.7%

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

   if -2.60000000000000003e-104 < x < 4.4000000000000003e-11

   1. Initial program 99.9%

      \[x \cdot \left(\left(\left(\left(y + z\right) + z\right) + y\right) + t\right) + y \cdot 5 \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 29.5

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

   4. Applied rewrites 29.5%

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

Alternative 13: 29.5% accurate, 5.2× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := N[(5.0 * y), $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. Taylor expanded in x around 0

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

   1. lower-*.f64 29.5

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

4. Applied rewrites 29.5%

   \[\leadsto \color{blue}{5 \cdot y} \]
5. Add Preprocessing

Reproduce

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