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

Percentage Accurate: 67.9% → 91.1%

Time: 12.6s

Alternatives: 18

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: 67.9% 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: 91.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- t x) (/ 1.0 (/ (- a z) (- y z))) x))
        (t_2 (+ x (/ (* (- y z) (- t x)) (- a z)))))
   (if (<= t_2 -5e-300)
     t_1
     (if (<= t_2 0.0) (fma (- x t) (/ (- y a) z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((t - x), (1.0 / ((a - z) / (y - z))), x);
	double t_2 = x + (((y - z) * (t - x)) / (a - z));
	double tmp;
	if (t_2 <= -5e-300) {
		tmp = t_1;
	} else if (t_2 <= 0.0) {
		tmp = fma((x - t), ((y - a) / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(t - x), Float64(1.0 / Float64(Float64(a - z) / Float64(y - z))), x)
	t_2 = Float64(x + Float64(Float64(Float64(y - z) * Float64(t - x)) / Float64(a - z)))
	tmp = 0.0
	if (t_2 <= -5e-300)
		tmp = t_1;
	elseif (t_2 <= 0.0)
		tmp = fma(Float64(x - t), Float64(Float64(y - a) / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < -4.99999999999999996e-300 or 0.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z)))

   1. Initial program 66.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 89.6

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

   4. Applied rewrites 89.6%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. lower-/.f64 89.6

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

   6. Applied rewrites 89.6%

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

   if -4.99999999999999996e-300 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < 0.0

   1. Initial program 4.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 99.9%

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

4. Final simplification 90.4%

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

Alternative 2: 91.2% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- t x) (/ (- y z) (- a z)) x))
        (t_2 (+ x (/ (* (- y z) (- t x)) (- a z)))))
   (if (<= t_2 -5e-300)
     t_1
     (if (<= t_2 0.0) (fma (- x t) (/ (- y a) z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((t - x), ((y - z) / (a - z)), x);
	double t_2 = x + (((y - z) * (t - x)) / (a - z));
	double tmp;
	if (t_2 <= -5e-300) {
		tmp = t_1;
	} else if (t_2 <= 0.0) {
		tmp = fma((x - t), ((y - a) / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < -4.99999999999999996e-300 or 0.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z)))

   1. Initial program 66.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 89.6

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

   4. Applied rewrites 89.6%

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

   if -4.99999999999999996e-300 < (+.f64 x (/.f64 (*.f64 (-.f64 y z) (-.f64 t x)) (-.f64 a z))) < 0.0

   1. Initial program 4.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 99.9%

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

4. Final simplification 90.3%

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

Alternative 3: 75.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(x - t, \frac{y - a}{z}, t\right)\\ \mathbf{if}\;z \leq -1.02 \cdot 10^{+60}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(t - x, \frac{y - z}{a}, x\right)\\ \mathbf{elif}\;z \leq 4 \cdot 10^{+110}:\\ \;\;\;\;x + \frac{\left(y - z\right) \cdot t}{a - z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- x t) (/ (- y a) z) t)))
   (if (<= z -1.02e+60)
     t_1
     (if (<= z 1.2e-247)
       (fma (- t x) (/ (- y z) a) x)
       (if (<= z 4e+110) (+ x (/ (* (- y z) t) (- a z))) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((x - t), ((y - a) / z), t);
	double tmp;
	if (z <= -1.02e+60) {
		tmp = t_1;
	} else if (z <= 1.2e-247) {
		tmp = fma((t - x), ((y - z) / a), x);
	} else if (z <= 4e+110) {
		tmp = x + (((y - z) * t) / (a - z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(x - t), Float64(Float64(y - a) / z), t)
	tmp = 0.0
	if (z <= -1.02e+60)
		tmp = t_1;
	elseif (z <= 1.2e-247)
		tmp = fma(Float64(t - x), Float64(Float64(y - z) / a), x);
	elseif (z <= 4e+110)
		tmp = Float64(x + Float64(Float64(Float64(y - z) * t) / Float64(a - z)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x - t), $MachinePrecision] * N[(N[(y - a), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -1.02e+60], t$95$1, If[LessEqual[z, 1.2e-247], N[(N[(t - x), $MachinePrecision] * N[(N[(y - z), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[z, 4e+110], N[(x + N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.0200000000000001e60 or 4.0000000000000001e110 < z

   1. Initial program 35.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.2%

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

   if -1.0200000000000001e60 < z < 1.20000000000000005e-247

   1. Initial program 84.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 95.7

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

   4. Applied rewrites 95.7%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 85.0

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

   7. Applied rewrites 85.0%

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

   if 1.20000000000000005e-247 < z < 4.0000000000000001e110

   1. Initial program 81.6%

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

   3. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 77.6

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

   5. Applied rewrites 77.6%

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

4. Final simplification 80.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.02 \cdot 10^{+60}:\\ \;\;\;\;\mathsf{fma}\left(x - t, \frac{y - a}{z}, t\right)\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-247}:\\ \;\;\;\;\mathsf{fma}\left(t - x, \frac{y - z}{a}, x\right)\\ \mathbf{elif}\;z \leq 4 \cdot 10^{+110}:\\ \;\;\;\;x + \frac{\left(y - z\right) \cdot t}{a - z}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x - t, \frac{y - a}{z}, t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 45.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(y, \frac{x}{z}, t\right)\\ \mathbf{if}\;z \leq -1.1 \cdot 10^{+56}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{-75}:\\ \;\;\;\;t \cdot \frac{y}{a - z}\\ \mathbf{elif}\;z \leq 1.02 \cdot 10^{+110}:\\ \;\;\;\;\mathsf{fma}\left(-t, \frac{y}{z}, t\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ x z) t)))
   (if (<= z -1.1e+56)
     t_1
     (if (<= z 2.5e-75)
       (* t (/ y (- a z)))
       (if (<= z 1.02e+110) (fma (- t) (/ y z) t) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (x / z), t);
	double tmp;
	if (z <= -1.1e+56) {
		tmp = t_1;
	} else if (z <= 2.5e-75) {
		tmp = t * (y / (a - z));
	} else if (z <= 1.02e+110) {
		tmp = fma(-t, (y / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(x / z), t)
	tmp = 0.0
	if (z <= -1.1e+56)
		tmp = t_1;
	elseif (z <= 2.5e-75)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (z <= 1.02e+110)
		tmp = fma(Float64(-t), Float64(y / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -1.1e+56], t$95$1, If[LessEqual[z, 2.5e-75], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.02e+110], N[((-t) * N[(y / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.10000000000000008e56 or 1.02e110 < 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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 79.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 73.1%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 68.1%

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

   if -1.10000000000000008e56 < z < 2.49999999999999989e-75

   1. Initial program 86.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. associate-/r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 86.4

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

   4. Applied rewrites 86.4%

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

   5. Taylor expanded in t around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 41.0

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

   7. Applied rewrites 41.0%

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

   8. Taylor expanded in y around inf

      \[\leadsto \frac{t \cdot y}{\color{blue}{a - z}} \]
   9. Step-by-step derivation

   10. Applied rewrites 37.8%

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

   if 2.49999999999999989e-75 < z < 1.02e110

   1. Initial program 73.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 56.8%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 52.9%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 45.0%

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

Alternative 5: 43.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ x z) t)))
   (if (<= z -1.35e+20)
     t_1
     (if (<= z 2.9e-227)
       (* t (/ y a))
       (if (<= z 8.8e+91) (* y (/ (- x t) z)) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (x / z), t);
	double tmp;
	if (z <= -1.35e+20) {
		tmp = t_1;
	} else if (z <= 2.9e-227) {
		tmp = t * (y / a);
	} else if (z <= 8.8e+91) {
		tmp = y * ((x - t) / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(x / z), t)
	tmp = 0.0
	if (z <= -1.35e+20)
		tmp = t_1;
	elseif (z <= 2.9e-227)
		tmp = Float64(t * Float64(y / a));
	elseif (z <= 8.8e+91)
		tmp = Float64(y * Float64(Float64(x - t) / z));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -1.35e+20], t$95$1, If[LessEqual[z, 2.9e-227], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 8.8e+91], N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.35e20 or 8.79999999999999998e91 < z

   1. Initial program 38.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 73.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 68.2%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 63.0%

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

   if -1.35e20 < z < 2.90000000000000011e-227

   1. Initial program 90.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. associate-/r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 90.2

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

   4. Applied rewrites 90.2%

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

   5. Taylor expanded in t around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 40.8

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

   7. Applied rewrites 40.8%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 27.0%

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

   12. Applied rewrites 33.9%

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

   if 2.90000000000000011e-227 < z < 8.79999999999999998e91

   1. Initial program 79.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 52.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 39.3%

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

Alternative 6: 74.5% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -9.5e+130)
     t_1
     (if (<= a 4.6e-13) (fma (- x t) (/ (- y a) z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y - z), ((t - x) / a), x);
	double tmp;
	if (a <= -9.5e+130) {
		tmp = t_1;
	} else if (a <= 4.6e-13) {
		tmp = fma((x - t), ((y - a) / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y - z), Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -9.5e+130)
		tmp = t_1;
	elseif (a <= 4.6e-13)
		tmp = fma(Float64(x - t), Float64(Float64(y - a) / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -9.5e+130], t$95$1, If[LessEqual[a, 4.6e-13], N[(N[(x - t), $MachinePrecision] * N[(N[(y - a), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -9.5000000000000009e130 or 4.59999999999999958e-13 < a

   1. Initial program 63.2%

      \[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 77.1

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

   5. Applied rewrites 77.1%

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

   if -9.5000000000000009e130 < a < 4.59999999999999958e-13

   1. Initial program 61.2%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 78.3%

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

4. Final simplification 77.8%

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

Alternative 7: 71.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -9.5e+130) t_1 (if (<= a 8.5e-14) (fma (- x t) (/ y z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((y - z), ((t - x) / a), x);
	double tmp;
	if (a <= -9.5e+130) {
		tmp = t_1;
	} else if (a <= 8.5e-14) {
		tmp = fma((x - t), (y / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(y - z), Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -9.5e+130)
		tmp = t_1;
	elseif (a <= 8.5e-14)
		tmp = fma(Float64(x - t), Float64(y / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -9.5e+130], t$95$1, If[LessEqual[a, 8.5e-14], N[(N[(x - t), $MachinePrecision] * N[(y / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -9.5000000000000009e130 or 8.50000000000000038e-14 < a

   1. Initial program 63.2%

      \[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 77.1

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

   5. Applied rewrites 77.1%

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

   if -9.5000000000000009e130 < a < 8.50000000000000038e-14

   1. Initial program 61.2%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 78.3%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 76.3%

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

   10. Applied rewrites 76.3%

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

Alternative 8: 70.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.7e+45)
   (fma (- x t) (/ y z) t)
   (if (<= z 2.15e-7) (fma (- t x) (/ y a) x) (fma y (/ (- x t) z) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.7e+45) {
		tmp = fma((x - t), (y / z), t);
	} else if (z <= 2.15e-7) {
		tmp = fma((t - x), (y / a), x);
	} else {
		tmp = fma(y, ((x - t) / z), t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.7e+45)
		tmp = fma(Float64(x - t), Float64(y / z), t);
	elseif (z <= 2.15e-7)
		tmp = fma(Float64(t - x), Float64(y / a), x);
	else
		tmp = fma(y, Float64(Float64(x - t) / z), t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.7e+45], N[(N[(x - t), $MachinePrecision] * N[(y / z), $MachinePrecision] + t), $MachinePrecision], If[LessEqual[z, 2.15e-7], N[(N[(t - x), $MachinePrecision] * N[(y / a), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.7e45

   1. Initial program 36.4%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 77.0%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 69.2%

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

   10. Applied rewrites 69.2%

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

   if -1.7e45 < z < 2.1500000000000001e-7

   1. Initial program 84.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 93.3

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

   4. Applied rewrites 93.3%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 75.4

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

   7. Applied rewrites 75.4%

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

   if 2.1500000000000001e-7 < z

   1. Initial program 47.4%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 74.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 73.3%

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

Alternative 9: 68.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ (- t x) a) x)))
   (if (<= a -2.1e+135) t_1 (if (<= a 4.6e-13) (fma (- x t) (/ y z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, ((t - x) / a), x);
	double tmp;
	if (a <= -2.1e+135) {
		tmp = t_1;
	} else if (a <= 4.6e-13) {
		tmp = fma((x - t), (y / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -2.1e+135)
		tmp = t_1;
	elseif (a <= 4.6e-13)
		tmp = fma(Float64(x - t), Float64(y / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -2.1e+135], t$95$1, If[LessEqual[a, 4.6e-13], N[(N[(x - t), $MachinePrecision] * N[(y / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.1000000000000001e135 or 4.59999999999999958e-13 < a

   1. Initial program 63.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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 67.4

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

   5. Applied rewrites 67.4%

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

   if -2.1000000000000001e135 < a < 4.59999999999999958e-13

   1. Initial program 61.2%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 78.3%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 76.3%

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

   10. Applied rewrites 76.3%

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

Alternative 10: 68.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ (- x t) z) t)))
   (if (<= z -4.8e+45) t_1 (if (<= z 2.15e-7) (fma y (/ (- t x) a) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, ((x - t) / z), t);
	double tmp;
	if (z <= -4.8e+45) {
		tmp = t_1;
	} else if (z <= 2.15e-7) {
		tmp = fma(y, ((t - x) / a), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(Float64(x - t) / z), t)
	tmp = 0.0
	if (z <= -4.8e+45)
		tmp = t_1;
	elseif (z <= 2.15e-7)
		tmp = fma(y, Float64(Float64(t - x) / a), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -4.8e+45], t$95$1, If[LessEqual[z, 2.15e-7], N[(y * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -4.79999999999999979e45 or 2.1500000000000001e-7 < z

   1. Initial program 42.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 75.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 70.0%

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

   if -4.79999999999999979e45 < z < 2.1500000000000001e-7

   1. Initial program 84.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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 73.8

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

   5. Applied rewrites 73.8%

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

Alternative 11: 61.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- x) (/ y a) x)))
   (if (<= a -2.9e+141) t_1 (if (<= a 4.6e-13) (fma y (/ (- x t) z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(-x, (y / a), x);
	double tmp;
	if (a <= -2.9e+141) {
		tmp = t_1;
	} else if (a <= 4.6e-13) {
		tmp = fma(y, ((x - t) / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(-x), Float64(y / a), x)
	tmp = 0.0
	if (a <= -2.9e+141)
		tmp = t_1;
	elseif (a <= 4.6e-13)
		tmp = fma(y, Float64(Float64(x - t) / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[((-x) * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -2.9e+141], t$95$1, If[LessEqual[a, 4.6e-13], N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.90000000000000007e141 or 4.59999999999999958e-13 < a

   1. Initial program 63.3%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 92.9

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

   4. Applied rewrites 92.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 67.6

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

   7. Applied rewrites 67.6%

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

   8. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 59.2

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

   10. Applied rewrites 59.2%

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

   if -2.90000000000000007e141 < a < 4.59999999999999958e-13

   1. Initial program 61.1%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 72.5%

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

Alternative 12: 57.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ x z) t)))
   (if (<= z -1.35e+60) t_1 (if (<= z 4.7e+30) (+ x (/ (* y t) a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (x / z), t);
	double tmp;
	if (z <= -1.35e+60) {
		tmp = t_1;
	} else if (z <= 4.7e+30) {
		tmp = x + ((y * t) / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(x / z), t)
	tmp = 0.0
	if (z <= -1.35e+60)
		tmp = t_1;
	elseif (z <= 4.7e+30)
		tmp = Float64(x + Float64(Float64(y * t) / a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -1.35e+60], t$95$1, If[LessEqual[z, 4.7e+30], N[(x + N[(N[(y * t), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.35e60 or 4.6999999999999999e30 < z

   1. Initial program 39.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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 78.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 72.1%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 65.3%

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

   if -1.35e60 < z < 4.6999999999999999e30

   1. Initial program 84.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 63.8

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

   5. Applied rewrites 63.8%

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

   6. Taylor expanded in t around inf

      \[\leadsto x + \frac{t \cdot y}{a} \]
   7. Step-by-step derivation

   8. Applied rewrites 56.5%

      \[\leadsto x + \frac{y \cdot t}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 43.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ x z) t)))
   (if (<= x -5.5e+25) t_1 (if (<= x 1.65e-72) (fma (- t) (/ y z) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (x / z), t);
	double tmp;
	if (x <= -5.5e+25) {
		tmp = t_1;
	} else if (x <= 1.65e-72) {
		tmp = fma(-t, (y / z), t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(x / z), t)
	tmp = 0.0
	if (x <= -5.5e+25)
		tmp = t_1;
	elseif (x <= 1.65e-72)
		tmp = fma(Float64(-t), Float64(y / z), t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[x, -5.5e+25], t$95$1, If[LessEqual[x, 1.65e-72], N[((-t) * N[(y / z), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -5.50000000000000018e25 or 1.65e-72 < x

   1. Initial program 47.4%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 56.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 49.9%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 46.8%

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

   if -5.50000000000000018e25 < x < 1.65e-72

   1. Initial program 78.1%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 54.6%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 54.7%

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

   9. Taylor expanded in x around 0

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

   11. Applied rewrites 52.3%

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

Alternative 14: 43.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ x z) t)))
   (if (<= z -1.35e+20) t_1 (if (<= z 5.8e-202) (* t (/ y a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (x / z), t);
	double tmp;
	if (z <= -1.35e+20) {
		tmp = t_1;
	} else if (z <= 5.8e-202) {
		tmp = t * (y / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(x / z), t)
	tmp = 0.0
	if (z <= -1.35e+20)
		tmp = t_1;
	elseif (z <= 5.8e-202)
		tmp = Float64(t * Float64(y / a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y * N[(x / z), $MachinePrecision] + t), $MachinePrecision]}, If[LessEqual[z, -1.35e+20], t$95$1, If[LessEqual[z, 5.8e-202], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.35e20 or 5.79999999999999976e-202 < z

   1. Initial program 50.7%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 67.6%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 61.2%

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

   9. Taylor expanded in x around inf

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

   11. Applied rewrites 51.8%

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

   if -1.35e20 < z < 5.79999999999999976e-202

   1. Initial program 89.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. associate-/r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 89.9

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

   4. Applied rewrites 89.9%

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

   5. Taylor expanded in t around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 42.5

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

   7. Applied rewrites 42.5%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 28.6%

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

   12. Applied rewrites 34.8%

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

Alternative 15: 31.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(t - x\right)\\ \mathbf{if}\;z \leq -2 \cdot 10^{+37}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.2 \cdot 10^{-18}:\\ \;\;\;\;t \cdot \frac{y}{a}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (- t x))))
   (if (<= z -2e+37) t_1 (if (<= z 1.2e-18) (* t (/ y a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (z <= -2e+37) {
		tmp = t_1;
	} else if (z <= 1.2e-18) {
		tmp = t * (y / a);
	} 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 = x + (t - x)
    if (z <= (-2d+37)) then
        tmp = t_1
    else if (z <= 1.2d-18) then
        tmp = t * (y / a)
    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 = x + (t - x);
	double tmp;
	if (z <= -2e+37) {
		tmp = t_1;
	} else if (z <= 1.2e-18) {
		tmp = t * (y / a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (t - x)
	tmp = 0
	if z <= -2e+37:
		tmp = t_1
	elif z <= 1.2e-18:
		tmp = t * (y / a)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(t - x))
	tmp = 0.0
	if (z <= -2e+37)
		tmp = t_1;
	elseif (z <= 1.2e-18)
		tmp = Float64(t * Float64(y / a));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (t - x);
	tmp = 0.0;
	if (z <= -2e+37)
		tmp = t_1;
	elseif (z <= 1.2e-18)
		tmp = t * (y / a);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2e+37], t$95$1, If[LessEqual[z, 1.2e-18], N[(t * N[(y / a), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.99999999999999991e37 or 1.19999999999999997e-18 < z

   1. Initial program 42.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 x + \color{blue}{\left(t - x\right)} \]
   4. Step-by-step derivation

      1. lower--.f64 34.6

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

   5. Applied rewrites 34.6%

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

   if -1.99999999999999991e37 < z < 1.19999999999999997e-18

   1. Initial program 86.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. clear-num N/A

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

      5. associate-/r/ N/A

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 86.7

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

   4. Applied rewrites 86.7%

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

   5. Taylor expanded in t around inf

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

      1. div-sub N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 41.9

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

   7. Applied rewrites 41.9%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 25.9%

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

   12. Applied rewrites 29.8%

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

Alternative 16: 25.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot y}{z}\\ \mathbf{if}\;x \leq -440000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 6.2 \cdot 10^{+166}:\\ \;\;\;\;x + \left(t - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* x y) z)))
   (if (<= x -440000.0) t_1 (if (<= x 6.2e+166) (+ x (- t x)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) / z;
	double tmp;
	if (x <= -440000.0) {
		tmp = t_1;
	} else if (x <= 6.2e+166) {
		tmp = x + (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 = (x * y) / z
    if (x <= (-440000.0d0)) then
        tmp = t_1
    else if (x <= 6.2d+166) then
        tmp = x + (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 = (x * y) / z;
	double tmp;
	if (x <= -440000.0) {
		tmp = t_1;
	} else if (x <= 6.2e+166) {
		tmp = x + (t - x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (x * y) / z
	tmp = 0
	if x <= -440000.0:
		tmp = t_1
	elif x <= 6.2e+166:
		tmp = x + (t - x)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) / z)
	tmp = 0.0
	if (x <= -440000.0)
		tmp = t_1;
	elseif (x <= 6.2e+166)
		tmp = Float64(x + Float64(t - x));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (x * y) / z;
	tmp = 0.0;
	if (x <= -440000.0)
		tmp = t_1;
	elseif (x <= 6.2e+166)
		tmp = x + (t - x);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[x, -440000.0], t$95$1, If[LessEqual[x, 6.2e+166], N[(x + N[(t - x), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.4e5 or 6.19999999999999966e166 < x

   1. Initial program 50.4%

      \[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. distribute-rgt-out-- N/A

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 49.3%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x + \left(-t\right), \frac{y - a}{z}, 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 44.0%

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

   9. Taylor expanded in x around inf

      \[\leadsto \frac{x \cdot y}{z} \]
   10. Step-by-step derivation

   11. Applied rewrites 25.2%

       \[\leadsto \frac{x \cdot y}{z} \]

   if -4.4e5 < x < 6.19999999999999966e166

   1. Initial program 69.7%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 31.6

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

   5. Applied rewrites 31.6%

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

Alternative 17: 19.4% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.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 x + \color{blue}{\left(t - x\right)} \]
4. Step-by-step derivation

   1. lower--.f64 21.7

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

5. Applied rewrites 21.7%

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

Alternative 18: 2.8% accurate, 4.8× speedup

Math

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

FPCore

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

C

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

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 + -x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(x + (-x)), $MachinePrecision]

Derivation

1. Initial program 62.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 x + \color{blue}{\left(t - x\right)} \]
4. Step-by-step derivation

   1. lower--.f64 21.7

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

5. Applied rewrites 21.7%

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

6. Taylor expanded in t around 0

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

8. Applied rewrites 2.7%

   \[\leadsto x + \left(-x\right) \]
9. Add Preprocessing

Developer Target 1: 83.4% 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 2024222 
(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))))