Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3

Percentage Accurate: 68.0% → 83.2%

Time: 12.7s

Alternatives: 14

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (((y - z) * (t - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (((y - z) * (t - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 83.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+46} \lor \neg \left(z \leq 2 \cdot 10^{+121}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-\left(t - x\right)}{z}, y - a, t\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{\left(y - z\right) \cdot \left(t - x\right)}{a - z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1e+46) (not (<= z 2e+121)))
   (fma (/ (- (- t x)) z) (- y a) t)
   (+ x (/ (* (- y z) (- t x)) (- a z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1e+46) || !(z <= 2e+121)) {
		tmp = fma((-(t - x) / z), (y - a), t);
	} else {
		tmp = x + (((y - z) * (t - x)) / (a - z));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1e+46) || !(z <= 2e+121))
		tmp = fma(Float64(Float64(-Float64(t - x)) / z), Float64(y - a), t);
	else
		tmp = Float64(x + Float64(Float64(Float64(y - z) * Float64(t - x)) / Float64(a - z)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -1e+46], N[Not[LessEqual[z, 2e+121]], $MachinePrecision]], N[(N[((-N[(t - x), $MachinePrecision]) / z), $MachinePrecision] * N[(y - a), $MachinePrecision] + t), $MachinePrecision], N[(x + N[(N[(N[(y - z), $MachinePrecision] * N[(t - x), $MachinePrecision]), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -9.9999999999999999e45 or 2.00000000000000007e121 < z

   1. Initial program 37.3%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 81.1%

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

   if -9.9999999999999999e45 < z < 2.00000000000000007e121

   1. Initial program 90.3%

      \[x + \frac{\left(y - z\right) \cdot \left(t - x\right)}{a - z} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 87.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+46} \lor \neg \left(z \leq 2 \cdot 10^{+121}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{-\left(t - x\right)}{z}, y - a, t\right)\\ \mathbf{else}:\\ \;\;\;\;x + \frac{\left(y - z\right) \cdot \left(t - x\right)}{a - z}\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 54.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{t - x}{z}, a, t\right)\\ \mathbf{if}\;z \leq -9.6 \cdot 10^{+85}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{elif}\;z \leq 5 \cdot 10^{+118}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-t}{a}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- t x) z) a t)))
   (if (<= z -9.6e+85)
     t_1
     (if (<= z 2000000.0)
       (fma (/ t a) y x)
       (if (<= z 5e+118) (fma (/ (- t) a) z x) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((t - x) / z), a, t);
	double tmp;
	if (z <= -9.6e+85) {
		tmp = t_1;
	} else if (z <= 2000000.0) {
		tmp = fma((t / a), y, x);
	} else if (z <= 5e+118) {
		tmp = fma((-t / a), z, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(t - x) / z), a, t)
	tmp = 0.0
	if (z <= -9.6e+85)
		tmp = t_1;
	elseif (z <= 2000000.0)
		tmp = fma(Float64(t / a), y, x);
	elseif (z <= 5e+118)
		tmp = fma(Float64(Float64(-t) / a), z, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(t - x), $MachinePrecision] / z), $MachinePrecision] * a + t), $MachinePrecision]}, If[LessEqual[z, -9.6e+85], t$95$1, If[LessEqual[z, 2000000.0], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[z, 5e+118], N[(N[((-t) / a), $MachinePrecision] * z + x), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -9.59999999999999986e85 or 4.99999999999999972e118 < z

   1. Initial program 35.6%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 81.8%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 65.5%

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

   if -9.59999999999999986e85 < z < 2e6

   1. Initial program 90.3%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 69.1

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

   5. Applied rewrites 69.1%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 58.5%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]

   if 2e6 < z < 4.99999999999999972e118

   1. Initial program 80.7%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 56.3

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

   5. Applied rewrites 56.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 54.3%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 58.5%

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

Alternative 3: 45.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.6 \cdot 10^{-29}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{elif}\;a \leq -5.3 \cdot 10^{-299}:\\ \;\;\;\;\frac{x - t}{z} \cdot y\\ \mathbf{elif}\;a \leq 9.2 \cdot 10^{-32}:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{a}, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.6e-29)
   (fma (/ t a) y x)
   (if (<= a -5.3e-299)
     (* (/ (- x t) z) y)
     (if (<= a 9.2e-32) t (fma (/ (- x t) a) z x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.6e-29) {
		tmp = fma((t / a), y, x);
	} else if (a <= -5.3e-299) {
		tmp = ((x - t) / z) * y;
	} else if (a <= 9.2e-32) {
		tmp = t;
	} else {
		tmp = fma(((x - t) / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.6e-29)
		tmp = fma(Float64(t / a), y, x);
	elseif (a <= -5.3e-299)
		tmp = Float64(Float64(Float64(x - t) / z) * y);
	elseif (a <= 9.2e-32)
		tmp = t;
	else
		tmp = fma(Float64(Float64(x - t) / a), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.6e-29], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[a, -5.3e-299], N[(N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[a, 9.2e-32], t, N[(N[(N[(x - t), $MachinePrecision] / a), $MachinePrecision] * z + x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if a < -2.6000000000000002e-29

   1. Initial program 78.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 73.4

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

   5. Applied rewrites 73.4%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 65.1%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]

   if -2.6000000000000002e-29 < a < -5.3000000000000004e-299

   1. Initial program 78.0%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 83.8%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 58.9%

      \[\leadsto \frac{x - t}{z} \cdot \color{blue}{y} \]

   if -5.3000000000000004e-299 < a < 9.2000000000000002e-32

   1. Initial program 58.2%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 37.6

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

   5. Applied rewrites 37.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 54.0%

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

   10. Applied rewrites 54.0%

       \[\leadsto t \]

   if 9.2000000000000002e-32 < a

   1. Initial program 69.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 66.0

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

   5. Applied rewrites 66.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 60.8%

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

Alternative 4: 75.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -5.7 \cdot 10^{+29} \lor \neg \left(a \leq 3.1 \cdot 10^{-38}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-\left(t - x\right)}{z}, y - a, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -5.7e+29) (not (<= a 3.1e-38)))
   (fma (- y z) (/ (- t x) a) x)
   (fma (/ (- (- t x)) z) (- y a) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -5.7e+29) || !(a <= 3.1e-38)) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else {
		tmp = fma((-(t - x) / z), (y - a), t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -5.7e+29) || !(a <= 3.1e-38))
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = fma(Float64(Float64(-Float64(t - x)) / z), Float64(y - a), t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -5.7e+29], N[Not[LessEqual[a, 3.1e-38]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], N[(N[((-N[(t - x), $MachinePrecision]) / z), $MachinePrecision] * N[(y - a), $MachinePrecision] + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -5.6999999999999999e29 or 3.09999999999999983e-38 < a

   1. Initial program 73.4%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 81.6

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

   5. Applied rewrites 81.6%

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

   if -5.6999999999999999e29 < a < 3.09999999999999983e-38

   1. Initial program 70.0%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 83.9%

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

4. Final simplification 82.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -5.7 \cdot 10^{+29} \lor \neg \left(a \leq 3.1 \cdot 10^{-38}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-\left(t - x\right)}{z}, y - a, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 45.9% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.6 \cdot 10^{-29}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{elif}\;a \leq -5.3 \cdot 10^{-299}:\\ \;\;\;\;\frac{x - t}{z} \cdot y\\ \mathbf{elif}\;a \leq 9.2 \cdot 10^{-32}:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-t}{a}, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.6e-29)
   (fma (/ t a) y x)
   (if (<= a -5.3e-299)
     (* (/ (- x t) z) y)
     (if (<= a 9.2e-32) t (fma (/ (- t) a) z x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.6e-29) {
		tmp = fma((t / a), y, x);
	} else if (a <= -5.3e-299) {
		tmp = ((x - t) / z) * y;
	} else if (a <= 9.2e-32) {
		tmp = t;
	} else {
		tmp = fma((-t / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.6e-29)
		tmp = fma(Float64(t / a), y, x);
	elseif (a <= -5.3e-299)
		tmp = Float64(Float64(Float64(x - t) / z) * y);
	elseif (a <= 9.2e-32)
		tmp = t;
	else
		tmp = fma(Float64(Float64(-t) / a), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.6e-29], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[a, -5.3e-299], N[(N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] * y), $MachinePrecision], If[LessEqual[a, 9.2e-32], t, N[(N[((-t) / a), $MachinePrecision] * z + x), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if a < -2.6000000000000002e-29

   1. Initial program 78.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 73.4

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

   5. Applied rewrites 73.4%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 65.1%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]

   if -2.6000000000000002e-29 < a < -5.3000000000000004e-299

   1. Initial program 78.0%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 83.8%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 58.9%

      \[\leadsto \frac{x - t}{z} \cdot \color{blue}{y} \]

   if -5.3000000000000004e-299 < a < 9.2000000000000002e-32

   1. Initial program 58.2%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 37.6

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

   5. Applied rewrites 37.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 54.0%

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

   10. Applied rewrites 54.0%

       \[\leadsto t \]

   if 9.2000000000000002e-32 < a

   1. Initial program 69.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 66.0

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

   5. Applied rewrites 66.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 60.8%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 60.3%

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

Alternative 6: 50.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{+87}:\\ \;\;\;\;t\\ \mathbf{elif}\;z \leq 2000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{elif}\;z \leq 5 \cdot 10^{+205}:\\ \;\;\;\;\mathsf{fma}\left(\frac{-t}{a}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.6e+87)
   t
   (if (<= z 2000000.0)
     (fma (/ t a) y x)
     (if (<= z 5e+205) (fma (/ (- t) a) z x) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.6e+87) {
		tmp = t;
	} else if (z <= 2000000.0) {
		tmp = fma((t / a), y, x);
	} else if (z <= 5e+205) {
		tmp = fma((-t / a), z, x);
	} else {
		tmp = t;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3.6e+87)
		tmp = t;
	elseif (z <= 2000000.0)
		tmp = fma(Float64(t / a), y, x);
	elseif (z <= 5e+205)
		tmp = fma(Float64(Float64(-t) / a), z, x);
	else
		tmp = t;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -3.6e+87], t, If[LessEqual[z, 2000000.0], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[z, 5e+205], N[(N[((-t) / a), $MachinePrecision] * z + x), $MachinePrecision], t]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.59999999999999994e87 or 5.0000000000000002e205 < z

   1. Initial program 37.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 54.0

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

   5. Applied rewrites 54.0%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 65.2%

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

   10. Applied rewrites 65.2%

       \[\leadsto t \]

   if -3.59999999999999994e87 < z < 2e6

   1. Initial program 90.3%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 69.1

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

   5. Applied rewrites 69.1%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 58.5%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]

   if 2e6 < z < 5.0000000000000002e205

   1. Initial program 55.7%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 55.1

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

   5. Applied rewrites 55.1%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 45.5%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 47.5%

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

Alternative 7: 73.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{-29} \lor \neg \left(a \leq 7.5 \cdot 10^{-44}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{z}, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.7e-29) (not (<= a 7.5e-44)))
   (fma (- y z) (/ (- t x) a) x)
   (fma (/ (- x t) z) y t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.7e-29) || !(a <= 7.5e-44)) {
		tmp = fma((y - z), ((t - x) / a), x);
	} else {
		tmp = fma(((x - t) / z), y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.7e-29) || !(a <= 7.5e-44))
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = fma(Float64(Float64(x - t) / z), y, t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -2.7e-29], N[Not[LessEqual[a, 7.5e-44]], $MachinePrecision]], N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], N[(N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] * y + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.70000000000000023e-29 or 7.50000000000000008e-44 < a

   1. Initial program 74.1%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 79.5

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

   5. Applied rewrites 79.5%

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

   if -2.70000000000000023e-29 < a < 7.50000000000000008e-44

   1. Initial program 68.8%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 86.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 82.5%

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

4. Final simplification 80.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{-29} \lor \neg \left(a \leq 7.5 \cdot 10^{-44}\right):\\ \;\;\;\;\mathsf{fma}\left(y - z, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{z}, y, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 69.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{-29} \lor \neg \left(a \leq 3.2 \cdot 10^{-30}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{t - x}{a}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{z}, y, t\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.7e-29) (not (<= a 3.2e-30)))
   (fma (/ (- t x) a) y x)
   (fma (/ (- x t) z) y t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.7e-29) || !(a <= 3.2e-30)) {
		tmp = fma(((t - x) / a), y, x);
	} else {
		tmp = fma(((x - t) / z), y, t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.7e-29) || !(a <= 3.2e-30))
		tmp = fma(Float64(Float64(t - x) / a), y, x);
	else
		tmp = fma(Float64(Float64(x - t) / z), y, t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -2.7e-29], N[Not[LessEqual[a, 3.2e-30]], $MachinePrecision]], N[(N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] * y + x), $MachinePrecision], N[(N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] * y + t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.70000000000000023e-29 or 3.2e-30 < a

   1. Initial program 74.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 71.4

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

   5. Applied rewrites 71.4%

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

   if -2.70000000000000023e-29 < a < 3.2e-30

   1. Initial program 68.5%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 85.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 82.0%

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

4. Final simplification 76.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{-29} \lor \neg \left(a \leq 3.2 \cdot 10^{-30}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{t - x}{a}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{z}, y, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 62.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.7 \cdot 10^{-29}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{elif}\;a \leq 3.2 \cdot 10^{-30}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{z}, y, t\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x - t}{a}, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.7e-29)
   (fma (/ t a) y x)
   (if (<= a 3.2e-30) (fma (/ (- x t) z) y t) (fma (/ (- x t) a) z x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.7e-29) {
		tmp = fma((t / a), y, x);
	} else if (a <= 3.2e-30) {
		tmp = fma(((x - t) / z), y, t);
	} else {
		tmp = fma(((x - t) / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.7e-29)
		tmp = fma(Float64(t / a), y, x);
	elseif (a <= 3.2e-30)
		tmp = fma(Float64(Float64(x - t) / z), y, t);
	else
		tmp = fma(Float64(Float64(x - t) / a), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.7e-29], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[a, 3.2e-30], N[(N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] * y + t), $MachinePrecision], N[(N[(N[(x - t), $MachinePrecision] / a), $MachinePrecision] * z + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -2.70000000000000023e-29

   1. Initial program 78.4%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 73.4

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

   5. Applied rewrites 73.4%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 65.1%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]

   if -2.70000000000000023e-29 < a < 3.2e-30

   1. Initial program 68.5%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. distribute-lft-out-- N/A

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

      6. div-sub N/A

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

      7. associate-/l* N/A

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

      8. associate-/l* N/A

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

      9. distribute-rgt-out-- N/A

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

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

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

      11. lower-fma.f64 N/A

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

   5. Applied rewrites 85.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 82.0%

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

   if 3.2e-30 < a

   1. Initial program 69.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 66.0

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

   5. Applied rewrites 66.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 60.8%

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

Alternative 10: 52.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{+87} \lor \neg \left(z \leq 2.55 \cdot 10^{+126}\right):\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -3.6e+87) (not (<= z 2.55e+126))) t (fma (/ t a) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -3.6e+87) || !(z <= 2.55e+126)) {
		tmp = t;
	} else {
		tmp = fma((t / a), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -3.6e+87) || !(z <= 2.55e+126))
		tmp = t;
	else
		tmp = fma(Float64(t / a), y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -3.6e+87], N[Not[LessEqual[z, 2.55e+126]], $MachinePrecision]], t, N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.59999999999999994e87 or 2.5500000000000001e126 < z

   1. Initial program 36.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 54.6

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 56.9%

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

   10. Applied rewrites 56.9%

       \[\leadsto t \]

   if -3.59999999999999994e87 < z < 2.5500000000000001e126

   1. Initial program 88.5%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 66.3

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

   5. Applied rewrites 66.3%

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

   6. Taylor expanded in x around 0

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 55.1%

      \[\leadsto \mathsf{fma}\left(\frac{t}{a}, y, x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 55.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{+87} \lor \neg \left(z \leq 2.55 \cdot 10^{+126}\right):\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 39.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{+30} \lor \neg \left(z \leq 1.1 \cdot 10^{+133}\right):\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{a}, z, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -3.5e+30) (not (<= z 1.1e+133))) t (fma (/ x a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -3.5e+30) || !(z <= 1.1e+133)) {
		tmp = t;
	} else {
		tmp = fma((x / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -3.5e+30) || !(z <= 1.1e+133))
		tmp = t;
	else
		tmp = fma(Float64(x / a), z, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[z, -3.5e+30], N[Not[LessEqual[z, 1.1e+133]], $MachinePrecision]], t, N[(N[(x / a), $MachinePrecision] * z + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.50000000000000021e30 or 1.1e133 < z

   1. Initial program 39.5%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 52.1

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

   5. Applied rewrites 52.1%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 54.1%

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

   10. Applied rewrites 54.1%

       \[\leadsto t \]

   if -3.50000000000000021e30 < z < 1.1e133

   1. Initial program 89.1%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 49.2

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

   5. Applied rewrites 49.2%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 49.8%

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

   9. Taylor expanded in x around inf

      \[\leadsto \mathsf{fma}\left(\frac{x}{a}, z, x\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 42.3%

       \[\leadsto \mathsf{fma}\left(\frac{x}{a}, z, x\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 46.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{+30} \lor \neg \left(z \leq 1.1 \cdot 10^{+133}\right):\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{a}, z, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 38.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{+67}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;a \leq 9.2 \cdot 10^{-32}:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{a}, x, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -4.8e+67) (* 1.0 x) (if (<= a 9.2e-32) t (fma (/ z a) x x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -4.8e+67) {
		tmp = 1.0 * x;
	} else if (a <= 9.2e-32) {
		tmp = t;
	} else {
		tmp = fma((z / a), x, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -4.8e+67)
		tmp = Float64(1.0 * x);
	elseif (a <= 9.2e-32)
		tmp = t;
	else
		tmp = fma(Float64(z / a), x, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -4.8e+67], N[(1.0 * x), $MachinePrecision], If[LessEqual[a, 9.2e-32], t, N[(N[(z / a), $MachinePrecision] * x + x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -4.80000000000000004e67

   1. Initial program 81.2%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 79.8

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

   5. Applied rewrites 79.8%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 69.6%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 58.8%

       \[\leadsto 1 \cdot x \]

   if -4.80000000000000004e67 < a < 9.2000000000000002e-32

   1. Initial program 68.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 33.6

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

   5. Applied rewrites 33.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 38.4%

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

   10. Applied rewrites 38.4%

       \[\leadsto t \]

   if 9.2000000000000002e-32 < a

   1. Initial program 69.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 66.0

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

   5. Applied rewrites 66.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 60.8%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 48.9%

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

Alternative 13: 38.4% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{+67} \lor \neg \left(a \leq 3.2 \cdot 10^{-30}\right):\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -4.8e+67) (not (<= a 3.2e-30))) (* 1.0 x) t))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.8e+67) || !(a <= 3.2e-30)) {
		tmp = 1.0 * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-4.8d+67)) .or. (.not. (a <= 3.2d-30))) then
        tmp = 1.0d0 * x
    else
        tmp = t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.8e+67) || !(a <= 3.2e-30)) {
		tmp = 1.0 * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -4.8e+67) or not (a <= 3.2e-30):
		tmp = 1.0 * x
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -4.8e+67) || !(a <= 3.2e-30))
		tmp = Float64(1.0 * x);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -4.8e+67) || ~((a <= 3.2e-30)))
		tmp = 1.0 * x;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -4.8e+67], N[Not[LessEqual[a, 3.2e-30]], $MachinePrecision]], N[(1.0 * x), $MachinePrecision], t]

Derivation

1. Split input into 2 regimes

2. if a < -4.80000000000000004e67 or 3.2e-30 < a

   1. Initial program 74.9%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

         \[\leadsto \color{blue}{y \cdot \frac{t - x}{a}} + x \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\frac{t - x}{a} \cdot y} + x \]

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 73.9

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

   5. Applied rewrites 73.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 62.8%

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

   9. Taylor expanded in y around 0

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 53.0%

       \[\leadsto 1 \cdot x \]

   if -4.80000000000000004e67 < a < 3.2e-30

   1. Initial program 68.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 N/A

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

      12. lower--.f64 33.6

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

   5. Applied rewrites 33.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 38.4%

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

   10. Applied rewrites 38.4%

       \[\leadsto t \]
3. Recombined 2 regimes into one program.

4. Final simplification 45.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{+67} \lor \neg \left(a \leq 3.2 \cdot 10^{-30}\right):\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \]
5. Add Preprocessing

Alternative 14: 24.8% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := t

Derivation

1. Initial program 71.7%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. mul-1-neg N/A

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

   3. *-commutative N/A

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

   4. associate-/l* N/A

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

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

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

   6. mul-1-neg N/A

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

   7. lower-fma.f64 N/A

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

   8. mul-1-neg N/A

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

   9. lower-neg.f64 N/A

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

   10. lower--.f64 N/A

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

   11. lower-/.f64 N/A

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

   12. lower--.f64 50.2

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

5. Applied rewrites 50.2%

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

6. Taylor expanded in z around inf

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

8. Applied rewrites 25.7%

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

10. Applied rewrites 25.7%

    \[\leadsto t \]
11. Add Preprocessing

Developer Target 1: 83.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t - \frac{y}{z} \cdot \left(t - x\right)\\ \mathbf{if}\;z < -1.2536131056095036 \cdot 10^{+188}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.446702369113811 \cdot 10^{+64}:\\ \;\;\;\;x + \frac{y - z}{\frac{a - z}{t - x}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- t (* (/ y z) (- t x)))))
   (if (< z -1.2536131056095036e+188)
     t_1
     (if (< z 4.446702369113811e+64)
       (+ x (/ (- y z) (/ (- a z) (- t x))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = t - ((y / z) * (t - x))
    if (z < (-1.2536131056095036d+188)) then
        tmp = t_1
    else if (z < 4.446702369113811d+64) then
        tmp = x + ((y - z) / ((a - z) / (t - x)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t - ((y / z) * (t - x))
	tmp = 0
	if z < -1.2536131056095036e+188:
		tmp = t_1
	elif z < 4.446702369113811e+64:
		tmp = x + ((y - z) / ((a - z) / (t - x)))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t - Float64(Float64(y / z) * Float64(t - x)))
	tmp = 0.0
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = Float64(x + Float64(Float64(y - z) / Float64(Float64(a - z) / Float64(t - x))));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t - ((y / z) * (t - x));
	tmp = 0.0;
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t - N[(N[(y / z), $MachinePrecision] * N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.2536131056095036e+188], t$95$1, If[Less[z, 4.446702369113811e+64], N[(x + N[(N[(y - z), $MachinePrecision] / N[(N[(a - z), $MachinePrecision] / N[(t - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024339 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -125361310560950360000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- t (* (/ y z) (- t x))) (if (< z 44467023691138110000000000000000000000000000000000000000000000000) (+ x (/ (- y z) (/ (- a z) (- t x)))) (- t (* (/ y z) (- t x))))))

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