Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, C

Percentage Accurate: 98.0% → 98.6%

Time: 3.5s

Alternatives: 13

Speedup: 0.5×

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

Specification

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

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

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Python

def code(x, y, z, t, a, b, c):
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(x * y) + Float64(Float64(z * t) / 16.0)) - Float64(Float64(a * b) / 4.0)) + c)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
end

Wolfram

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

Initial Program: 98.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

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

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
}

Python

def code(x, y, z, t, a, b, c):
	return (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c

Julia

function code(x, y, z, t, a, b, c)
	return Float64(Float64(Float64(Float64(x * y) + Float64(Float64(z * t) / 16.0)) - Float64(Float64(a * b) / 4.0)) + c)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c)
	tmp = (((x * y) + ((z * t) / 16.0)) - ((a * b) / 4.0)) + c;
end

Wolfram

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

Alternative 1: 98.6% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c) < +inf.0

   1. Initial program 99.9%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   if +inf.0 < (+.f64 (-.f64 (+.f64 (*.f64 x y) (/.f64 (*.f64 z t) #s(literal 16 binary64))) (/.f64 (*.f64 a b) #s(literal 4 binary64))) c)

   1. Initial program 0.0%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + \color{blue}{x} \cdot y\right) + c \]

      2. lower-fma.f64 N/A

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

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, x \cdot y\right) + c \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, y \cdot x\right) + c \]

      5. lower-*.f64 34.0

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

   4. Applied rewrites 34.0%

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

Alternative 2: 89.6% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (+ (fma (* t z) 0.0625 (* y x)) c)))
   (if (<= (* x y) -5e+49)
     t_1
     (if (<= (* x y) 2e+29)
       (+ (fma (* 0.0625 t) z (* -0.25 (* b a))) c)
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma((t * z), 0.0625, (y * x)) + c;
	double tmp;
	if ((x * y) <= -5e+49) {
		tmp = t_1;
	} else if ((x * y) <= 2e+29) {
		tmp = fma((0.0625 * t), z, (-0.25 * (b * a))) + c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(fma(Float64(t * z), 0.0625, Float64(y * x)) + c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+49)
		tmp = t_1;
	elseif (Float64(x * y) <= 2e+29)
		tmp = Float64(fma(Float64(0.0625 * t), z, Float64(-0.25 * Float64(b * a))) + c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(t * z), $MachinePrecision] * 0.0625 + N[(y * x), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+49], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 2e+29], N[(N[(N[(0.0625 * t), $MachinePrecision] * z + N[(-0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000004e49 or 1.99999999999999983e29 < (*.f64 x y)

   1. Initial program 96.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + \color{blue}{x} \cdot y\right) + c \]

      2. lower-fma.f64 N/A

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

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, x \cdot y\right) + c \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, y \cdot x\right) + c \]

      5. lower-*.f64 82.5

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

   4. Applied rewrites 82.5%

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

   if -5.0000000000000004e49 < (*.f64 x y) < 1.99999999999999983e29

   1. Initial program 99.1%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. fp-cancel-sub-sign-inv N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \left(a \cdot b\right)}\right) + c \]

      2. associate-*r* N/A

         \[\leadsto \left(\left(\frac{1}{16} \cdot t\right) \cdot z + \color{blue}{\left(\mathsf{neg}\left(\frac{1}{4}\right)\right)} \cdot \left(a \cdot b\right)\right) + c \]

      3. metadata-eval N/A

         \[\leadsto \left(\left(\frac{1}{16} \cdot t\right) \cdot z + \frac{-1}{4} \cdot \left(\color{blue}{a} \cdot b\right)\right) + c \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{16} \cdot t, \color{blue}{z}, \frac{-1}{4} \cdot \left(a \cdot b\right)\right) + c \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{16} \cdot t, z, \frac{-1}{4} \cdot \left(a \cdot b\right)\right) + c \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{16} \cdot t, z, \frac{-1}{4} \cdot \left(a \cdot b\right)\right) + c \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{16} \cdot t, z, \frac{-1}{4} \cdot \left(b \cdot a\right)\right) + c \]

      8. lower-*.f64 95.0

         \[\leadsto \mathsf{fma}\left(0.0625 \cdot t, z, -0.25 \cdot \left(b \cdot a\right)\right) + c \]

   4. Applied rewrites 95.0%

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

Alternative 3: 89.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (+ (fma (* t z) 0.0625 (* y x)) c)))
   (if (<= (* x y) -5e+49)
     t_1
     (if (<= (* x y) 2e+29) (- (fma (* t z) 0.0625 c) (* 0.25 (* b a))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma((t * z), 0.0625, (y * x)) + c;
	double tmp;
	if ((x * y) <= -5e+49) {
		tmp = t_1;
	} else if ((x * y) <= 2e+29) {
		tmp = fma((t * z), 0.0625, c) - (0.25 * (b * a));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(fma(Float64(t * z), 0.0625, Float64(y * x)) + c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+49)
		tmp = t_1;
	elseif (Float64(x * y) <= 2e+29)
		tmp = Float64(fma(Float64(t * z), 0.0625, c) - Float64(0.25 * Float64(b * a)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(N[(t * z), $MachinePrecision] * 0.0625 + N[(y * x), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+49], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 2e+29], N[(N[(N[(t * z), $MachinePrecision] * 0.0625 + c), $MachinePrecision] - N[(0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000004e49 or 1.99999999999999983e29 < (*.f64 x y)

   1. Initial program 96.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + \color{blue}{x} \cdot y\right) + c \]

      2. lower-fma.f64 N/A

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

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, x \cdot y\right) + c \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, y \cdot x\right) + c \]

      5. lower-*.f64 82.5

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

   4. Applied rewrites 82.5%

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

   if -5.0000000000000004e49 < (*.f64 x y) < 1.99999999999999983e29

   1. Initial program 99.1%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 94.6

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

   4. Applied rewrites 94.6%

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

Alternative 4: 87.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot t}{16}\\ t_2 := \mathsf{fma}\left(t \cdot z, 0.0625, y \cdot x\right) + c\\ \mathbf{if}\;t\_1 \leq -0.0005:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-50}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right) - 0.25 \cdot \left(b \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* z t) 16.0)) (t_2 (+ (fma (* t z) 0.0625 (* y x)) c)))
   (if (<= t_1 -0.0005)
     t_2
     (if (<= t_1 1e-50) (- (fma y x c) (* 0.25 (* b a))) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (z * t) / 16.0;
	double t_2 = fma((t * z), 0.0625, (y * x)) + c;
	double tmp;
	if (t_1 <= -0.0005) {
		tmp = t_2;
	} else if (t_1 <= 1e-50) {
		tmp = fma(y, x, c) - (0.25 * (b * a));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(z * t) / 16.0)
	t_2 = Float64(fma(Float64(t * z), 0.0625, Float64(y * x)) + c)
	tmp = 0.0
	if (t_1 <= -0.0005)
		tmp = t_2;
	elseif (t_1 <= 1e-50)
		tmp = Float64(fma(y, x, c) - Float64(0.25 * Float64(b * a)));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(N[(t * z), $MachinePrecision] * 0.0625 + N[(y * x), $MachinePrecision]), $MachinePrecision] + c), $MachinePrecision]}, If[LessEqual[t$95$1, -0.0005], t$95$2, If[LessEqual[t$95$1, 1e-50], N[(N[(y * x + c), $MachinePrecision] - N[(0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z t) #s(literal 16 binary64)) < -5.0000000000000001e-4 or 1.00000000000000001e-50 < (/.f64 (*.f64 z t) #s(literal 16 binary64))

   1. Initial program 96.8%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around 0

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

      1. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + \color{blue}{x} \cdot y\right) + c \]

      2. lower-fma.f64 N/A

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

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, x \cdot y\right) + c \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, y \cdot x\right) + c \]

      5. lower-*.f64 80.0

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

   4. Applied rewrites 80.0%

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

   if -5.0000000000000001e-4 < (/.f64 (*.f64 z t) #s(literal 16 binary64)) < 1.00000000000000001e-50

   1. Initial program 99.3%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 96.5

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

   4. Applied rewrites 96.5%

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

Alternative 5: 86.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot t}{16}\\ t_2 := \mathsf{fma}\left(t \cdot z, 0.0625, c\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+133}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+177}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right) - 0.25 \cdot \left(b \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* z t) 16.0)) (t_2 (fma (* t z) 0.0625 c)))
   (if (<= t_1 -1e+133)
     t_2
     (if (<= t_1 5e+177) (- (fma y x c) (* 0.25 (* b a))) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (z * t) / 16.0;
	double t_2 = fma((t * z), 0.0625, c);
	double tmp;
	if (t_1 <= -1e+133) {
		tmp = t_2;
	} else if (t_1 <= 5e+177) {
		tmp = fma(y, x, c) - (0.25 * (b * a));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(z * t) / 16.0)
	t_2 = fma(Float64(t * z), 0.0625, c)
	tmp = 0.0
	if (t_1 <= -1e+133)
		tmp = t_2;
	elseif (t_1 <= 5e+177)
		tmp = Float64(fma(y, x, c) - Float64(0.25 * Float64(b * a)));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] * 0.0625 + c), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+133], t$95$2, If[LessEqual[t$95$1, 5e+177], N[(N[(y * x + c), $MachinePrecision] - N[(0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z t) #s(literal 16 binary64)) < -1e133 or 5.0000000000000003e177 < (/.f64 (*.f64 z t) #s(literal 16 binary64))

   1. Initial program 94.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 85.5

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

   4. Applied rewrites 85.5%

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

   5. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto c + \left(t \cdot z\right) \cdot \frac{1}{16} \]

      2. +-commutative N/A

         \[\leadsto \left(t \cdot z\right) \cdot \frac{1}{16} + c \]

      3. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) \]

      4. lift-*.f64 77.2

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

   7. Applied rewrites 77.2%

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

   if -1e133 < (/.f64 (*.f64 z t) #s(literal 16 binary64)) < 5.0000000000000003e177

   1. Initial program 99.3%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 89.4

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

   4. Applied rewrites 89.4%

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

Alternative 6: 65.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(t \cdot z, 0.0625, c\right)\\ \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+129}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-23}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-137}:\\ \;\;\;\;c - 0.25 \cdot \left(b \cdot a\right)\\ \mathbf{elif}\;x \cdot y \leq 5 \cdot 10^{-13}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq 1.15 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(-0.25, b \cdot a, y \cdot x\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma (* t z) 0.0625 c)))
   (if (<= (* x y) -5e+129)
     (fma y x c)
     (if (<= (* x y) -2e-23)
       t_1
       (if (<= (* x y) -5e-137)
         (- c (* 0.25 (* b a)))
         (if (<= (* x y) 5e-13)
           t_1
           (if (<= (* x y) 1.15e+30)
             (fma -0.25 (* b a) (* y x))
             (if (<= (* x y) 2e+63) t_1 (fma y x c)))))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma((t * z), 0.0625, c);
	double tmp;
	if ((x * y) <= -5e+129) {
		tmp = fma(y, x, c);
	} else if ((x * y) <= -2e-23) {
		tmp = t_1;
	} else if ((x * y) <= -5e-137) {
		tmp = c - (0.25 * (b * a));
	} else if ((x * y) <= 5e-13) {
		tmp = t_1;
	} else if ((x * y) <= 1.15e+30) {
		tmp = fma(-0.25, (b * a), (y * x));
	} else if ((x * y) <= 2e+63) {
		tmp = t_1;
	} else {
		tmp = fma(y, x, c);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(Float64(t * z), 0.0625, c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+129)
		tmp = fma(y, x, c);
	elseif (Float64(x * y) <= -2e-23)
		tmp = t_1;
	elseif (Float64(x * y) <= -5e-137)
		tmp = Float64(c - Float64(0.25 * Float64(b * a)));
	elseif (Float64(x * y) <= 5e-13)
		tmp = t_1;
	elseif (Float64(x * y) <= 1.15e+30)
		tmp = fma(-0.25, Float64(b * a), Float64(y * x));
	elseif (Float64(x * y) <= 2e+63)
		tmp = t_1;
	else
		tmp = fma(y, x, c);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(t * z), $MachinePrecision] * 0.0625 + c), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+129], N[(y * x + c), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-23], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -5e-137], N[(c - N[(0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 5e-13], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], 1.15e+30], N[(-0.25 * N[(b * a), $MachinePrecision] + N[(y * x), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+63], t$95$1, N[(y * x + c), $MachinePrecision]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (*.f64 x y) < -5.0000000000000003e129 or 2.00000000000000012e63 < (*.f64 x y)

   1. Initial program 95.9%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 85.0

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

   4. Applied rewrites 85.0%

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

   5. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-fma.f64 72.7

         \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

   7. Applied rewrites 72.7%

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

   if -5.0000000000000003e129 < (*.f64 x y) < -1.99999999999999992e-23 or -5.00000000000000001e-137 < (*.f64 x y) < 4.9999999999999999e-13 or 1.15e30 < (*.f64 x y) < 2.00000000000000012e63

   1. Initial program 99.2%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 92.5

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

   4. Applied rewrites 92.5%

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

   5. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto c + \left(t \cdot z\right) \cdot \frac{1}{16} \]

      2. +-commutative N/A

         \[\leadsto \left(t \cdot z\right) \cdot \frac{1}{16} + c \]

      3. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) \]

      4. lift-*.f64 61.6

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

   7. Applied rewrites 61.6%

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

   if -1.99999999999999992e-23 < (*.f64 x y) < -5.00000000000000001e-137

   1. Initial program 98.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 92.4

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

   4. Applied rewrites 92.4%

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

   5. Taylor expanded in z around 0

      \[\leadsto c - \color{blue}{\frac{1}{4}} \cdot \left(b \cdot a\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 63.9%

      \[\leadsto c - \color{blue}{0.25} \cdot \left(b \cdot a\right) \]

   if 4.9999999999999999e-13 < (*.f64 x y) < 1.15e30

   1. Initial program 99.2%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 68.0

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

   4. Applied rewrites 68.0%

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

   5. Taylor expanded in c around 0

      \[\leadsto x \cdot y - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]
   6. Step-by-step derivation

      1. fp-cancel-sub-sign-inv N/A

         \[\leadsto x \cdot y + \left(\mathsf{neg}\left(\frac{1}{4}\right)\right) \cdot \color{blue}{\left(a \cdot b\right)} \]

      2. metadata-eval N/A

         \[\leadsto x \cdot y + \frac{-1}{4} \cdot \left(a \cdot b\right) \]

      3. +-commutative N/A

         \[\leadsto \frac{-1}{4} \cdot \left(a \cdot b\right) + x \cdot \color{blue}{y} \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{4}, a \cdot \color{blue}{b}, x \cdot y\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{4}, b \cdot a, x \cdot y\right) \]

      6. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{4}, b \cdot a, x \cdot y\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\frac{-1}{4}, b \cdot a, y \cdot x\right) \]

      8. lift-*.f64 40.7

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

   7. Applied rewrites 40.7%

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

Alternative 7: 65.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(t \cdot z, 0.0625, c\right)\\ \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+129}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{elif}\;x \cdot y \leq -2 \cdot 10^{-23}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \cdot y \leq -5 \cdot 10^{-137}:\\ \;\;\;\;c - 0.25 \cdot \left(b \cdot a\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (fma (* t z) 0.0625 c)))
   (if (<= (* x y) -5e+129)
     (fma y x c)
     (if (<= (* x y) -2e-23)
       t_1
       (if (<= (* x y) -5e-137)
         (- c (* 0.25 (* b a)))
         (if (<= (* x y) 2e+63) t_1 (fma y x c)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = fma((t * z), 0.0625, c);
	double tmp;
	if ((x * y) <= -5e+129) {
		tmp = fma(y, x, c);
	} else if ((x * y) <= -2e-23) {
		tmp = t_1;
	} else if ((x * y) <= -5e-137) {
		tmp = c - (0.25 * (b * a));
	} else if ((x * y) <= 2e+63) {
		tmp = t_1;
	} else {
		tmp = fma(y, x, c);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = fma(Float64(t * z), 0.0625, c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+129)
		tmp = fma(y, x, c);
	elseif (Float64(x * y) <= -2e-23)
		tmp = t_1;
	elseif (Float64(x * y) <= -5e-137)
		tmp = Float64(c - Float64(0.25 * Float64(b * a)));
	elseif (Float64(x * y) <= 2e+63)
		tmp = t_1;
	else
		tmp = fma(y, x, c);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(t * z), $MachinePrecision] * 0.0625 + c), $MachinePrecision]}, If[LessEqual[N[(x * y), $MachinePrecision], -5e+129], N[(y * x + c), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], -2e-23], t$95$1, If[LessEqual[N[(x * y), $MachinePrecision], -5e-137], N[(c - N[(0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+63], t$95$1, N[(y * x + c), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 x y) < -5.0000000000000003e129 or 2.00000000000000012e63 < (*.f64 x y)

   1. Initial program 95.9%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 85.0

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

   4. Applied rewrites 85.0%

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

   5. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-fma.f64 72.7

         \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

   7. Applied rewrites 72.7%

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

   if -5.0000000000000003e129 < (*.f64 x y) < -1.99999999999999992e-23 or -5.00000000000000001e-137 < (*.f64 x y) < 2.00000000000000012e63

   1. Initial program 99.2%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 92.2

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

   4. Applied rewrites 92.2%

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

   5. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto c + \left(t \cdot z\right) \cdot \frac{1}{16} \]

      2. +-commutative N/A

         \[\leadsto \left(t \cdot z\right) \cdot \frac{1}{16} + c \]

      3. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) \]

      4. lift-*.f64 61.2

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

   7. Applied rewrites 61.2%

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

   if -1.99999999999999992e-23 < (*.f64 x y) < -5.00000000000000001e-137

   1. Initial program 98.5%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 92.4

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

   4. Applied rewrites 92.4%

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

   5. Taylor expanded in z around 0

      \[\leadsto c - \color{blue}{\frac{1}{4}} \cdot \left(b \cdot a\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 63.9%

      \[\leadsto c - \color{blue}{0.25} \cdot \left(b \cdot a\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 65.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+129}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+63}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot z, 0.0625, c\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= (* x y) -5e+129)
   (fma y x c)
   (if (<= (* x y) 2e+63) (fma (* t z) 0.0625 c) (fma y x c))))

C

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

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+129)
		tmp = fma(y, x, c);
	elseif (Float64(x * y) <= 2e+63)
		tmp = fma(Float64(t * z), 0.0625, c);
	else
		tmp = fma(y, x, c);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[N[(x * y), $MachinePrecision], -5e+129], N[(y * x + c), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+63], N[(N[(t * z), $MachinePrecision] * 0.0625 + c), $MachinePrecision], N[(y * x + c), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000003e129 or 2.00000000000000012e63 < (*.f64 x y)

   1. Initial program 95.9%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 85.0

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

   4. Applied rewrites 85.0%

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

   5. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-fma.f64 72.7

         \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

   7. Applied rewrites 72.7%

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

   if -5.0000000000000003e129 < (*.f64 x y) < 2.00000000000000012e63

   1. Initial program 99.1%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + \frac{1}{16} \cdot \left(t \cdot z\right)\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(\frac{1}{16} \cdot \left(t \cdot z\right) + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(t \cdot z\right) \cdot \frac{1}{16} + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      8. lower-*.f64 92.2

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

   4. Applied rewrites 92.2%

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

   5. Taylor expanded in a around 0

      \[\leadsto c + \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto c + \left(t \cdot z\right) \cdot \frac{1}{16} \]

      2. +-commutative N/A

         \[\leadsto \left(t \cdot z\right) \cdot \frac{1}{16} + c \]

      3. lift-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{1}{16}, c\right) \]

      4. lift-*.f64 60.9

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

   7. Applied rewrites 60.9%

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

Alternative 9: 63.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot t}{16}\\ t_2 := \left(t \cdot z\right) \cdot 0.0625\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+133}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+114}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* z t) 16.0)) (t_2 (* (* t z) 0.0625)))
   (if (<= t_1 -1e+133) t_2 (if (<= t_1 2e+114) (fma y x c) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (z * t) / 16.0;
	double t_2 = (t * z) * 0.0625;
	double tmp;
	if (t_1 <= -1e+133) {
		tmp = t_2;
	} else if (t_1 <= 2e+114) {
		tmp = fma(y, x, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(z * t) / 16.0)
	t_2 = Float64(Float64(t * z) * 0.0625)
	tmp = 0.0
	if (t_1 <= -1e+133)
		tmp = t_2;
	elseif (t_1 <= 2e+114)
		tmp = fma(y, x, c);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(z * t), $MachinePrecision] / 16.0), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t * z), $MachinePrecision] * 0.0625), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+133], t$95$2, If[LessEqual[t$95$1, 2e+114], N[(y * x + c), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 z t) #s(literal 16 binary64)) < -1e133 or 2e114 < (/.f64 (*.f64 z t) #s(literal 16 binary64))

   1. Initial program 95.1%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{1}{16} \cdot \left(t \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(t \cdot z\right) \cdot \color{blue}{\frac{1}{16}} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(t \cdot z\right) \cdot \color{blue}{\frac{1}{16}} \]

      3. lower-*.f64 68.1

         \[\leadsto \left(t \cdot z\right) \cdot 0.0625 \]

   4. Applied rewrites 68.1%

      \[\leadsto \color{blue}{\left(t \cdot z\right) \cdot 0.0625} \]

   if -1e133 < (/.f64 (*.f64 z t) #s(literal 16 binary64)) < 2e114

   1. Initial program 99.3%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 91.1

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

   4. Applied rewrites 91.1%

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

   5. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-fma.f64 59.9

         \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

   7. Applied rewrites 59.9%

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

Alternative 10: 62.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a \cdot b}{4}\\ t_2 := -0.25 \cdot \left(b \cdot a\right)\\ \mathbf{if}\;t\_1 \leq -4 \cdot 10^{+231}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+143}:\\ \;\;\;\;\mathsf{fma}\left(y, x, c\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (let* ((t_1 (/ (* a b) 4.0)) (t_2 (* -0.25 (* b a))))
   (if (<= t_1 -4e+231) t_2 (if (<= t_1 5e+143) (fma y x c) t_2))))

C

double code(double x, double y, double z, double t, double a, double b, double c) {
	double t_1 = (a * b) / 4.0;
	double t_2 = -0.25 * (b * a);
	double tmp;
	if (t_1 <= -4e+231) {
		tmp = t_2;
	} else if (t_1 <= 5e+143) {
		tmp = fma(y, x, c);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c)
	t_1 = Float64(Float64(a * b) / 4.0)
	t_2 = Float64(-0.25 * Float64(b * a))
	tmp = 0.0
	if (t_1 <= -4e+231)
		tmp = t_2;
	elseif (t_1 <= 5e+143)
		tmp = fma(y, x, c);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := Block[{t$95$1 = N[(N[(a * b), $MachinePrecision] / 4.0), $MachinePrecision]}, Block[{t$95$2 = N[(-0.25 * N[(b * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -4e+231], t$95$2, If[LessEqual[t$95$1, 5e+143], N[(y * x + c), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 a b) #s(literal 4 binary64)) < -4.0000000000000002e231 or 5.00000000000000012e143 < (/.f64 (*.f64 a b) #s(literal 4 binary64))

   1. Initial program 94.0%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{4} \cdot \left(a \cdot b\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \frac{-1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      2. *-commutative N/A

         \[\leadsto \frac{-1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      3. lower-*.f64 77.4

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

   4. Applied rewrites 77.4%

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

   if -4.0000000000000002e231 < (/.f64 (*.f64 a b) #s(literal 4 binary64)) < 5.00000000000000012e143

   1. Initial program 99.2%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in z around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

      2. +-commutative N/A

         \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

      7. lower-*.f64 69.9

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

   4. Applied rewrites 69.9%

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

   5. Taylor expanded in a around 0

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

      1. *-commutative N/A

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

      2. +-commutative N/A

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

      3. lift-fma.f64 58.5

         \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

   7. Applied rewrites 58.5%

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

Alternative 11: 48.7% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.0%

   \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

2. Taylor expanded in z around 0

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

   1. lower--.f64 N/A

      \[\leadsto \left(c + x \cdot y\right) - \color{blue}{\frac{1}{4} \cdot \left(a \cdot b\right)} \]

   2. +-commutative N/A

      \[\leadsto \left(x \cdot y + c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

   3. *-commutative N/A

      \[\leadsto \left(y \cdot x + c\right) - \frac{1}{4} \cdot \left(a \cdot b\right) \]

   4. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(y, x, c\right) - \color{blue}{\frac{1}{4}} \cdot \left(a \cdot b\right) \]

   5. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \color{blue}{\left(a \cdot b\right)} \]

   6. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(y, x, c\right) - \frac{1}{4} \cdot \left(b \cdot \color{blue}{a}\right) \]

   7. lower-*.f64 74.3

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

4. Applied rewrites 74.3%

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

5. Taylor expanded in a around 0

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

   1. *-commutative N/A

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

   2. +-commutative N/A

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

   3. lift-fma.f64 48.7

      \[\leadsto \mathsf{fma}\left(y, x, c\right) \]

7. Applied rewrites 48.7%

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

Alternative 12: 41.7% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot y \leq -5 \cdot 10^{+129}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \cdot y \leq 2 \cdot 10^{+29}:\\ \;\;\;\;c\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c)
 :precision binary64
 (if (<= (* x y) -5e+129) (* y x) (if (<= (* x y) 2e+29) c (* y x))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c)
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
    real(8), intent (in) :: c
    real(8) :: tmp
    if ((x * y) <= (-5d+129)) then
        tmp = y * x
    else if ((x * y) <= 2d+29) then
        tmp = c
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c) {
	double tmp;
	if ((x * y) <= -5e+129) {
		tmp = y * x;
	} else if ((x * y) <= 2e+29) {
		tmp = c;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c):
	tmp = 0
	if (x * y) <= -5e+129:
		tmp = y * x
	elif (x * y) <= 2e+29:
		tmp = c
	else:
		tmp = y * x
	return tmp

Julia

function code(x, y, z, t, a, b, c)
	tmp = 0.0
	if (Float64(x * y) <= -5e+129)
		tmp = Float64(y * x);
	elseif (Float64(x * y) <= 2e+29)
		tmp = c;
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c)
	tmp = 0.0;
	if ((x * y) <= -5e+129)
		tmp = y * x;
	elseif ((x * y) <= 2e+29)
		tmp = c;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := If[LessEqual[N[(x * y), $MachinePrecision], -5e+129], N[(y * x), $MachinePrecision], If[LessEqual[N[(x * y), $MachinePrecision], 2e+29], c, N[(y * x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < -5.0000000000000003e129 or 1.99999999999999983e29 < (*.f64 x y)

   1. Initial program 96.0%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 61.9

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

   4. Applied rewrites 61.9%

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

   if -5.0000000000000003e129 < (*.f64 x y) < 1.99999999999999983e29

   1. Initial program 99.2%

      \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{c} \]
   3. Step-by-step derivation

   4. Applied rewrites 29.2%

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

Alternative 13: 22.0% accurate, 24.7× speedup

Math

\[\begin{array}{l} \\ c \end{array} \]

FPCore

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

C

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

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, c)
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
    real(8), intent (in) :: c
    code = c
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_, c_] := c

Derivation

1. Initial program 98.0%

   \[\left(\left(x \cdot y + \frac{z \cdot t}{16}\right) - \frac{a \cdot b}{4}\right) + c \]

2. Taylor expanded in c around inf

   \[\leadsto \color{blue}{c} \]
3. Step-by-step derivation

4. Applied rewrites 22.0%

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

Reproduce

herbie shell --seed 2025119 
(FPCore (x y z t a b c)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, C"
  :precision binary64
  (+ (- (+ (* x y) (/ (* z t) 16.0)) (/ (* a b) 4.0)) c))