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

Percentage Accurate: 77.4% → 91.1%

Time: 11.0s

Alternatives: 12

Speedup: 0.7×

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: 77.4% 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: 91.1% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.4 \cdot 10^{+96} \lor \neg \left(t \leq 1.05 \cdot 10^{+115}\right):\\ \;\;\;\;\left(x - a \cdot \frac{y}{t}\right) + y \cdot \frac{z}{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 -1.4e+96) (not (<= t 1.05e+115)))
   (+ (- x (* a (/ y t))) (* y (/ z 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 <= -1.4e+96) || !(t <= 1.05e+115)) {
		tmp = (x - (a * (y / t))) + (y * (z / 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 <= -1.4e+96) || !(t <= 1.05e+115))
		tmp = Float64(Float64(x - Float64(a * Float64(y / t))) + Float64(y * Float64(z / 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, -1.4e+96], N[Not[LessEqual[t, 1.05e+115]], $MachinePrecision]], N[(N[(x - N[(a * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y * N[(z / 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 < -1.4e96 or 1.05000000000000002e115 < t

   1. Initial program 51.0%

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

   3. Taylor expanded in t around inf 80.8%

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

      1. sub-neg 80.8%

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

      2. mul-1-neg 80.8%

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

      3. unsub-neg 80.8%

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

      4. associate-/l* 84.0%

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

      5. mul-1-neg 84.0%

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

      6. remove-double-neg 84.0%

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

      7. associate-/l* 91.1%

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

   5. Simplified 91.1%

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

   if -1.4e96 < t < 1.05000000000000002e115

   1. Initial program 90.3%

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

      1. sub-neg 90.3%

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

      2. +-commutative 90.3%

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

      3. distribute-frac-neg 90.3%

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

      4. distribute-rgt-neg-out 90.3%

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

      5. associate-/l* 91.9%

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

      6. fma-define 91.9%

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

      7. distribute-frac-neg 91.9%

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

      8. distribute-neg-frac2 91.9%

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

      9. sub-neg 91.9%

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

      10. distribute-neg-in 91.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 91.9%

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

      12. +-commutative 91.9%

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

      13. sub-neg 91.9%

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

   3. Simplified 91.9%

      \[\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 91.7%

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

Alternative 2: 88.6% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.5 \cdot 10^{+16} \lor \neg \left(a \leq 9.2 \cdot 10^{+86}\right):\\ \;\;\;\;\left(x + y\right) + y \cdot \frac{z}{t - 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 -3.5e+16) (not (<= a 9.2e+86)))
   (+ (+ x y) (* y (/ z (- t a))))
   (+ x (/ y (/ (- t a) z)))))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -3.5e+16) or not (a <= 9.2e+86):
		tmp = (x + y) + (y * (z / (t - a)))
	else:
		tmp = x + (y / ((t - a) / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -3.5e+16) || !(a <= 9.2e+86))
		tmp = Float64(Float64(x + y) + Float64(y * Float64(z / Float64(t - 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 <= -3.5e+16) || ~((a <= 9.2e+86)))
		tmp = (x + y) + (y * (z / (t - a)));
	else
		tmp = x + (y / ((t - a) / z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -3.5e+16], N[Not[LessEqual[a, 9.2e+86]], $MachinePrecision]], N[(N[(x + y), $MachinePrecision] + N[(y * N[(z / N[(t - a), $MachinePrecision]), $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 < -3.5e16 or 9.19999999999999958e86 < a

   1. Initial program 83.0%

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

   3. Taylor expanded in z around inf 86.1%

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

      1. associate-/l* 93.0%

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

   5. Simplified 93.0%

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

   if -3.5e16 < a < 9.19999999999999958e86

   1. Initial program 73.8%

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

   3. Taylor expanded in z around inf 71.5%

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

      1. associate-/l* 71.2%

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

   5. Simplified 71.2%

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

      1. clear-num 71.2%

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

      2. un-div-inv 71.3%

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

   7. Applied egg-rr 71.3%

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

   8. Taylor expanded in x around inf 90.4%

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

4. Final simplification 91.5%

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

Alternative 3: 88.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y / ((t - a) / z);
	double tmp;
	if (a <= -6.2e+15) {
		tmp = (x + y) + (y * (z / (t - a)));
	} else if (a <= 3.4e+86) {
		tmp = x + t_1;
	} else {
		tmp = (x + y) + t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = y / ((t - a) / z)
    if (a <= (-6.2d+15)) then
        tmp = (x + y) + (y * (z / (t - a)))
    else if (a <= 3.4d+86) then
        tmp = x + t_1
    else
        tmp = (x + y) + 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 / ((t - a) / z);
	double tmp;
	if (a <= -6.2e+15) {
		tmp = (x + y) + (y * (z / (t - a)));
	} else if (a <= 3.4e+86) {
		tmp = x + t_1;
	} else {
		tmp = (x + y) + t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -6.2e15

   1. Initial program 89.0%

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

   3. Taylor expanded in z around inf 89.6%

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

      1. associate-/l* 95.5%

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

   5. Simplified 95.5%

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

   if -6.2e15 < a < 3.3999999999999998e86

   1. Initial program 73.8%

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

   3. Taylor expanded in z around inf 71.5%

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

      1. associate-/l* 71.2%

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

   5. Simplified 71.2%

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

      1. clear-num 71.2%

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

      2. un-div-inv 71.3%

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

   7. Applied egg-rr 71.3%

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

   8. Taylor expanded in x around inf 90.4%

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

   if 3.3999999999999998e86 < a

   1. Initial program 74.0%

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

   3. Taylor expanded in z around inf 80.8%

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

      1. associate-/l* 89.4%

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

   5. Simplified 89.4%

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

      1. clear-num 89.4%

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

      2. un-div-inv 89.4%

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

   7. Applied egg-rr 89.4%

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

4. Final simplification 91.5%

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

Alternative 4: 87.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -5.8 \cdot 10^{+14} \lor \neg \left(a \leq 4 \cdot 10^{+86}\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 -5.8e+14) (not (<= a 4e+86)))
   (- (+ 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 <= -5.8e+14) || !(a <= 4e+86)) {
		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 <= (-5.8d+14)) .or. (.not. (a <= 4d+86))) 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 <= -5.8e+14) || !(a <= 4e+86)) {
		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 <= -5.8e+14) or not (a <= 4e+86):
		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 <= -5.8e+14) || !(a <= 4e+86))
		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 <= -5.8e+14) || ~((a <= 4e+86)))
		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, -5.8e+14], N[Not[LessEqual[a, 4e+86]], $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 < -5.8e14 or 4.0000000000000001e86 < a

   1. Initial program 83.0%

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

   3. Taylor expanded in t around 0 84.1%

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

      1. associate-/l* 90.5%

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

   5. Simplified 90.5%

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

   if -5.8e14 < a < 4.0000000000000001e86

   1. Initial program 73.8%

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

   3. Taylor expanded in z around inf 71.5%

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

      1. associate-/l* 71.2%

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

   5. Simplified 71.2%

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

      1. clear-num 71.2%

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

      2. un-div-inv 71.3%

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

   7. Applied egg-rr 71.3%

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

   8. Taylor expanded in x around inf 90.4%

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

4. Final simplification 90.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -5.8 \cdot 10^{+14} \lor \neg \left(a \leq 4 \cdot 10^{+86}\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 5: 83.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -8 \cdot 10^{+16} \lor \neg \left(a \leq 3.8 \cdot 10^{+179}\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 -8e+16) (not (<= a 3.8e+179)))
   (+ x y)
   (+ x (/ y (/ (- t a) z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -8e+16) || !(a <= 3.8e+179)) {
		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 <= (-8d+16)) .or. (.not. (a <= 3.8d+179))) 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 <= -8e+16) || !(a <= 3.8e+179)) {
		tmp = x + y;
	} else {
		tmp = x + (y / ((t - a) / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -8e+16) or not (a <= 3.8e+179):
		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 <= -8e+16) || !(a <= 3.8e+179))
		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 <= -8e+16) || ~((a <= 3.8e+179)))
		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, -8e+16], N[Not[LessEqual[a, 3.8e+179]], $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 < -8e16 or 3.8e179 < a

   1. Initial program 86.9%

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

      1. sub-neg 86.9%

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

      2. +-commutative 86.9%

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

      3. distribute-frac-neg 86.9%

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

      4. distribute-rgt-neg-out 86.9%

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

      5. associate-/l* 94.8%

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

      6. fma-define 94.7%

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

      7. distribute-frac-neg 94.7%

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

      8. distribute-neg-frac2 94.7%

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

      9. sub-neg 94.7%

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

      10. distribute-neg-in 94.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 94.7%

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

      12. +-commutative 94.7%

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

      13. sub-neg 94.7%

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

   3. Simplified 94.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 86.4%

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

      1. +-commutative 86.4%

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

   7. Simplified 86.4%

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

   if -8e16 < a < 3.8e179

   1. Initial program 72.5%

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

   3. Taylor expanded in z around inf 72.0%

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

      1. associate-/l* 71.8%

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

   5. Simplified 71.8%

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

      1. clear-num 71.8%

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

      2. un-div-inv 71.8%

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

   7. Applied egg-rr 71.8%

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

   8. Taylor expanded in x around inf 88.6%

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

4. Final simplification 87.8%

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

Alternative 6: 62.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{-118}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;a \leq 3 \cdot 10^{-246}:\\ \;\;\;\;y \cdot \frac{z}{t - a}\\ \mathbf{elif}\;a \leq 1.32 \cdot 10^{+92}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -4.8e-118)
   (+ x y)
   (if (<= a 3e-246) (* y (/ z (- t a))) (if (<= a 1.32e+92) x (+ x y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -4.8e-118) {
		tmp = x + y;
	} else if (a <= 3e-246) {
		tmp = y * (z / (t - a));
	} else if (a <= 1.32e+92) {
		tmp = x;
	} 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 (a <= (-4.8d-118)) then
        tmp = x + y
    else if (a <= 3d-246) then
        tmp = y * (z / (t - a))
    else if (a <= 1.32d+92) then
        tmp = x
    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 (a <= -4.8e-118) {
		tmp = x + y;
	} else if (a <= 3e-246) {
		tmp = y * (z / (t - a));
	} else if (a <= 1.32e+92) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -4.8e-118:
		tmp = x + y
	elif a <= 3e-246:
		tmp = y * (z / (t - a))
	elif a <= 1.32e+92:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -4.8e-118)
		tmp = Float64(x + y);
	elseif (a <= 3e-246)
		tmp = Float64(y * Float64(z / Float64(t - a)));
	elseif (a <= 1.32e+92)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -4.8e-118)
		tmp = x + y;
	elseif (a <= 3e-246)
		tmp = y * (z / (t - a));
	elseif (a <= 1.32e+92)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -4.8e-118], N[(x + y), $MachinePrecision], If[LessEqual[a, 3e-246], N[(y * N[(z / N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.32e+92], x, N[(x + y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -4.8000000000000003e-118 or 1.32000000000000007e92 < a

   1. Initial program 82.1%

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

      1. sub-neg 82.1%

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

      2. +-commutative 82.1%

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

      3. distribute-frac-neg 82.1%

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

      4. distribute-rgt-neg-out 82.1%

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

      5. associate-/l* 90.1%

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

      6. fma-define 90.0%

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

      7. distribute-frac-neg 90.0%

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

      8. distribute-neg-frac2 90.0%

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

      9. sub-neg 90.0%

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

      10. distribute-neg-in 90.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 90.0%

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

      12. +-commutative 90.0%

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

      13. sub-neg 90.0%

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

   3. Simplified 90.0%

      \[\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 -4.8000000000000003e-118 < a < 3e-246

   1. Initial program 71.0%

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

      1. sub-neg 71.0%

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

      2. +-commutative 71.0%

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

      3. distribute-frac-neg 71.0%

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

      4. distribute-rgt-neg-out 71.0%

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

      5. associate-/l* 69.2%

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

      6. fma-define 69.2%

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

      7. distribute-frac-neg 69.2%

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

      8. distribute-neg-frac2 69.2%

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

      9. sub-neg 69.2%

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

      10. distribute-neg-in 69.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 69.2%

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

      12. +-commutative 69.2%

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

      13. sub-neg 69.2%

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

   3. Simplified 69.2%

      \[\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 57.1%

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

      1. associate-/l* 60.7%

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

   7. Simplified 60.7%

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

   if 3e-246 < a < 1.32000000000000007e92

   1. Initial program 74.3%

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

      1. sub-neg 74.3%

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

      2. +-commutative 74.3%

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

      3. distribute-frac-neg 74.3%

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

      4. distribute-rgt-neg-out 74.3%

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

      5. associate-/l* 74.0%

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

      6. fma-define 73.8%

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

      7. distribute-frac-neg 73.8%

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

      8. distribute-neg-frac2 73.8%

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

      9. sub-neg 73.8%

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

      10. distribute-neg-in 73.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 73.8%

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

      12. +-commutative 73.8%

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

      13. sub-neg 73.8%

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

   3. Simplified 73.8%

      \[\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 63.1%

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

      1. distribute-rgt1-in 63.1%

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

      2. metadata-eval 63.1%

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

      3. mul0-lft 63.1%

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

   7. Simplified 63.1%

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

   8. Taylor expanded in x around 0 63.1%

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

4. Final simplification 70.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{-118}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;a \leq 3 \cdot 10^{-246}:\\ \;\;\;\;y \cdot \frac{z}{t - a}\\ \mathbf{elif}\;a \leq 1.32 \cdot 10^{+92}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 61.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{-121}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;a \leq 1.05 \cdot 10^{-276}:\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{elif}\;a \leq 1.2 \cdot 10^{+97}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -3.1e-121)
   (+ x y)
   (if (<= a 1.05e-276) (* y (/ z t)) (if (<= a 1.2e+97) x (+ x y)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -3.1e-121) {
		tmp = x + y;
	} else if (a <= 1.05e-276) {
		tmp = y * (z / t);
	} else if (a <= 1.2e+97) {
		tmp = x;
	} 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 (a <= (-3.1d-121)) then
        tmp = x + y
    else if (a <= 1.05d-276) then
        tmp = y * (z / t)
    else if (a <= 1.2d+97) then
        tmp = x
    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 (a <= -3.1e-121) {
		tmp = x + y;
	} else if (a <= 1.05e-276) {
		tmp = y * (z / t);
	} else if (a <= 1.2e+97) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -3.1e-121:
		tmp = x + y
	elif a <= 1.05e-276:
		tmp = y * (z / t)
	elif a <= 1.2e+97:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -3.1e-121)
		tmp = Float64(x + y);
	elseif (a <= 1.05e-276)
		tmp = Float64(y * Float64(z / t));
	elseif (a <= 1.2e+97)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -3.1e-121)
		tmp = x + y;
	elseif (a <= 1.05e-276)
		tmp = y * (z / t);
	elseif (a <= 1.2e+97)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -3.1e-121], N[(x + y), $MachinePrecision], If[LessEqual[a, 1.05e-276], N[(y * N[(z / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.2e+97], x, N[(x + y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if a < -3.0999999999999998e-121 or 1.2e97 < a

   1. Initial program 82.1%

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

      1. sub-neg 82.1%

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

      2. +-commutative 82.1%

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

      3. distribute-frac-neg 82.1%

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

      4. distribute-rgt-neg-out 82.1%

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

      5. associate-/l* 90.1%

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

      6. fma-define 90.0%

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

      7. distribute-frac-neg 90.0%

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

      8. distribute-neg-frac2 90.0%

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

      9. sub-neg 90.0%

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

      10. distribute-neg-in 90.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 90.0%

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

      12. +-commutative 90.0%

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

      13. sub-neg 90.0%

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

   3. Simplified 90.0%

      \[\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 -3.0999999999999998e-121 < a < 1.05e-276

   1. Initial program 72.7%

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

      1. sub-neg 72.7%

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

      2. +-commutative 72.7%

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

      3. distribute-frac-neg 72.7%

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

      4. distribute-rgt-neg-out 72.7%

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

      5. associate-/l* 72.8%

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

      6. fma-define 72.7%

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

      7. distribute-frac-neg 72.7%

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

      8. distribute-neg-frac2 72.7%

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

      9. sub-neg 72.7%

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

      10. distribute-neg-in 72.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 72.7%

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

      12. +-commutative 72.7%

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

      13. sub-neg 72.7%

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

   3. Simplified 72.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 59.9%

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

      1. *-commutative 59.9%

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

      2. *-lft-identity 59.9%

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

      3. times-frac 62.0%

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

      4. /-rgt-identity 62.0%

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

   7. Simplified 62.0%

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

   8. Taylor expanded in t around inf 51.0%

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

      1. associate-/l* 55.4%

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

   10. Simplified 55.4%

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

   if 1.05e-276 < a < 1.2e97

   1. Initial program 73.0%

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

      1. sub-neg 73.0%

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

      2. +-commutative 73.0%

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

      3. distribute-frac-neg 73.0%

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

      4. distribute-rgt-neg-out 73.0%

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

      5. associate-/l* 71.5%

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

      6. fma-define 71.4%

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

      7. distribute-frac-neg 71.4%

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

      8. distribute-neg-frac2 71.4%

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

      9. sub-neg 71.4%

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

      10. distribute-neg-in 71.4%

          \[\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 71.4%

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

      12. +-commutative 71.4%

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

      13. sub-neg 71.4%

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

   3. Simplified 71.4%

      \[\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 61.0%

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

      1. distribute-rgt1-in 61.0%

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

      2. metadata-eval 61.0%

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

      3. mul0-lft 61.0%

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

   7. Simplified 61.0%

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

   8. Taylor expanded in x around 0 61.0%

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

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{-121}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;a \leq 1.05 \cdot 10^{-276}:\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{elif}\;a \leq 1.2 \cdot 10^{+97}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 76.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -1080000000000.0) (not (<= a 3.05e+93)))
   (+ x y)
   (+ x (/ y (/ t z)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -1080000000000.0) || !(a <= 3.05e+93)) {
		tmp = x + y;
	} else {
		tmp = x + (y / (t / 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 <= (-1080000000000.0d0)) .or. (.not. (a <= 3.05d+93))) then
        tmp = x + y
    else
        tmp = x + (y / (t / 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 <= -1080000000000.0) || !(a <= 3.05e+93)) {
		tmp = x + y;
	} else {
		tmp = x + (y / (t / z));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -1080000000000.0) or not (a <= 3.05e+93):
		tmp = x + y
	else:
		tmp = x + (y / (t / z))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -1080000000000.0) || !(a <= 3.05e+93))
		tmp = Float64(x + y);
	else
		tmp = Float64(x + Float64(y / Float64(t / z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if ((a <= -1080000000000.0) || ~((a <= 3.05e+93)))
		tmp = x + y;
	else
		tmp = x + (y / (t / z));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.08e12 or 3.05e93 < a

   1. Initial program 82.6%

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

      1. sub-neg 82.6%

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

      2. +-commutative 82.6%

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

      3. distribute-frac-neg 82.6%

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

      4. distribute-rgt-neg-out 82.6%

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

      5. associate-/l* 91.9%

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

      6. fma-define 91.8%

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

      7. distribute-frac-neg 91.8%

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

      8. distribute-neg-frac2 91.8%

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

      9. sub-neg 91.8%

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

      10. distribute-neg-in 91.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 91.8%

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

      12. +-commutative 91.8%

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

      13. sub-neg 91.8%

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

   3. Simplified 91.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 83.7%

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

      1. +-commutative 83.7%

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

   7. Simplified 83.7%

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

   if -1.08e12 < a < 3.05e93

   1. Initial program 74.1%

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

   3. Taylor expanded in a around 0 60.5%

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

      1. mul-1-neg 60.5%

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

      2. associate-/l* 60.2%

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

      3. distribute-lft-neg-in 60.2%

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

   5. Simplified 60.2%

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

   6. Taylor expanded in z around 0 77.5%

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

      1. +-commutative 77.5%

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

      2. associate-/l* 78.5%

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

   8. Simplified 78.5%

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

      1. clear-num 78.5%

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

      2. un-div-inv 79.2%

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

   10. Applied egg-rr 79.2%

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

4. Final simplification 81.1%

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

Alternative 9: 76.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4100000000000 \lor \neg \left(a \leq 2.06 \cdot 10^{+92}\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 -4100000000000.0) (not (<= a 2.06e+92)))
   (+ x y)
   (+ x (* y (/ z t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4100000000000.0) || !(a <= 2.06e+92)) {
		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 <= (-4100000000000.0d0)) .or. (.not. (a <= 2.06d+92))) 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 <= -4100000000000.0) || !(a <= 2.06e+92)) {
		tmp = x + y;
	} else {
		tmp = x + (y * (z / t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -4100000000000.0) or not (a <= 2.06e+92):
		tmp = x + y
	else:
		tmp = x + (y * (z / t))
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -4100000000000.0) || !(a <= 2.06e+92))
		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 <= -4100000000000.0) || ~((a <= 2.06e+92)))
		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, -4100000000000.0], N[Not[LessEqual[a, 2.06e+92]], $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 < -4.1e12 or 2.0599999999999999e92 < a

   1. Initial program 82.6%

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

      1. sub-neg 82.6%

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

      2. +-commutative 82.6%

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

      3. distribute-frac-neg 82.6%

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

      4. distribute-rgt-neg-out 82.6%

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

      5. associate-/l* 91.9%

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

      6. fma-define 91.8%

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

      7. distribute-frac-neg 91.8%

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

      8. distribute-neg-frac2 91.8%

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

      9. sub-neg 91.8%

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

      10. distribute-neg-in 91.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 91.8%

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

      12. +-commutative 91.8%

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

      13. sub-neg 91.8%

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

   3. Simplified 91.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 83.7%

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

      1. +-commutative 83.7%

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

   7. Simplified 83.7%

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

   if -4.1e12 < a < 2.0599999999999999e92

   1. Initial program 74.1%

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

   3. Taylor expanded in a around 0 60.5%

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

      1. mul-1-neg 60.5%

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

      2. associate-/l* 60.2%

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

      3. distribute-lft-neg-in 60.2%

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

   5. Simplified 60.2%

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

   6. Taylor expanded in z around 0 77.5%

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

      1. +-commutative 77.5%

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

      2. associate-/l* 78.5%

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

   8. Simplified 78.5%

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

4. Final simplification 80.7%

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

Alternative 10: 63.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.6 \cdot 10^{-44} \lor \neg \left(a \leq 3 \cdot 10^{+96}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -4.6e-44) (not (<= a 3e+96))) (+ x y) x))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -4.6e-44) || !(a <= 3e+96)) {
		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 ((a <= (-4.6d-44)) .or. (.not. (a <= 3d+96))) 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 ((a <= -4.6e-44) || !(a <= 3e+96)) {
		tmp = x + y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if (a <= -4.6e-44) or not (a <= 3e+96):
		tmp = x + y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -4.6e-44) || !(a <= 3e+96))
		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 ((a <= -4.6e-44) || ~((a <= 3e+96)))
		tmp = x + y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -4.6e-44], N[Not[LessEqual[a, 3e+96]], $MachinePrecision]], N[(x + y), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if a < -4.59999999999999996e-44 or 3e96 < a

   1. Initial program 82.2%

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

      1. sub-neg 82.2%

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

      2. +-commutative 82.2%

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

      3. distribute-frac-neg 82.2%

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

      4. distribute-rgt-neg-out 82.2%

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

      5. associate-/l* 91.2%

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

      6. fma-define 91.2%

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

      7. distribute-frac-neg 91.2%

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

      8. distribute-neg-frac2 91.2%

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

      9. sub-neg 91.2%

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

      10. distribute-neg-in 91.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 91.2%

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

      12. +-commutative 91.2%

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

      13. sub-neg 91.2%

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

   3. Simplified 91.2%

      \[\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 80.6%

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

      1. +-commutative 80.6%

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

   7. Simplified 80.6%

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

   if -4.59999999999999996e-44 < a < 3e96

   1. Initial program 73.8%

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

      1. sub-neg 73.8%

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

      2. +-commutative 73.8%

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

      3. distribute-frac-neg 73.8%

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

      4. distribute-rgt-neg-out 73.8%

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

      5. associate-/l* 73.0%

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

      6. fma-define 72.8%

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

      7. distribute-frac-neg 72.8%

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

      8. distribute-neg-frac2 72.8%

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

      9. sub-neg 72.8%

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

      10. distribute-neg-in 72.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 72.8%

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

      12. +-commutative 72.8%

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

      13. sub-neg 72.8%

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

   3. Simplified 72.8%

      \[\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 54.3%

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

      1. distribute-rgt1-in 54.3%

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

      2. metadata-eval 54.3%

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

      3. mul0-lft 54.3%

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

   7. Simplified 54.3%

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

   8. Taylor expanded in x around 0 54.3%

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

4. Final simplification 66.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4.6 \cdot 10^{-44} \lor \neg \left(a \leq 3 \cdot 10^{+96}\right):\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 53.4% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{-137}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{-228}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -2.1e-137) x (if (<= x 1.6e-228) y x)))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if x <= -2.1e-137:
		tmp = x
	elif x <= 1.6e-228:
		tmp = y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -2.1e-137)
		tmp = x;
	elseif (x <= 1.6e-228)
		tmp = y;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (x <= -2.1e-137)
		tmp = x;
	elseif (x <= 1.6e-228)
		tmp = y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -2.1e-137], x, If[LessEqual[x, 1.6e-228], y, x]]

Derivation

1. Split input into 2 regimes

2. if x < -2.09999999999999992e-137 or 1.60000000000000011e-228 < x

   1. Initial program 78.7%

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

      1. sub-neg 78.7%

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

      2. +-commutative 78.7%

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

      3. distribute-frac-neg 78.7%

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

      4. distribute-rgt-neg-out 78.7%

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

      5. associate-/l* 84.1%

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

      6. fma-define 84.1%

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

      7. distribute-frac-neg 84.1%

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

      8. distribute-neg-frac2 84.1%

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

      9. sub-neg 84.1%

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

      10. distribute-neg-in 84.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 84.1%

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

      12. +-commutative 84.1%

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

      13. sub-neg 84.1%

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

   3. Simplified 84.1%

      \[\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 64.8%

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

      1. distribute-rgt1-in 64.8%

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

      2. metadata-eval 64.8%

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

      3. mul0-lft 64.8%

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

   7. Simplified 64.8%

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

   8. Taylor expanded in x around 0 64.8%

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

   if -2.09999999999999992e-137 < x < 1.60000000000000011e-228

   1. Initial program 74.1%

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

      1. sub-neg 74.1%

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

      2. +-commutative 74.1%

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

      3. distribute-frac-neg 74.1%

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

      4. distribute-rgt-neg-out 74.1%

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

      5. associate-/l* 72.5%

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

      6. fma-define 72.0%

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

      7. distribute-frac-neg 72.0%

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

      8. distribute-neg-frac2 72.0%

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

      9. sub-neg 72.0%

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

      10. distribute-neg-in 72.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 72.0%

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

      12. +-commutative 72.0%

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

      13. sub-neg 72.0%

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

   3. Simplified 72.0%

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

   5. Taylor expanded in y around inf 67.7%

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

      1. associate--l+ 67.7%

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

      2. div-sub 67.7%

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

   7. Simplified 67.7%

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

   8. Taylor expanded in a around inf 35.3%

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

   9. Taylor expanded in y around 0 35.3%

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

Alternative 12: 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 77.7%

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

   1. sub-neg 77.7%

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

   2. +-commutative 77.7%

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

   3. distribute-frac-neg 77.7%

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

   4. distribute-rgt-neg-out 77.7%

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

   5. associate-/l* 81.5%

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

   6. fma-define 81.4%

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

   7. distribute-frac-neg 81.4%

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

   8. distribute-neg-frac2 81.4%

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

   9. sub-neg 81.4%

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

   10. distribute-neg-in 81.4%

       \[\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 81.4%

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

   12. +-commutative 81.4%

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

   13. sub-neg 81.4%

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

3. Simplified 81.4%

   \[\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 54.1%

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

   1. distribute-rgt1-in 54.1%

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

   2. metadata-eval 54.1%

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

   3. mul0-lft 54.1%

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

7. Simplified 54.1%

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

8. Taylor expanded in x around 0 54.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 2024157 
(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))))