Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1

Percentage Accurate: 92.9% → 97.4%

Time: 3.4s

Alternatives: 10

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

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, a, b)
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), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x + (y * z)) + (t * a)) + ((a * z) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 92.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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, a, b)
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), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x + (y * z)) + (t * a)) + ((a * z) * b)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.4% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b))))
   (if (<= t_1 (- INFINITY))
     (+ (fma a t x) (* (fma b a y) z))
     (if (<= t_1 INFINITY) t_1 (fma (fma b z t) a x)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = ((x + (y * z)) + (t * a)) + ((a * z) * b);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = fma(a, t, x) + (fma(b, a, y) * z);
	} else if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = fma(fma(b, z, t), a, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(Float64(x + Float64(y * z)) + Float64(t * a)) + Float64(Float64(a * z) * b))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(fma(a, t, x) + Float64(fma(b, a, y) * z));
	elseif (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = fma(fma(b, z, t), a, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(N[(x + N[(y * z), $MachinePrecision]), $MachinePrecision] + N[(t * a), $MachinePrecision]), $MachinePrecision] + N[(N[(a * z), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[(a * t + x), $MachinePrecision] + N[(N[(b * a + y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, Infinity], t$95$1, N[(N[(b * z + t), $MachinePrecision] * a + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b)) < -inf.0

   1. Initial program 92.9%

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

   2. Taylor expanded in x around 0

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

      1. associate-+r+ N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 94.3

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

   4. Applied rewrites 94.3%

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

   if -inf.0 < (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b)) < +inf.0

   1. Initial program 92.9%

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

   if +inf.0 < (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b))

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

Alternative 2: 95.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 1.8 \cdot 10^{+53}:\\ \;\;\;\;\mathsf{fma}\left(a, t, x\right) + \mathsf{fma}\left(b, a, y\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, z, t\right), a, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= a 1.8e+53) (+ (fma a t x) (* (fma b a y) z)) (fma (fma b z t) a x)))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (a <= 1.8e+53) {
		tmp = fma(a, t, x) + (fma(b, a, y) * z);
	} else {
		tmp = fma(fma(b, z, t), a, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (a <= 1.8e+53)
		tmp = Float64(fma(a, t, x) + Float64(fma(b, a, y) * z));
	else
		tmp = fma(fma(b, z, t), a, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[a, 1.8e+53], N[(N[(a * t + x), $MachinePrecision] + N[(N[(b * a + y), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], N[(N[(b * z + t), $MachinePrecision] * a + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < 1.8e53

   1. Initial program 92.9%

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

   2. Taylor expanded in x around 0

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

      1. associate-+r+ N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 94.3

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

   4. Applied rewrites 94.3%

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

   if 1.8e53 < a

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

Alternative 3: 87.8% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{+28}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, a \cdot t\right)\\ \mathbf{elif}\;z \leq 4000000:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, z, t\right), a, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -8e+28)
   (fma (fma b a y) z (* a t))
   (if (<= z 4000000.0) (fma (fma b z t) a x) (fma (fma b a y) z x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -8e+28) {
		tmp = fma(fma(b, a, y), z, (a * t));
	} else if (z <= 4000000.0) {
		tmp = fma(fma(b, z, t), a, x);
	} else {
		tmp = fma(fma(b, a, y), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -8e+28)
		tmp = fma(fma(b, a, y), z, Float64(a * t));
	elseif (z <= 4000000.0)
		tmp = fma(fma(b, z, t), a, x);
	else
		tmp = fma(fma(b, a, y), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -8e+28], N[(N[(b * a + y), $MachinePrecision] * z + N[(a * t), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4000000.0], N[(N[(b * z + t), $MachinePrecision] * a + x), $MachinePrecision], N[(N[(b * a + y), $MachinePrecision] * z + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -7.99999999999999967e28

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-*r* N/A

         \[\leadsto \left(y \cdot z + \left(a \cdot b\right) \cdot z\right) + a \cdot t \]

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. +-commutative N/A

         \[\leadsto \left(a \cdot b + y\right) \cdot z + a \cdot t \]

      7. *-commutative N/A

         \[\leadsto \left(b \cdot a + y\right) \cdot z + a \cdot t \]

      8. lower-fma.f64 N/A

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

      9. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, a \cdot t\right) \]

      10. lift-*.f64 70.0

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, a \cdot t\right) \]

   7. Applied rewrites 70.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, a \cdot t\right)} \]

   if -7.99999999999999967e28 < z < 4e6

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   if 4e6 < z

   1. Initial program 92.9%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 74.5

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right) \]

   4. Applied rewrites 74.5%

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

Alternative 4: 85.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\mathsf{fma}\left(b, z, t\right), a, x\right)\\ \mathbf{if}\;a \leq -1 \cdot 10^{-25}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 0.0105:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma (fma b z t) a x)))
   (if (<= a -1e-25) t_1 (if (<= a 0.0105) (fma (fma b a y) z x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(fma(b, z, t), a, x);
	double tmp;
	if (a <= -1e-25) {
		tmp = t_1;
	} else if (a <= 0.0105) {
		tmp = fma(fma(b, a, y), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(fma(b, z, t), a, x)
	tmp = 0.0
	if (a <= -1e-25)
		tmp = t_1;
	elseif (a <= 0.0105)
		tmp = fma(fma(b, a, y), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(b * z + t), $MachinePrecision] * a + x), $MachinePrecision]}, If[LessEqual[a, -1e-25], t$95$1, If[LessEqual[a, 0.0105], N[(N[(b * a + y), $MachinePrecision] * z + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -1.00000000000000004e-25 or 0.0105000000000000007 < a

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   if -1.00000000000000004e-25 < a < 0.0105000000000000007

   1. Initial program 92.9%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 74.5

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right) \]

   4. Applied rewrites 74.5%

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

Alternative 5: 80.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right)\\ \mathbf{if}\;z \leq -3.1 \cdot 10^{+21}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 7 \cdot 10^{-127}:\\ \;\;\;\;\mathsf{fma}\left(t, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (fma (fma b a y) z x)))
   (if (<= z -3.1e+21) t_1 (if (<= z 7e-127) (fma t a x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(fma(b, a, y), z, x);
	double tmp;
	if (z <= -3.1e+21) {
		tmp = t_1;
	} else if (z <= 7e-127) {
		tmp = fma(t, a, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(fma(b, a, y), z, x)
	tmp = 0.0
	if (z <= -3.1e+21)
		tmp = t_1;
	elseif (z <= 7e-127)
		tmp = fma(t, a, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(b * a + y), $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -3.1e+21], t$95$1, If[LessEqual[z, 7e-127], N[(t * a + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.1e21 or 6.99999999999999979e-127 < z

   1. Initial program 92.9%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. +-commutative N/A

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

      3. associate-*r* N/A

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

      4. distribute-rgt-in N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 74.5

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b, a, y\right), z, x\right) \]

   4. Applied rewrites 74.5%

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

   if -3.1e21 < z < 6.99999999999999979e-127

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 52.7%

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

Alternative 6: 75.3% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, z, t\right) \cdot a\\ \mathbf{if}\;a \leq -1420000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 0.00046:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (fma b z t) a)))
   (if (<= a -1420000000.0) t_1 (if (<= a 0.00046) (fma z y x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(b, z, t) * a;
	double tmp;
	if (a <= -1420000000.0) {
		tmp = t_1;
	} else if (a <= 0.00046) {
		tmp = fma(z, y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(b, z, t) * a)
	tmp = 0.0
	if (a <= -1420000000.0)
		tmp = t_1;
	elseif (a <= 0.00046)
		tmp = fma(z, y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(b * z + t), $MachinePrecision] * a), $MachinePrecision]}, If[LessEqual[a, -1420000000.0], t$95$1, If[LessEqual[a, 0.00046], N[(z * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -1.42e9 or 4.6000000000000001e-4 < a

   1. Initial program 92.9%

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

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(b \cdot z + t\right) \cdot a \]

      4. lower-fma.f64 50.6

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

   4. Applied rewrites 50.6%

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

   if -1.42e9 < a < 4.6000000000000001e-4

   1. Initial program 92.9%

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

   2. Taylor expanded in x around 0

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

      1. associate-+r+ N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 94.3

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

   4. Applied rewrites 94.3%

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

   5. Taylor expanded in a around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 52.0

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

   7. Applied rewrites 52.0%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto z \cdot y + x \]

      5. lower-fma.f64 52.0

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

   9. Applied rewrites 52.0%

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

Alternative 7: 71.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, y\right) \cdot z\\ \mathbf{if}\;z \leq -3.2 \cdot 10^{+21}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 7.5 \cdot 10^{-127}:\\ \;\;\;\;\mathsf{fma}\left(t, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (* (fma b a y) z)))
   (if (<= z -3.2e+21) t_1 (if (<= z 7.5e-127) (fma t a x) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = fma(b, a, y) * z;
	double tmp;
	if (z <= -3.2e+21) {
		tmp = t_1;
	} else if (z <= 7.5e-127) {
		tmp = fma(t, a, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(fma(b, a, y) * z)
	tmp = 0.0
	if (z <= -3.2e+21)
		tmp = t_1;
	elseif (z <= 7.5e-127)
		tmp = fma(t, a, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(b * a + y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -3.2e+21], t$95$1, If[LessEqual[z, 7.5e-127], N[(t * a + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.2e21 or 7.5000000000000004e-127 < z

   1. Initial program 92.9%

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

   2. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

         \[\leadsto \left(a \cdot b + y\right) \cdot z \]

      4. *-commutative N/A

         \[\leadsto \left(b \cdot a + y\right) \cdot z \]

      5. lower-fma.f64 50.1

         \[\leadsto \mathsf{fma}\left(b, a, y\right) \cdot z \]

   4. Applied rewrites 50.1%

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

   if -3.2e21 < z < 7.5000000000000004e-127

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 52.7%

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

Alternative 8: 63.1% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+24}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \mathbf{elif}\;z \leq 4000000:\\ \;\;\;\;\mathsf{fma}\left(t, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(z, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= z -1.8e+24)
   (fma z y x)
   (if (<= z 4000000.0) (fma t a x) (fma z y x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (z <= -1.8e+24) {
		tmp = fma(z, y, x);
	} else if (z <= 4000000.0) {
		tmp = fma(t, a, x);
	} else {
		tmp = fma(z, y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (z <= -1.8e+24)
		tmp = fma(z, y, x);
	elseif (z <= 4000000.0)
		tmp = fma(t, a, x);
	else
		tmp = fma(z, y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[z, -1.8e+24], N[(z * y + x), $MachinePrecision], If[LessEqual[z, 4000000.0], N[(t * a + x), $MachinePrecision], N[(z * y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.79999999999999992e24 or 4e6 < z

   1. Initial program 92.9%

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

   2. Taylor expanded in x around 0

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

      1. associate-+r+ N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. distribute-rgt-in N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. +-commutative N/A

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

      11. *-commutative N/A

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

      12. lower-fma.f64 94.3

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

   4. Applied rewrites 94.3%

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

   5. Taylor expanded in a around 0

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 52.0

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

   7. Applied rewrites 52.0%

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

      1. lift-*.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

         \[\leadsto z \cdot y + x \]

      5. lower-fma.f64 52.0

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

   9. Applied rewrites 52.0%

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

   if -1.79999999999999992e24 < z < 4e6

   1. Initial program 92.9%

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

   2. Taylor expanded in y around 0

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

      1. distribute-lft-out N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 74.9

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

   4. Applied rewrites 74.9%

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

   5. Taylor expanded in z around 0

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

   7. Applied rewrites 52.7%

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

Alternative 9: 52.0% accurate, 3.5× speedup

Math

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

FPCore

(FPCore (x y z t a b) :precision binary64 (fma z y x))

C

double code(double x, double y, double z, double t, double a, double b) {
	return fma(z, y, x);
}

Julia

function code(x, y, z, t, a, b)
	return fma(z, y, x)
end

Wolfram

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

Derivation

1. Initial program 92.9%

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

2. Taylor expanded in x around 0

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

   1. associate-+r+ N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-*r* N/A

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

   7. distribute-rgt-in N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. *-commutative N/A

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

   12. lower-fma.f64 94.3

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

4. Applied rewrites 94.3%

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

5. Taylor expanded in a around 0

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

   1. lower-+.f64 N/A

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

   2. lower-*.f64 52.0

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

7. Applied rewrites 52.0%

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

   1. lift-*.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

      \[\leadsto z \cdot y + x \]

   5. lower-fma.f64 52.0

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

9. Applied rewrites 52.0%

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

Alternative 10: 27.4% accurate, 5.3× speedup

Math

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

FPCore

(FPCore (x y z t a b) :precision binary64 (* z y))

C

double code(double x, double y, double z, double t, double a, double b) {
	return z * 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, a, b)
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), intent (in) :: a
    real(8), intent (in) :: b
    code = z * y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.9%

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

2. Taylor expanded in x around 0

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

   1. associate-+r+ N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-fma.f64 N/A

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

   5. +-commutative N/A

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

   6. associate-*r* N/A

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

   7. distribute-rgt-in N/A

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

   8. *-commutative N/A

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

   9. lower-*.f64 N/A

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

   10. +-commutative N/A

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

   11. *-commutative N/A

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

   12. lower-fma.f64 94.3

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

4. Applied rewrites 94.3%

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

5. Taylor expanded in a around 0

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

   1. lower-+.f64 N/A

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

   2. lower-*.f64 52.0

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

7. Applied rewrites 52.0%

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

8. Taylor expanded in x around 0

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

   1. *-commutative N/A

      \[\leadsto z \cdot y \]

   2. lower-*.f64 27.4

      \[\leadsto z \cdot y \]

10. Applied rewrites 27.4%

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

Reproduce

herbie shell --seed 2025139 
(FPCore (x y z t a b)
  :name "Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1"
  :precision binary64
  (+ (+ (+ x (* y z)) (* t a)) (* (* a z) b)))