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

Percentage Accurate: 90.8% → 93.9%

Time: 9.9s

Alternatives: 7

Speedup: 0.4×

• 49.6% 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

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

real(8) function code(x, y, z, t)
    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: 93.9% accurate, 0.0× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (- t (* z z))))
   (if (<= (+ (* x x) (* (* y 4.0) t_1)) (- INFINITY))
     (-
      (* x x)
      (pow (* z (sqrt (fma -4.0 (* t (/ y (pow z 2.0))) (* y 4.0)))) 2.0))
     (fma (* y 4.0) t_1 (* x x)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = t - (z * z);
	double tmp;
	if (((x * x) + ((y * 4.0) * t_1)) <= -((double) INFINITY)) {
		tmp = (x * x) - pow((z * sqrt(fma(-4.0, (t * (y / pow(z, 2.0))), (y * 4.0)))), 2.0);
	} else {
		tmp = fma((y * 4.0), t_1, (x * x));
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(t - Float64(z * z))
	tmp = 0.0
	if (Float64(Float64(x * x) + Float64(Float64(y * 4.0) * t_1)) <= Float64(-Inf))
		tmp = Float64(Float64(x * x) - (Float64(z * sqrt(fma(-4.0, Float64(t * Float64(y / (z ^ 2.0))), Float64(y * 4.0)))) ^ 2.0));
	else
		tmp = fma(Float64(y * 4.0), t_1, Float64(x * x));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(t - N[(z * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(x * x), $MachinePrecision] + N[(N[(y * 4.0), $MachinePrecision] * t$95$1), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[(x * x), $MachinePrecision] - N[Power[N[(z * N[Sqrt[N[(-4.0 * N[(t * N[(y / N[Power[z, 2.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * 4.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision]), $MachinePrecision], N[(N[(y * 4.0), $MachinePrecision] * t$95$1 + N[(x * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) (-.f64 (*.f64 z z) t))) < -inf.0

   1. Initial program 88.3%

      \[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 63.3%

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

      1. add-sqr-sqrt 63.3%

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

      2. pow2 63.3%

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

      3. sqrt-prod 63.3%

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

      4. sqrt-pow1 84.9%

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

      5. metadata-eval 84.9%

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

      6. pow1 84.9%

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

      7. fma-define 84.9%

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

      8. associate-/l* 99.9%

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

      9. *-commutative 99.9%

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

   5. Applied egg-rr 99.9%

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

   if -inf.0 < (-.f64 (*.f64 x x) (*.f64 (*.f64 y #s(literal 4 binary64)) (-.f64 (*.f64 z z) t)))

   1. Initial program 95.4%

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

      1. cancel-sign-sub-inv 95.4%

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

      2. distribute-lft-neg-out 95.4%

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

      3. +-commutative 95.4%

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

      4. associate-*l* 95.4%

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

      5. distribute-lft-neg-in 95.4%

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

      6. associate-*l* 95.4%

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

      7. distribute-rgt-neg-in 95.4%

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

      8. fma-define 96.8%

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

      9. sub-neg 96.8%

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

      10. +-commutative 96.8%

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

      11. distribute-neg-in 96.8%

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

      12. remove-double-neg 96.8%

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

      13. sub-neg 96.8%

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

   3. Simplified 96.8%

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

4. Final simplification 97.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x + \left(y \cdot 4\right) \cdot \left(t - z \cdot z\right) \leq -\infty:\\ \;\;\;\;x \cdot x - {\left(z \cdot \sqrt{\mathsf{fma}\left(-4, t \cdot \frac{y}{{z}^{2}}, y \cdot 4\right)}\right)}^{2}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y \cdot 4, t - z \cdot z, x \cdot x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 91.8% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 94.3%

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

   1. cancel-sign-sub-inv 94.3%

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

   2. distribute-lft-neg-out 94.3%

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

   3. +-commutative 94.3%

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

   4. associate-*l* 94.3%

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

   5. distribute-lft-neg-in 94.3%

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

   6. associate-*l* 94.3%

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

   7. distribute-rgt-neg-in 94.3%

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

   8. fma-define 95.5%

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

   9. sub-neg 95.5%

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

   10. +-commutative 95.5%

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

   11. distribute-neg-in 95.5%

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

   12. remove-double-neg 95.5%

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

   13. sub-neg 95.5%

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

3. Simplified 95.5%

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

Alternative 3: 93.2% accurate, 0.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 94.3%

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

   1. fma-neg 95.1%

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

   2. distribute-lft-neg-in 95.1%

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

   3. *-commutative 95.1%

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

   4. distribute-rgt-neg-in 95.1%

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

   5. metadata-eval 95.1%

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

3. Simplified 95.1%

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

Alternative 4: 93.3% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot x \leq 10^{+308}:\\ \;\;\;\;x \cdot x + \left(y \cdot 4\right) \cdot \left(t - z \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;{x}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (* x x) 1e+308) (+ (* x x) (* (* y 4.0) (- t (* z z)))) (pow x 2.0)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 1e+308) {
		tmp = (x * x) + ((y * 4.0) * (t - (z * z)));
	} else {
		tmp = pow(x, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x * x) <= 1d+308) then
        tmp = (x * x) + ((y * 4.0d0) * (t - (z * z)))
    else
        tmp = x ** 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x * x) <= 1e+308) {
		tmp = (x * x) + ((y * 4.0) * (t - (z * z)));
	} else {
		tmp = Math.pow(x, 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x * x) <= 1e+308:
		tmp = (x * x) + ((y * 4.0) * (t - (z * z)))
	else:
		tmp = math.pow(x, 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x * x) <= 1e+308)
		tmp = Float64(Float64(x * x) + Float64(Float64(y * 4.0) * Float64(t - Float64(z * z))));
	else
		tmp = x ^ 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x * x) <= 1e+308)
		tmp = (x * x) + ((y * 4.0) * (t - (z * z)));
	else
		tmp = x ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[N[(x * x), $MachinePrecision], 1e+308], N[(N[(x * x), $MachinePrecision] + N[(N[(y * 4.0), $MachinePrecision] * N[(t - N[(z * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[Power[x, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x x) < 1e308

   1. Initial program 96.6%

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

   if 1e308 < (*.f64 x x)

   1. Initial program 86.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 inf 96.7%

      \[\leadsto \color{blue}{{x}^{2}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x \leq 10^{+308}:\\ \;\;\;\;x \cdot x + \left(y \cdot 4\right) \cdot \left(t - z \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;{x}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 92.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x * x) + ((y * 4.0) * (t - (z * z)));
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = (x * x) - (y * (t * -4.0));
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (x * x) + ((y * 4.0) * (t - (z * z)))
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = (x * x) - (y * (t * -4.0))
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (x * x) + ((y * 4.0) * (t - (z * z)));
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = (x * x) - (y * (t * -4.0));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 97.3%

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

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

   1. Initial program 0.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 0 50.0%

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

      1. *-commutative 50.0%

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

      2. *-commutative 50.0%

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

      3. associate-*l* 50.0%

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

   5. Simplified 50.0%

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

4. Final simplification 95.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \cdot x + \left(y \cdot 4\right) \cdot \left(t - z \cdot z\right) \leq \infty:\\ \;\;\;\;x \cdot x + \left(y \cdot 4\right) \cdot \left(t - z \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot x - y \cdot \left(t \cdot -4\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 66.4% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.3%

   \[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 68.7%

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

   1. *-commutative 68.7%

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

   2. *-commutative 68.7%

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

   3. associate-*l* 68.7%

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

5. Simplified 68.7%

   \[\leadsto x \cdot x - \color{blue}{y \cdot \left(t \cdot -4\right)} \]
6. Add Preprocessing

Alternative 7: 32.1% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 94.3%

   \[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 33.2%

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

   1. *-commutative 33.2%

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

5. Simplified 33.2%

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

Developer target: 90.8% 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

real(8) function code(x, y, z, t)
    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 2024107 
(FPCore (x y z t)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, B"
  :precision binary64

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

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