Kahan p13 Example 3

Percentage Accurate: 99.9% → 100.0%
Time: 16.3s
Alternatives: 9
Speedup: 1.4×

Specification

?
\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t\_1 \cdot t\_1} \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))
double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function
public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}
def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))
function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end
function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end
code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\
1 - \frac{1}{2 + t\_1 \cdot t\_1}
\end{array}
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 9 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 99.9% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\ 1 - \frac{1}{2 + t\_1 \cdot t\_1} \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (let* ((t_1 (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))))))
   (- 1.0 (/ 1.0 (+ 2.0 (* t_1 t_1))))))
double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = 2.0d0 - ((2.0d0 / t) / (1.0d0 + (1.0d0 / t)))
    code = 1.0d0 - (1.0d0 / (2.0d0 + (t_1 * t_1)))
end function
public static double code(double t) {
	double t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
}
def code(t):
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)))
	return 1.0 - (1.0 / (2.0 + (t_1 * t_1)))
function code(t)
	t_1 = Float64(2.0 - Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))))
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(t_1 * t_1))))
end
function tmp = code(t)
	t_1 = 2.0 - ((2.0 / t) / (1.0 + (1.0 / t)));
	tmp = 1.0 - (1.0 / (2.0 + (t_1 * t_1)));
end
code[t_] := Block[{t$95$1 = N[(2.0 - N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, N[(1.0 - N[(1.0 / N[(2.0 + N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
t_1 := 2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\\
1 - \frac{1}{2 + t\_1 \cdot t\_1}
\end{array}
\end{array}

Alternative 1: 100.0% accurate, 0.2× speedup?

\[\begin{array}{l} \\ 1 + \frac{1}{\frac{8 + \frac{-8}{{\left(1 + t\right)}^{3}}}{4 + \frac{4 + \frac{4}{1 + t}}{1 + t}} \cdot \left(\frac{-2}{-1 - t} - 2\right) - 2} \end{array} \]
(FPCore (t)
 :precision binary64
 (+
  1.0
  (/
   1.0
   (-
    (*
     (/
      (+ 8.0 (/ -8.0 (pow (+ 1.0 t) 3.0)))
      (+ 4.0 (/ (+ 4.0 (/ 4.0 (+ 1.0 t))) (+ 1.0 t))))
     (- (/ -2.0 (- -1.0 t)) 2.0))
    2.0))))
double code(double t) {
	return 1.0 + (1.0 / ((((8.0 + (-8.0 / pow((1.0 + t), 3.0))) / (4.0 + ((4.0 + (4.0 / (1.0 + t))) / (1.0 + t)))) * ((-2.0 / (-1.0 - t)) - 2.0)) - 2.0));
}
real(8) function code(t)
    real(8), intent (in) :: t
    code = 1.0d0 + (1.0d0 / ((((8.0d0 + ((-8.0d0) / ((1.0d0 + t) ** 3.0d0))) / (4.0d0 + ((4.0d0 + (4.0d0 / (1.0d0 + t))) / (1.0d0 + t)))) * (((-2.0d0) / ((-1.0d0) - t)) - 2.0d0)) - 2.0d0))
end function
public static double code(double t) {
	return 1.0 + (1.0 / ((((8.0 + (-8.0 / Math.pow((1.0 + t), 3.0))) / (4.0 + ((4.0 + (4.0 / (1.0 + t))) / (1.0 + t)))) * ((-2.0 / (-1.0 - t)) - 2.0)) - 2.0));
}
def code(t):
	return 1.0 + (1.0 / ((((8.0 + (-8.0 / math.pow((1.0 + t), 3.0))) / (4.0 + ((4.0 + (4.0 / (1.0 + t))) / (1.0 + t)))) * ((-2.0 / (-1.0 - t)) - 2.0)) - 2.0))
function code(t)
	return Float64(1.0 + Float64(1.0 / Float64(Float64(Float64(Float64(8.0 + Float64(-8.0 / (Float64(1.0 + t) ^ 3.0))) / Float64(4.0 + Float64(Float64(4.0 + Float64(4.0 / Float64(1.0 + t))) / Float64(1.0 + t)))) * Float64(Float64(-2.0 / Float64(-1.0 - t)) - 2.0)) - 2.0)))
end
function tmp = code(t)
	tmp = 1.0 + (1.0 / ((((8.0 + (-8.0 / ((1.0 + t) ^ 3.0))) / (4.0 + ((4.0 + (4.0 / (1.0 + t))) / (1.0 + t)))) * ((-2.0 / (-1.0 - t)) - 2.0)) - 2.0));
end
code[t_] := N[(1.0 + N[(1.0 / N[(N[(N[(N[(8.0 + N[(-8.0 / N[Power[N[(1.0 + t), $MachinePrecision], 3.0], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(4.0 + N[(N[(4.0 + N[(4.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(N[(-2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
1 + \frac{1}{\frac{8 + \frac{-8}{{\left(1 + t\right)}^{3}}}{4 + \frac{4 + \frac{4}{1 + t}}{1 + t}} \cdot \left(\frac{-2}{-1 - t} - 2\right) - 2}
\end{array}
Derivation
  1. Initial program 100.0%

    \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. flip3--100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\frac{{2}^{3} - {\left(\frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}^{3}}{2 \cdot 2 + \left(\frac{\frac{2}{t}}{1 + \frac{1}{t}} \cdot \frac{\frac{2}{t}}{1 + \frac{1}{t}} + 2 \cdot \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}}} \]
    2. associate-*r/100.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\frac{\left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left({2}^{3} - {\left(\frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}^{3}\right)}{2 \cdot 2 + \left(\frac{\frac{2}{t}}{1 + \frac{1}{t}} \cdot \frac{\frac{2}{t}}{1 + \frac{1}{t}} + 2 \cdot \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)}}} \]
  4. Applied egg-rr100.0%

    \[\leadsto 1 - \frac{1}{2 + \color{blue}{\frac{\left(2 + \frac{\frac{-2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(8 - {\left(\frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}\right)}^{3}\right)}{\mathsf{fma}\left(\frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}, 2 + \frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}, 4\right)}}} \]
  5. Simplified100.0%

    \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(2 + \frac{-2}{t + 1}\right) \cdot \frac{8 + \frac{-8}{{\left(t + 1\right)}^{3}}}{4 + \frac{4 + \frac{4}{t + 1}}{t + 1}}}} \]
  6. Final simplification100.0%

    \[\leadsto 1 + \frac{1}{\frac{8 + \frac{-8}{{\left(1 + t\right)}^{3}}}{4 + \frac{4 + \frac{4}{1 + t}}{1 + t}} \cdot \left(\frac{-2}{-1 - t} - 2\right) - 2} \]
  7. Add Preprocessing

Alternative 2: 99.4% accurate, 1.1× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.2 \lor \neg \left(t \leq 0.58\right):\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{1}{\left(2 \cdot t\right) \cdot \left(\frac{2}{1 + t} - 2\right) - 2}\\ \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (if (or (<= t -1.2) (not (<= t 0.58)))
   (-
    1.0
    (-
     0.16666666666666666
     (/ (+ (/ 0.037037037037037035 t) -0.2222222222222222) t)))
   (+ 1.0 (/ 1.0 (- (* (* 2.0 t) (- (/ 2.0 (+ 1.0 t)) 2.0)) 2.0)))))
double code(double t) {
	double tmp;
	if ((t <= -1.2) || !(t <= 0.58)) {
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	} else {
		tmp = 1.0 + (1.0 / (((2.0 * t) * ((2.0 / (1.0 + t)) - 2.0)) - 2.0));
	}
	return tmp;
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-1.2d0)) .or. (.not. (t <= 0.58d0))) then
        tmp = 1.0d0 - (0.16666666666666666d0 - (((0.037037037037037035d0 / t) + (-0.2222222222222222d0)) / t))
    else
        tmp = 1.0d0 + (1.0d0 / (((2.0d0 * t) * ((2.0d0 / (1.0d0 + t)) - 2.0d0)) - 2.0d0))
    end if
    code = tmp
end function
public static double code(double t) {
	double tmp;
	if ((t <= -1.2) || !(t <= 0.58)) {
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	} else {
		tmp = 1.0 + (1.0 / (((2.0 * t) * ((2.0 / (1.0 + t)) - 2.0)) - 2.0));
	}
	return tmp;
}
def code(t):
	tmp = 0
	if (t <= -1.2) or not (t <= 0.58):
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t))
	else:
		tmp = 1.0 + (1.0 / (((2.0 * t) * ((2.0 / (1.0 + t)) - 2.0)) - 2.0))
	return tmp
function code(t)
	tmp = 0.0
	if ((t <= -1.2) || !(t <= 0.58))
		tmp = Float64(1.0 - Float64(0.16666666666666666 - Float64(Float64(Float64(0.037037037037037035 / t) + -0.2222222222222222) / t)));
	else
		tmp = Float64(1.0 + Float64(1.0 / Float64(Float64(Float64(2.0 * t) * Float64(Float64(2.0 / Float64(1.0 + t)) - 2.0)) - 2.0)));
	end
	return tmp
end
function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -1.2) || ~((t <= 0.58)))
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	else
		tmp = 1.0 + (1.0 / (((2.0 * t) * ((2.0 / (1.0 + t)) - 2.0)) - 2.0));
	end
	tmp_2 = tmp;
end
code[t_] := If[Or[LessEqual[t, -1.2], N[Not[LessEqual[t, 0.58]], $MachinePrecision]], N[(1.0 - N[(0.16666666666666666 - N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(1.0 / N[(N[(N[(2.0 * t), $MachinePrecision] * N[(N[(2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;t \leq -1.2 \lor \neg \left(t \leq 0.58\right):\\
\;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\

\mathbf{else}:\\
\;\;\;\;1 + \frac{1}{\left(2 \cdot t\right) \cdot \left(\frac{2}{1 + t} - 2\right) - 2}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if t < -1.19999999999999996 or 0.57999999999999996 < t

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around inf 98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
    4. Step-by-step derivation
      1. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
      2. associate--l+98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
      3. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
      4. associate--r-98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
      5. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
      6. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
      7. unpow298.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
      8. associate-/r*98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
      9. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
      10. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
      11. div-sub98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
      12. sub-neg98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
      13. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
      14. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
      15. distribute-neg-frac98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
      16. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
    5. Simplified98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
    6. Taylor expanded in t around -inf 98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    7. Step-by-step derivation
      1. mul-1-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
      2. unsub-neg98.5%

        \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
      3. sub-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
      4. associate-*r/98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
      5. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
      6. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
    8. Simplified98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]

    if -1.19999999999999996 < t < 0.57999999999999996

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(2 \cdot t\right)}} \]
    4. Step-by-step derivation
      1. add-log-exp99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\right) \cdot \left(2 \cdot t\right)} \]
      2. *-un-lft-identity99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \log \color{blue}{\left(1 \cdot e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\right) \cdot \left(2 \cdot t\right)} \]
      3. log-prod99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right)}\right) \cdot \left(2 \cdot t\right)} \]
      4. metadata-eval99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(\color{blue}{0} + \log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right)\right) \cdot \left(2 \cdot t\right)} \]
      5. add-log-exp99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \color{blue}{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right) \cdot \left(2 \cdot t\right)} \]
      6. associate-/l/99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \color{blue}{\frac{2}{\left(1 + \frac{1}{t}\right) \cdot t}}\right)\right) \cdot \left(2 \cdot t\right)} \]
      7. *-commutative99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \frac{2}{\color{blue}{t \cdot \left(1 + \frac{1}{t}\right)}}\right)\right) \cdot \left(2 \cdot t\right)} \]
    5. Applied egg-rr99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\left(0 + \frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}\right)}\right) \cdot \left(2 \cdot t\right)} \]
    6. Step-by-step derivation
      1. +-lft-identity99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}}\right) \cdot \left(2 \cdot t\right)} \]
      2. distribute-rgt-in99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{\color{blue}{1 \cdot t + \frac{1}{t} \cdot t}}\right) \cdot \left(2 \cdot t\right)} \]
      3. lft-mult-inverse99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{1 \cdot t + \color{blue}{1}}\right) \cdot \left(2 \cdot t\right)} \]
      4. *-lft-identity99.8%

        \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{\color{blue}{t} + 1}\right) \cdot \left(2 \cdot t\right)} \]
    7. Simplified99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\frac{2}{t + 1}}\right) \cdot \left(2 \cdot t\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification99.2%

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.2 \lor \neg \left(t \leq 0.58\right):\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{1}{\left(2 \cdot t\right) \cdot \left(\frac{2}{1 + t} - 2\right) - 2}\\ \end{array} \]
  5. Add Preprocessing

Alternative 3: 99.4% accurate, 1.3× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.62 \lor \neg \left(t \leq 0.44\right):\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{2 + \left(2 \cdot t\right) \cdot \left(2 \cdot t\right)}\\ \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (if (or (<= t -0.62) (not (<= t 0.44)))
   (-
    1.0
    (-
     0.16666666666666666
     (/ (+ (/ 0.037037037037037035 t) -0.2222222222222222) t)))
   (+ 1.0 (/ -1.0 (+ 2.0 (* (* 2.0 t) (* 2.0 t)))))))
double code(double t) {
	double tmp;
	if ((t <= -0.62) || !(t <= 0.44)) {
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	} else {
		tmp = 1.0 + (-1.0 / (2.0 + ((2.0 * t) * (2.0 * t))));
	}
	return tmp;
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.62d0)) .or. (.not. (t <= 0.44d0))) then
        tmp = 1.0d0 - (0.16666666666666666d0 - (((0.037037037037037035d0 / t) + (-0.2222222222222222d0)) / t))
    else
        tmp = 1.0d0 + ((-1.0d0) / (2.0d0 + ((2.0d0 * t) * (2.0d0 * t))))
    end if
    code = tmp
end function
public static double code(double t) {
	double tmp;
	if ((t <= -0.62) || !(t <= 0.44)) {
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	} else {
		tmp = 1.0 + (-1.0 / (2.0 + ((2.0 * t) * (2.0 * t))));
	}
	return tmp;
}
def code(t):
	tmp = 0
	if (t <= -0.62) or not (t <= 0.44):
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t))
	else:
		tmp = 1.0 + (-1.0 / (2.0 + ((2.0 * t) * (2.0 * t))))
	return tmp
function code(t)
	tmp = 0.0
	if ((t <= -0.62) || !(t <= 0.44))
		tmp = Float64(1.0 - Float64(0.16666666666666666 - Float64(Float64(Float64(0.037037037037037035 / t) + -0.2222222222222222) / t)));
	else
		tmp = Float64(1.0 + Float64(-1.0 / Float64(2.0 + Float64(Float64(2.0 * t) * Float64(2.0 * t)))));
	end
	return tmp
end
function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.62) || ~((t <= 0.44)))
		tmp = 1.0 - (0.16666666666666666 - (((0.037037037037037035 / t) + -0.2222222222222222) / t));
	else
		tmp = 1.0 + (-1.0 / (2.0 + ((2.0 * t) * (2.0 * t))));
	end
	tmp_2 = tmp;
end
code[t_] := If[Or[LessEqual[t, -0.62], N[Not[LessEqual[t, 0.44]], $MachinePrecision]], N[(1.0 - N[(0.16666666666666666 - N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(-1.0 / N[(2.0 + N[(N[(2.0 * t), $MachinePrecision] * N[(2.0 * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;t \leq -0.62 \lor \neg \left(t \leq 0.44\right):\\
\;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\

\mathbf{else}:\\
\;\;\;\;1 + \frac{-1}{2 + \left(2 \cdot t\right) \cdot \left(2 \cdot t\right)}\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if t < -0.619999999999999996 or 0.440000000000000002 < t

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around inf 98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
    4. Step-by-step derivation
      1. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
      2. associate--l+98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
      3. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
      4. associate--r-98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
      5. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
      6. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
      7. unpow298.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
      8. associate-/r*98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
      9. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
      10. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
      11. div-sub98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
      12. sub-neg98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
      13. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
      14. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
      15. distribute-neg-frac98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
      16. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
    5. Simplified98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
    6. Taylor expanded in t around -inf 98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    7. Step-by-step derivation
      1. mul-1-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
      2. unsub-neg98.5%

        \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
      3. sub-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
      4. associate-*r/98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
      5. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
      6. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
    8. Simplified98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]

    if -0.619999999999999996 < t < 0.440000000000000002

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(2 \cdot t\right)}} \]
    4. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(2 \cdot t\right)} \cdot \left(2 \cdot t\right)} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification99.2%

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.62 \lor \neg \left(t \leq 0.44\right):\\ \;\;\;\;1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;1 + \frac{-1}{2 + \left(2 \cdot t\right) \cdot \left(2 \cdot t\right)}\\ \end{array} \]
  5. Add Preprocessing

Alternative 4: 99.2% accurate, 1.4× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.5 \lor \neg \left(t \leq 0.23\right):\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t} - 0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (if (or (<= t -0.5) (not (<= t 0.23)))
   (+
    1.0
    (-
     (/ (+ (/ 0.037037037037037035 t) -0.2222222222222222) t)
     0.16666666666666666))
   0.5))
double code(double t) {
	double tmp;
	if ((t <= -0.5) || !(t <= 0.23)) {
		tmp = 1.0 + ((((0.037037037037037035 / t) + -0.2222222222222222) / t) - 0.16666666666666666);
	} else {
		tmp = 0.5;
	}
	return tmp;
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.5d0)) .or. (.not. (t <= 0.23d0))) then
        tmp = 1.0d0 + ((((0.037037037037037035d0 / t) + (-0.2222222222222222d0)) / t) - 0.16666666666666666d0)
    else
        tmp = 0.5d0
    end if
    code = tmp
end function
public static double code(double t) {
	double tmp;
	if ((t <= -0.5) || !(t <= 0.23)) {
		tmp = 1.0 + ((((0.037037037037037035 / t) + -0.2222222222222222) / t) - 0.16666666666666666);
	} else {
		tmp = 0.5;
	}
	return tmp;
}
def code(t):
	tmp = 0
	if (t <= -0.5) or not (t <= 0.23):
		tmp = 1.0 + ((((0.037037037037037035 / t) + -0.2222222222222222) / t) - 0.16666666666666666)
	else:
		tmp = 0.5
	return tmp
function code(t)
	tmp = 0.0
	if ((t <= -0.5) || !(t <= 0.23))
		tmp = Float64(1.0 + Float64(Float64(Float64(Float64(0.037037037037037035 / t) + -0.2222222222222222) / t) - 0.16666666666666666));
	else
		tmp = 0.5;
	end
	return tmp
end
function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.5) || ~((t <= 0.23)))
		tmp = 1.0 + ((((0.037037037037037035 / t) + -0.2222222222222222) / t) - 0.16666666666666666);
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end
code[t_] := If[Or[LessEqual[t, -0.5], N[Not[LessEqual[t, 0.23]], $MachinePrecision]], N[(1.0 + N[(N[(N[(N[(0.037037037037037035 / t), $MachinePrecision] + -0.2222222222222222), $MachinePrecision] / t), $MachinePrecision] - 0.16666666666666666), $MachinePrecision]), $MachinePrecision], 0.5]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;t \leq -0.5 \lor \neg \left(t \leq 0.23\right):\\
\;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t} - 0.16666666666666666\right)\\

\mathbf{else}:\\
\;\;\;\;0.5\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if t < -0.5 or 0.23000000000000001 < t

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around inf 98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
    4. Step-by-step derivation
      1. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
      2. associate--l+98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
      3. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
      4. associate--r-98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
      5. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
      6. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
      7. unpow298.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
      8. associate-/r*98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
      9. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
      10. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
      11. div-sub98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
      12. sub-neg98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
      13. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
      14. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
      15. distribute-neg-frac98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
      16. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
    5. Simplified98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
    6. Taylor expanded in t around -inf 98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    7. Step-by-step derivation
      1. mul-1-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
      2. unsub-neg98.5%

        \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
      3. sub-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
      4. associate-*r/98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
      5. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
      6. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
    8. Simplified98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]

    if -0.5 < t < 0.23000000000000001

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(2 \cdot t\right)}} \]
    4. Taylor expanded in t around inf 99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{4 \cdot t}} \]
    5. Step-by-step derivation
      1. *-commutative99.0%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    6. Simplified99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    7. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{0.5} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification99.1%

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.5 \lor \neg \left(t \leq 0.23\right):\\ \;\;\;\;1 + \left(\frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t} - 0.16666666666666666\right)\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]
  5. Add Preprocessing

Alternative 5: 100.0% accurate, 1.4× speedup?

\[\begin{array}{l} \\ 1 - \frac{1}{2 + \left(2 + \frac{-2}{1 + t}\right) \cdot \left(2 + \frac{2}{-1 - t}\right)} \end{array} \]
(FPCore (t)
 :precision binary64
 (-
  1.0
  (/ 1.0 (+ 2.0 (* (+ 2.0 (/ -2.0 (+ 1.0 t))) (+ 2.0 (/ 2.0 (- -1.0 t))))))))
double code(double t) {
	return 1.0 - (1.0 / (2.0 + ((2.0 + (-2.0 / (1.0 + t))) * (2.0 + (2.0 / (-1.0 - t))))));
}
real(8) function code(t)
    real(8), intent (in) :: t
    code = 1.0d0 - (1.0d0 / (2.0d0 + ((2.0d0 + ((-2.0d0) / (1.0d0 + t))) * (2.0d0 + (2.0d0 / ((-1.0d0) - t))))))
end function
public static double code(double t) {
	return 1.0 - (1.0 / (2.0 + ((2.0 + (-2.0 / (1.0 + t))) * (2.0 + (2.0 / (-1.0 - t))))));
}
def code(t):
	return 1.0 - (1.0 / (2.0 + ((2.0 + (-2.0 / (1.0 + t))) * (2.0 + (2.0 / (-1.0 - t))))))
function code(t)
	return Float64(1.0 - Float64(1.0 / Float64(2.0 + Float64(Float64(2.0 + Float64(-2.0 / Float64(1.0 + t))) * Float64(2.0 + Float64(2.0 / Float64(-1.0 - t)))))))
end
function tmp = code(t)
	tmp = 1.0 - (1.0 / (2.0 + ((2.0 + (-2.0 / (1.0 + t))) * (2.0 + (2.0 / (-1.0 - t))))));
end
code[t_] := N[(1.0 - N[(1.0 / N[(2.0 + N[(N[(2.0 + N[(-2.0 / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(2.0 + N[(2.0 / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
1 - \frac{1}{2 + \left(2 + \frac{-2}{1 + t}\right) \cdot \left(2 + \frac{2}{-1 - t}\right)}
\end{array}
Derivation
  1. Initial program 100.0%

    \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. add-cube-cbrt100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\color{blue}{\left(\sqrt[3]{\frac{2}{t}} \cdot \sqrt[3]{\frac{2}{t}}\right) \cdot \sqrt[3]{\frac{2}{t}}}}{1 + \frac{1}{t}}\right)} \]
    2. associate-/l*100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \color{blue}{\left(\sqrt[3]{\frac{2}{t}} \cdot \sqrt[3]{\frac{2}{t}}\right) \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}}\right)} \]
    3. pow2100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \color{blue}{{\left(\sqrt[3]{\frac{2}{t}}\right)}^{2}} \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}\right)} \]
  4. Applied egg-rr100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \color{blue}{{\left(\sqrt[3]{\frac{2}{t}}\right)}^{2} \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}}\right)} \]
  5. Step-by-step derivation
    1. add-log-exp63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\right) \cdot \left(2 \cdot t\right)} \]
    2. *-un-lft-identity63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \log \color{blue}{\left(1 \cdot e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)}\right) \cdot \left(2 \cdot t\right)} \]
    3. log-prod63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\left(\log 1 + \log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right)}\right) \cdot \left(2 \cdot t\right)} \]
    4. metadata-eval63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(\color{blue}{0} + \log \left(e^{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right)\right) \cdot \left(2 \cdot t\right)} \]
    5. add-log-exp63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \color{blue}{\frac{\frac{2}{t}}{1 + \frac{1}{t}}}\right)\right) \cdot \left(2 \cdot t\right)} \]
    6. associate-/l/63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \color{blue}{\frac{2}{\left(1 + \frac{1}{t}\right) \cdot t}}\right)\right) \cdot \left(2 \cdot t\right)} \]
    7. *-commutative63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \left(0 + \frac{2}{\color{blue}{t \cdot \left(1 + \frac{1}{t}\right)}}\right)\right) \cdot \left(2 \cdot t\right)} \]
  6. Applied egg-rr100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\left(0 + \frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}\right)}\right) \cdot \left(2 - {\left(\sqrt[3]{\frac{2}{t}}\right)}^{2} \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}\right)} \]
  7. Step-by-step derivation
    1. +-lft-identity63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\frac{2}{t \cdot \left(1 + \frac{1}{t}\right)}}\right) \cdot \left(2 \cdot t\right)} \]
    2. distribute-rgt-in63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{\color{blue}{1 \cdot t + \frac{1}{t} \cdot t}}\right) \cdot \left(2 \cdot t\right)} \]
    3. lft-mult-inverse63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{1 \cdot t + \color{blue}{1}}\right) \cdot \left(2 \cdot t\right)} \]
    4. *-lft-identity63.3%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{\color{blue}{t} + 1}\right) \cdot \left(2 \cdot t\right)} \]
  8. Simplified100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \color{blue}{\frac{2}{t + 1}}\right) \cdot \left(2 - {\left(\sqrt[3]{\frac{2}{t}}\right)}^{2} \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}\right)} \]
  9. Step-by-step derivation
    1. sub-neg100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \color{blue}{\left(2 + \left(-{\left(\sqrt[3]{\frac{2}{t}}\right)}^{2} \cdot \frac{\sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}\right)\right)}} \]
    2. associate-*r/100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \left(-\color{blue}{\frac{{\left(\sqrt[3]{\frac{2}{t}}\right)}^{2} \cdot \sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}}\right)\right)} \]
    3. unpow2100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \left(-\frac{\color{blue}{\left(\sqrt[3]{\frac{2}{t}} \cdot \sqrt[3]{\frac{2}{t}}\right)} \cdot \sqrt[3]{\frac{2}{t}}}{1 + \frac{1}{t}}\right)\right)} \]
    4. add-cube-cbrt100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \left(-\frac{\color{blue}{\frac{2}{t}}}{1 + \frac{1}{t}}\right)\right)} \]
    5. distribute-neg-frac100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \color{blue}{\frac{-\frac{2}{t}}{1 + \frac{1}{t}}}\right)} \]
    6. distribute-neg-frac100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{\color{blue}{\frac{-2}{t}}}{1 + \frac{1}{t}}\right)} \]
    7. metadata-eval100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{\frac{\color{blue}{-2}}{t}}{1 + \frac{1}{t}}\right)} \]
  10. Applied egg-rr100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \color{blue}{\left(2 + \frac{\frac{-2}{t}}{1 + \frac{1}{t}}\right)}} \]
  11. Step-by-step derivation
    1. rem-cube-cbrt100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{\frac{\color{blue}{{\left(\sqrt[3]{-2}\right)}^{3}}}{t}}{1 + \frac{1}{t}}\right)} \]
    2. associate-/r*100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \color{blue}{\frac{{\left(\sqrt[3]{-2}\right)}^{3}}{t \cdot \left(1 + \frac{1}{t}\right)}}\right)} \]
    3. rem-cube-cbrt100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{\color{blue}{-2}}{t \cdot \left(1 + \frac{1}{t}\right)}\right)} \]
    4. distribute-lft-in100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{-2}{\color{blue}{t \cdot 1 + t \cdot \frac{1}{t}}}\right)} \]
    5. *-rgt-identity100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{-2}{\color{blue}{t} + t \cdot \frac{1}{t}}\right)} \]
    6. rgt-mult-inverse100.0%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \left(2 + \frac{-2}{t + \color{blue}{1}}\right)} \]
  12. Simplified100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{2}{t + 1}\right) \cdot \color{blue}{\left(2 + \frac{-2}{t + 1}\right)}} \]
  13. Final simplification100.0%

    \[\leadsto 1 - \frac{1}{2 + \left(2 + \frac{-2}{1 + t}\right) \cdot \left(2 + \frac{2}{-1 - t}\right)} \]
  14. Add Preprocessing

Alternative 6: 98.0% accurate, 1.5× speedup?

\[\begin{array}{l} \\ 1 + \frac{1}{2 \cdot \left(\frac{\frac{2}{t}}{1 + \frac{1}{t}} - 2\right) - 2} \end{array} \]
(FPCore (t)
 :precision binary64
 (+ 1.0 (/ 1.0 (- (* 2.0 (- (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t))) 2.0)) 2.0))))
double code(double t) {
	return 1.0 + (1.0 / ((2.0 * (((2.0 / t) / (1.0 + (1.0 / t))) - 2.0)) - 2.0));
}
real(8) function code(t)
    real(8), intent (in) :: t
    code = 1.0d0 + (1.0d0 / ((2.0d0 * (((2.0d0 / t) / (1.0d0 + (1.0d0 / t))) - 2.0d0)) - 2.0d0))
end function
public static double code(double t) {
	return 1.0 + (1.0 / ((2.0 * (((2.0 / t) / (1.0 + (1.0 / t))) - 2.0)) - 2.0));
}
def code(t):
	return 1.0 + (1.0 / ((2.0 * (((2.0 / t) / (1.0 + (1.0 / t))) - 2.0)) - 2.0))
function code(t)
	return Float64(1.0 + Float64(1.0 / Float64(Float64(2.0 * Float64(Float64(Float64(2.0 / t) / Float64(1.0 + Float64(1.0 / t))) - 2.0)) - 2.0)))
end
function tmp = code(t)
	tmp = 1.0 + (1.0 / ((2.0 * (((2.0 / t) / (1.0 + (1.0 / t))) - 2.0)) - 2.0));
end
code[t_] := N[(1.0 + N[(1.0 / N[(N[(2.0 * N[(N[(N[(2.0 / t), $MachinePrecision] / N[(1.0 + N[(1.0 / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]
\begin{array}{l}

\\
1 + \frac{1}{2 \cdot \left(\frac{\frac{2}{t}}{1 + \frac{1}{t}} - 2\right) - 2}
\end{array}
Derivation
  1. Initial program 100.0%

    \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in t around inf 98.3%

    \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{2}} \]
  4. Final simplification98.3%

    \[\leadsto 1 + \frac{1}{2 \cdot \left(\frac{\frac{2}{t}}{1 + \frac{1}{t}} - 2\right) - 2} \]
  5. Add Preprocessing

Alternative 7: 99.1% accurate, 1.9× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.49 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;\frac{-0.2222222222222222}{t} + 0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (if (or (<= t -0.49) (not (<= t 0.68)))
   (+ (/ -0.2222222222222222 t) 0.8333333333333334)
   0.5))
double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = (-0.2222222222222222 / t) + 0.8333333333333334;
	} else {
		tmp = 0.5;
	}
	return tmp;
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.49d0)) .or. (.not. (t <= 0.68d0))) then
        tmp = ((-0.2222222222222222d0) / t) + 0.8333333333333334d0
    else
        tmp = 0.5d0
    end if
    code = tmp
end function
public static double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = (-0.2222222222222222 / t) + 0.8333333333333334;
	} else {
		tmp = 0.5;
	}
	return tmp;
}
def code(t):
	tmp = 0
	if (t <= -0.49) or not (t <= 0.68):
		tmp = (-0.2222222222222222 / t) + 0.8333333333333334
	else:
		tmp = 0.5
	return tmp
function code(t)
	tmp = 0.0
	if ((t <= -0.49) || !(t <= 0.68))
		tmp = Float64(Float64(-0.2222222222222222 / t) + 0.8333333333333334);
	else
		tmp = 0.5;
	end
	return tmp
end
function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.49) || ~((t <= 0.68)))
		tmp = (-0.2222222222222222 / t) + 0.8333333333333334;
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end
code[t_] := If[Or[LessEqual[t, -0.49], N[Not[LessEqual[t, 0.68]], $MachinePrecision]], N[(N[(-0.2222222222222222 / t), $MachinePrecision] + 0.8333333333333334), $MachinePrecision], 0.5]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;t \leq -0.49 \lor \neg \left(t \leq 0.68\right):\\
\;\;\;\;\frac{-0.2222222222222222}{t} + 0.8333333333333334\\

\mathbf{else}:\\
\;\;\;\;0.5\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if t < -0.48999999999999999 or 0.680000000000000049 < t

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around inf 98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
    4. Step-by-step derivation
      1. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
      2. associate--l+98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
      3. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
      4. associate--r-98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
      5. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
      6. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
      7. unpow298.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
      8. associate-/r*98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
      9. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
      10. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
      11. div-sub98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
      12. sub-neg98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
      13. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
      14. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
      15. distribute-neg-frac98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
      16. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
    5. Simplified98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
    6. Taylor expanded in t around -inf 98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    7. Step-by-step derivation
      1. mul-1-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
      2. unsub-neg98.5%

        \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
      3. sub-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
      4. associate-*r/98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
      5. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
      6. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
    8. Simplified98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]
    9. Taylor expanded in t around inf 98.2%

      \[\leadsto 1 - \left(0.16666666666666666 - \color{blue}{\frac{-0.2222222222222222}{t}}\right) \]
    10. Taylor expanded in t around inf 98.2%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
    11. Step-by-step derivation
      1. cancel-sign-sub-inv98.2%

        \[\leadsto \color{blue}{0.8333333333333334 + \left(-0.2222222222222222\right) \cdot \frac{1}{t}} \]
      2. metadata-eval98.2%

        \[\leadsto 0.8333333333333334 + \color{blue}{-0.2222222222222222} \cdot \frac{1}{t} \]
      3. associate-*r/98.2%

        \[\leadsto 0.8333333333333334 + \color{blue}{\frac{-0.2222222222222222 \cdot 1}{t}} \]
      4. metadata-eval98.2%

        \[\leadsto 0.8333333333333334 + \frac{\color{blue}{-0.2222222222222222}}{t} \]
      5. +-commutative98.2%

        \[\leadsto \color{blue}{\frac{-0.2222222222222222}{t} + 0.8333333333333334} \]
    12. Simplified98.2%

      \[\leadsto \color{blue}{\frac{-0.2222222222222222}{t} + 0.8333333333333334} \]

    if -0.48999999999999999 < t < 0.680000000000000049

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(2 \cdot t\right)}} \]
    4. Taylor expanded in t around inf 99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{4 \cdot t}} \]
    5. Step-by-step derivation
      1. *-commutative99.0%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    6. Simplified99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    7. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{0.5} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification99.0%

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.49 \lor \neg \left(t \leq 0.68\right):\\ \;\;\;\;\frac{-0.2222222222222222}{t} + 0.8333333333333334\\ \mathbf{else}:\\ \;\;\;\;0.5\\ \end{array} \]
  5. Add Preprocessing

Alternative 8: 98.6% accurate, 2.6× speedup?

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.34:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \end{array} \]
(FPCore (t)
 :precision binary64
 (if (<= t -0.34) 0.8333333333333334 (if (<= t 1.0) 0.5 0.8333333333333334)))
double code(double t) {
	double tmp;
	if (t <= -0.34) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}
real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.34d0)) then
        tmp = 0.8333333333333334d0
    else if (t <= 1.0d0) then
        tmp = 0.5d0
    else
        tmp = 0.8333333333333334d0
    end if
    code = tmp
end function
public static double code(double t) {
	double tmp;
	if (t <= -0.34) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}
def code(t):
	tmp = 0
	if t <= -0.34:
		tmp = 0.8333333333333334
	elif t <= 1.0:
		tmp = 0.5
	else:
		tmp = 0.8333333333333334
	return tmp
function code(t)
	tmp = 0.0
	if (t <= -0.34)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	return tmp
end
function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.34)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	tmp_2 = tmp;
end
code[t_] := If[LessEqual[t, -0.34], 0.8333333333333334, If[LessEqual[t, 1.0], 0.5, 0.8333333333333334]]
\begin{array}{l}

\\
\begin{array}{l}
\mathbf{if}\;t \leq -0.34:\\
\;\;\;\;0.8333333333333334\\

\mathbf{elif}\;t \leq 1:\\
\;\;\;\;0.5\\

\mathbf{else}:\\
\;\;\;\;0.8333333333333334\\


\end{array}
\end{array}
Derivation
  1. Split input into 2 regimes
  2. if t < -0.340000000000000024 or 1 < t

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around inf 98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
    4. Step-by-step derivation
      1. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
      2. associate--l+98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
      3. +-commutative98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
      4. associate--r-98.3%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
      5. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
      6. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
      7. unpow298.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
      8. associate-/r*98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
      9. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
      10. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
      11. div-sub98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
      12. sub-neg98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
      13. associate-*r/98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
      14. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
      15. distribute-neg-frac98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
      16. metadata-eval98.3%

        \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
    5. Simplified98.3%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
    6. Taylor expanded in t around -inf 98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    7. Step-by-step derivation
      1. mul-1-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
      2. unsub-neg98.5%

        \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
      3. sub-neg98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
      4. associate-*r/98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
      5. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
      6. metadata-eval98.5%

        \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
    8. Simplified98.5%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]
    9. Taylor expanded in t around inf 98.2%

      \[\leadsto 1 - \left(0.16666666666666666 - \color{blue}{\frac{-0.2222222222222222}{t}}\right) \]
    10. Taylor expanded in t around inf 97.5%

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

    if -0.340000000000000024 < t < 1

    1. Initial program 100.0%

      \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
    2. Add Preprocessing
    3. Taylor expanded in t around 0 99.8%

      \[\leadsto 1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \color{blue}{\left(2 \cdot t\right)}} \]
    4. Taylor expanded in t around inf 99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{4 \cdot t}} \]
    5. Step-by-step derivation
      1. *-commutative99.0%

        \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    6. Simplified99.0%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{t \cdot 4}} \]
    7. Taylor expanded in t around 0 99.6%

      \[\leadsto 1 - \color{blue}{0.5} \]
  3. Recombined 2 regimes into one program.
  4. Final simplification98.6%

    \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -0.34:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \]
  5. Add Preprocessing

Alternative 9: 58.6% accurate, 29.0× speedup?

\[\begin{array}{l} \\ 0.8333333333333334 \end{array} \]
(FPCore (t) :precision binary64 0.8333333333333334)
double code(double t) {
	return 0.8333333333333334;
}
real(8) function code(t)
    real(8), intent (in) :: t
    code = 0.8333333333333334d0
end function
public static double code(double t) {
	return 0.8333333333333334;
}
def code(t):
	return 0.8333333333333334
function code(t)
	return 0.8333333333333334
end
function tmp = code(t)
	tmp = 0.8333333333333334;
end
code[t_] := 0.8333333333333334
\begin{array}{l}

\\
0.8333333333333334
\end{array}
Derivation
  1. Initial program 100.0%

    \[1 - \frac{1}{2 + \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right) \cdot \left(2 - \frac{\frac{2}{t}}{1 + \frac{1}{t}}\right)} \]
  2. Add Preprocessing
  3. Taylor expanded in t around inf 55.7%

    \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 + \frac{12}{{t}^{2}}\right) - 8 \cdot \frac{1}{t}\right)}} \]
  4. Step-by-step derivation
    1. +-commutative55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(\color{blue}{\left(\frac{12}{{t}^{2}} + 4\right)} - 8 \cdot \frac{1}{t}\right)} \]
    2. associate--l+55.7%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\frac{12}{{t}^{2}} + \left(4 - 8 \cdot \frac{1}{t}\right)\right)}} \]
    3. +-commutative55.7%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(\left(4 - 8 \cdot \frac{1}{t}\right) + \frac{12}{{t}^{2}}\right)}} \]
    4. associate--r-55.7%

      \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \left(8 \cdot \frac{1}{t} - \frac{12}{{t}^{2}}\right)\right)}} \]
    5. associate-*r/55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\color{blue}{\frac{8 \cdot 1}{t}} - \frac{12}{{t}^{2}}\right)\right)} \]
    6. metadata-eval55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{\color{blue}{8}}{t} - \frac{12}{{t}^{2}}\right)\right)} \]
    7. unpow255.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{12}{\color{blue}{t \cdot t}}\right)\right)} \]
    8. associate-/r*55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \color{blue}{\frac{\frac{12}{t}}{t}}\right)\right)} \]
    9. metadata-eval55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\frac{\color{blue}{12 \cdot 1}}{t}}{t}\right)\right)} \]
    10. associate-*r/55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \left(\frac{8}{t} - \frac{\color{blue}{12 \cdot \frac{1}{t}}}{t}\right)\right)} \]
    11. div-sub55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \color{blue}{\frac{8 - 12 \cdot \frac{1}{t}}{t}}\right)} \]
    12. sub-neg55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{\color{blue}{8 + \left(-12 \cdot \frac{1}{t}\right)}}{t}\right)} \]
    13. associate-*r/55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\color{blue}{\frac{12 \cdot 1}{t}}\right)}{t}\right)} \]
    14. metadata-eval55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \left(-\frac{\color{blue}{12}}{t}\right)}{t}\right)} \]
    15. distribute-neg-frac55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \color{blue}{\frac{-12}{t}}}{t}\right)} \]
    16. metadata-eval55.7%

      \[\leadsto 1 - \frac{1}{2 + \left(4 - \frac{8 + \frac{\color{blue}{-12}}{t}}{t}\right)} \]
  5. Simplified55.7%

    \[\leadsto 1 - \frac{1}{2 + \color{blue}{\left(4 - \frac{8 + \frac{-12}{t}}{t}\right)}} \]
  6. Taylor expanded in t around -inf 47.9%

    \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 + -1 \cdot \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
  7. Step-by-step derivation
    1. mul-1-neg47.9%

      \[\leadsto 1 - \left(0.16666666666666666 + \color{blue}{\left(-\frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)}\right) \]
    2. unsub-neg47.9%

      \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{0.037037037037037035 \cdot \frac{1}{t} - 0.2222222222222222}{t}\right)} \]
    3. sub-neg47.9%

      \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{0.037037037037037035 \cdot \frac{1}{t} + \left(-0.2222222222222222\right)}}{t}\right) \]
    4. associate-*r/47.9%

      \[\leadsto 1 - \left(0.16666666666666666 - \frac{\color{blue}{\frac{0.037037037037037035 \cdot 1}{t}} + \left(-0.2222222222222222\right)}{t}\right) \]
    5. metadata-eval47.9%

      \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{\color{blue}{0.037037037037037035}}{t} + \left(-0.2222222222222222\right)}{t}\right) \]
    6. metadata-eval47.9%

      \[\leadsto 1 - \left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + \color{blue}{-0.2222222222222222}}{t}\right) \]
  8. Simplified47.9%

    \[\leadsto 1 - \color{blue}{\left(0.16666666666666666 - \frac{\frac{0.037037037037037035}{t} + -0.2222222222222222}{t}\right)} \]
  9. Taylor expanded in t around inf 47.4%

    \[\leadsto 1 - \left(0.16666666666666666 - \color{blue}{\frac{-0.2222222222222222}{t}}\right) \]
  10. Taylor expanded in t around inf 55.8%

    \[\leadsto \color{blue}{0.8333333333333334} \]
  11. Final simplification55.8%

    \[\leadsto 0.8333333333333334 \]
  12. Add Preprocessing

Reproduce

?
herbie shell --seed 2024053 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1.0 (/ 1.0 (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))))))