Data.Metrics.Snapshot:quantile from metrics-0.3.0.2

Percentage Accurate: 100.0% → 100.0%

Time: 8.7s

Alternatives: 11

Speedup: 1.2×

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

Specification

Math

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

FPCore

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

C

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

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 + ((y - z) * (t - x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 + ((y - z) * (t - x))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lower-fma.f64 100.0

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

4. Applied rewrites 100.0%

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

Alternative 2: 71.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ \mathbf{if}\;y \leq -2.9 \cdot 10^{+51}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-53}:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \mathbf{elif}\;y \leq -1.82 \cdot 10^{-140}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 21000:\\ \;\;\;\;\mathsf{fma}\left(-t, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -2.9e+51)
     t_1
     (if (<= y -9.5e-53)
       (* (- x t) z)
       (if (<= y -1.82e-140)
         (fma z x x)
         (if (<= y 21000.0) (fma (- t) z x) t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -2.9e+51) {
		tmp = t_1;
	} else if (y <= -9.5e-53) {
		tmp = (x - t) * z;
	} else if (y <= -1.82e-140) {
		tmp = fma(z, x, x);
	} else if (y <= 21000.0) {
		tmp = fma(-t, z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -2.9e+51)
		tmp = t_1;
	elseif (y <= -9.5e-53)
		tmp = Float64(Float64(x - t) * z);
	elseif (y <= -1.82e-140)
		tmp = fma(z, x, x);
	elseif (y <= 21000.0)
		tmp = fma(Float64(-t), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -2.9e+51], t$95$1, If[LessEqual[y, -9.5e-53], N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[y, -1.82e-140], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 21000.0], N[((-t) * z + x), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -2.8999999999999998e51 or 21000 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 85.8

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

   5. Applied rewrites 85.8%

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

   if -2.8999999999999998e51 < y < -9.5000000000000008e-53

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. unsub-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower--.f64 68.0

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

   5. Applied rewrites 68.0%

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

   if -9.5000000000000008e-53 < y < -1.8200000000000001e-140

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 88.3

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

   5. Applied rewrites 88.3%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 82.6%

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

   if -1.8200000000000001e-140 < y < 21000

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 90.0

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

   5. Applied rewrites 90.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(-1 \cdot t, z, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 72.0%

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

Alternative 3: 67.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ \mathbf{if}\;y \leq -2.9 \cdot 10^{+51}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-53}:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \mathbf{elif}\;y \leq 7.8 \cdot 10^{-82}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 6.8 \cdot 10^{+21}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -2.9e+51)
     t_1
     (if (<= y -9.5e-53)
       (* (- x t) z)
       (if (<= y 7.8e-82)
         (fma z x x)
         (if (<= y 6.8e+21) (* t (- y z)) t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -2.9e+51) {
		tmp = t_1;
	} else if (y <= -9.5e-53) {
		tmp = (x - t) * z;
	} else if (y <= 7.8e-82) {
		tmp = fma(z, x, x);
	} else if (y <= 6.8e+21) {
		tmp = t * (y - z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -2.9e+51)
		tmp = t_1;
	elseif (y <= -9.5e-53)
		tmp = Float64(Float64(x - t) * z);
	elseif (y <= 7.8e-82)
		tmp = fma(z, x, x);
	elseif (y <= 6.8e+21)
		tmp = Float64(t * Float64(y - z));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision]}, If[LessEqual[y, -2.9e+51], t$95$1, If[LessEqual[y, -9.5e-53], N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[y, 7.8e-82], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 6.8e+21], N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -2.8999999999999998e51 or 6.8e21 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 86.3

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

   5. Applied rewrites 86.3%

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

   if -2.8999999999999998e51 < y < -9.5000000000000008e-53

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. unsub-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower--.f64 68.0

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

   5. Applied rewrites 68.0%

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

   if -9.5000000000000008e-53 < y < 7.79999999999999947e-82

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 91.8

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

   5. Applied rewrites 91.8%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 63.1%

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

   if 7.79999999999999947e-82 < y < 6.8e21

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 69.2

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

   5. Applied rewrites 69.2%

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

4. Final simplification 73.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.9 \cdot 10^{+51}:\\ \;\;\;\;\left(t - x\right) \cdot y\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-53}:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \mathbf{elif}\;y \leq 7.8 \cdot 10^{-82}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 6.8 \cdot 10^{+21}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(t - x\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 68.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ t_2 := \left(x - t\right) \cdot z\\ \mathbf{if}\;y \leq -2.9 \cdot 10^{+51}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -9.5 \cdot 10^{-53}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq 4 \cdot 10^{-297}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 115000:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)) (t_2 (* (- x t) z)))
   (if (<= y -2.9e+51)
     t_1
     (if (<= y -9.5e-53)
       t_2
       (if (<= y 4e-297) (fma z x x) (if (<= y 115000.0) t_2 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double t_2 = (x - t) * z;
	double tmp;
	if (y <= -2.9e+51) {
		tmp = t_1;
	} else if (y <= -9.5e-53) {
		tmp = t_2;
	} else if (y <= 4e-297) {
		tmp = fma(z, x, x);
	} else if (y <= 115000.0) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	t_2 = Float64(Float64(x - t) * z)
	tmp = 0.0
	if (y <= -2.9e+51)
		tmp = t_1;
	elseif (y <= -9.5e-53)
		tmp = t_2;
	elseif (y <= 4e-297)
		tmp = fma(z, x, x);
	elseif (y <= 115000.0)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[y, -2.9e+51], t$95$1, If[LessEqual[y, -9.5e-53], t$95$2, If[LessEqual[y, 4e-297], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 115000.0], t$95$2, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.8999999999999998e51 or 115000 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 85.8

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

   5. Applied rewrites 85.8%

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

   if -2.8999999999999998e51 < y < -9.5000000000000008e-53 or 4.00000000000000016e-297 < y < 115000

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. unsub-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower--.f64 63.2

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

   5. Applied rewrites 63.2%

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

   if -9.5000000000000008e-53 < y < 4.00000000000000016e-297

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 90.5

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

   5. Applied rewrites 90.5%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 66.4%

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

Alternative 5: 85.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x - t\right) \cdot z\\ \mathbf{if}\;z \leq -34000000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-17}:\\ \;\;\;\;\mathsf{fma}\left(t - x, y, x\right)\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+28}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- x t) z)))
   (if (<= z -34000000000000.0)
     t_1
     (if (<= z 4.5e-17)
       (fma (- t x) y x)
       (if (<= z 1.15e+28) (* t (- y z)) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - t) * z;
	double tmp;
	if (z <= -34000000000000.0) {
		tmp = t_1;
	} else if (z <= 4.5e-17) {
		tmp = fma((t - x), y, x);
	} else if (z <= 1.15e+28) {
		tmp = t * (y - z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(x - t) * z)
	tmp = 0.0
	if (z <= -34000000000000.0)
		tmp = t_1;
	elseif (z <= 4.5e-17)
		tmp = fma(Float64(t - x), y, x);
	elseif (z <= 1.15e+28)
		tmp = Float64(t * Float64(y - z));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision]}, If[LessEqual[z, -34000000000000.0], t$95$1, If[LessEqual[z, 4.5e-17], N[(N[(t - x), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[z, 1.15e+28], N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.4e13 or 1.14999999999999992e28 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

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

      5. sub-neg N/A

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

      6. +-commutative N/A

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

      7. distribute-neg-in N/A

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

      8. unsub-neg N/A

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

      9. remove-double-neg N/A

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

      10. lower--.f64 81.8

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

   5. Applied rewrites 81.8%

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

   if -3.4e13 < z < 4.49999999999999978e-17

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 91.2

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

   5. Applied rewrites 91.2%

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

   if 4.49999999999999978e-17 < z < 1.14999999999999992e28

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 81.9

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

   5. Applied rewrites 81.9%

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

4. Final simplification 86.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -34000000000000:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-17}:\\ \;\;\;\;\mathsf{fma}\left(t - x, y, x\right)\\ \mathbf{elif}\;z \leq 1.15 \cdot 10^{+28}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 83.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -2.9e+51) t_1 (if (<= y 115000.0) (fma (- x t) z x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -2.9e+51) {
		tmp = t_1;
	} else if (y <= 115000.0) {
		tmp = fma((x - t), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -2.9e+51)
		tmp = t_1;
	elseif (y <= 115000.0)
		tmp = fma(Float64(x - t), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.8999999999999998e51 or 115000 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 85.8

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

   5. Applied rewrites 85.8%

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

   if -2.8999999999999998e51 < y < 115000

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 87.2

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

   5. Applied rewrites 87.2%

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

Alternative 7: 67.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -2.9e+51) t_1 (if (<= y 0.175) (fma z x x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -2.9e+51) {
		tmp = t_1;
	} else if (y <= 0.175) {
		tmp = fma(z, x, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(t - x) * y)
	tmp = 0.0
	if (y <= -2.9e+51)
		tmp = t_1;
	elseif (y <= 0.175)
		tmp = fma(z, x, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.8999999999999998e51 or 0.17499999999999999 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 84.5

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

   5. Applied rewrites 84.5%

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

   if -2.8999999999999998e51 < y < 0.17499999999999999

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 87.6

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

   5. Applied rewrites 87.6%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 55.9%

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

Alternative 8: 49.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.4e+115) (* (- x) y) (if (<= y 0.175) (fma z x x) (* t y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.4e+115) {
		tmp = -x * y;
	} else if (y <= 0.175) {
		tmp = fma(z, x, x);
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.4e+115)
		tmp = Float64(Float64(-x) * y);
	elseif (y <= 0.175)
		tmp = fma(z, x, x);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.4e+115], N[((-x) * y), $MachinePrecision], If[LessEqual[y, 0.175], N[(z * x + x), $MachinePrecision], N[(t * y), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.4e115

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 91.5

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

   5. Applied rewrites 91.5%

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

   6. Taylor expanded in t around 0

      \[\leadsto \left(-1 \cdot x\right) \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 81.0%

      \[\leadsto \left(-x\right) \cdot y \]

   if -2.4e115 < y < 0.17499999999999999

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 84.5

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

   5. Applied rewrites 84.5%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 54.9%

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

   if 0.17499999999999999 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 68.3

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

   5. Applied rewrites 68.3%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 56.0%

      \[\leadsto y \cdot \color{blue}{t} \]
3. Recombined 3 regimes into one program.

4. Final simplification 58.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.4 \cdot 10^{+115}:\\ \;\;\;\;\left(-x\right) \cdot y\\ \mathbf{elif}\;y \leq 0.175:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 40.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -14500000000000:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 4.9 \cdot 10^{+27}:\\ \;\;\;\;t \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -14500000000000.0) (* x z) (if (<= z 4.9e+27) (* t y) (* x z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -14500000000000.0) {
		tmp = x * z;
	} else if (z <= 4.9e+27) {
		tmp = t * y;
	} else {
		tmp = x * z;
	}
	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 (z <= (-14500000000000.0d0)) then
        tmp = x * z
    else if (z <= 4.9d+27) then
        tmp = t * y
    else
        tmp = x * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -14500000000000.0) {
		tmp = x * z;
	} else if (z <= 4.9e+27) {
		tmp = t * y;
	} else {
		tmp = x * z;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -14500000000000.0:
		tmp = x * z
	elif z <= 4.9e+27:
		tmp = t * y
	else:
		tmp = x * z
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -14500000000000.0)
		tmp = Float64(x * z);
	elseif (z <= 4.9e+27)
		tmp = Float64(t * y);
	else
		tmp = Float64(x * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -14500000000000.0)
		tmp = x * z;
	elseif (z <= 4.9e+27)
		tmp = t * y;
	else
		tmp = x * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -14500000000000.0], N[(x * z), $MachinePrecision], If[LessEqual[z, 4.9e+27], N[(t * y), $MachinePrecision], N[(x * z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.45e13 or 4.90000000000000015e27 < z

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lower-fma.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. mul-1-neg N/A

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

      5. neg-sub0 N/A

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

      6. associate-+l- N/A

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

      7. neg-sub0 N/A

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

      8. mul-1-neg N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 N/A

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

      11. mul-1-neg N/A

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

      12. unsub-neg N/A

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

      13. lower--.f64 56.7

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

   7. Applied rewrites 56.7%

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

   8. Taylor expanded in z around inf

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

   10. Applied rewrites 44.2%

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

   if -1.45e13 < z < 4.90000000000000015e27

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 45.8

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

   5. Applied rewrites 45.8%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 36.0%

      \[\leadsto y \cdot \color{blue}{t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 39.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -14500000000000:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z \leq 4.9 \cdot 10^{+27}:\\ \;\;\;\;t \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 44.7% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 0.175:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t) :precision binary64 (if (<= y 0.175) (fma z x x) (* t y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 0.175) {
		tmp = fma(z, x, x);
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 0.175)
		tmp = fma(z, x, x);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 0.17499999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-*r* N/A

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

      4. lower-fma.f64 N/A

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

      5. mul-1-neg N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. unsub-neg N/A

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

      10. remove-double-neg N/A

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

      11. lower--.f64 72.2

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

   5. Applied rewrites 72.2%

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

   6. Taylor expanded in x around inf

      \[\leadsto x \cdot \color{blue}{\left(1 + z\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.2%

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

   if 0.17499999999999999 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 68.3

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

   5. Applied rewrites 68.3%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 56.0%

      \[\leadsto y \cdot \color{blue}{t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 0.175:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 26.4% accurate, 2.5× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around 0

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. lower--.f64 49.3

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

5. Applied rewrites 49.3%

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

6. Taylor expanded in y around inf

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

8. Applied rewrites 25.5%

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

9. Final simplification 25.5%

   \[\leadsto t \cdot y \]
10. Add Preprocessing

Developer Target 1: 96.1% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

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 + ((t * (y - z)) + (-x * (y - z)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024235 
(FPCore (x y z t)
  :name "Data.Metrics.Snapshot:quantile from metrics-0.3.0.2"
  :precision binary64

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

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