Data.Metrics.Snapshot:quantile from metrics-0.3.0.2

Percentage Accurate: 100.0% → 100.0%

Time: 5.1s

Alternatives: 12

Speedup: 1.0×

• 34.5% 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.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t) {
	return ((t - x) * (y - z)) + 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 = ((t - x) * (y - z)) + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 2: 68.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ \mathbf{if}\;y \leq -3.5 \cdot 10^{+15}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -3 \cdot 10^{-106}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{elif}\;y \leq -1.4 \cdot 10^{-280}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 45:\\ \;\;\;\;\left(x - t\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -3.5e+15)
     t_1
     (if (<= y -3e-106)
       (* t (- y z))
       (if (<= y -1.4e-280) (fma z x x) (if (<= y 45.0) (* (- x t) z) t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -3.5e+15) {
		tmp = t_1;
	} else if (y <= -3e-106) {
		tmp = t * (y - z);
	} else if (y <= -1.4e-280) {
		tmp = fma(z, x, x);
	} else if (y <= 45.0) {
		tmp = (x - t) * 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 <= -3.5e+15)
		tmp = t_1;
	elseif (y <= -3e-106)
		tmp = Float64(t * Float64(y - z));
	elseif (y <= -1.4e-280)
		tmp = fma(z, x, x);
	elseif (y <= 45.0)
		tmp = Float64(Float64(x - t) * 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, -3.5e+15], t$95$1, If[LessEqual[y, -3e-106], N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -1.4e-280], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 45.0], N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -3.5e15 or 45 < 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 88.7

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

   5. Applied rewrites 88.7%

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

   if -3.5e15 < y < -3.00000000000000019e-106

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 64.7

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

   5. Applied rewrites 64.7%

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

   if -3.00000000000000019e-106 < y < -1.40000000000000009e-280

   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 92.9

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

   5. Applied rewrites 92.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 73.5%

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

   if -1.40000000000000009e-280 < y < 45

   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 76.2

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

   5. Applied rewrites 76.2%

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

Alternative 3: 66.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(t - x\right) \cdot y\\ t_2 := t \cdot \left(y - z\right)\\ \mathbf{if}\;y \leq -3.5 \cdot 10^{+15}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq -3 \cdot 10^{-106}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;y \leq 2.5 \cdot 10^{-148}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 29.5:\\ \;\;\;\;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 (* t (- y z))))
   (if (<= y -3.5e+15)
     t_1
     (if (<= y -3e-106)
       t_2
       (if (<= y 2.5e-148) (fma z x x) (if (<= y 29.5) t_2 t_1))))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double t_2 = t * (y - z);
	double tmp;
	if (y <= -3.5e+15) {
		tmp = t_1;
	} else if (y <= -3e-106) {
		tmp = t_2;
	} else if (y <= 2.5e-148) {
		tmp = fma(z, x, x);
	} else if (y <= 29.5) {
		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(t * Float64(y - z))
	tmp = 0.0
	if (y <= -3.5e+15)
		tmp = t_1;
	elseif (y <= -3e-106)
		tmp = t_2;
	elseif (y <= 2.5e-148)
		tmp = fma(z, x, x);
	elseif (y <= 29.5)
		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[(t * N[(y - z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.5e+15], t$95$1, If[LessEqual[y, -3e-106], t$95$2, If[LessEqual[y, 2.5e-148], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 29.5], t$95$2, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -3.5e15 or 29.5 < 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 88.7

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

   5. Applied rewrites 88.7%

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

   if -3.5e15 < y < -3.00000000000000019e-106 or 2.4999999999999999e-148 < y < 29.5

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 62.2

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

   5. Applied rewrites 62.2%

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

   if -3.00000000000000019e-106 < y < 2.4999999999999999e-148

   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 95.9

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

   5. Applied rewrites 95.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 65.8%

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

Alternative 4: 47.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.4 \cdot 10^{+45}:\\ \;\;\;\;t \cdot y\\ \mathbf{elif}\;y \leq 9.5 \cdot 10^{-148}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 29.5:\\ \;\;\;\;\left(-t\right) \cdot z\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+155}:\\ \;\;\;\;\left(-x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -7.4e+45)
   (* t y)
   (if (<= y 9.5e-148)
     (fma z x x)
     (if (<= y 29.5) (* (- t) z) (if (<= y 3.8e+155) (* (- x) y) (* t y))))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.4e+45) {
		tmp = t * y;
	} else if (y <= 9.5e-148) {
		tmp = fma(z, x, x);
	} else if (y <= 29.5) {
		tmp = -t * z;
	} else if (y <= 3.8e+155) {
		tmp = -x * y;
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -7.4e+45)
		tmp = Float64(t * y);
	elseif (y <= 9.5e-148)
		tmp = fma(z, x, x);
	elseif (y <= 29.5)
		tmp = Float64(Float64(-t) * z);
	elseif (y <= 3.8e+155)
		tmp = Float64(Float64(-x) * y);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -7.4e+45], N[(t * y), $MachinePrecision], If[LessEqual[y, 9.5e-148], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 29.5], N[((-t) * z), $MachinePrecision], If[LessEqual[y, 3.8e+155], N[((-x) * y), $MachinePrecision], N[(t * y), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -7.39999999999999954e45 or 3.8000000000000001e155 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 60.5

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

   5. Applied rewrites 60.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 57.4%

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

   if -7.39999999999999954e45 < y < 9.50000000000000069e-148

   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 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)} \]

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 57.8%

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

   if 9.50000000000000069e-148 < y < 29.5

   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 84.1

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

   5. Applied rewrites 84.1%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 52.9%

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

   if 29.5 < y < 3.8000000000000001e155

   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. lift--.f64 N/A

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

      5. sub-neg N/A

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

      6. distribute-lft-in N/A

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

      7. associate-+l+ N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. sub-neg N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 79.1

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

   7. Applied rewrites 79.1%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 52.0%

       \[\leadsto \left(-x\right) \cdot y \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 5: 70.4% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- t x) y)))
   (if (<= y -7.8e+14)
     t_1
     (if (<= y 6.2e-269) (fma (- t) z x) (if (<= y 45.0) (* (- x t) z) t_1)))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (t - x) * y;
	double tmp;
	if (y <= -7.8e+14) {
		tmp = t_1;
	} else if (y <= 6.2e-269) {
		tmp = fma(-t, z, x);
	} else if (y <= 45.0) {
		tmp = (x - t) * 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 <= -7.8e+14)
		tmp = t_1;
	elseif (y <= 6.2e-269)
		tmp = fma(Float64(-t), z, x);
	elseif (y <= 45.0)
		tmp = Float64(Float64(x - t) * 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, -7.8e+14], t$95$1, If[LessEqual[y, 6.2e-269], N[((-t) * z + x), $MachinePrecision], If[LessEqual[y, 45.0], N[(N[(x - t), $MachinePrecision] * z), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.8e14 or 45 < 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 88.7

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

   5. Applied rewrites 88.7%

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

   if -7.8e14 < y < 6.19999999999999933e-269

   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 84.9

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

   5. Applied rewrites 84.9%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 66.4%

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

   if 6.19999999999999933e-269 < y < 45

   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 79.6

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

   5. Applied rewrites 79.6%

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

Alternative 6: 61.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+83}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;x \leq 2.45 \cdot 10^{+73}:\\ \;\;\;\;t \cdot \left(y - z\right)\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{+167}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-x\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -1e+83)
   (fma z x x)
   (if (<= x 2.45e+73)
     (* t (- y z))
     (if (<= x 3.8e+167) (fma z x x) (* (- x) y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -1e+83) {
		tmp = fma(z, x, x);
	} else if (x <= 2.45e+73) {
		tmp = t * (y - z);
	} else if (x <= 3.8e+167) {
		tmp = fma(z, x, x);
	} else {
		tmp = -x * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -1e+83)
		tmp = fma(z, x, x);
	elseif (x <= 2.45e+73)
		tmp = Float64(t * Float64(y - z));
	elseif (x <= 3.8e+167)
		tmp = fma(z, x, x);
	else
		tmp = Float64(Float64(-x) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -1e+83], N[(z * x + x), $MachinePrecision], If[LessEqual[x, 2.45e+73], N[(t * N[(y - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 3.8e+167], N[(z * x + x), $MachinePrecision], N[((-x) * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if x < -1.00000000000000003e83 or 2.45e73 < x < 3.79999999999999994e167

   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 66.8

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

   5. Applied rewrites 66.8%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 60.1%

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

   if -1.00000000000000003e83 < x < 2.45e73

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 71.4

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

   5. Applied rewrites 71.4%

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

   if 3.79999999999999994e167 < x

   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. lift--.f64 N/A

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

      5. sub-neg N/A

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

      6. distribute-lft-in N/A

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

      7. associate-+l+ N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lower-neg.f64 95.6

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

   4. Applied rewrites 95.6%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. mul-1-neg N/A

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

      3. sub-neg N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 65.2

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

   7. Applied rewrites 65.2%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 63.0%

       \[\leadsto \left(-x\right) \cdot y \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 48.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.4 \cdot 10^{+45}:\\ \;\;\;\;t \cdot y\\ \mathbf{elif}\;y \leq 9.5 \cdot 10^{-148}:\\ \;\;\;\;\mathsf{fma}\left(z, x, x\right)\\ \mathbf{elif}\;y \leq 1.7 \cdot 10^{-14}:\\ \;\;\;\;\left(-t\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -7.4e+45)
   (* t y)
   (if (<= y 9.5e-148) (fma z x x) (if (<= y 1.7e-14) (* (- t) z) (* t y)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.4e+45) {
		tmp = t * y;
	} else if (y <= 9.5e-148) {
		tmp = fma(z, x, x);
	} else if (y <= 1.7e-14) {
		tmp = -t * z;
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -7.4e+45)
		tmp = Float64(t * y);
	elseif (y <= 9.5e-148)
		tmp = fma(z, x, x);
	elseif (y <= 1.7e-14)
		tmp = Float64(Float64(-t) * z);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -7.4e+45], N[(t * y), $MachinePrecision], If[LessEqual[y, 9.5e-148], N[(z * x + x), $MachinePrecision], If[LessEqual[y, 1.7e-14], N[((-t) * z), $MachinePrecision], N[(t * y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < -7.39999999999999954e45 or 1.70000000000000001e-14 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 54.6

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 50.9%

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

   if -7.39999999999999954e45 < y < 9.50000000000000069e-148

   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 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)} \]

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 57.8%

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

   if 9.50000000000000069e-148 < y < 1.70000000000000001e-14

   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 89.8

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

   5. Applied rewrites 89.8%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 58.9%

      \[\leadsto \left(-t\right) \cdot z \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 84.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.7e+15)
   (* (- t x) y)
   (if (<= y 8.8e-5) (fma (- x t) z x) (fma (- t x) y x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -2.7e+15) {
		tmp = (t - x) * y;
	} else if (y <= 8.8e-5) {
		tmp = fma((x - t), z, x);
	} else {
		tmp = fma((t - x), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -2.7e+15)
		tmp = Float64(Float64(t - x) * y);
	elseif (y <= 8.8e-5)
		tmp = fma(Float64(x - t), z, x);
	else
		tmp = fma(Float64(t - x), y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -2.7e+15], N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[y, 8.8e-5], N[(N[(x - t), $MachinePrecision] * z + x), $MachinePrecision], N[(N[(t - x), $MachinePrecision] * y + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.7e15

   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 90.5

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

   5. Applied rewrites 90.5%

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

   if -2.7e15 < y < 8.7999999999999998e-5

   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 89.1

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

   5. Applied rewrites 89.1%

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

   if 8.7999999999999998e-5 < y

   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 88.4

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

   5. Applied rewrites 88.4%

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

Alternative 9: 85.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x - t\right) \cdot z\\ \mathbf{if}\;z \leq -1.4 \cdot 10^{+23}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2500000000:\\ \;\;\;\;\mathsf{fma}\left(t - x, y, x\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 -1.4e+23) t_1 (if (<= z 2500000000.0) (fma (- t x) y x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (x - t) * z;
	double tmp;
	if (z <= -1.4e+23) {
		tmp = t_1;
	} else if (z <= 2500000000.0) {
		tmp = fma((t - x), y, x);
	} 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 <= -1.4e+23)
		tmp = t_1;
	elseif (z <= 2500000000.0)
		tmp = fma(Float64(t - x), y, x);
	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, -1.4e+23], t$95$1, If[LessEqual[z, 2500000000.0], N[(N[(t - x), $MachinePrecision] * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.4e23 or 2.5e9 < z

   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 81.7

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

   5. Applied rewrites 81.7%

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

   if -1.4e23 < z < 2.5e9

   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.1

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

   5. Applied rewrites 91.1%

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

Alternative 10: 50.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.4 \cdot 10^{+45}:\\ \;\;\;\;t \cdot y\\ \mathbf{elif}\;y \leq 5.6 \cdot 10^{+59}:\\ \;\;\;\;\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 -7.4e+45) (* t y) (if (<= y 5.6e+59) (fma z x x) (* t y))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= -7.4e+45) {
		tmp = t * y;
	} else if (y <= 5.6e+59) {
		tmp = fma(z, x, x);
	} else {
		tmp = t * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= -7.4e+45)
		tmp = Float64(t * y);
	elseif (y <= 5.6e+59)
		tmp = fma(z, x, x);
	else
		tmp = Float64(t * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[y, -7.4e+45], N[(t * y), $MachinePrecision], If[LessEqual[y, 5.6e+59], N[(z * x + x), $MachinePrecision], N[(t * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -7.39999999999999954e45 or 5.5999999999999996e59 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 57.1

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

   5. Applied rewrites 57.1%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 54.6%

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

   if -7.39999999999999954e45 < y < 5.5999999999999996e59

   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 83.6

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

   5. Applied rewrites 83.6%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 51.2%

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

Alternative 11: 40.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -1.02e+18) (* z x) (if (<= z 2500000000.0) (* t y) (* z x))))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -1.02e+18:
		tmp = z * x
	elif z <= 2500000000.0:
		tmp = t * y
	else:
		tmp = z * x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -1.02e+18)
		tmp = z * x;
	elseif (z <= 2500000000.0)
		tmp = t * y;
	else
		tmp = z * x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.02e18 or 2.5e9 < z

   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 80.6

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

   5. Applied rewrites 80.6%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 44.7%

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

   if -1.02e18 < z < 2.5e9

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 51.3

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

   5. Applied rewrites 51.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 44.1%

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

Alternative 12: 27.3% 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 t around inf

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

   1. lower-*.f64 N/A

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

   2. lower--.f64 50.8

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

5. Applied rewrites 50.8%

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

6. Taylor expanded in z around 0

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

8. Applied rewrites 31.1%

   \[\leadsto t \cdot \color{blue}{y} \]
9. Add Preprocessing

Developer Target 1: 96.2% 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 2024276 
(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))))