Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B

Percentage Accurate: 90.7% → 96.7%

Time: 9.0s

Alternatives: 7

Speedup: 0.9×

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

Specification

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 90.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* (* y 4.0) (- (* z z) t))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 96.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} \mathbf{if}\;z\_m \leq 1.85 \cdot 10^{+152}:\\ \;\;\;\;\mathsf{fma}\left(z\_m \cdot z\_m - t, -4 \cdot y, x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\_m\right) \cdot z\_m, -4, x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (if (<= z_m 1.85e+152)
   (fma (- (* z_m z_m) t) (* -4.0 y) (* x x))
   (fma (* (* y z_m) z_m) -4.0 (* x x))))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 1.85e+152) {
		tmp = fma(((z_m * z_m) - t), (-4.0 * y), (x * x));
	} else {
		tmp = fma(((y * z_m) * z_m), -4.0, (x * x));
	}
	return tmp;
}

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	tmp = 0.0
	if (z_m <= 1.85e+152)
		tmp = fma(Float64(Float64(z_m * z_m) - t), Float64(-4.0 * y), Float64(x * x));
	else
		tmp = fma(Float64(Float64(y * z_m) * z_m), -4.0, Float64(x * x));
	end
	return tmp
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := If[LessEqual[z$95$m, 1.85e+152], N[(N[(N[(z$95$m * z$95$m), $MachinePrecision] - t), $MachinePrecision] * N[(-4.0 * y), $MachinePrecision] + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z$95$m), $MachinePrecision] * z$95$m), $MachinePrecision] * -4.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 1.84999999999999998e152

   1. Initial program 94.5%

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

   4. Applied rewrites 95.8%

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

   if 1.84999999999999998e152 < z

   1. Initial program 66.2%

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

   3. Taylor expanded in t around 0

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

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

         \[\leadsto \color{blue}{{x}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(y \cdot {z}^{2}\right)} \]

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-rgt-identity N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{{x}^{2} \cdot 1} \]

      5. unpow2 N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{\left(x \cdot x\right)} \cdot 1 \]

      6. associate-*l* N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{x \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto \color{blue}{-4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(x\right)\right) \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(x \cdot 1\right)\right)\right)} \]

      9. associate-*l* N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot x\right) \cdot 1}\right)\right) \]

      10. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{{x}^{2}} \cdot 1\right)\right) \]

      11. *-rgt-identity N/A

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

      12. mul-1-neg N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{-1 \cdot {x}^{2}} \]

      13. *-commutative N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{{x}^{2} \cdot -1} \]

      14. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(x \cdot x\right)} \cdot -1 \]

      15. sqr-neg-rev N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)} \cdot -1 \]

      16. distribute-lft-neg-out N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(\mathsf{neg}\left(x\right)\right)\right)\right)} \cdot -1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot x\right)\right)}\right)\right) \cdot -1 \]

      18. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \cdot -1 \]

      19. mul-1-neg N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{-1 \cdot {x}^{2}}\right)\right) \cdot -1 \]

      20. fp-cancel-sign-sub N/A

          \[\leadsto \color{blue}{-4 \cdot \left(y \cdot {z}^{2}\right) + \left(-1 \cdot {x}^{2}\right) \cdot -1} \]

      21. *-commutative N/A

          \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} + \left(-1 \cdot {x}^{2}\right) \cdot -1 \]

      22. mul-1-neg N/A

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

   5. Applied rewrites 66.2%

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

   7. Applied rewrites 79.3%

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

Alternative 2: 45.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} t_1 := \left(t \cdot 4\right) \cdot y\\ \mathbf{if}\;x \leq 4.5 \cdot 10^{-248}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 4.5 \cdot 10^{-62}:\\ \;\;\;\;\left(\left(-4 \cdot z\_m\right) \cdot y\right) \cdot z\_m\\ \mathbf{elif}\;x \leq 0.115:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (let* ((t_1 (* (* t 4.0) y)))
   (if (<= x 4.5e-248)
     t_1
     (if (<= x 4.5e-62)
       (* (* (* -4.0 z_m) y) z_m)
       (if (<= x 0.115) t_1 (* x x))))))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double t_1 = (t * 4.0) * y;
	double tmp;
	if (x <= 4.5e-248) {
		tmp = t_1;
	} else if (x <= 4.5e-62) {
		tmp = ((-4.0 * z_m) * y) * z_m;
	} else if (x <= 0.115) {
		tmp = t_1;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

z_m =     private
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_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t * 4.0d0) * y
    if (x <= 4.5d-248) then
        tmp = t_1
    else if (x <= 4.5d-62) then
        tmp = (((-4.0d0) * z_m) * y) * z_m
    else if (x <= 0.115d0) then
        tmp = t_1
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

z_m = Math.abs(z);
public static double code(double x, double y, double z_m, double t) {
	double t_1 = (t * 4.0) * y;
	double tmp;
	if (x <= 4.5e-248) {
		tmp = t_1;
	} else if (x <= 4.5e-62) {
		tmp = ((-4.0 * z_m) * y) * z_m;
	} else if (x <= 0.115) {
		tmp = t_1;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

z_m = math.fabs(z)
def code(x, y, z_m, t):
	t_1 = (t * 4.0) * y
	tmp = 0
	if x <= 4.5e-248:
		tmp = t_1
	elif x <= 4.5e-62:
		tmp = ((-4.0 * z_m) * y) * z_m
	elif x <= 0.115:
		tmp = t_1
	else:
		tmp = x * x
	return tmp

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	t_1 = Float64(Float64(t * 4.0) * y)
	tmp = 0.0
	if (x <= 4.5e-248)
		tmp = t_1;
	elseif (x <= 4.5e-62)
		tmp = Float64(Float64(Float64(-4.0 * z_m) * y) * z_m);
	elseif (x <= 0.115)
		tmp = t_1;
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

z_m = abs(z);
function tmp_2 = code(x, y, z_m, t)
	t_1 = (t * 4.0) * y;
	tmp = 0.0;
	if (x <= 4.5e-248)
		tmp = t_1;
	elseif (x <= 4.5e-62)
		tmp = ((-4.0 * z_m) * y) * z_m;
	elseif (x <= 0.115)
		tmp = t_1;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := Block[{t$95$1 = N[(N[(t * 4.0), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[x, 4.5e-248], t$95$1, If[LessEqual[x, 4.5e-62], N[(N[(N[(-4.0 * z$95$m), $MachinePrecision] * y), $MachinePrecision] * z$95$m), $MachinePrecision], If[LessEqual[x, 0.115], t$95$1, N[(x * x), $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if x < 4.4999999999999996e-248 or 4.50000000000000018e-62 < x < 0.115000000000000005

   1. Initial program 91.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} \]

      3. lower-*.f64 37.7

         \[\leadsto \color{blue}{\left(t \cdot y\right)} \cdot 4 \]

   5. Applied rewrites 37.7%

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

   7. Applied rewrites 37.7%

      \[\leadsto \left(t \cdot 4\right) \cdot \color{blue}{y} \]

   if 4.4999999999999996e-248 < x < 4.50000000000000018e-62

   1. Initial program 97.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left({z}^{2} \cdot y\right)} \cdot -4 \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({z}^{2} \cdot y\right)} \cdot -4 \]

      5. unpow2 N/A

         \[\leadsto \left(\color{blue}{\left(z \cdot z\right)} \cdot y\right) \cdot -4 \]

      6. lower-*.f64 66.1

         \[\leadsto \left(\color{blue}{\left(z \cdot z\right)} \cdot y\right) \cdot -4 \]

   5. Applied rewrites 66.1%

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

   7. Applied rewrites 69.0%

      \[\leadsto \left(\left(-4 \cdot z\right) \cdot y\right) \cdot \color{blue}{z} \]

   if 0.115000000000000005 < x

   1. Initial program 88.9%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\color{blue}{\left({z}^{2} - t\right)} \cdot y\right) \cdot -4 \]

      6. unpow2 N/A

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

      7. lower-*.f64 38.8

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

   5. Applied rewrites 38.8%

      \[\leadsto \color{blue}{\left(\left(z \cdot z - t\right) \cdot y\right) \cdot -4} \]

   6. Taylor expanded in t around inf

      \[\leadsto \left(t \cdot \left(-1 \cdot y + \frac{y \cdot {z}^{2}}{t}\right)\right) \cdot -4 \]
   7. Step-by-step derivation

   8. Applied rewrites 37.2%

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

   9. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   10. Step-by-step derivation

       1. unpow2 N/A

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

       2. lower-*.f64 73.2

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

   11. Applied rewrites 73.2%

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

Alternative 3: 90.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} \mathbf{if}\;z\_m \leq 29500000000:\\ \;\;\;\;\mathsf{fma}\left(t \cdot 4, y, x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\left(y \cdot z\_m\right) \cdot z\_m, -4, x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (if (<= z_m 29500000000.0)
   (fma (* t 4.0) y (* x x))
   (fma (* (* y z_m) z_m) -4.0 (* x x))))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 29500000000.0) {
		tmp = fma((t * 4.0), y, (x * x));
	} else {
		tmp = fma(((y * z_m) * z_m), -4.0, (x * x));
	}
	return tmp;
}

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	tmp = 0.0
	if (z_m <= 29500000000.0)
		tmp = fma(Float64(t * 4.0), y, Float64(x * x));
	else
		tmp = fma(Float64(Float64(y * z_m) * z_m), -4.0, Float64(x * x));
	end
	return tmp
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := If[LessEqual[z$95$m, 29500000000.0], N[(N[(t * 4.0), $MachinePrecision] * y + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(y * z$95$m), $MachinePrecision] * z$95$m), $MachinePrecision] * -4.0 + N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 2.95e10

   1. Initial program 93.7%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. unpow2 N/A

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

      6. associate-*l* N/A

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

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

         \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(x\right)\right) \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(x \cdot 1\right)\right)\right)} \]

      9. associate-*l* N/A

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot x\right) \cdot 1}\right)\right) \]

      10. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{{x}^{2}} \cdot 1\right)\right) \]

      11. *-rgt-identity N/A

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

      12. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{-1 \cdot {x}^{2}} \]

      13. *-commutative N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{{x}^{2} \cdot -1} \]

      14. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(x \cdot x\right)} \cdot -1 \]

      15. sqr-neg-rev N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)} \cdot -1 \]

      16. distribute-lft-neg-out N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(\mathsf{neg}\left(x\right)\right)\right)\right)} \cdot -1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot x\right)\right)}\right)\right) \cdot -1 \]

      18. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \cdot -1 \]

      19. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{-1 \cdot {x}^{2}}\right)\right) \cdot -1 \]

      20. fp-cancel-sign-sub N/A

          \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) + \left(-1 \cdot {x}^{2}\right) \cdot -1} \]

      21. *-commutative N/A

          \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} + \left(-1 \cdot {x}^{2}\right) \cdot -1 \]

      22. mul-1-neg N/A

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

      23. distribute-lft-neg-out N/A

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

      24. *-commutative N/A

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

   5. Applied rewrites 81.0%

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

   7. Applied rewrites 82.5%

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

   if 2.95e10 < z

   1. Initial program 82.8%

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

   3. Taylor expanded in t around 0

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

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

         \[\leadsto \color{blue}{{x}^{2} + \left(\mathsf{neg}\left(4\right)\right) \cdot \left(y \cdot {z}^{2}\right)} \]

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-rgt-identity N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{{x}^{2} \cdot 1} \]

      5. unpow2 N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{\left(x \cdot x\right)} \cdot 1 \]

      6. associate-*l* N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) + \color{blue}{x \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto \color{blue}{-4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(x\right)\right) \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(x \cdot 1\right)\right)\right)} \]

      9. associate-*l* N/A

         \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot x\right) \cdot 1}\right)\right) \]

      10. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{{x}^{2}} \cdot 1\right)\right) \]

      11. *-rgt-identity N/A

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

      12. mul-1-neg N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{-1 \cdot {x}^{2}} \]

      13. *-commutative N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{{x}^{2} \cdot -1} \]

      14. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(x \cdot x\right)} \cdot -1 \]

      15. sqr-neg-rev N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)} \cdot -1 \]

      16. distribute-lft-neg-out N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(\mathsf{neg}\left(x\right)\right)\right)\right)} \cdot -1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot x\right)\right)}\right)\right) \cdot -1 \]

      18. unpow2 N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \cdot -1 \]

      19. mul-1-neg N/A

          \[\leadsto -4 \cdot \left(y \cdot {z}^{2}\right) - \left(\mathsf{neg}\left(\color{blue}{-1 \cdot {x}^{2}}\right)\right) \cdot -1 \]

      20. fp-cancel-sign-sub N/A

          \[\leadsto \color{blue}{-4 \cdot \left(y \cdot {z}^{2}\right) + \left(-1 \cdot {x}^{2}\right) \cdot -1} \]

      21. *-commutative N/A

          \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} + \left(-1 \cdot {x}^{2}\right) \cdot -1 \]

      22. mul-1-neg N/A

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

   5. Applied rewrites 73.5%

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

   7. Applied rewrites 80.2%

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

Alternative 4: 72.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 1.35 \cdot 10^{-9}:\\ \;\;\;\;\left(\left(z\_m \cdot z\_m - t\right) \cdot y\right) \cdot -4\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot 4, y, x \cdot x\right)\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (if (<= x 1.35e-9)
   (* (* (- (* z_m z_m) t) y) -4.0)
   (fma (* t 4.0) y (* x x))))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double tmp;
	if (x <= 1.35e-9) {
		tmp = (((z_m * z_m) - t) * y) * -4.0;
	} else {
		tmp = fma((t * 4.0), y, (x * x));
	}
	return tmp;
}

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	tmp = 0.0
	if (x <= 1.35e-9)
		tmp = Float64(Float64(Float64(Float64(z_m * z_m) - t) * y) * -4.0);
	else
		tmp = fma(Float64(t * 4.0), y, Float64(x * x));
	end
	return tmp
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := If[LessEqual[x, 1.35e-9], N[(N[(N[(N[(z$95$m * z$95$m), $MachinePrecision] - t), $MachinePrecision] * y), $MachinePrecision] * -4.0), $MachinePrecision], N[(N[(t * 4.0), $MachinePrecision] * y + N[(x * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 1.3500000000000001e-9

   1. Initial program 91.8%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\color{blue}{\left({z}^{2} - t\right)} \cdot y\right) \cdot -4 \]

      6. unpow2 N/A

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

      7. lower-*.f64 66.9

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

   5. Applied rewrites 66.9%

      \[\leadsto \color{blue}{\left(\left(z \cdot z - t\right) \cdot y\right) \cdot -4} \]

   if 1.3500000000000001e-9 < x

   1. Initial program 89.8%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. unpow2 N/A

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

      6. associate-*l* N/A

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

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

         \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(x\right)\right) \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(x \cdot 1\right)\right)\right)} \]

      9. associate-*l* N/A

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot x\right) \cdot 1}\right)\right) \]

      10. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{{x}^{2}} \cdot 1\right)\right) \]

      11. *-rgt-identity N/A

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

      12. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{-1 \cdot {x}^{2}} \]

      13. *-commutative N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{{x}^{2} \cdot -1} \]

      14. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(x \cdot x\right)} \cdot -1 \]

      15. sqr-neg-rev N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)} \cdot -1 \]

      16. distribute-lft-neg-out N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(\mathsf{neg}\left(x\right)\right)\right)\right)} \cdot -1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot x\right)\right)}\right)\right) \cdot -1 \]

      18. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \cdot -1 \]

      19. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{-1 \cdot {x}^{2}}\right)\right) \cdot -1 \]

      20. fp-cancel-sign-sub N/A

          \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) + \left(-1 \cdot {x}^{2}\right) \cdot -1} \]

      21. *-commutative N/A

          \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} + \left(-1 \cdot {x}^{2}\right) \cdot -1 \]

      22. mul-1-neg N/A

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

      23. distribute-lft-neg-out N/A

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

      24. *-commutative N/A

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

   5. Applied rewrites 85.3%

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

   7. Applied rewrites 85.3%

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

Alternative 5: 85.9% accurate, 1.2× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} \mathbf{if}\;z\_m \leq 5.6 \cdot 10^{+69}:\\ \;\;\;\;\mathsf{fma}\left(t \cdot 4, y, x \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-4 \cdot z\_m\right) \cdot y\right) \cdot z\_m\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (if (<= z_m 5.6e+69) (fma (* t 4.0) y (* x x)) (* (* (* -4.0 z_m) y) z_m)))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 5.6e+69) {
		tmp = fma((t * 4.0), y, (x * x));
	} else {
		tmp = ((-4.0 * z_m) * y) * z_m;
	}
	return tmp;
}

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	tmp = 0.0
	if (z_m <= 5.6e+69)
		tmp = fma(Float64(t * 4.0), y, Float64(x * x));
	else
		tmp = Float64(Float64(Float64(-4.0 * z_m) * y) * z_m);
	end
	return tmp
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := If[LessEqual[z$95$m, 5.6e+69], N[(N[(t * 4.0), $MachinePrecision] * y + N[(x * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(-4.0 * z$95$m), $MachinePrecision] * y), $MachinePrecision] * z$95$m), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 5.59999999999999964e69

   1. Initial program 94.1%

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

   3. Taylor expanded in z around 0

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

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

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

      2. metadata-eval N/A

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

      3. +-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. unpow2 N/A

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

      6. associate-*l* N/A

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

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

         \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(x\right)\right) \cdot \left(x \cdot 1\right)} \]

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

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(x \cdot 1\right)\right)\right)} \]

      9. associate-*l* N/A

         \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot x\right) \cdot 1}\right)\right) \]

      10. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{{x}^{2}} \cdot 1\right)\right) \]

      11. *-rgt-identity N/A

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

      12. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{-1 \cdot {x}^{2}} \]

      13. *-commutative N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{{x}^{2} \cdot -1} \]

      14. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(x \cdot x\right)} \cdot -1 \]

      15. sqr-neg-rev N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\left(\mathsf{neg}\left(x\right)\right) \cdot \left(\mathsf{neg}\left(x\right)\right)\right)} \cdot -1 \]

      16. distribute-lft-neg-out N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(\mathsf{neg}\left(x\right)\right)\right)\right)} \cdot -1 \]

      17. distribute-rgt-neg-in N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot x\right)\right)}\right)\right) \cdot -1 \]

      18. unpow2 N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \cdot -1 \]

      19. mul-1-neg N/A

          \[\leadsto 4 \cdot \left(t \cdot y\right) - \left(\mathsf{neg}\left(\color{blue}{-1 \cdot {x}^{2}}\right)\right) \cdot -1 \]

      20. fp-cancel-sign-sub N/A

          \[\leadsto \color{blue}{4 \cdot \left(t \cdot y\right) + \left(-1 \cdot {x}^{2}\right) \cdot -1} \]

      21. *-commutative N/A

          \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} + \left(-1 \cdot {x}^{2}\right) \cdot -1 \]

      22. mul-1-neg N/A

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

      23. distribute-lft-neg-out N/A

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

      24. *-commutative N/A

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

   5. Applied rewrites 79.9%

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

   7. Applied rewrites 81.3%

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

   if 5.59999999999999964e69 < z

   1. Initial program 77.7%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(y \cdot {z}^{2}\right) \cdot -4} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left({z}^{2} \cdot y\right)} \cdot -4 \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({z}^{2} \cdot y\right)} \cdot -4 \]

      5. unpow2 N/A

         \[\leadsto \left(\color{blue}{\left(z \cdot z\right)} \cdot y\right) \cdot -4 \]

      6. lower-*.f64 75.0

         \[\leadsto \left(\color{blue}{\left(z \cdot z\right)} \cdot y\right) \cdot -4 \]

   5. Applied rewrites 75.0%

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

   7. Applied rewrites 77.0%

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

Alternative 6: 45.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ \begin{array}{l} \mathbf{if}\;x \leq 0.115:\\ \;\;\;\;\left(t \cdot 4\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t)
 :precision binary64
 (if (<= x 0.115) (* (* t 4.0) y) (* x x)))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	double tmp;
	if (x <= 0.115) {
		tmp = (t * 4.0) * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Fortran

z_m =     private
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_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x <= 0.115d0) then
        tmp = (t * 4.0d0) * y
    else
        tmp = x * x
    end if
    code = tmp
end function

Java

z_m = Math.abs(z);
public static double code(double x, double y, double z_m, double t) {
	double tmp;
	if (x <= 0.115) {
		tmp = (t * 4.0) * y;
	} else {
		tmp = x * x;
	}
	return tmp;
}

Python

z_m = math.fabs(z)
def code(x, y, z_m, t):
	tmp = 0
	if x <= 0.115:
		tmp = (t * 4.0) * y
	else:
		tmp = x * x
	return tmp

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	tmp = 0.0
	if (x <= 0.115)
		tmp = Float64(Float64(t * 4.0) * y);
	else
		tmp = Float64(x * x);
	end
	return tmp
end

MATLAB

z_m = abs(z);
function tmp_2 = code(x, y, z_m, t)
	tmp = 0.0;
	if (x <= 0.115)
		tmp = (t * 4.0) * y;
	else
		tmp = x * x;
	end
	tmp_2 = tmp;
end

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := If[LessEqual[x, 0.115], N[(N[(t * 4.0), $MachinePrecision] * y), $MachinePrecision], N[(x * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.115000000000000005

   1. Initial program 92.0%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(t \cdot y\right) \cdot 4} \]

      3. lower-*.f64 37.5

         \[\leadsto \color{blue}{\left(t \cdot y\right)} \cdot 4 \]

   5. Applied rewrites 37.5%

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

   7. Applied rewrites 37.5%

      \[\leadsto \left(t \cdot 4\right) \cdot \color{blue}{y} \]

   if 0.115000000000000005 < x

   1. Initial program 88.9%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

      5. lower--.f64 N/A

         \[\leadsto \left(\color{blue}{\left({z}^{2} - t\right)} \cdot y\right) \cdot -4 \]

      6. unpow2 N/A

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

      7. lower-*.f64 38.8

         \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

   5. Applied rewrites 38.8%

      \[\leadsto \color{blue}{\left(\left(z \cdot z - t\right) \cdot y\right) \cdot -4} \]

   6. Taylor expanded in t around inf

      \[\leadsto \left(t \cdot \left(-1 \cdot y + \frac{y \cdot {z}^{2}}{t}\right)\right) \cdot -4 \]
   7. Step-by-step derivation

   8. Applied rewrites 37.2%

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

   9. Taylor expanded in x around inf

      \[\leadsto \color{blue}{{x}^{2}} \]
   10. Step-by-step derivation

       1. unpow2 N/A

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

       2. lower-*.f64 73.2

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

   11. Applied rewrites 73.2%

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

Alternative 7: 40.5% accurate, 4.5× speedup

Math

\[\begin{array}{l} z_m = \left|z\right| \\ x \cdot x \end{array} \]

FPCore

z_m = (fabs.f64 z)
(FPCore (x y z_m t) :precision binary64 (* x x))

C

z_m = fabs(z);
double code(double x, double y, double z_m, double t) {
	return x * x;
}

Fortran

z_m =     private
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_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    code = x * x
end function

Java

z_m = Math.abs(z);
public static double code(double x, double y, double z_m, double t) {
	return x * x;
}

Python

z_m = math.fabs(z)
def code(x, y, z_m, t):
	return x * x

Julia

z_m = abs(z)
function code(x, y, z_m, t)
	return Float64(x * x)
end

MATLAB

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

Wolfram

z_m = N[Abs[z], $MachinePrecision]
code[x_, y_, z$95$m_, t_] := N[(x * x), $MachinePrecision]

Derivation

1. Initial program 91.3%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(y \cdot \left({z}^{2} - t\right)\right) \cdot -4} \]

   3. *-commutative N/A

      \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\left({z}^{2} - t\right) \cdot y\right)} \cdot -4 \]

   5. lower--.f64 N/A

      \[\leadsto \left(\color{blue}{\left({z}^{2} - t\right)} \cdot y\right) \cdot -4 \]

   6. unpow2 N/A

      \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

   7. lower-*.f64 60.1

      \[\leadsto \left(\left(\color{blue}{z \cdot z} - t\right) \cdot y\right) \cdot -4 \]

5. Applied rewrites 60.1%

   \[\leadsto \color{blue}{\left(\left(z \cdot z - t\right) \cdot y\right) \cdot -4} \]

6. Taylor expanded in t around inf

   \[\leadsto \left(t \cdot \left(-1 \cdot y + \frac{y \cdot {z}^{2}}{t}\right)\right) \cdot -4 \]
7. Step-by-step derivation

8. Applied rewrites 56.9%

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

9. Taylor expanded in x around inf

   \[\leadsto \color{blue}{{x}^{2}} \]
10. Step-by-step derivation

    1. unpow2 N/A

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

    2. lower-*.f64 48.3

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

11. Applied rewrites 48.3%

    \[\leadsto \color{blue}{x \cdot x} \]
12. Add Preprocessing

Developer Target 1: 90.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (- (* x x) (* 4.0 (* y (- (* z z) t)))))

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024360 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B"
  :precision binary64

  :alt
  (! :herbie-platform default (- (* x x) (* 4 (* y (- (* z z) t)))))

  (- (* x x) (* (* y 4.0) (- (* z z) t))))