Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTick from plot-0.2.3.4, B

Percentage Accurate: 76.6% → 90.4%

Time: 12.0s

Alternatives: 15

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 76.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 90.4% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -1.35e+134) (not (<= t 3e+38)))
   (+ x (* y (/ (- z a) t)))
   (fma (- z t) (/ -1.0 (/ (- a t) y)) (+ x y))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -1.35e+134) || !(t <= 3e+38)) {
		tmp = x + (y * ((z - a) / t));
	} else {
		tmp = fma((z - t), (-1.0 / ((a - t) / y)), (x + y));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -1.35e+134) || !(t <= 3e+38))
		tmp = Float64(x + Float64(y * Float64(Float64(z - a) / t)));
	else
		tmp = fma(Float64(z - t), Float64(-1.0 / Float64(Float64(a - t) / y)), Float64(x + y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.35e134 or 3.0000000000000001e38 < t

   1. Initial program 51.9%

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

   3. Taylor expanded in t around -inf 79.2%

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

      1. mul-1-neg 79.2%

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

      2. unsub-neg 79.2%

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

      3. *-commutative 79.2%

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

   5. Simplified 79.2%

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

   6. Taylor expanded in y around 0 80.4%

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

      1. associate-*r/ 93.7%

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

   8. Simplified 93.7%

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

   if -1.35e134 < t < 3.0000000000000001e38

   1. Initial program 92.2%

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

      1. sub-neg 92.2%

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

      2. +-commutative 92.2%

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

      3. distribute-frac-neg 92.2%

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

      4. distribute-rgt-neg-out 92.2%

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

      5. associate-/l* 96.4%

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

      6. fma-define 96.5%

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

      7. distribute-frac-neg 96.5%

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

      8. distribute-neg-frac2 96.5%

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

      9. sub-neg 96.5%

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

      10. distribute-neg-in 96.5%

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

      11. remove-double-neg 96.5%

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

      12. +-commutative 96.5%

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

      13. sub-neg 96.5%

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

   3. Simplified 96.5%

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

      1. clear-num 96.5%

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

      2. inv-pow 96.5%

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

   6. Applied egg-rr 96.5%

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

      1. unpow-1 96.5%

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

   8. Simplified 96.5%

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

4. Final simplification 95.6%

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

Alternative 2: 90.5% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -3.4e+128) (not (<= t 1.25e+38)))
   (+ x (* y (/ (- z a) t)))
   (fma (- z t) (/ y (- t a)) (+ x y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -3.3999999999999999e128 or 1.24999999999999992e38 < t

   1. Initial program 51.9%

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

   3. Taylor expanded in t around -inf 79.2%

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

      1. mul-1-neg 79.2%

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

      2. unsub-neg 79.2%

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

      3. *-commutative 79.2%

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

   5. Simplified 79.2%

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

   6. Taylor expanded in y around 0 80.4%

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

      1. associate-*r/ 93.7%

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

   8. Simplified 93.7%

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

   if -3.3999999999999999e128 < t < 1.24999999999999992e38

   1. Initial program 92.2%

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

      1. sub-neg 92.2%

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

      2. +-commutative 92.2%

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

      3. distribute-frac-neg 92.2%

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

      4. distribute-rgt-neg-out 92.2%

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

      5. associate-/l* 96.4%

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

      6. fma-define 96.5%

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

      7. distribute-frac-neg 96.5%

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

      8. distribute-neg-frac2 96.5%

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

      9. sub-neg 96.5%

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

      10. distribute-neg-in 96.5%

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

      11. remove-double-neg 96.5%

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

      12. +-commutative 96.5%

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

      13. sub-neg 96.5%

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

   3. Simplified 96.5%

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

4. Final simplification 95.6%

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

Alternative 3: 90.0% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -8.2 \cdot 10^{+128} \lor \neg \left(t \leq 3 \cdot 10^{+38}\right):\\ \;\;\;\;x + y \cdot \frac{z - a}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) + \frac{y}{\frac{t - a}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -8.2e+128) (not (<= t 3e+38)))
   (+ x (* y (/ (- z a) t)))
   (+ (+ x y) (/ y (/ (- t a) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -8.2e+128) || !(t <= 3e+38)) {
		tmp = x + (y * ((z - a) / t));
	} else {
		tmp = (x + y) + (y / ((t - a) / z));
	}
	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 <= (-8.2d+128)) .or. (.not. (t <= 3d+38))) then
        tmp = x + (y * ((z - a) / t))
    else
        tmp = (x + y) + (y / ((t - a) / z))
    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 <= -8.2e+128) || !(t <= 3e+38)) {
		tmp = x + (y * ((z - a) / t));
	} else {
		tmp = (x + y) + (y / ((t - a) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (t <= -8.2e+128) or not (t <= 3e+38):
		tmp = x + (y * ((z - a) / t))
	else:
		tmp = (x + y) + (y / ((t - a) / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -8.2e+128) || !(t <= 3e+38))
		tmp = Float64(x + Float64(y * Float64(Float64(z - a) / t)));
	else
		tmp = Float64(Float64(x + y) + Float64(y / Float64(Float64(t - a) / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((t <= -8.2e+128) || ~((t <= 3e+38)))
		tmp = x + (y * ((z - a) / t));
	else
		tmp = (x + y) + (y / ((t - a) / z));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -8.20000000000000023e128 or 3.0000000000000001e38 < t

   1. Initial program 51.9%

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

   3. Taylor expanded in t around -inf 79.2%

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

      1. mul-1-neg 79.2%

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

      2. unsub-neg 79.2%

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

      3. *-commutative 79.2%

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

   5. Simplified 79.2%

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

   6. Taylor expanded in y around 0 80.4%

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

      1. associate-*r/ 93.7%

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

   8. Simplified 93.7%

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

   if -8.20000000000000023e128 < t < 3.0000000000000001e38

   1. Initial program 92.2%

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

   3. Taylor expanded in z around inf 92.3%

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

      1. associate-/l* 95.6%

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

   5. Simplified 95.6%

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

      1. clear-num 95.6%

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

      2. un-div-inv 95.7%

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

   7. Applied egg-rr 95.7%

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

4. Final simplification 95.0%

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

Alternative 4: 89.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -6 \cdot 10^{+130} \lor \neg \left(t \leq 1.65 \cdot 10^{+38}\right):\\ \;\;\;\;x + y \cdot \frac{z - a}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) - y \cdot \frac{z}{a - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -6e+130) (not (<= t 1.65e+38)))
   (+ x (* y (/ (- z a) t)))
   (- (+ x y) (* y (/ z (- a t))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -6e+130) || !(t <= 1.65e+38)) {
		tmp = x + (y * ((z - a) / t));
	} else {
		tmp = (x + y) - (y * (z / (a - 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 <= (-6d+130)) .or. (.not. (t <= 1.65d+38))) then
        tmp = x + (y * ((z - a) / t))
    else
        tmp = (x + y) - (y * (z / (a - 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 <= -6e+130) || !(t <= 1.65e+38)) {
		tmp = x + (y * ((z - a) / t));
	} else {
		tmp = (x + y) - (y * (z / (a - t)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (t <= -6e+130) or not (t <= 1.65e+38):
		tmp = x + (y * ((z - a) / t))
	else:
		tmp = (x + y) - (y * (z / (a - t)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -6e+130) || !(t <= 1.65e+38))
		tmp = Float64(x + Float64(y * Float64(Float64(z - a) / t)));
	else
		tmp = Float64(Float64(x + y) - Float64(y * Float64(z / Float64(a - t))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((t <= -6e+130) || ~((t <= 1.65e+38)))
		tmp = x + (y * ((z - a) / t));
	else
		tmp = (x + y) - (y * (z / (a - t)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.9999999999999999e130 or 1.65e38 < t

   1. Initial program 51.9%

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

   3. Taylor expanded in t around -inf 79.2%

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

      1. mul-1-neg 79.2%

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

      2. unsub-neg 79.2%

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

      3. *-commutative 79.2%

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

   5. Simplified 79.2%

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

   6. Taylor expanded in y around 0 80.4%

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

      1. associate-*r/ 93.7%

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

   8. Simplified 93.7%

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

   if -5.9999999999999999e130 < t < 1.65e38

   1. Initial program 92.2%

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

   3. Taylor expanded in z around inf 92.3%

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

      1. associate-/l* 95.6%

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

   5. Simplified 95.6%

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

4. Final simplification 95.0%

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

Alternative 5: 87.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.6 \cdot 10^{+68} \lor \neg \left(a \leq 2.1 \cdot 10^{+30}\right):\\ \;\;\;\;\left(x + y\right) - y \cdot \frac{z}{a}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{\frac{t - a}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1.6e+68) (not (<= a 2.1e+30)))
   (- (+ x y) (* y (/ z a)))
   (+ x (/ y (/ (- t a) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.6e+68) || !(a <= 2.1e+30)) {
		tmp = (x + y) - (y * (z / a));
	} else {
		tmp = x + (y / ((t - a) / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-1.6d+68)) .or. (.not. (a <= 2.1d+30))) then
        tmp = (x + y) - (y * (z / a))
    else
        tmp = x + (y / ((t - a) / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1.6e+68) || !(a <= 2.1e+30)) {
		tmp = (x + y) - (y * (z / a));
	} else {
		tmp = x + (y / ((t - a) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -1.6e+68) or not (a <= 2.1e+30):
		tmp = (x + y) - (y * (z / a))
	else:
		tmp = x + (y / ((t - a) / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1.6e+68) || !(a <= 2.1e+30))
		tmp = Float64(Float64(x + y) - Float64(y * Float64(z / a)));
	else
		tmp = Float64(x + Float64(y / Float64(Float64(t - a) / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -1.6e+68) || ~((a <= 2.1e+30)))
		tmp = (x + y) - (y * (z / a));
	else
		tmp = x + (y / ((t - a) / z));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.59999999999999997e68 or 2.1e30 < a

   1. Initial program 78.0%

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

   3. Taylor expanded in t around 0 81.4%

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

      1. associate-/l* 89.2%

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

   5. Simplified 89.2%

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

   if -1.59999999999999997e68 < a < 2.1e30

   1. Initial program 79.6%

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

   3. Taylor expanded in z around inf 80.5%

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

      1. associate-/l* 81.8%

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

   5. Simplified 81.8%

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

      1. clear-num 81.8%

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

      2. un-div-inv 81.9%

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

   7. Applied egg-rr 81.9%

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

   8. Taylor expanded in x around inf 91.9%

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

4. Final simplification 90.8%

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

Alternative 6: 84.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.3 \cdot 10^{+68} \lor \neg \left(a \leq 4 \cdot 10^{+171}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{\frac{t - a}{z}}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.3e+68) (not (<= a 4e+171)))
   (+ x y)
   (+ x (/ y (/ (- t a) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.3e+68) || !(a <= 4e+171)) {
		tmp = x + y;
	} else {
		tmp = x + (y / ((t - a) / z));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-2.3d+68)) .or. (.not. (a <= 4d+171))) then
        tmp = x + y
    else
        tmp = x + (y / ((t - a) / z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.3e+68) || !(a <= 4e+171)) {
		tmp = x + y;
	} else {
		tmp = x + (y / ((t - a) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -2.3e+68) or not (a <= 4e+171):
		tmp = x + y
	else:
		tmp = x + (y / ((t - a) / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.3e+68) || !(a <= 4e+171))
		tmp = Float64(x + y);
	else
		tmp = Float64(x + Float64(y / Float64(Float64(t - a) / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -2.3e+68) || ~((a <= 4e+171)))
		tmp = x + y;
	else
		tmp = x + (y / ((t - a) / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -2.3e+68], N[Not[LessEqual[a, 4e+171]], $MachinePrecision]], N[(x + y), $MachinePrecision], N[(x + N[(y / N[(N[(t - a), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.3e68 or 3.99999999999999982e171 < a

   1. Initial program 77.9%

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

      1. sub-neg 77.9%

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

      2. +-commutative 77.9%

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

      3. distribute-frac-neg 77.9%

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

      4. distribute-rgt-neg-out 77.9%

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

      5. associate-/l* 92.7%

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

      6. fma-define 92.9%

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

      7. distribute-frac-neg 92.9%

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

      8. distribute-neg-frac2 92.9%

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

      9. sub-neg 92.9%

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

      10. distribute-neg-in 92.9%

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

      11. remove-double-neg 92.9%

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

      12. +-commutative 92.9%

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

      13. sub-neg 92.9%

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

   3. Simplified 92.9%

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

   5. Taylor expanded in a around inf 85.0%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 85.0%

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

   7. Simplified 85.0%

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

   if -2.3e68 < a < 3.99999999999999982e171

   1. Initial program 79.4%

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

   3. Taylor expanded in z around inf 80.2%

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

      1. associate-/l* 82.3%

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

   5. Simplified 82.3%

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

      1. clear-num 82.3%

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

      2. un-div-inv 82.3%

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

   7. Applied egg-rr 82.3%

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

   8. Taylor expanded in x around inf 89.4%

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

4. Final simplification 88.0%

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

Alternative 7: 84.0% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.6 \cdot 10^{+68} \lor \neg \left(a \leq 6.9 \cdot 10^{+168}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z}{t - a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.6e+68) (not (<= a 6.9e+168)))
   (+ x y)
   (+ x (* y (/ z (- t a))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.6e+68) || !(a <= 6.9e+168)) {
		tmp = x + y;
	} else {
		tmp = x + (y * (z / (t - a)));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if ((a <= (-2.6d+68)) .or. (.not. (a <= 6.9d+168))) then
        tmp = x + y
    else
        tmp = x + (y * (z / (t - a)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.6e+68) || !(a <= 6.9e+168)) {
		tmp = x + y;
	} else {
		tmp = x + (y * (z / (t - a)));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -2.6e+68) or not (a <= 6.9e+168):
		tmp = x + y
	else:
		tmp = x + (y * (z / (t - a)))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.6e+68) || !(a <= 6.9e+168))
		tmp = Float64(x + y);
	else
		tmp = Float64(x + Float64(y * Float64(z / Float64(t - a))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -2.6e+68) || ~((a <= 6.9e+168)))
		tmp = x + y;
	else
		tmp = x + (y * (z / (t - a)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.5999999999999998e68 or 6.8999999999999998e168 < a

   1. Initial program 77.9%

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

      1. sub-neg 77.9%

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

      2. +-commutative 77.9%

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

      3. distribute-frac-neg 77.9%

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

      4. distribute-rgt-neg-out 77.9%

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

      5. associate-/l* 92.7%

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

      6. fma-define 92.9%

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

      7. distribute-frac-neg 92.9%

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

      8. distribute-neg-frac2 92.9%

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

      9. sub-neg 92.9%

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

      10. distribute-neg-in 92.9%

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

      11. remove-double-neg 92.9%

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

      12. +-commutative 92.9%

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

      13. sub-neg 92.9%

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

   3. Simplified 92.9%

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

   5. Taylor expanded in a around inf 85.0%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 85.0%

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

   7. Simplified 85.0%

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

   if -2.5999999999999998e68 < a < 6.8999999999999998e168

   1. Initial program 79.4%

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

   3. Taylor expanded in z around inf 80.2%

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

      1. associate-/l* 82.3%

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

   5. Simplified 82.3%

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

   6. Taylor expanded in x around inf 89.3%

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

4. Final simplification 88.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -2.6 \cdot 10^{+68} \lor \neg \left(a \leq 6.9 \cdot 10^{+168}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z}{t - a}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 87.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2 \cdot 10^{+55}:\\ \;\;\;\;\left(x + y\right) - \frac{y}{\frac{a}{z}}\\ \mathbf{elif}\;a \leq 2.7 \cdot 10^{+31}:\\ \;\;\;\;x + \frac{y}{\frac{t - a}{z}}\\ \mathbf{else}:\\ \;\;\;\;\left(x + y\right) - y \cdot \frac{z}{a}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2e+55)
   (- (+ x y) (/ y (/ a z)))
   (if (<= a 2.7e+31) (+ x (/ y (/ (- t a) z))) (- (+ x y) (* y (/ z a))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2e+55) {
		tmp = (x + y) - (y / (a / z));
	} else if (a <= 2.7e+31) {
		tmp = x + (y / ((t - a) / z));
	} else {
		tmp = (x + y) - (y * (z / a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (a <= (-2d+55)) then
        tmp = (x + y) - (y / (a / z))
    else if (a <= 2.7d+31) then
        tmp = x + (y / ((t - a) / z))
    else
        tmp = (x + y) - (y * (z / a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2e+55) {
		tmp = (x + y) - (y / (a / z));
	} else if (a <= 2.7e+31) {
		tmp = x + (y / ((t - a) / z));
	} else {
		tmp = (x + y) - (y * (z / a));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -2.00000000000000002e55

   1. Initial program 83.3%

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

   3. Taylor expanded in z around inf 84.8%

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

      1. associate-/l* 92.3%

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

   5. Simplified 92.3%

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

      1. clear-num 92.3%

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

      2. un-div-inv 92.4%

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

   7. Applied egg-rr 92.4%

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

   8. Taylor expanded in a around inf 92.0%

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

   if -2.00000000000000002e55 < a < 2.69999999999999986e31

   1. Initial program 79.4%

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

   3. Taylor expanded in z around inf 80.2%

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

      1. associate-/l* 81.6%

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

   5. Simplified 81.6%

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

      1. clear-num 81.6%

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

      2. un-div-inv 81.6%

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

   7. Applied egg-rr 81.6%

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

   8. Taylor expanded in x around inf 91.8%

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

   if 2.69999999999999986e31 < a

   1. Initial program 74.2%

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

   3. Taylor expanded in t around 0 79.3%

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

      1. associate-/l* 87.2%

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

   5. Simplified 87.2%

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

4. Final simplification 90.8%

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

Alternative 9: 77.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.4 \cdot 10^{+47} \lor \neg \left(a \leq 2.2 \cdot 10^{+31}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.4e+47) (not (<= a 2.2e+31))) (+ x y) (+ x (* y (/ z t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.4e+47) || !(a <= 2.2e+31)) {
		tmp = x + y;
	} else {
		tmp = x + (y * (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 ((a <= (-2.4d+47)) .or. (.not. (a <= 2.2d+31))) then
        tmp = x + y
    else
        tmp = x + (y * (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 ((a <= -2.4e+47) || !(a <= 2.2e+31)) {
		tmp = x + y;
	} else {
		tmp = x + (y * (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -2.4e+47) or not (a <= 2.2e+31):
		tmp = x + y
	else:
		tmp = x + (y * (z / t))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.4e+47) || !(a <= 2.2e+31))
		tmp = Float64(x + y);
	else
		tmp = Float64(x + Float64(y * Float64(z / t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -2.4e+47) || ~((a <= 2.2e+31)))
		tmp = x + y;
	else
		tmp = x + (y * (z / t));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.40000000000000019e47 or 2.2000000000000001e31 < a

   1. Initial program 78.6%

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

      1. sub-neg 78.6%

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

      2. +-commutative 78.6%

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

      3. distribute-frac-neg 78.6%

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

      4. distribute-rgt-neg-out 78.6%

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

      5. associate-/l* 90.3%

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

      6. fma-define 90.5%

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

      7. distribute-frac-neg 90.5%

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

      8. distribute-neg-frac2 90.5%

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

      9. sub-neg 90.5%

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

      10. distribute-neg-in 90.5%

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

      11. remove-double-neg 90.5%

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

      12. +-commutative 90.5%

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

      13. sub-neg 90.5%

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

   3. Simplified 90.5%

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

   5. Taylor expanded in a around inf 78.5%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 78.5%

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

   7. Simplified 78.5%

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

   if -2.40000000000000019e47 < a < 2.2000000000000001e31

   1. Initial program 79.2%

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

   3. Taylor expanded in z around inf 80.1%

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

      1. associate-/l* 81.4%

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

   5. Simplified 81.4%

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

   6. Taylor expanded in x around inf 91.8%

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

   7. Taylor expanded in a around 0 79.6%

      \[\leadsto \color{blue}{x - -1 \cdot \frac{y \cdot z}{t}} \]
   8. Step-by-step derivation

      1. cancel-sign-sub-inv 79.6%

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

      2. metadata-eval 79.6%

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

      3. associate-*r/ 82.9%

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

      4. *-lft-identity 82.9%

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

   9. Simplified 82.9%

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

4. Final simplification 81.0%

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

Alternative 10: 63.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.3 \cdot 10^{+101} \lor \neg \left(z \leq 8.6 \cdot 10^{+103}\right):\\ \;\;\;\;y \cdot \frac{z}{t - a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= z -1.3e+101) (not (<= z 8.6e+103))) (* y (/ z (- t a))) (+ x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((z <= -1.3e+101) || !(z <= 8.6e+103)) {
		tmp = y * (z / (t - a));
	} else {
		tmp = x + 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 ((z <= (-1.3d+101)) .or. (.not. (z <= 8.6d+103))) then
        tmp = y * (z / (t - a))
    else
        tmp = x + 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 ((z <= -1.3e+101) || !(z <= 8.6e+103)) {
		tmp = y * (z / (t - a));
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (z <= -1.3e+101) or not (z <= 8.6e+103):
		tmp = y * (z / (t - a))
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((z <= -1.3e+101) || !(z <= 8.6e+103))
		tmp = Float64(y * Float64(z / Float64(t - a)));
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((z <= -1.3e+101) || ~((z <= 8.6e+103)))
		tmp = y * (z / (t - a));
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.3e101 or 8.59999999999999938e103 < z

   1. Initial program 77.1%

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

      1. sub-neg 77.1%

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

      2. +-commutative 77.1%

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

      3. distribute-frac-neg 77.1%

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

      4. distribute-rgt-neg-out 77.1%

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

      5. associate-/l* 88.9%

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

      6. fma-define 89.0%

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

      7. distribute-frac-neg 89.0%

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

      8. distribute-neg-frac2 89.0%

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

      9. sub-neg 89.0%

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

      10. distribute-neg-in 89.0%

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

      11. remove-double-neg 89.0%

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

      12. +-commutative 89.0%

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

      13. sub-neg 89.0%

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

   3. Simplified 89.0%

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

   5. Taylor expanded in z around inf 60.0%

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

      1. associate-/l* 64.2%

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

   7. Simplified 64.2%

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

   if -1.3e101 < z < 8.59999999999999938e103

   1. Initial program 79.9%

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

      1. sub-neg 79.9%

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

      2. +-commutative 79.9%

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

      3. distribute-frac-neg 79.9%

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

      4. distribute-rgt-neg-out 79.9%

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

      5. associate-/l* 83.7%

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

      6. fma-define 83.8%

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

      7. distribute-frac-neg 83.8%

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

      8. distribute-neg-frac2 83.8%

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

      9. sub-neg 83.8%

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

      10. distribute-neg-in 83.8%

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

      11. remove-double-neg 83.8%

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

      12. +-commutative 83.8%

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

      13. sub-neg 83.8%

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

   3. Simplified 83.8%

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

   5. Taylor expanded in a around inf 71.3%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 71.3%

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

   7. Simplified 71.3%

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

4. Final simplification 68.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.3 \cdot 10^{+101} \lor \neg \left(z \leq 8.6 \cdot 10^{+103}\right):\\ \;\;\;\;y \cdot \frac{z}{t - a}\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 63.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.5e+101)
   (* z (/ y (- t a)))
   (if (<= z 1.25e+106) (+ x y) (* y (/ z (- t a))))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.5e+101) {
		tmp = z * (y / (t - a));
	} else if (z <= 1.25e+106) {
		tmp = x + y;
	} else {
		tmp = y * (z / (t - a));
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z <= (-3.5d+101)) then
        tmp = z * (y / (t - a))
    else if (z <= 1.25d+106) then
        tmp = x + y
    else
        tmp = y * (z / (t - a))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -3.5e+101) {
		tmp = z * (y / (t - a));
	} else if (z <= 1.25e+106) {
		tmp = x + y;
	} else {
		tmp = y * (z / (t - a));
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -3.50000000000000023e101

   1. Initial program 77.8%

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

      1. sub-neg 77.8%

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

      2. +-commutative 77.8%

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

      3. distribute-frac-neg 77.8%

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

      4. distribute-rgt-neg-out 77.8%

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

      5. associate-/l* 87.7%

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

      6. fma-define 87.7%

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

      7. distribute-frac-neg 87.7%

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

      8. distribute-neg-frac2 87.7%

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

      9. sub-neg 87.7%

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

      10. distribute-neg-in 87.7%

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

      11. remove-double-neg 87.7%

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

      12. +-commutative 87.7%

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

      13. sub-neg 87.7%

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

   3. Simplified 87.7%

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

   5. Taylor expanded in z around inf 61.1%

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

      1. *-commutative 61.1%

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

      2. *-lft-identity 61.1%

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

      3. times-frac 64.0%

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

      4. /-rgt-identity 64.0%

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

   7. Simplified 64.0%

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

   if -3.50000000000000023e101 < z < 1.25e106

   1. Initial program 79.9%

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

      1. sub-neg 79.9%

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

      2. +-commutative 79.9%

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

      3. distribute-frac-neg 79.9%

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

      4. distribute-rgt-neg-out 79.9%

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

      5. associate-/l* 83.7%

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

      6. fma-define 83.8%

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

      7. distribute-frac-neg 83.8%

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

      8. distribute-neg-frac2 83.8%

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

      9. sub-neg 83.8%

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

      10. distribute-neg-in 83.8%

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

      11. remove-double-neg 83.8%

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

      12. +-commutative 83.8%

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

      13. sub-neg 83.8%

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

   3. Simplified 83.8%

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

   5. Taylor expanded in a around inf 71.3%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 71.3%

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

   7. Simplified 71.3%

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

   if 1.25e106 < z

   1. Initial program 76.5%

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

      1. sub-neg 76.5%

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

      2. +-commutative 76.5%

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

      3. distribute-frac-neg 76.5%

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

      4. distribute-rgt-neg-out 76.5%

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

      5. associate-/l* 89.9%

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

      6. fma-define 90.1%

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

      7. distribute-frac-neg 90.1%

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

      8. distribute-neg-frac2 90.1%

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

      9. sub-neg 90.1%

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

      10. distribute-neg-in 90.1%

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

      11. remove-double-neg 90.1%

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

      12. +-commutative 90.1%

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

      13. sub-neg 90.1%

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

   3. Simplified 90.1%

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

   5. Taylor expanded in z around inf 59.2%

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

      1. associate-/l* 64.9%

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

   7. Simplified 64.9%

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

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -3.5 \cdot 10^{+101}:\\ \;\;\;\;z \cdot \frac{y}{t - a}\\ \mathbf{elif}\;z \leq 1.25 \cdot 10^{+106}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{z}{t - a}\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 60.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.2 \cdot 10^{-137} \lor \neg \left(a \leq 2.65 \cdot 10^{-192}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -2.2e-137) (not (<= a 2.65e-192))) (+ x y) (* y (/ z t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -2.2e-137) || !(a <= 2.65e-192)) {
		tmp = x + y;
	} else {
		tmp = y * (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 ((a <= (-2.2d-137)) .or. (.not. (a <= 2.65d-192))) then
        tmp = x + y
    else
        tmp = y * (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 ((a <= -2.2e-137) || !(a <= 2.65e-192)) {
		tmp = x + y;
	} else {
		tmp = y * (z / t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -2.2e-137) or not (a <= 2.65e-192):
		tmp = x + y
	else:
		tmp = y * (z / t)
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -2.2e-137) || !(a <= 2.65e-192))
		tmp = Float64(x + y);
	else
		tmp = Float64(y * Float64(z / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -2.2e-137) || ~((a <= 2.65e-192)))
		tmp = x + y;
	else
		tmp = y * (z / t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -2.2000000000000001e-137 or 2.64999999999999985e-192 < a

   1. Initial program 80.0%

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

      1. sub-neg 80.0%

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

      2. +-commutative 80.0%

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

      3. distribute-frac-neg 80.0%

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

      4. distribute-rgt-neg-out 80.0%

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

      5. associate-/l* 87.7%

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

      6. fma-define 87.7%

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

      7. distribute-frac-neg 87.7%

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

      8. distribute-neg-frac2 87.7%

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

      9. sub-neg 87.7%

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

      10. distribute-neg-in 87.7%

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

      11. remove-double-neg 87.7%

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

      12. +-commutative 87.7%

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

      13. sub-neg 87.7%

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

   3. Simplified 87.7%

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

   5. Taylor expanded in a around inf 68.6%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 68.6%

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

   7. Simplified 68.6%

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

   if -2.2000000000000001e-137 < a < 2.64999999999999985e-192

   1. Initial program 75.9%

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

      1. sub-neg 75.9%

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

      2. +-commutative 75.9%

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

      3. distribute-frac-neg 75.9%

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

      4. distribute-rgt-neg-out 75.9%

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

      5. associate-/l* 79.1%

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

      6. fma-define 79.3%

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

      7. distribute-frac-neg 79.3%

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

      8. distribute-neg-frac2 79.3%

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

      9. sub-neg 79.3%

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

      10. distribute-neg-in 79.3%

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

      11. remove-double-neg 79.3%

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

      12. +-commutative 79.3%

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

      13. sub-neg 79.3%

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

   3. Simplified 79.3%

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

   5. Taylor expanded in z around inf 62.1%

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

   6. Taylor expanded in t around inf 55.6%

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

      1. associate-/l* 57.1%

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

   8. Simplified 57.1%

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

4. Final simplification 65.7%

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

Alternative 13: 53.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.5 \cdot 10^{+186}:\\ \;\;\;\;y\\ \mathbf{elif}\;y \leq 6.7 \cdot 10^{+145}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= y -2.5e+186) y (if (<= y 6.7e+145) x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (y <= -2.5e+186) {
		tmp = y;
	} else if (y <= 6.7e+145) {
		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 (y <= (-2.5d+186)) then
        tmp = y
    else if (y <= 6.7d+145) 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 (y <= -2.5e+186) {
		tmp = y;
	} else if (y <= 6.7e+145) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if y <= -2.5e+186:
		tmp = y
	elif y <= 6.7e+145:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (y <= -2.5e+186)
		tmp = y;
	elseif (y <= 6.7e+145)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (y <= -2.5e+186)
		tmp = y;
	elseif (y <= 6.7e+145)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[y, -2.5e+186], y, If[LessEqual[y, 6.7e+145], x, y]]

Derivation

1. Split input into 2 regimes

2. if y < -2.49999999999999977e186 or 6.6999999999999996e145 < y

   1. Initial program 67.1%

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

      1. sub-neg 67.1%

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

      2. +-commutative 67.1%

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

      3. distribute-frac-neg 67.1%

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

      4. distribute-rgt-neg-out 67.1%

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

      5. associate-/l* 83.4%

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

      6. fma-define 83.6%

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

      7. distribute-frac-neg 83.6%

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

      8. distribute-neg-frac2 83.6%

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

      9. sub-neg 83.6%

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

      10. distribute-neg-in 83.6%

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

      11. remove-double-neg 83.6%

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

      12. +-commutative 83.6%

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

      13. sub-neg 83.6%

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

   3. Simplified 83.6%

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

   5. Taylor expanded in a around inf 42.9%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 42.9%

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

   7. Simplified 42.9%

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

   8. Taylor expanded in y around inf 37.7%

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

   if -2.49999999999999977e186 < y < 6.6999999999999996e145

   1. Initial program 83.4%

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

      1. sub-neg 83.4%

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

      2. +-commutative 83.4%

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

      3. distribute-frac-neg 83.4%

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

      4. distribute-rgt-neg-out 83.4%

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

      5. associate-/l* 86.3%

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

      6. fma-define 86.3%

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

      7. distribute-frac-neg 86.3%

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

      8. distribute-neg-frac2 86.3%

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

      9. sub-neg 86.3%

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

      10. distribute-neg-in 86.3%

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

      11. remove-double-neg 86.3%

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

      12. +-commutative 86.3%

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

      13. sub-neg 86.3%

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

   3. Simplified 86.3%

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

   5. Taylor expanded in t around inf 60.3%

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

      1. distribute-rgt1-in 60.3%

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

      2. metadata-eval 60.3%

         \[\leadsto x + \color{blue}{0} \cdot y \]

      3. mul0-lft 60.3%

         \[\leadsto x + \color{blue}{0} \]

   7. Simplified 60.3%

      \[\leadsto \color{blue}{x + 0} \]

   8. Taylor expanded in x around 0 60.3%

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

Alternative 14: 61.6% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq 1.4 \cdot 10^{+43}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (if (<= t 1.4e+43) (+ x y) x))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= 1.4e+43) {
		tmp = x + y;
	} else {
		tmp = x;
	}
	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 <= 1.4d+43) then
        tmp = x + y
    else
        tmp = x
    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 <= 1.4e+43) {
		tmp = x + y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= 1.4e+43:
		tmp = x + y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= 1.4e+43)
		tmp = Float64(x + y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= 1.4e+43)
		tmp = x + y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, 1.4e+43], N[(x + y), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if t < 1.40000000000000009e43

   1. Initial program 85.2%

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

      1. sub-neg 85.2%

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

      2. +-commutative 85.2%

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

      3. distribute-frac-neg 85.2%

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

      4. distribute-rgt-neg-out 85.2%

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

      5. associate-/l* 90.6%

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

      6. fma-define 90.8%

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

      7. distribute-frac-neg 90.8%

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

      8. distribute-neg-frac2 90.8%

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

      9. sub-neg 90.8%

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

      10. distribute-neg-in 90.8%

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

      11. remove-double-neg 90.8%

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

      12. +-commutative 90.8%

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

      13. sub-neg 90.8%

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

   3. Simplified 90.8%

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

   5. Taylor expanded in a around inf 59.5%

      \[\leadsto \color{blue}{x + y} \]
   6. Step-by-step derivation

      1. +-commutative 59.5%

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

   7. Simplified 59.5%

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

   if 1.40000000000000009e43 < t

   1. Initial program 55.4%

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

      1. sub-neg 55.4%

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

      2. +-commutative 55.4%

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

      3. distribute-frac-neg 55.4%

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

      4. distribute-rgt-neg-out 55.4%

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

      5. associate-/l* 66.3%

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

      6. fma-define 66.2%

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

      7. distribute-frac-neg 66.2%

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

      8. distribute-neg-frac2 66.2%

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

      9. sub-neg 66.2%

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

      10. distribute-neg-in 66.2%

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

      11. remove-double-neg 66.2%

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

      12. +-commutative 66.2%

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

      13. sub-neg 66.2%

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

   3. Simplified 66.2%

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

   5. Taylor expanded in t around inf 67.2%

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

      1. distribute-rgt1-in 67.2%

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

      2. metadata-eval 67.2%

         \[\leadsto x + \color{blue}{0} \cdot y \]

      3. mul0-lft 67.2%

         \[\leadsto x + \color{blue}{0} \]

   7. Simplified 67.2%

      \[\leadsto \color{blue}{x + 0} \]

   8. Taylor expanded in x around 0 67.2%

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

4. Final simplification 61.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 1.4 \cdot 10^{+43}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 15: 50.8% 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 78.9%

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

   1. sub-neg 78.9%

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

   2. +-commutative 78.9%

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

   3. distribute-frac-neg 78.9%

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

   4. distribute-rgt-neg-out 78.9%

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

   5. associate-/l* 85.5%

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

   6. fma-define 85.6%

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

   7. distribute-frac-neg 85.6%

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

   8. distribute-neg-frac2 85.6%

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

   9. sub-neg 85.6%

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

   10. distribute-neg-in 85.6%

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

   11. remove-double-neg 85.6%

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

   12. +-commutative 85.6%

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

   13. sub-neg 85.6%

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

3. Simplified 85.6%

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

5. Taylor expanded in t around inf 47.1%

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

   1. distribute-rgt1-in 47.1%

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

   2. metadata-eval 47.1%

      \[\leadsto x + \color{blue}{0} \cdot y \]

   3. mul0-lft 47.1%

      \[\leadsto x + \color{blue}{0} \]

7. Simplified 47.1%

   \[\leadsto \color{blue}{x + 0} \]

8. Taylor expanded in x around 0 47.1%

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

Developer Target 1: 88.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(y + x\right) - \left(\left(z - t\right) \cdot \frac{1}{a - t}\right) \cdot y\\ t_2 := \left(x + y\right) - \frac{\left(z - t\right) \cdot y}{a - t}\\ \mathbf{if}\;t\_2 < -1.3664970889390727 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 < 1.4754293444577233 \cdot 10^{-239}:\\ \;\;\;\;\frac{y \cdot \left(a - z\right) - x \cdot t}{a - t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- (+ y x) (* (* (- z t) (/ 1.0 (- a t))) y)))
        (t_2 (- (+ x y) (/ (* (- z t) y) (- a t)))))
   (if (< t_2 -1.3664970889390727e-7)
     t_1
     (if (< t_2 1.4754293444577233e-239)
       (/ (- (* y (- a z)) (* x t)) (- a t))
       t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y)
	t_2 = (x + y) - (((z - t) * y) / (a - t))
	tmp = 0
	if t_2 < -1.3664970889390727e-7:
		tmp = t_1
	elif t_2 < 1.4754293444577233e-239:
		tmp = ((y * (a - z)) - (x * t)) / (a - t)
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y + x) - (((z - t) * (1.0 / (a - t))) * y);
	t_2 = (x + y) - (((z - t) * y) / (a - t));
	tmp = 0.0;
	if (t_2 < -1.3664970889390727e-7)
		tmp = t_1;
	elseif (t_2 < 1.4754293444577233e-239)
		tmp = ((y * (a - z)) - (x * t)) / (a - t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(y + x), $MachinePrecision] - N[(N[(N[(z - t), $MachinePrecision] * N[(1.0 / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(x + y), $MachinePrecision] - N[(N[(N[(z - t), $MachinePrecision] * y), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[Less[t$95$2, -1.3664970889390727e-7], t$95$1, If[Less[t$95$2, 1.4754293444577233e-239], N[(N[(N[(y * N[(a - z), $MachinePrecision]), $MachinePrecision] - N[(x * t), $MachinePrecision]), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Reproduce

herbie shell --seed 2024185 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisTick from plot-0.2.3.4, B"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (- (+ x y) (/ (* (- z t) y) (- a t))) -13664970889390727/100000000000000000000000) (- (+ y x) (* (* (- z t) (/ 1 (- a t))) y)) (if (< (- (+ x y) (/ (* (- z t) y) (- a t))) 14754293444577233/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (/ (- (* y (- a z)) (* x t)) (- a t)) (- (+ y x) (* (* (- z t) (/ 1 (- a t))) y)))))

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