Graphics.Rasterific.CubicBezier:cachedBezierAt from Rasterific-0.6.1

Percentage Accurate: 92.4% → 96.1%

Time: 4.8s

Alternatives: 12

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.4% 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: 96.1% accurate, 0.5× 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 10^{+305}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, z, t\right), a, z \cdot y\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 1e+305) t_1 (fma (fma b z t) a (* z y)))))

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 <= 1e+305) {
		tmp = t_1;
	} else {
		tmp = fma(fma(b, z, t), a, (z * y));
	}
	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 <= 1e+305)
		tmp = t_1;
	else
		tmp = fma(fma(b, z, t), a, Float64(z * y));
	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, 1e+305], t$95$1, N[(N[(b * z + t), $MachinePrecision] * a + N[(z * y), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b)) < 9.9999999999999994e304

   1. Initial program 92.4%

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

   if 9.9999999999999994e304 < (+.f64 (+.f64 (+.f64 x (*.f64 y z)) (*.f64 t a)) (*.f64 (*.f64 a z) b))

   1. Initial program 92.4%

      \[\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}{a \cdot t + \left(a \cdot \left(b \cdot z\right) + y \cdot z\right)} \]
   3. Step-by-step derivation

      1. associate-+r+ N/A

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

      2. distribute-lft-out N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 70.3

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

   4. Applied rewrites 70.3%

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

Alternative 2: 95.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.99999999999999988e166

   1. Initial program 92.4%

      \[\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 75.1

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

   4. Applied rewrites 75.1%

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

   if -1.99999999999999988e166 < z

   1. Initial program 92.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-+l+ N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. distribute-rgt-in N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. *-commutative N/A

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

      16. lower-fma.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 N/A

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

      19. +-commutative N/A

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

      20. lower-fma.f64 94.3

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

   3. Applied rewrites 94.3%

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

Alternative 3: 87.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 -4.6 \cdot 10^{+35}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6.4 \cdot 10^{+34}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, z, t\right), 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 -4.6e+35) t_1 (if (<= z 6.4e+34) (fma (fma b z 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 <= -4.6e+35) {
		tmp = t_1;
	} else if (z <= 6.4e+34) {
		tmp = fma(fma(b, z, 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 <= -4.6e+35)
		tmp = t_1;
	elseif (z <= 6.4e+34)
		tmp = fma(fma(b, z, 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, -4.6e+35], t$95$1, If[LessEqual[z, 6.4e+34], N[(N[(b * z + t), $MachinePrecision] * a + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.5999999999999996e35 or 6.3999999999999997e34 < z

   1. Initial program 92.4%

      \[\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 75.1

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

   4. Applied rewrites 75.1%

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

   if -4.5999999999999996e35 < z < 6.3999999999999997e34

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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 4: 86.0% 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 -1 \cdot 10^{+60}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.25 \cdot 10^{-139}:\\ \;\;\;\;\mathsf{fma}\left(a, t, \mathsf{fma}\left(y, z, x\right)\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 -1e+60) t_1 (if (<= z 1.25e-139) (fma a t (fma 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, a, y), z, x);
	double tmp;
	if (z <= -1e+60) {
		tmp = t_1;
	} else if (z <= 1.25e-139) {
		tmp = fma(a, t, fma(y, z, 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 <= -1e+60)
		tmp = t_1;
	elseif (z <= 1.25e-139)
		tmp = fma(a, t, fma(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 * a + y), $MachinePrecision] * z + x), $MachinePrecision]}, If[LessEqual[z, -1e+60], t$95$1, If[LessEqual[z, 1.25e-139], N[(a * t + N[(y * z + x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -9.9999999999999995e59 or 1.25000000000000008e-139 < z

   1. Initial program 92.4%

      \[\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 75.1

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

   4. Applied rewrites 75.1%

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

   if -9.9999999999999995e59 < z < 1.25000000000000008e-139

   1. Initial program 92.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-+l+ N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. distribute-rgt-in N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. *-commutative N/A

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

      16. lower-fma.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 N/A

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

      19. +-commutative N/A

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

      20. lower-fma.f64 94.3

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

   3. Applied rewrites 94.3%

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

   4. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 77.5

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

   6. Applied rewrites 77.5%

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

Alternative 5: 81.6% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= b -1.76e+190)
   (* (fma b a y) z)
   (if (<= b 7.5e+183) (fma a t (fma y z x)) (fma (* b z) a x))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if (b <= -1.76e+190) {
		tmp = fma(b, a, y) * z;
	} else if (b <= 7.5e+183) {
		tmp = fma(a, t, fma(y, z, x));
	} else {
		tmp = fma((b * z), a, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if b < -1.76000000000000004e190

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   if -1.76000000000000004e190 < b < 7.49999999999999966e183

   1. Initial program 92.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-+l+ N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. distribute-rgt-in N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. *-commutative N/A

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

      16. lower-fma.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 N/A

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

      19. +-commutative N/A

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

      20. lower-fma.f64 94.3

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

   3. Applied rewrites 94.3%

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

   4. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 77.5

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

   6. Applied rewrites 77.5%

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

   if 7.49999999999999966e183 < b

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 50.8

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

   7. Applied rewrites 50.8%

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

Alternative 6: 74.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, y\right) \cdot z\\ \mathbf{if}\;z \leq -3.65 \cdot 10^{+59}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 8.5 \cdot 10^{-145}:\\ \;\;\;\;\mathsf{fma}\left(t, a, x\right)\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot z, 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.65e+59)
     t_1
     (if (<= z 8.5e-145)
       (fma t a x)
       (if (<= z 8.6e+35) (fma (* b z) 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.65e+59) {
		tmp = t_1;
	} else if (z <= 8.5e-145) {
		tmp = fma(t, a, x);
	} else if (z <= 8.6e+35) {
		tmp = fma((b * z), 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.65e+59)
		tmp = t_1;
	elseif (z <= 8.5e-145)
		tmp = fma(t, a, x);
	elseif (z <= 8.6e+35)
		tmp = fma(Float64(b * z), 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.65e+59], t$95$1, If[LessEqual[z, 8.5e-145], N[(t * a + x), $MachinePrecision], If[LessEqual[z, 8.6e+35], N[(N[(b * z), $MachinePrecision] * a + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.6500000000000001e59 or 8.5999999999999995e35 < z

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   if -3.6500000000000001e59 < z < 8.50000000000000043e-145

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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.0%

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

   if 8.50000000000000043e-145 < z < 8.5999999999999995e35

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 50.8

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

   7. Applied rewrites 50.8%

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

Alternative 7: 72.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(b, a, y\right) \cdot z\\ \mathbf{if}\;z \leq -3.65 \cdot 10^{+59}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.25 \cdot 10^{-139}:\\ \;\;\;\;\mathsf{fma}\left(t, a, x\right)\\ \mathbf{elif}\;z \leq 9 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot b, 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 b a y) z)))
   (if (<= z -3.65e+59)
     t_1
     (if (<= z 1.25e-139)
       (fma t a x)
       (if (<= z 9e+35) (fma (* a b) z 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.65e+59) {
		tmp = t_1;
	} else if (z <= 1.25e-139) {
		tmp = fma(t, a, x);
	} else if (z <= 9e+35) {
		tmp = fma((a * b), z, 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.65e+59)
		tmp = t_1;
	elseif (z <= 1.25e-139)
		tmp = fma(t, a, x);
	elseif (z <= 9e+35)
		tmp = fma(Float64(a * b), 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 * a + y), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -3.65e+59], t$95$1, If[LessEqual[z, 1.25e-139], N[(t * a + x), $MachinePrecision], If[LessEqual[z, 9e+35], N[(N[(a * b), $MachinePrecision] * z + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.6500000000000001e59 or 8.9999999999999993e35 < z

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   if -3.6500000000000001e59 < z < 1.25000000000000008e-139

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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.0%

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

   if 1.25000000000000008e-139 < z < 8.9999999999999993e35

   1. Initial program 92.4%

      \[\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 75.1

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

   4. Applied rewrites 75.1%

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

   5. Taylor expanded in y around 0

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

      1. lower-*.f64 50.7

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

   7. Applied rewrites 50.7%

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

Alternative 8: 72.8% 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.65 \cdot 10^{+59}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6.4 \cdot 10^{-18}:\\ \;\;\;\;\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.65e+59) t_1 (if (<= z 6.4e-18) (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.65e+59) {
		tmp = t_1;
	} else if (z <= 6.4e-18) {
		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.65e+59)
		tmp = t_1;
	elseif (z <= 6.4e-18)
		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.65e+59], t$95$1, If[LessEqual[z, 6.4e-18], N[(t * a + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6500000000000001e59 or 6.3999999999999998e-18 < z

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   if -3.6500000000000001e59 < z < 6.3999999999999998e-18

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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.0%

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

Alternative 9: 64.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(a, t, y \cdot z\right)\\ \mathbf{if}\;z \leq -3.25 \cdot 10^{+276}:\\ \;\;\;\;\left(a \cdot b\right) \cdot z\\ \mathbf{elif}\;z \leq -2.05 \cdot 10^{+59}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 9 \cdot 10^{+35}:\\ \;\;\;\;\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 a t (* y z))))
   (if (<= z -3.25e+276)
     (* (* a b) z)
     (if (<= z -2.05e+59) t_1 (if (<= z 9e+35) (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(a, t, (y * z));
	double tmp;
	if (z <= -3.25e+276) {
		tmp = (a * b) * z;
	} else if (z <= -2.05e+59) {
		tmp = t_1;
	} else if (z <= 9e+35) {
		tmp = fma(t, a, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = fma(a, t, Float64(y * z))
	tmp = 0.0
	if (z <= -3.25e+276)
		tmp = Float64(Float64(a * b) * z);
	elseif (z <= -2.05e+59)
		tmp = t_1;
	elseif (z <= 9e+35)
		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[(a * t + N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.25e+276], N[(N[(a * b), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[z, -2.05e+59], t$95$1, If[LessEqual[z, 9e+35], N[(t * a + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.24999999999999986e276

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in y around 0

      \[\leadsto \left(a \cdot b\right) \cdot z \]
   6. Step-by-step derivation

      1. lower-*.f64 26.8

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

   7. Applied rewrites 26.8%

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

   if -3.24999999999999986e276 < z < -2.05e59 or 8.9999999999999993e35 < z

   1. Initial program 92.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-+.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift-*.f64 N/A

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

      8. associate-+l+ N/A

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

      9. associate-*l* N/A

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

      10. *-commutative N/A

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

      11. *-commutative N/A

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

      12. distribute-rgt-in N/A

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

      13. lower-+.f64 N/A

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

      14. +-commutative N/A

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

      15. *-commutative N/A

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

      16. lower-fma.f64 N/A

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

      17. *-commutative N/A

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

      18. lower-*.f64 N/A

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

      19. +-commutative N/A

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

      20. lower-fma.f64 94.3

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

   3. Applied rewrites 94.3%

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

   4. Taylor expanded in b around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-+l+ N/A

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

      4. *-commutative N/A

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

      5. +-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-fma.f64 77.5

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

   6. Applied rewrites 77.5%

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

   7. Taylor expanded in x around 0

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

      1. lower-*.f64 52.8

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

   9. Applied rewrites 52.8%

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

   if -2.05e59 < z < 8.9999999999999993e35

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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.0%

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

Alternative 10: 56.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(a \cdot z\right) \cdot b\\ \mathbf{if}\;b \leq -7 \cdot 10^{+171}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 2.9 \cdot 10^{+145}:\\ \;\;\;\;\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 (* (* a z) b)))
   (if (<= b -7e+171) t_1 (if (<= b 2.9e+145) (fma t a x) t_1))))

C

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

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(a * z) * b)
	tmp = 0.0
	if (b <= -7e+171)
		tmp = t_1;
	elseif (b <= 2.9e+145)
		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[(a * z), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[b, -7e+171], t$95$1, If[LessEqual[b, 2.9e+145], N[(t * a + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if b < -6.9999999999999999e171 or 2.9000000000000001e145 < b

   1. Initial program 92.4%

      \[\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.9

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

   4. Applied rewrites 50.9%

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

   5. Taylor expanded in y around 0

      \[\leadsto \left(a \cdot b\right) \cdot z \]
   6. Step-by-step derivation

      1. lower-*.f64 26.8

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

   7. Applied rewrites 26.8%

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

   8. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-*.f64 27.7

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

   10. Applied rewrites 27.7%

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

   if -6.9999999999999999e171 < b < 2.9000000000000001e145

   1. Initial program 92.4%

      \[\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.2

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

   4. Applied rewrites 74.2%

      \[\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.0%

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

Alternative 11: 52.0% accurate, 3.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 92.4%

   \[\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.2

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

4. Applied rewrites 74.2%

   \[\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.0%

   \[\leadsto \mathsf{fma}\left(t, a, x\right) \]
8. Add Preprocessing

Alternative 12: 27.5% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ t \cdot a \end{array} \]

FPCore

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

C

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

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 = t * a
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 92.4%

   \[\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.0

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

4. Applied rewrites 50.0%

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

5. Taylor expanded in z around 0

   \[\leadsto t \cdot a \]
6. Step-by-step derivation

7. Applied rewrites 27.5%

   \[\leadsto t \cdot a \]
8. Add Preprocessing

Reproduce

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