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

Percentage Accurate: 68.3% → 90.6%

Time: 13.2s

Alternatives: 15

Speedup: 0.6×

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.3% 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: 90.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y - x) / ((a - t) / (z - t)));
	double t_2 = x + (((y - x) * (z - t)) / (a - t));
	double tmp;
	if (t_2 <= -2e-263) {
		tmp = t_1;
	} else if (t_2 <= 0.0) {
		tmp = y + (((y - x) * (a - z)) / t);
	} 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) :: t_2
    real(8) :: tmp
    t_1 = x + ((y - x) / ((a - t) / (z - t)))
    t_2 = x + (((y - x) * (z - t)) / (a - t))
    if (t_2 <= (-2d-263)) then
        tmp = t_1
    else if (t_2 <= 0.0d0) then
        tmp = y + (((y - x) * (a - z)) / t)
    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) / ((a - t) / (z - t)));
	double t_2 = x + (((y - x) * (z - t)) / (a - t));
	double tmp;
	if (t_2 <= -2e-263) {
		tmp = t_1;
	} else if (t_2 <= 0.0) {
		tmp = y + (((y - x) * (a - z)) / t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 76.8%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 91.4%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 91.4%

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

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

   1. Initial program 4.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 y + \color{blue}{\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 + -1 \cdot \color{blue}{\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 \frac{z \cdot \left(y - x\right) - a \cdot \left(y - x\right)}{\color{blue}{t}} \]

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(z \cdot \left(y - x\right) - a \cdot \left(y - x\right)\right), \color{blue}{t}\right)\right) \]

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

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(\left(y - x\right) \cdot \left(z - a\right)\right), t\right)\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\left(y - x\right), \left(z - a\right)\right), t\right)\right) \]

      10. --lowering--.f64 N/A

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(z - a\right)\right), t\right)\right) \]

      11. --lowering--.f64 99.7%

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(z, a\right)\right), t\right)\right) \]

   5. Simplified 99.7%

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

4. Final simplification 92.0%

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

Alternative 2: 90.9% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (- z t) (/ (- y x) (- a t)))))
        (t_2 (+ x (/ (* (- y x) (- z t)) (- a t)))))
   (if (<= t_2 (- INFINITY))
     t_1
     (if (<= t_2 -2e-263)
       t_2
       (if (<= t_2 0.0)
         (+ y (/ (* (- y x) (- a z)) t))
         (if (<= t_2 1e+275) t_2 t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((z - t) * ((y - x) / (a - t)));
	double t_2 = x + (((y - x) * (z - t)) / (a - t));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= -2e-263) {
		tmp = t_2;
	} else if (t_2 <= 0.0) {
		tmp = y + (((y - x) * (a - z)) / t);
	} else if (t_2 <= 1e+275) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((z - t) * ((y - x) / (a - t)));
	double t_2 = x + (((y - x) * (z - t)) / (a - t));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= -2e-263) {
		tmp = t_2;
	} else if (t_2 <= 0.0) {
		tmp = y + (((y - x) * (a - z)) / t);
	} else if (t_2 <= 1e+275) {
		tmp = t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + ((z - t) * ((y - x) / (a - t)))
	t_2 = x + (((y - x) * (z - t)) / (a - t))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= -2e-263:
		tmp = t_2
	elif t_2 <= 0.0:
		tmp = y + (((y - x) * (a - z)) / t)
	elif t_2 <= 1e+275:
		tmp = t_2
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(Float64(z - t) * Float64(Float64(y - x) / Float64(a - t))))
	t_2 = Float64(x + Float64(Float64(Float64(y - x) * Float64(z - t)) / Float64(a - t)))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= -2e-263)
		tmp = t_2;
	elseif (t_2 <= 0.0)
		tmp = Float64(y + Float64(Float64(Float64(y - x) * Float64(a - z)) / t));
	elseif (t_2 <= 1e+275)
		tmp = t_2;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + ((z - t) * ((y - x) / (a - t)));
	t_2 = x + (((y - x) * (z - t)) / (a - t));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_1;
	elseif (t_2 <= -2e-263)
		tmp = t_2;
	elseif (t_2 <= 0.0)
		tmp = y + (((y - x) * (a - z)) / t);
	elseif (t_2 <= 1e+275)
		tmp = t_2;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x (/.f64 (*.f64 (-.f64 y x) (-.f64 z t)) (-.f64 a t))) < -inf.0 or 9.9999999999999996e274 < (+.f64 x (/.f64 (*.f64 (-.f64 y x) (-.f64 z t)) (-.f64 a t)))

   1. Initial program 47.3%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. --lowering--.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\left(y - x\right), \color{blue}{\left(a - t\right)}\right)\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(\color{blue}{a} - t\right)\right)\right)\right) \]

      7. --lowering--.f64 81.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 81.6%

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

   if -inf.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y x) (-.f64 z t)) (-.f64 a t))) < -2e-263 or 0.0 < (+.f64 x (/.f64 (*.f64 (-.f64 y x) (-.f64 z t)) (-.f64 a t))) < 9.9999999999999996e274

   1. Initial program 98.5%

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

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

   1. Initial program 4.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 y + \color{blue}{\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 + -1 \cdot \color{blue}{\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 \frac{z \cdot \left(y - x\right) - a \cdot \left(y - x\right)}{\color{blue}{t}} \]

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(z \cdot \left(y - x\right) - a \cdot \left(y - x\right)\right), \color{blue}{t}\right)\right) \]

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

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(\left(y - x\right) \cdot \left(z - a\right)\right), t\right)\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\left(y - x\right), \left(z - a\right)\right), t\right)\right) \]

      10. --lowering--.f64 N/A

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(z - a\right)\right), t\right)\right) \]

      11. --lowering--.f64 99.7%

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(z, a\right)\right), t\right)\right) \]

   5. Simplified 99.7%

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

4. Final simplification 91.9%

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

Alternative 3: 83.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (- z t) (/ (- y x) (- a t))))))
   (if (<= a -8.2e-112)
     t_1
     (if (<= a 6.5e-149) (+ y (/ (* (- y x) (- a z)) t)) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = x + ((z - t) * ((y - x) / (a - t)))
	tmp = 0
	if a <= -8.2e-112:
		tmp = t_1
	elif a <= 6.5e-149:
		tmp = y + (((y - x) * (a - z)) / t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(Float64(z - t) * Float64(Float64(y - x) / Float64(a - t))))
	tmp = 0.0
	if (a <= -8.2e-112)
		tmp = t_1;
	elseif (a <= 6.5e-149)
		tmp = Float64(y + Float64(Float64(Float64(y - x) * Float64(a - z)) / t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + ((z - t) * ((y - x) / (a - t)));
	tmp = 0.0;
	if (a <= -8.2e-112)
		tmp = t_1;
	elseif (a <= 6.5e-149)
		tmp = y + (((y - x) * (a - z)) / t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -8.19999999999999991e-112 or 6.50000000000000019e-149 < a

   1. Initial program 73.8%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. --lowering--.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\left(y - x\right), \color{blue}{\left(a - t\right)}\right)\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(\color{blue}{a} - t\right)\right)\right)\right) \]

      7. --lowering--.f64 85.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 85.5%

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

   if -8.19999999999999991e-112 < a < 6.50000000000000019e-149

   1. Initial program 67.6%

      \[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 y + \color{blue}{\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 + -1 \cdot \color{blue}{\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 \frac{z \cdot \left(y - x\right) - a \cdot \left(y - x\right)}{\color{blue}{t}} \]

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(z \cdot \left(y - x\right) - a \cdot \left(y - x\right)\right), \color{blue}{t}\right)\right) \]

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

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(\left(y - x\right) \cdot \left(z - a\right)\right), t\right)\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\left(y - x\right), \left(z - a\right)\right), t\right)\right) \]

      10. --lowering--.f64 N/A

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(z - a\right)\right), t\right)\right) \]

      11. --lowering--.f64 88.5%

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(z, a\right)\right), t\right)\right) \]

   5. Simplified 88.5%

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

4. Final simplification 86.4%

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

Alternative 4: 45.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2.8 \cdot 10^{+147}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq -6.2 \cdot 10^{-151}:\\ \;\;\;\;y \cdot \frac{z}{a - t}\\ \mathbf{elif}\;t \leq 920000:\\ \;\;\;\;x \cdot \left(1 - \frac{z}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -2.8e+147)
   y
   (if (<= t -6.2e-151)
     (* y (/ z (- a t)))
     (if (<= t 920000.0) (* x (- 1.0 (/ z a))) y))))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -2.8e+147:
		tmp = y
	elif t <= -6.2e-151:
		tmp = y * (z / (a - t))
	elif t <= 920000.0:
		tmp = x * (1.0 - (z / a))
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -2.8e+147)
		tmp = y;
	elseif (t <= -6.2e-151)
		tmp = Float64(y * Float64(z / Float64(a - t)));
	elseif (t <= 920000.0)
		tmp = Float64(x * Float64(1.0 - Float64(z / a)));
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -2.8e+147)
		tmp = y;
	elseif (t <= -6.2e-151)
		tmp = y * (z / (a - t));
	elseif (t <= 920000.0)
		tmp = x * (1.0 - (z / a));
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -2.8e+147], y, If[LessEqual[t, -6.2e-151], N[(y * N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 920000.0], N[(x * N[(1.0 - N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], y]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.8000000000000001e147 or 9.2e5 < t

   1. Initial program 41.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}{y} \]
   4. Step-by-step derivation

   5. Simplified 49.9%

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

   if -2.8000000000000001e147 < t < -6.19999999999999969e-151

   1. Initial program 82.4%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 61.0%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 61.0%

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

   6. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-lowering-*.f64 N/A

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

      3. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{/.f64}\left(z, \color{blue}{\left(a - t\right)}\right)\right) \]

      4. --lowering--.f64 40.7%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{/.f64}\left(z, \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right)\right) \]

   8. Simplified 40.7%

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

   if -6.19999999999999969e-151 < t < 9.2e5

   1. Initial program 92.4%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 99.8%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 80.9%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 80.9%

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

   8. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + -1 \cdot \frac{z}{a}\right)}\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right)\right) \]

      3. unsub-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 - \color{blue}{\frac{z}{a}}\right)\right) \]

      4. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{z}{a}\right)}\right)\right) \]

      5. /-lowering-/.f64 56.0%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(z, \color{blue}{a}\right)\right)\right) \]

   10. Simplified 56.0%

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

Alternative 5: 74.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -9.5 \cdot 10^{+57}:\\ \;\;\;\;\frac{y}{\frac{a - t}{z - t}}\\ \mathbf{elif}\;t \leq 1.8 \cdot 10^{-19}:\\ \;\;\;\;x + \frac{y - x}{\frac{a - t}{z}}\\ \mathbf{else}:\\ \;\;\;\;y + \frac{\left(y - x\right) \cdot \left(a - z\right)}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -9.5e+57)
   (/ y (/ (- a t) (- z t)))
   (if (<= t 1.8e-19)
     (+ x (/ (- y x) (/ (- a t) z)))
     (+ y (/ (* (- y x) (- a z)) t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -9.5e+57) {
		tmp = y / ((a - t) / (z - t));
	} else if (t <= 1.8e-19) {
		tmp = x + ((y - x) / ((a - t) / z));
	} else {
		tmp = y + (((y - x) * (a - z)) / t);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= (-9.5d+57)) then
        tmp = y / ((a - t) / (z - t))
    else if (t <= 1.8d-19) then
        tmp = x + ((y - x) / ((a - t) / z))
    else
        tmp = y + (((y - x) * (a - z)) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -9.5e+57) {
		tmp = y / ((a - t) / (z - t));
	} else if (t <= 1.8e-19) {
		tmp = x + ((y - x) / ((a - t) / z));
	} else {
		tmp = y + (((y - x) * (a - z)) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -9.5e+57:
		tmp = y / ((a - t) / (z - t))
	elif t <= 1.8e-19:
		tmp = x + ((y - x) / ((a - t) / z))
	else:
		tmp = y + (((y - x) * (a - z)) / t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -9.5e+57)
		tmp = Float64(y / Float64(Float64(a - t) / Float64(z - t)));
	elseif (t <= 1.8e-19)
		tmp = Float64(x + Float64(Float64(y - x) / Float64(Float64(a - t) / z)));
	else
		tmp = Float64(y + Float64(Float64(Float64(y - x) * Float64(a - z)) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -9.5e+57)
		tmp = y / ((a - t) / (z - t));
	elseif (t <= 1.8e-19)
		tmp = x + ((y - x) / ((a - t) / z));
	else
		tmp = y + (((y - x) * (a - z)) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -9.5e+57], N[(y / N[(N[(a - t), $MachinePrecision] / N[(z - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 1.8e-19], N[(x + N[(N[(y - x), $MachinePrecision] / N[(N[(a - t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(y + N[(N[(N[(y - x), $MachinePrecision] * N[(a - z), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -9.4999999999999997e57

   1. Initial program 40.8%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 38.8%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 38.8%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right) \]

      7. --lowering--.f64 67.9%

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right) \]

   7. Applied egg-rr 67.9%

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

   if -9.4999999999999997e57 < t < 1.8000000000000001e-19

   1. Initial program 90.7%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 97.2%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 97.2%

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

   5. Taylor expanded in z around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{z}\right)\right)\right) \]

      2. --lowering--.f64 87.0%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), z\right)\right)\right) \]

   7. Simplified 87.0%

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

   if 1.8000000000000001e-19 < t

   1. Initial program 52.9%

      \[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 y + \color{blue}{\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 + -1 \cdot \color{blue}{\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 \frac{z \cdot \left(y - x\right) - a \cdot \left(y - x\right)}{\color{blue}{t}} \]

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. --lowering--.f64 N/A

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

      7. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(z \cdot \left(y - x\right) - a \cdot \left(y - x\right)\right), \color{blue}{t}\right)\right) \]

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

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\left(\left(y - x\right) \cdot \left(z - a\right)\right), t\right)\right) \]

      9. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\left(y - x\right), \left(z - a\right)\right), t\right)\right) \]

      10. --lowering--.f64 N/A

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \left(z - a\right)\right), t\right)\right) \]

      11. --lowering--.f64 69.9%

          \[\leadsto \mathsf{\_.f64}\left(y, \mathsf{/.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{\_.f64}\left(z, a\right)\right), t\right)\right) \]

   5. Simplified 69.9%

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

4. Final simplification 79.2%

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

Alternative 6: 74.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y}{\frac{a - t}{z - t}}\\ \mathbf{if}\;t \leq -1 \cdot 10^{+58}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 18000000000:\\ \;\;\;\;x + \frac{y - x}{\frac{a - t}{z}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ y (/ (- a t) (- z t)))))
   (if (<= t -1e+58)
     t_1
     (if (<= t 18000000000.0) (+ x (/ (- y x) (/ (- a t) z))) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = y / ((a - t) / (z - t))
	tmp = 0
	if t <= -1e+58:
		tmp = t_1
	elif t <= 18000000000.0:
		tmp = x + ((y - x) / ((a - t) / z))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y / Float64(Float64(a - t) / Float64(z - t)))
	tmp = 0.0
	if (t <= -1e+58)
		tmp = t_1;
	elseif (t <= 18000000000.0)
		tmp = Float64(x + Float64(Float64(y - x) / Float64(Float64(a - t) / z)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = y / ((a - t) / (z - t));
	tmp = 0.0;
	if (t <= -1e+58)
		tmp = t_1;
	elseif (t <= 18000000000.0)
		tmp = x + ((y - x) / ((a - t) / z));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -9.99999999999999944e57 or 1.8e10 < t

   1. Initial program 44.9%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 47.5%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 47.5%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right) \]

      7. --lowering--.f64 67.7%

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right) \]

   7. Applied egg-rr 67.7%

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

   if -9.99999999999999944e57 < t < 1.8e10

   1. Initial program 90.0%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 96.7%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 96.7%

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

   5. Taylor expanded in z around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{z}\right)\right)\right) \]

      2. --lowering--.f64 86.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), z\right)\right)\right) \]

   7. Simplified 86.5%

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

Alternative 7: 67.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y}{\frac{a - t}{z - t}}\\ \mathbf{if}\;t \leq -7.2 \cdot 10^{-54}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 2.55 \cdot 10^{-14}:\\ \;\;\;\;x + \frac{y - x}{\frac{a}{z}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ y (/ (- a t) (- z t)))))
   (if (<= t -7.2e-54)
     t_1
     (if (<= t 2.55e-14) (+ x (/ (- y x) (/ a z))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y / ((a - t) / (z - t));
	double tmp;
	if (t <= -7.2e-54) {
		tmp = t_1;
	} else if (t <= 2.55e-14) {
		tmp = x + ((y - x) / (a / z));
	} 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 = y / ((a - t) / (z - t))
    if (t <= (-7.2d-54)) then
        tmp = t_1
    else if (t <= 2.55d-14) then
        tmp = x + ((y - x) / (a / z))
    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 = y / ((a - t) / (z - t));
	double tmp;
	if (t <= -7.2e-54) {
		tmp = t_1;
	} else if (t <= 2.55e-14) {
		tmp = x + ((y - x) / (a / z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = y / ((a - t) / (z - t))
	tmp = 0
	if t <= -7.2e-54:
		tmp = t_1
	elif t <= 2.55e-14:
		tmp = x + ((y - x) / (a / z))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y / Float64(Float64(a - t) / Float64(z - t)))
	tmp = 0.0
	if (t <= -7.2e-54)
		tmp = t_1;
	elseif (t <= 2.55e-14)
		tmp = Float64(x + Float64(Float64(y - x) / Float64(a / z)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = y / ((a - t) / (z - t));
	tmp = 0.0;
	if (t <= -7.2e-54)
		tmp = t_1;
	elseif (t <= 2.55e-14)
		tmp = x + ((y - x) / (a / z));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -7.19999999999999953e-54 or 2.5499999999999999e-14 < t

   1. Initial program 56.3%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 50.5%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 50.5%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right) \]

      7. --lowering--.f64 64.8%

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right) \]

   7. Applied egg-rr 64.8%

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

   if -7.19999999999999953e-54 < t < 2.5499999999999999e-14

   1. Initial program 92.2%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 99.0%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 99.0%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 80.3%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 80.3%

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

Alternative 8: 63.1% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (- z t) (/ y (- a t)))))
   (if (<= t -5e-56)
     t_1
     (if (<= t 2800000000000.0) (+ x (/ (- y x) (/ a z))) t_1))))

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.99999999999999997e-56 or 2.8e12 < t

   1. Initial program 55.5%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 51.4%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 51.4%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. associate-/r/ N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \left(a - t\right)\right), \left(\color{blue}{z} - t\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \left(z - t\right)\right) \]

      8. --lowering--.f64 58.0%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right) \]

   7. Applied egg-rr 58.0%

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

   if -4.99999999999999997e-56 < t < 2.8e12

   1. Initial program 91.1%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 97.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 97.5%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 77.3%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 77.3%

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

4. Final simplification 67.0%

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

Alternative 9: 61.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (- z t) (/ y (- a t)))))
   (if (<= t -2.05e-109) t_1 (if (<= t 8e-17) (+ x (* z (/ (- y x) a))) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = (z - t) * (y / (a - t))
	tmp = 0
	if t <= -2.05e-109:
		tmp = t_1
	elif t <= 8e-17:
		tmp = x + (z * ((y - x) / a))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) * Float64(y / Float64(a - t)))
	tmp = 0.0
	if (t <= -2.05e-109)
		tmp = t_1;
	elseif (t <= 8e-17)
		tmp = Float64(x + Float64(z * Float64(Float64(y - x) / a)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) * (y / (a - t));
	tmp = 0.0;
	if (t <= -2.05e-109)
		tmp = t_1;
	elseif (t <= 8e-17)
		tmp = x + (z * ((y - x) / a));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.0500000000000001e-109 or 8.00000000000000057e-17 < t

   1. Initial program 57.7%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 51.5%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 51.5%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. associate-/r/ N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \left(a - t\right)\right), \left(\color{blue}{z} - t\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \left(z - t\right)\right) \]

      8. --lowering--.f64 56.9%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right) \]

   7. Applied egg-rr 56.9%

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

   if -2.0500000000000001e-109 < t < 8.00000000000000057e-17

   1. Initial program 92.7%

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

   3. Taylor expanded in a around inf

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

      1. +-lowering-+.f64 N/A

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

      2. *-commutative N/A

         \[\leadsto \mathsf{+.f64}\left(x, \left(\frac{\left(z - t\right) \cdot \left(y - x\right)}{a}\right)\right) \]

      3. associate-/l* N/A

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

      4. *-lowering-*.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\left(y - x\right), \color{blue}{a}\right)\right)\right) \]

      7. --lowering--.f64 79.0%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\mathsf{\_.f64}\left(z, t\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), a\right)\right)\right) \]

   5. Simplified 79.0%

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

   6. Taylor expanded in z around inf

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(\color{blue}{z}, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), a\right)\right)\right) \]
   7. Step-by-step derivation

   8. Simplified 79.1%

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

4. Final simplification 66.0%

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

Alternative 10: 56.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x \cdot \left(1 - \frac{z}{a}\right)\\ \mathbf{if}\;x \leq -4 \cdot 10^{+106}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 5 \cdot 10^{+45}:\\ \;\;\;\;\left(z - t\right) \cdot \frac{y}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* x (- 1.0 (/ z a)))))
   (if (<= x -4e+106) t_1 (if (<= x 5e+45) (* (- z t) (/ y (- a t))) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = x * (1.0 - (z / a))
	tmp = 0
	if x <= -4e+106:
		tmp = t_1
	elif x <= 5e+45:
		tmp = (z - t) * (y / (a - t))
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x * (1.0 - (z / a));
	tmp = 0.0;
	if (x <= -4e+106)
		tmp = t_1;
	elseif (x <= 5e+45)
		tmp = (z - t) * (y / (a - t));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -4.00000000000000036e106 or 5e45 < x

   1. Initial program 60.5%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 76.4%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 76.4%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 55.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 55.6%

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

   8. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + -1 \cdot \frac{z}{a}\right)}\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right)\right) \]

      3. unsub-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 - \color{blue}{\frac{z}{a}}\right)\right) \]

      4. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{z}{a}\right)}\right)\right) \]

      5. /-lowering-/.f64 48.8%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(z, \color{blue}{a}\right)\right)\right) \]

   10. Simplified 48.8%

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

   if -4.00000000000000036e106 < x < 5e45

   1. Initial program 78.9%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 61.6%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 61.6%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. associate-/r/ N/A

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

      5. *-lowering-*.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \left(a - t\right)\right), \left(\color{blue}{z} - t\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \left(z - t\right)\right) \]

      8. --lowering--.f64 65.6%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{/.f64}\left(y, \mathsf{\_.f64}\left(a, t\right)\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right) \]

   7. Applied egg-rr 65.6%

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

4. Final simplification 59.4%

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

Alternative 11: 51.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2 \cdot 10^{+106}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 1.85 \cdot 10^{+30}:\\ \;\;\;\;x + \frac{y \cdot z}{a}\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -2e+106) y (if (<= t 1.85e+30) (+ x (/ (* y z) a)) y)))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -2e+106:
		tmp = y
	elif t <= 1.85e+30:
		tmp = x + ((y * z) / a)
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -2e+106)
		tmp = y;
	elseif (t <= 1.85e+30)
		tmp = Float64(x + Float64(Float64(y * z) / a));
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -2e+106)
		tmp = y;
	elseif (t <= 1.85e+30)
		tmp = x + ((y * z) / a);
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.00000000000000018e106 or 1.85000000000000008e30 < t

   1. Initial program 42.3%

      \[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}{y} \]
   4. Step-by-step derivation

   5. Simplified 50.4%

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

   if -2.00000000000000018e106 < t < 1.85000000000000008e30

   1. Initial program 88.5%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 95.2%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 95.2%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 68.0%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 68.0%

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

   8. Taylor expanded in y around inf

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\left(y \cdot z\right), \color{blue}{a}\right)\right) \]

      2. *-lowering-*.f64 54.5%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, z\right), a\right)\right) \]

   10. Simplified 54.5%

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

Alternative 12: 49.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -4.5 \cdot 10^{+72}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 1500000:\\ \;\;\;\;x \cdot \left(1 - \frac{z}{a}\right)\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -4.5e+72) y (if (<= t 1500000.0) (* x (- 1.0 (/ z a))) y)))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -4.5e+72:
		tmp = y
	elif t <= 1500000.0:
		tmp = x * (1.0 - (z / a))
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -4.5e+72)
		tmp = y;
	elseif (t <= 1500000.0)
		tmp = Float64(x * Float64(1.0 - Float64(z / a)));
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -4.5e+72)
		tmp = y;
	elseif (t <= 1500000.0)
		tmp = x * (1.0 - (z / a));
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -4.5e+72], y, If[LessEqual[t, 1500000.0], N[(x * N[(1.0 - N[(z / a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], y]]

Derivation

1. Split input into 2 regimes

2. if t < -4.4999999999999998e72 or 1.5e6 < t

   1. Initial program 43.9%

      \[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}{y} \]
   4. Step-by-step derivation

   5. Simplified 47.5%

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

   if -4.4999999999999998e72 < t < 1.5e6

   1. Initial program 90.7%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. un-div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right)\right) \]

      7. --lowering--.f64 N/A

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right)\right) \]

      8. --lowering--.f64 97.3%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right)\right) \]

   4. Applied egg-rr 97.3%

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

   5. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 70.7%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(y, x\right), \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right)\right) \]

   7. Simplified 70.7%

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

   8. Taylor expanded in x around inf

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

      1. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \color{blue}{\left(1 + -1 \cdot \frac{z}{a}\right)}\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right)\right) \]

      3. unsub-neg N/A

         \[\leadsto \mathsf{*.f64}\left(x, \left(1 - \color{blue}{\frac{z}{a}}\right)\right) \]

      4. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \color{blue}{\left(\frac{z}{a}\right)}\right)\right) \]

      5. /-lowering-/.f64 48.3%

         \[\leadsto \mathsf{*.f64}\left(x, \mathsf{\_.f64}\left(1, \mathsf{/.f64}\left(z, \color{blue}{a}\right)\right)\right) \]

   10. Simplified 48.3%

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

Alternative 13: 40.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y}{\frac{a}{z}}\\ \mathbf{if}\;z \leq -3.1 \cdot 10^{+125}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 6 \cdot 10^{+76}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ y (/ a z))))
   (if (<= z -3.1e+125) t_1 (if (<= z 6e+76) (+ x y) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y / (a / z);
	double tmp;
	if (z <= -3.1e+125) {
		tmp = t_1;
	} else if (z <= 6e+76) {
		tmp = x + y;
	} 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 = y / (a / z)
    if (z <= (-3.1d+125)) then
        tmp = t_1
    else if (z <= 6d+76) then
        tmp = x + y
    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 = y / (a / z);
	double tmp;
	if (z <= -3.1e+125) {
		tmp = t_1;
	} else if (z <= 6e+76) {
		tmp = x + y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = y / (a / z)
	tmp = 0
	if z <= -3.1e+125:
		tmp = t_1
	elif z <= 6e+76:
		tmp = x + y
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y / Float64(a / z))
	tmp = 0.0
	if (z <= -3.1e+125)
		tmp = t_1;
	elseif (z <= 6e+76)
		tmp = Float64(x + y);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = y / (a / z);
	tmp = 0.0;
	if (z <= -3.1e+125)
		tmp = t_1;
	elseif (z <= 6e+76)
		tmp = x + y;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(y / N[(a / z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -3.1e+125], t$95$1, If[LessEqual[z, 6e+76], N[(x + y), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.1e125 or 5.9999999999999996e76 < z

   1. Initial program 74.8%

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

   3. Taylor expanded in x around 0

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

      1. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\left(y \cdot \left(z - t\right)\right), \color{blue}{\left(a - t\right)}\right) \]

      2. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \left(z - t\right)\right), \left(\color{blue}{a} - t\right)\right) \]

      3. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \left(a - t\right)\right) \]

      4. --lowering--.f64 49.2%

         \[\leadsto \mathsf{/.f64}\left(\mathsf{*.f64}\left(y, \mathsf{\_.f64}\left(z, t\right)\right), \mathsf{\_.f64}\left(a, \color{blue}{t}\right)\right) \]

   5. Simplified 49.2%

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

      1. associate-/l* N/A

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

      2. clear-num N/A

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

      3. div-inv N/A

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

      4. /-lowering-/.f64 N/A

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

      5. /-lowering-/.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\left(a - t\right), \color{blue}{\left(z - t\right)}\right)\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \left(\color{blue}{z} - t\right)\right)\right) \]

      7. --lowering--.f64 61.5%

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(\mathsf{\_.f64}\left(a, t\right), \mathsf{\_.f64}\left(z, \color{blue}{t}\right)\right)\right) \]

   7. Applied egg-rr 61.5%

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

   8. Taylor expanded in t around 0

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

      1. /-lowering-/.f64 43.2%

         \[\leadsto \mathsf{/.f64}\left(y, \mathsf{/.f64}\left(a, \color{blue}{z}\right)\right) \]

   10. Simplified 43.2%

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

   if -3.1e125 < z < 5.9999999999999996e76

   1. Initial program 70.3%

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

   3. Taylor expanded in t around inf

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

      1. --lowering--.f64 26.4%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{\_.f64}\left(y, \color{blue}{x}\right)\right) \]

   5. Simplified 26.4%

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

   6. Taylor expanded in y around inf

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

   8. Simplified 42.6%

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

Alternative 14: 39.2% accurate, 1.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -3.2e-27) y (if (<= t 650000.0) x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -3.2e-27) {
		tmp = y;
	} else if (t <= 650000.0) {
		tmp = x;
	} else {
		tmp = y;
	}
	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.2d-27)) then
        tmp = y
    else if (t <= 650000.0d0) then
        tmp = x
    else
        tmp = y
    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.2e-27) {
		tmp = y;
	} else if (t <= 650000.0) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -3.2e-27:
		tmp = y
	elif t <= 650000.0:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -3.2e-27)
		tmp = y;
	elseif (t <= 650000.0)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -3.2e-27)
		tmp = y;
	elseif (t <= 650000.0)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -3.2e-27], y, If[LessEqual[t, 650000.0], x, y]]

Derivation

1. Split input into 2 regimes

2. if t < -3.19999999999999991e-27 or 6.5e5 < t

   1. Initial program 52.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}{y} \]
   4. Step-by-step derivation

   5. Simplified 41.0%

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

   if -3.19999999999999991e-27 < t < 6.5e5

   1. Initial program 92.9%

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

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{x} \]
   4. Step-by-step derivation

   5. Simplified 33.8%

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

Alternative 15: 25.4% accurate, 13.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 72.0%

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

3. Taylor expanded in a around inf

   \[\leadsto \color{blue}{x} \]
4. Step-by-step derivation

5. Simplified 22.3%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Developer Target 1: 87.1% accurate, 0.5× 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 2024160 
(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))))