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

Percentage Accurate: 68.9% → 88.7%

Time: 8.9s

Alternatives: 12

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 88.7% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2.1e+181) (not (<= t 2.2e+67)))
   (fma (- x y) (/ (- z a) t) y)
   (+ x (/ (- y x) (/ (- a t) (- z t))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2.1e+181) || !(t <= 2.2e+67)) {
		tmp = fma((x - y), ((z - a) / t), y);
	} else {
		tmp = x + ((y - x) / ((a - t) / (z - t)));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2.1e+181) || !(t <= 2.2e+67))
		tmp = fma(Float64(x - y), Float64(Float64(z - a) / t), y);
	else
		tmp = Float64(x + Float64(Float64(y - x) / Float64(Float64(a - t) / Float64(z - t))));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -2.1e+181], N[Not[LessEqual[t, 2.2e+67]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * N[(N[(z - a), $MachinePrecision] / t), $MachinePrecision] + y), $MachinePrecision], N[(x + N[(N[(y - x), $MachinePrecision] / N[(N[(a - t), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.09999999999999997e181 or 2.2e67 < t

   1. Initial program 34.7%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 91.7%

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

   if -2.09999999999999997e181 < t < 2.2e67

   1. Initial program 77.8%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 88.6

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

   4. Applied rewrites 88.6%

      \[\leadsto x + \color{blue}{\frac{y - x}{\frac{a - t}{z - t}}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.7%

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

Alternative 2: 86.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -1.85e+176) (not (<= t 2.2e+67)))
   (fma (- x y) (/ (- z a) t) y)
   (fma (- z t) (/ (- y x) (- a t)) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -1.85e+176) || !(t <= 2.2e+67)) {
		tmp = fma((x - y), ((z - a) / t), y);
	} else {
		tmp = fma((z - t), ((y - x) / (a - t)), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -1.85e+176) || !(t <= 2.2e+67))
		tmp = fma(Float64(x - y), Float64(Float64(z - a) / t), y);
	else
		tmp = fma(Float64(z - t), Float64(Float64(y - x) / Float64(a - t)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -1.85e+176], N[Not[LessEqual[t, 2.2e+67]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * N[(N[(z - a), $MachinePrecision] / t), $MachinePrecision] + y), $MachinePrecision], N[(N[(z - t), $MachinePrecision] * N[(N[(y - x), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.8499999999999999e176 or 2.2e67 < t

   1. Initial program 35.1%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 91.9%

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

   if -1.8499999999999999e176 < t < 2.2e67

   1. Initial program 78.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 88.4

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

   4. Applied rewrites 88.4%

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

4. Final simplification 89.6%

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

Alternative 3: 76.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2.4e-5) (not (<= t 7.4e+15)))
   (fma (- x y) (/ (- z a) t) y)
   (fma (- y x) (/ (- z t) a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2.4e-5) || !(t <= 7.4e+15)) {
		tmp = fma((x - y), ((z - a) / t), y);
	} else {
		tmp = fma((y - x), ((z - t) / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2.4e-5) || !(t <= 7.4e+15))
		tmp = fma(Float64(x - y), Float64(Float64(z - a) / t), y);
	else
		tmp = fma(Float64(y - x), Float64(Float64(z - t) / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -2.4e-5], N[Not[LessEqual[t, 7.4e+15]], $MachinePrecision]], N[(N[(x - y), $MachinePrecision] * N[(N[(z - a), $MachinePrecision] / t), $MachinePrecision] + y), $MachinePrecision], N[(N[(y - x), $MachinePrecision] * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.4000000000000001e-5 or 7.4e15 < t

   1. Initial program 43.7%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 85.3%

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

   if -2.4000000000000001e-5 < t < 7.4e15

   1. Initial program 85.1%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. clear-num N/A

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

      5. un-div-inv N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 91.6

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

   4. Applied rewrites 91.6%

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

   5. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 84.9

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

   7. Applied rewrites 84.9%

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

4. Final simplification 85.1%

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

Alternative 4: 73.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -0.00049) (not (<= t 7e+15)))
   (fma (- x y) (/ (- z a) t) y)
   (fma (/ (- y x) a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -0.00049) || !(t <= 7e+15)) {
		tmp = fma((x - y), ((z - a) / t), y);
	} else {
		tmp = fma(((y - x) / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -0.00049) || !(t <= 7e+15))
		tmp = fma(Float64(x - y), Float64(Float64(z - a) / t), y);
	else
		tmp = fma(Float64(Float64(y - x) / a), z, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.8999999999999998e-4 or 7e15 < t

   1. Initial program 43.7%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 85.3%

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

   if -4.8999999999999998e-4 < t < 7e15

   1. Initial program 85.1%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 80.6

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

   5. Applied rewrites 80.6%

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

4. Final simplification 83.2%

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

Alternative 5: 69.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -200.0) (not (<= t 7e+15)))
   (fma (- x y) (/ z t) y)
   (fma (/ (- y x) a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -200.0) || !(t <= 7e+15)) {
		tmp = fma((x - y), (z / t), y);
	} else {
		tmp = fma(((y - x) / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -200.0) || !(t <= 7e+15))
		tmp = fma(Float64(x - y), Float64(z / t), y);
	else
		tmp = fma(Float64(Float64(y - x) / a), z, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -200 or 7e15 < t

   1. Initial program 43.2%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 85.7%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 74.5%

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

   if -200 < t < 7e15

   1. Initial program 84.6%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 79.5

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

   5. Applied rewrites 79.5%

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

4. Final simplification 76.8%

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

Alternative 6: 70.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2550000.0) (not (<= t 7.4e+15)))
   (fma (- x y) (/ z t) y)
   (fma (- y x) (/ z a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2550000.0) || !(t <= 7.4e+15)) {
		tmp = fma((x - y), (z / t), y);
	} else {
		tmp = fma((y - x), (z / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2550000.0) || !(t <= 7.4e+15))
		tmp = fma(Float64(x - y), Float64(z / t), y);
	else
		tmp = fma(Float64(y - x), Float64(z / a), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.55e6 or 7.4e15 < t

   1. Initial program 43.5%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 75.0%

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

   if -2.55e6 < t < 7.4e15

   1. Initial program 83.9%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 78.8

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

   5. Applied rewrites 78.8%

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

   7. Applied rewrites 77.7%

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

4. Final simplification 76.3%

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

Alternative 7: 62.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2000000.0) (not (<= t 7e+15)))
   (fma (- x y) (/ z t) y)
   (fma (/ y a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2000000.0) || !(t <= 7e+15)) {
		tmp = fma((x - y), (z / t), y);
	} else {
		tmp = fma((y / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2000000.0) || !(t <= 7e+15))
		tmp = fma(Float64(x - y), Float64(z / t), y);
	else
		tmp = fma(Float64(y / a), z, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2e6 or 7e15 < t

   1. Initial program 43.5%

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

   3. Taylor expanded in t around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 85.6%

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

   6. Taylor expanded in z around inf

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

   8. Applied rewrites 75.0%

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

   if -2e6 < t < 7e15

   1. Initial program 83.9%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 78.8

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

   5. Applied rewrites 78.8%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 58.6%

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

4. Final simplification 67.3%

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

Alternative 8: 53.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -1.25e-15) (not (<= t 7.4e+15)))
   (fma (/ (- y x) t) a y)
   (fma (/ y a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -1.25e-15) || !(t <= 7.4e+15)) {
		tmp = fma(((y - x) / t), a, y);
	} else {
		tmp = fma((y / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -1.25e-15) || !(t <= 7.4e+15))
		tmp = fma(Float64(Float64(y - x) / t), a, y);
	else
		tmp = fma(Float64(y / a), z, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.25e-15 or 7.4e15 < t

   1. Initial program 45.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 52.0

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

   5. Applied rewrites 52.0%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 66.2%

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

   if -1.25e-15 < t < 7.4e15

   1. Initial program 85.2%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 81.5

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

   5. Applied rewrites 81.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 60.5%

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

4. Final simplification 63.7%

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

Alternative 9: 50.4% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -3300.0) (not (<= t 7.4e+15))) y (fma (/ y a) z x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -3300.0) || !(t <= 7.4e+15)) {
		tmp = y;
	} else {
		tmp = fma((y / a), z, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -3300.0) || !(t <= 7.4e+15))
		tmp = y;
	else
		tmp = fma(Float64(y / a), z, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -3300 or 7.4e15 < t

   1. Initial program 43.2%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 52.0

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

   5. Applied rewrites 52.0%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 54.6%

      \[\leadsto y \]

   if -3300 < t < 7.4e15

   1. Initial program 84.6%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 79.5

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

   5. Applied rewrites 79.5%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 59.1%

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

4. Final simplification 56.7%

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

Alternative 10: 39.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.34 \cdot 10^{-5} \lor \neg \left(t \leq 7.4 \cdot 10^{+15}\right):\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{x}{a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -1.34e-5) (not (<= t 7.4e+15))) y (fma t (/ x a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -1.34e-5) || !(t <= 7.4e+15)) {
		tmp = y;
	} else {
		tmp = fma(t, (x / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -1.34e-5) || !(t <= 7.4e+15))
		tmp = y;
	else
		tmp = fma(t, Float64(x / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -1.34e-5], N[Not[LessEqual[t, 7.4e+15]], $MachinePrecision]], y, N[(t * N[(x / a), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -1.34e-5 or 7.4e15 < t

   1. Initial program 43.7%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 51.7

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

   5. Applied rewrites 51.7%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 54.3%

      \[\leadsto y \]

   if -1.34e-5 < t < 7.4e15

   1. Initial program 85.1%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 42.4

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

   5. Applied rewrites 42.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 34.6%

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

   9. Taylor expanded in t around 0

      \[\leadsto x + \frac{t \cdot x}{\color{blue}{a}} \]
   10. Step-by-step derivation

   11. Applied rewrites 36.1%

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

4. Final simplification 46.0%

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

Alternative 11: 32.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -3.5 \cdot 10^{-27} \lor \neg \left(t \leq 2.7 \cdot 10^{-55}\right):\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot y}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -3.5e-27) (not (<= t 2.7e-55))) y (/ (* z y) a)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -3.5e-27) || !(t <= 2.7e-55)) {
		tmp = y;
	} else {
		tmp = (z * y) / a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((t <= (-3.5d-27)) .or. (.not. (t <= 2.7d-55))) then
        tmp = y
    else
        tmp = (z * y) / a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -3.5e-27) || !(t <= 2.7e-55)) {
		tmp = y;
	} else {
		tmp = (z * y) / a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (t <= -3.5e-27) or not (t <= 2.7e-55):
		tmp = y
	else:
		tmp = (z * y) / a
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -3.5e-27) || !(t <= 2.7e-55))
		tmp = y;
	else
		tmp = Float64(Float64(z * y) / a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((t <= -3.5e-27) || ~((t <= 2.7e-55)))
		tmp = y;
	else
		tmp = (z * y) / a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -3.5e-27], N[Not[LessEqual[t, 2.7e-55]], $MachinePrecision]], y, N[(N[(z * y), $MachinePrecision] / a), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.5000000000000001e-27 or 2.70000000000000004e-55 < t

   1. Initial program 46.3%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 N/A

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

      16. lower--.f64 52.9

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

   5. Applied rewrites 52.9%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 51.5%

      \[\leadsto y \]

   if -3.5000000000000001e-27 < t < 2.70000000000000004e-55

   1. Initial program 86.1%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 83.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 28.3%

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

4. Final simplification 42.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -3.5 \cdot 10^{-27} \lor \neg \left(t \leq 2.7 \cdot 10^{-55}\right):\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot y}{a}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 24.2% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.5%

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

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. mul-1-neg N/A

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

   3. *-commutative N/A

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

   4. associate-/l* N/A

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

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

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

   6. mul-1-neg N/A

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

   7. lower-fma.f64 N/A

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

   8. mul-1-neg N/A

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

   9. sub-neg N/A

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

   10. +-commutative N/A

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

   11. distribute-neg-in N/A

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

   12. unsub-neg N/A

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

   13. remove-double-neg N/A

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

   14. lower--.f64 N/A

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

   15. lower-/.f64 N/A

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

   16. lower--.f64 47.5

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

5. Applied rewrites 47.5%

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

6. Taylor expanded in t around inf

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

8. Applied rewrites 32.9%

   \[\leadsto y \]
9. Add Preprocessing

Developer Target 1: 87.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y - x}{1} \cdot \frac{z - t}{a - t}\\ \mathbf{if}\;a < -1.6153062845442575 \cdot 10^{-142}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a < 3.774403170083174 \cdot 10^{-182}:\\ \;\;\;\;y - \frac{z}{t} \cdot \left(y - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (/ (- y x) 1.0) (/ (- z t) (- a t))))))
   (if (< a -1.6153062845442575e-142)
     t_1
     (if (< a 3.774403170083174e-182) (- y (* (/ z t) (- y x))) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = x + (((y - x) / 1.0) * ((z - t) / (a - t)))
	tmp = 0
	if a < -1.6153062845442575e-142:
		tmp = t_1
	elif a < 3.774403170083174e-182:
		tmp = y - ((z / t) * (y - x))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(Float64(Float64(y - x) / 1.0) * Float64(Float64(z - t) / Float64(a - t))))
	tmp = 0.0
	if (a < -1.6153062845442575e-142)
		tmp = t_1;
	elseif (a < 3.774403170083174e-182)
		tmp = Float64(y - Float64(Float64(z / t) * Float64(y - x)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (((y - x) / 1.0) * ((z - t) / (a - t)));
	tmp = 0.0;
	if (a < -1.6153062845442575e-142)
		tmp = t_1;
	elseif (a < 3.774403170083174e-182)
		tmp = y - ((z / t) * (y - x));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(x + N[(N[(N[(y - x), $MachinePrecision] / 1.0), $MachinePrecision] * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[a, -1.6153062845442575e-142], t$95$1, If[Less[a, 3.774403170083174e-182], N[(y - N[(N[(z / t), $MachinePrecision] * N[(y - x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Reproduce

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

  :alt
  (! :herbie-platform default (if (< a -646122513817703/4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ x (* (/ (- y x) 1) (/ (- z t) (- a t)))) (if (< a 1887201585041587/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- y (* (/ z t) (- y x))) (+ x (* (/ (- y x) 1) (/ (- z t) (- a t)))))))

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