Kahan p13 Example 1

Percentage Accurate: 99.9% → 100.0%

Time: 8.9s

Alternatives: 9

Speedup: 1.1×

Specification

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{2 \cdot t}{1 + t}\\ t_2 := t\_1 \cdot t\_1\\ \frac{1 + t\_2}{2 + t\_2} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (/ (* 2.0 t) (+ 1.0 t))) (t_2 (* t_1 t_1)))
   (/ (+ 1.0 t_2) (+ 2.0 t_2))))

C

double code(double t) {
	double t_1 = (2.0 * t) / (1.0 + t);
	double t_2 = t_1 * t_1;
	return (1.0 + t_2) / (2.0 + t_2);
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    t_1 = (2.0d0 * t) / (1.0d0 + t)
    t_2 = t_1 * t_1
    code = (1.0d0 + t_2) / (2.0d0 + t_2)
end function

Java

public static double code(double t) {
	double t_1 = (2.0 * t) / (1.0 + t);
	double t_2 = t_1 * t_1;
	return (1.0 + t_2) / (2.0 + t_2);
}

Python

def code(t):
	t_1 = (2.0 * t) / (1.0 + t)
	t_2 = t_1 * t_1
	return (1.0 + t_2) / (2.0 + t_2)

Julia

function code(t)
	t_1 = Float64(Float64(2.0 * t) / Float64(1.0 + t))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(1.0 + t_2) / Float64(2.0 + t_2))
end

MATLAB

function tmp = code(t)
	t_1 = (2.0 * t) / (1.0 + t);
	t_2 = t_1 * t_1;
	tmp = (1.0 + t_2) / (2.0 + t_2);
end

Wolfram

code[t_] := Block[{t$95$1 = N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(1.0 + t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{2 \cdot t}{1 + t}\\ t_2 := t\_1 \cdot t\_1\\ \frac{1 + t\_2}{2 + t\_2} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (/ (* 2.0 t) (+ 1.0 t))) (t_2 (* t_1 t_1)))
   (/ (+ 1.0 t_2) (+ 2.0 t_2))))

C

double code(double t) {
	double t_1 = (2.0 * t) / (1.0 + t);
	double t_2 = t_1 * t_1;
	return (1.0 + t_2) / (2.0 + t_2);
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    t_1 = (2.0d0 * t) / (1.0d0 + t)
    t_2 = t_1 * t_1
    code = (1.0d0 + t_2) / (2.0d0 + t_2)
end function

Java

public static double code(double t) {
	double t_1 = (2.0 * t) / (1.0 + t);
	double t_2 = t_1 * t_1;
	return (1.0 + t_2) / (2.0 + t_2);
}

Python

def code(t):
	t_1 = (2.0 * t) / (1.0 + t)
	t_2 = t_1 * t_1
	return (1.0 + t_2) / (2.0 + t_2)

Julia

function code(t)
	t_1 = Float64(Float64(2.0 * t) / Float64(1.0 + t))
	t_2 = Float64(t_1 * t_1)
	return Float64(Float64(1.0 + t_2) / Float64(2.0 + t_2))
end

MATLAB

function tmp = code(t)
	t_1 = (2.0 * t) / (1.0 + t);
	t_2 = t_1 * t_1;
	tmp = (1.0 + t_2) / (2.0 + t_2);
end

Wolfram

code[t_] := Block[{t$95$1 = N[(N[(2.0 * t), $MachinePrecision] / N[(1.0 + t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t$95$1 * t$95$1), $MachinePrecision]}, N[(N[(1.0 + t$95$2), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]

Alternative 1: 100.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{t + 1}\\ \frac{1 - 4 \cdot \left(\frac{t}{-1 + \left(t + 2\right)} \cdot \frac{t}{-1 - t}\right)}{2 + 4 \cdot \left(t\_1 \cdot t\_1\right)} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (/ t (+ t 1.0))))
   (/
    (- 1.0 (* 4.0 (* (/ t (+ -1.0 (+ t 2.0))) (/ t (- -1.0 t)))))
    (+ 2.0 (* 4.0 (* t_1 t_1))))))

C

double code(double t) {
	double t_1 = t / (t + 1.0);
	return (1.0 - (4.0 * ((t / (-1.0 + (t + 2.0))) * (t / (-1.0 - t))))) / (2.0 + (4.0 * (t_1 * t_1)));
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    t_1 = t / (t + 1.0d0)
    code = (1.0d0 - (4.0d0 * ((t / ((-1.0d0) + (t + 2.0d0))) * (t / ((-1.0d0) - t))))) / (2.0d0 + (4.0d0 * (t_1 * t_1)))
end function

Java

public static double code(double t) {
	double t_1 = t / (t + 1.0);
	return (1.0 - (4.0 * ((t / (-1.0 + (t + 2.0))) * (t / (-1.0 - t))))) / (2.0 + (4.0 * (t_1 * t_1)));
}

Python

def code(t):
	t_1 = t / (t + 1.0)
	return (1.0 - (4.0 * ((t / (-1.0 + (t + 2.0))) * (t / (-1.0 - t))))) / (2.0 + (4.0 * (t_1 * t_1)))

Julia

function code(t)
	t_1 = Float64(t / Float64(t + 1.0))
	return Float64(Float64(1.0 - Float64(4.0 * Float64(Float64(t / Float64(-1.0 + Float64(t + 2.0))) * Float64(t / Float64(-1.0 - t))))) / Float64(2.0 + Float64(4.0 * Float64(t_1 * t_1))))
end

MATLAB

function tmp = code(t)
	t_1 = t / (t + 1.0);
	tmp = (1.0 - (4.0 * ((t / (-1.0 + (t + 2.0))) * (t / (-1.0 - t))))) / (2.0 + (4.0 * (t_1 * t_1)));
end

Wolfram

code[t_] := Block[{t$95$1 = N[(t / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]}, N[(N[(1.0 - N[(4.0 * N[(N[(t / N[(-1.0 + N[(t + 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * N[(t / N[(-1.0 - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(2.0 + N[(4.0 * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Initial program 100.0%

   \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

   2. associate-/l* 100.0%

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

   3. swap-sqr 100.0%

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

   4. metadata-eval 100.0%

      \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

   5. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

   6. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

   7. swap-sqr 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

   8. metadata-eval 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
4. Add Preprocessing
5. Step-by-step derivation

   1. expm1-log1p-u 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{\color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(1 + t\right)\right)}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   2. expm1-undefine 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{\color{blue}{e^{\mathsf{log1p}\left(1 + t\right)} - 1}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. +-commutative 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{e^{\mathsf{log1p}\left(\color{blue}{t + 1}\right)} - 1}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

6. Applied egg-rr 73.5%

   \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{\color{blue}{e^{\mathsf{log1p}\left(t + 1\right)} - 1}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]
7. Step-by-step derivation

   1. sub-neg 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{\color{blue}{e^{\mathsf{log1p}\left(t + 1\right)} + \left(-1\right)}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   2. metadata-eval 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{e^{\mathsf{log1p}\left(t + 1\right)} + \color{blue}{-1}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. +-commutative 73.5%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{\color{blue}{-1 + e^{\mathsf{log1p}\left(t + 1\right)}}}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   4. log1p-undefine 73.5%

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

   5. rem-exp-log 100.0%

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

   6. +-commutative 100.0%

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

   7. associate-+r+ 100.0%

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

   8. metadata-eval 100.0%

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

8. Simplified 100.0%

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

9. Final simplification 100.0%

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

Alternative 2: 100.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{t + 1}\\ t_2 := 4 \cdot \left(t\_1 \cdot t\_1\right)\\ \frac{t\_2 + 1}{2 + t\_2} \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (let* ((t_1 (/ t (+ t 1.0))) (t_2 (* 4.0 (* t_1 t_1))))
   (/ (+ t_2 1.0) (+ 2.0 t_2))))

C

double code(double t) {
	double t_1 = t / (t + 1.0);
	double t_2 = 4.0 * (t_1 * t_1);
	return (t_2 + 1.0) / (2.0 + t_2);
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: t_2
    t_1 = t / (t + 1.0d0)
    t_2 = 4.0d0 * (t_1 * t_1)
    code = (t_2 + 1.0d0) / (2.0d0 + t_2)
end function

Java

public static double code(double t) {
	double t_1 = t / (t + 1.0);
	double t_2 = 4.0 * (t_1 * t_1);
	return (t_2 + 1.0) / (2.0 + t_2);
}

Python

def code(t):
	t_1 = t / (t + 1.0)
	t_2 = 4.0 * (t_1 * t_1)
	return (t_2 + 1.0) / (2.0 + t_2)

Julia

function code(t)
	t_1 = Float64(t / Float64(t + 1.0))
	t_2 = Float64(4.0 * Float64(t_1 * t_1))
	return Float64(Float64(t_2 + 1.0) / Float64(2.0 + t_2))
end

MATLAB

function tmp = code(t)
	t_1 = t / (t + 1.0);
	t_2 = 4.0 * (t_1 * t_1);
	tmp = (t_2 + 1.0) / (2.0 + t_2);
end

Wolfram

code[t_] := Block[{t$95$1 = N[(t / N[(t + 1.0), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(4.0 * N[(t$95$1 * t$95$1), $MachinePrecision]), $MachinePrecision]}, N[(N[(t$95$2 + 1.0), $MachinePrecision] / N[(2.0 + t$95$2), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Initial program 100.0%

   \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

   2. associate-/l* 100.0%

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

   3. swap-sqr 100.0%

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

   4. metadata-eval 100.0%

      \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

   5. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

   6. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

   7. swap-sqr 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

   8. metadata-eval 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
4. Add Preprocessing

5. Final simplification 100.0%

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

Alternative 3: 99.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.52 \lor \neg \left(t \leq 0.58\right):\\ \;\;\;\;0.8333333333333334 + \frac{\frac{0.037037037037037035 + \frac{0.04938271604938271}{t}}{t} - 0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(t \cdot t\right) \cdot \left(t \cdot -2 + 1\right) + 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.52) (not (<= t 0.58)))
   (+
    0.8333333333333334
    (/
     (-
      (/ (+ 0.037037037037037035 (/ 0.04938271604938271 t)) t)
      0.2222222222222222)
     t))
   (+ (* (* t t) (+ (* t -2.0) 1.0)) 0.5)))

C

double code(double t) {
	double tmp;
	if ((t <= -0.52) || !(t <= 0.58)) {
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) - 0.2222222222222222) / t);
	} else {
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.52d0)) .or. (.not. (t <= 0.58d0))) then
        tmp = 0.8333333333333334d0 + ((((0.037037037037037035d0 + (0.04938271604938271d0 / t)) / t) - 0.2222222222222222d0) / t)
    else
        tmp = ((t * t) * ((t * (-2.0d0)) + 1.0d0)) + 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.52) || !(t <= 0.58)) {
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) - 0.2222222222222222) / t);
	} else {
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.52) or not (t <= 0.58):
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) - 0.2222222222222222) / t)
	else:
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.52) || !(t <= 0.58))
		tmp = Float64(0.8333333333333334 + Float64(Float64(Float64(Float64(0.037037037037037035 + Float64(0.04938271604938271 / t)) / t) - 0.2222222222222222) / t));
	else
		tmp = Float64(Float64(Float64(t * t) * Float64(Float64(t * -2.0) + 1.0)) + 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.52) || ~((t <= 0.58)))
		tmp = 0.8333333333333334 + ((((0.037037037037037035 + (0.04938271604938271 / t)) / t) - 0.2222222222222222) / t);
	else
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.52], N[Not[LessEqual[t, 0.58]], $MachinePrecision]], N[(0.8333333333333334 + N[(N[(N[(N[(0.037037037037037035 + N[(0.04938271604938271 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision] - 0.2222222222222222), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * N[(N[(t * -2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.52000000000000002 or 0.57999999999999996 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around -inf 99.1%

      \[\leadsto \color{blue}{0.8333333333333334 + -1 \cdot \frac{0.2222222222222222 + -1 \cdot \frac{0.037037037037037035 + 0.04938271604938271 \cdot \frac{1}{t}}{t}}{t}} \]
   6. Step-by-step derivation

      1. mul-1-neg 99.1%

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

      2. unsub-neg 99.1%

         \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222 + -1 \cdot \frac{0.037037037037037035 + 0.04938271604938271 \cdot \frac{1}{t}}{t}}{t}} \]

      3. mul-1-neg 99.1%

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

      4. unsub-neg 99.1%

         \[\leadsto 0.8333333333333334 - \frac{\color{blue}{0.2222222222222222 - \frac{0.037037037037037035 + 0.04938271604938271 \cdot \frac{1}{t}}{t}}}{t} \]

      5. associate-*r/ 99.1%

         \[\leadsto 0.8333333333333334 - \frac{0.2222222222222222 - \frac{0.037037037037037035 + \color{blue}{\frac{0.04938271604938271 \cdot 1}{t}}}{t}}{t} \]

      6. metadata-eval 99.1%

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

   7. Simplified 99.1%

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

   if -0.52000000000000002 < t < 0.57999999999999996

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 100.0%

      \[\leadsto \color{blue}{0.5 + {t}^{2} \cdot \left(1 + -2 \cdot t\right)} \]
   6. Step-by-step derivation

      1. +-commutative 100.0%

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + -2 \cdot t\right) + 0.5} \]

      2. *-commutative 100.0%

         \[\leadsto {t}^{2} \cdot \left(1 + \color{blue}{t \cdot -2}\right) + 0.5 \]

   7. Simplified 100.0%

      \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot -2\right) + 0.5} \]
   8. Step-by-step derivation

      1. unpow2 100.0%

         \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   9. Applied egg-rr 100.0%

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

4. Final simplification 99.5%

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

Alternative 4: 99.5% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.6 \lor \neg \left(t \leq 0.44\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222 + \frac{-0.037037037037037035}{t}}{t}\\ \mathbf{else}:\\ \;\;\;\;\left(t \cdot t\right) \cdot \left(t \cdot -2 + 1\right) + 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.6) (not (<= t 0.44)))
   (-
    0.8333333333333334
    (/ (+ 0.2222222222222222 (/ -0.037037037037037035 t)) t))
   (+ (* (* t t) (+ (* t -2.0) 1.0)) 0.5)))

C

double code(double t) {
	double tmp;
	if ((t <= -0.6) || !(t <= 0.44)) {
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	} else {
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.6d0)) .or. (.not. (t <= 0.44d0))) then
        tmp = 0.8333333333333334d0 - ((0.2222222222222222d0 + ((-0.037037037037037035d0) / t)) / t)
    else
        tmp = ((t * t) * ((t * (-2.0d0)) + 1.0d0)) + 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.6) || !(t <= 0.44)) {
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	} else {
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.6) or not (t <= 0.44):
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t)
	else:
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.6) || !(t <= 0.44))
		tmp = Float64(0.8333333333333334 - Float64(Float64(0.2222222222222222 + Float64(-0.037037037037037035 / t)) / t));
	else
		tmp = Float64(Float64(Float64(t * t) * Float64(Float64(t * -2.0) + 1.0)) + 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.6) || ~((t <= 0.44)))
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	else
		tmp = ((t * t) * ((t * -2.0) + 1.0)) + 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.6], N[Not[LessEqual[t, 0.44]], $MachinePrecision]], N[(0.8333333333333334 - N[(N[(0.2222222222222222 + N[(-0.037037037037037035 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(N[(t * t), $MachinePrecision] * N[(N[(t * -2.0), $MachinePrecision] + 1.0), $MachinePrecision]), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.599999999999999978 or 0.440000000000000002 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around -inf 99.5%

      \[\leadsto \color{blue}{0.8333333333333334 + -1 \cdot \frac{0.2222222222222222 - 0.037037037037037035 \cdot \frac{1}{t}}{t}} \]
   6. Step-by-step derivation

      1. mul-1-neg 99.5%

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

      2. unsub-neg 99.5%

         \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222 - 0.037037037037037035 \cdot \frac{1}{t}}{t}} \]

      3. sub-neg 99.5%

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

      4. associate-*r/ 99.5%

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

      5. metadata-eval 99.5%

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

      6. distribute-neg-frac 99.5%

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

      7. metadata-eval 99.5%

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

   7. Simplified 99.5%

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

   if -0.599999999999999978 < t < 0.440000000000000002

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.4%

      \[\leadsto \color{blue}{0.5 + {t}^{2} \cdot \left(1 + -2 \cdot t\right)} \]
   6. Step-by-step derivation

      1. +-commutative 99.4%

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + -2 \cdot t\right) + 0.5} \]

      2. *-commutative 99.4%

         \[\leadsto {t}^{2} \cdot \left(1 + \color{blue}{t \cdot -2}\right) + 0.5 \]

   7. Simplified 99.4%

      \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot -2\right) + 0.5} \]
   8. Step-by-step derivation

      1. unpow2 99.4%

         \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   9. Applied egg-rr 99.4%

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

4. Final simplification 99.4%

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

Alternative 5: 99.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.81 \lor \neg \left(t \leq 0.235\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222 + \frac{-0.037037037037037035}{t}}{t}\\ \mathbf{else}:\\ \;\;\;\;t \cdot t + 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.81) (not (<= t 0.235)))
   (-
    0.8333333333333334
    (/ (+ 0.2222222222222222 (/ -0.037037037037037035 t)) t))
   (+ (* t t) 0.5)))

C

double code(double t) {
	double tmp;
	if ((t <= -0.81) || !(t <= 0.235)) {
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	} else {
		tmp = (t * t) + 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.81d0)) .or. (.not. (t <= 0.235d0))) then
        tmp = 0.8333333333333334d0 - ((0.2222222222222222d0 + ((-0.037037037037037035d0) / t)) / t)
    else
        tmp = (t * t) + 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.81) || !(t <= 0.235)) {
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	} else {
		tmp = (t * t) + 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.81) or not (t <= 0.235):
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t)
	else:
		tmp = (t * t) + 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.81) || !(t <= 0.235))
		tmp = Float64(0.8333333333333334 - Float64(Float64(0.2222222222222222 + Float64(-0.037037037037037035 / t)) / t));
	else
		tmp = Float64(Float64(t * t) + 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.81) || ~((t <= 0.235)))
		tmp = 0.8333333333333334 - ((0.2222222222222222 + (-0.037037037037037035 / t)) / t);
	else
		tmp = (t * t) + 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.81], N[Not[LessEqual[t, 0.235]], $MachinePrecision]], N[(0.8333333333333334 - N[(N[(0.2222222222222222 + N[(-0.037037037037037035 / t), $MachinePrecision]), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], N[(N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.81000000000000005 or 0.23499999999999999 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around -inf 99.5%

      \[\leadsto \color{blue}{0.8333333333333334 + -1 \cdot \frac{0.2222222222222222 - 0.037037037037037035 \cdot \frac{1}{t}}{t}} \]
   6. Step-by-step derivation

      1. mul-1-neg 99.5%

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

      2. unsub-neg 99.5%

         \[\leadsto \color{blue}{0.8333333333333334 - \frac{0.2222222222222222 - 0.037037037037037035 \cdot \frac{1}{t}}{t}} \]

      3. sub-neg 99.5%

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

      4. associate-*r/ 99.5%

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

      5. metadata-eval 99.5%

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

      6. distribute-neg-frac 99.5%

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

      7. metadata-eval 99.5%

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

   7. Simplified 99.5%

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

   if -0.81000000000000005 < t < 0.23499999999999999

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.4%

      \[\leadsto \color{blue}{0.5 + {t}^{2} \cdot \left(1 + -2 \cdot t\right)} \]
   6. Step-by-step derivation

      1. +-commutative 99.4%

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + -2 \cdot t\right) + 0.5} \]

      2. *-commutative 99.4%

         \[\leadsto {t}^{2} \cdot \left(1 + \color{blue}{t \cdot -2}\right) + 0.5 \]

   7. Simplified 99.4%

      \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot -2\right) + 0.5} \]
   8. Step-by-step derivation

      1. unpow2 99.4%

         \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   9. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   10. Taylor expanded in t around 0 99.2%

       \[\leadsto \left(t \cdot t\right) \cdot \color{blue}{1} + 0.5 \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

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

Alternative 6: 99.2% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.8 \lor \neg \left(t \leq 0.58\right):\\ \;\;\;\;0.8333333333333334 - \frac{0.2222222222222222}{t}\\ \mathbf{else}:\\ \;\;\;\;t \cdot t + 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.8) (not (<= t 0.58)))
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   (+ (* t t) 0.5)))

C

double code(double t) {
	double tmp;
	if ((t <= -0.8) || !(t <= 0.58)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = (t * t) + 0.5;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((t <= (-0.8d0)) .or. (.not. (t <= 0.58d0))) then
        tmp = 0.8333333333333334d0 - (0.2222222222222222d0 / t)
    else
        tmp = (t * t) + 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.8) || !(t <= 0.58)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = (t * t) + 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.8) or not (t <= 0.58):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = (t * t) + 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.8) || !(t <= 0.58))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = Float64(Float64(t * t) + 0.5);
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.8) || ~((t <= 0.58)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = (t * t) + 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.8], N[Not[LessEqual[t, 0.58]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], N[(N[(t * t), $MachinePrecision] + 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -0.80000000000000004 or 0.57999999999999996 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 99.2%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
   6. Step-by-step derivation

      1. associate-*r/ 99.2%

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

      2. metadata-eval 99.2%

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

   7. Simplified 99.2%

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

   if -0.80000000000000004 < t < 0.57999999999999996

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.4%

      \[\leadsto \color{blue}{0.5 + {t}^{2} \cdot \left(1 + -2 \cdot t\right)} \]
   6. Step-by-step derivation

      1. +-commutative 99.4%

         \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + -2 \cdot t\right) + 0.5} \]

      2. *-commutative 99.4%

         \[\leadsto {t}^{2} \cdot \left(1 + \color{blue}{t \cdot -2}\right) + 0.5 \]

   7. Simplified 99.4%

      \[\leadsto \color{blue}{{t}^{2} \cdot \left(1 + t \cdot -2\right) + 0.5} \]
   8. Step-by-step derivation

      1. unpow2 99.4%

         \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   9. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\left(t \cdot t\right)} \cdot \left(1 + t \cdot -2\right) + 0.5 \]

   10. Taylor expanded in t around 0 99.2%

       \[\leadsto \left(t \cdot t\right) \cdot \color{blue}{1} + 0.5 \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

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

Alternative 7: 99.1% accurate, 2.3× speedup

Math

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

FPCore

(FPCore (t)
 :precision binary64
 (if (or (<= t -0.49) (not (<= t 0.68)))
   (- 0.8333333333333334 (/ 0.2222222222222222 t))
   0.5))

C

double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Fortran

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.8333333333333334d0 - (0.2222222222222222d0 / t)
    else
        tmp = 0.5d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if ((t <= -0.49) || !(t <= 0.68)) {
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	} else {
		tmp = 0.5;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if (t <= -0.49) or not (t <= 0.68):
		tmp = 0.8333333333333334 - (0.2222222222222222 / t)
	else:
		tmp = 0.5
	return tmp

Julia

function code(t)
	tmp = 0.0
	if ((t <= -0.49) || !(t <= 0.68))
		tmp = Float64(0.8333333333333334 - Float64(0.2222222222222222 / t));
	else
		tmp = 0.5;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if ((t <= -0.49) || ~((t <= 0.68)))
		tmp = 0.8333333333333334 - (0.2222222222222222 / t);
	else
		tmp = 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[Or[LessEqual[t, -0.49], N[Not[LessEqual[t, 0.68]], $MachinePrecision]], N[(0.8333333333333334 - N[(0.2222222222222222 / t), $MachinePrecision]), $MachinePrecision], 0.5]

Derivation

1. Split input into 2 regimes

2. if t < -0.48999999999999999 or 0.680000000000000049 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 98.6%

      \[\leadsto \color{blue}{0.8333333333333334 - 0.2222222222222222 \cdot \frac{1}{t}} \]
   6. Step-by-step derivation

      1. associate-*r/ 98.6%

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

      2. metadata-eval 98.6%

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

   7. Simplified 98.6%

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

   if -0.48999999999999999 < t < 0.680000000000000049

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.3%

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

4. Final simplification 98.9%

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

Alternative 8: 98.5% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -0.33:\\ \;\;\;\;0.8333333333333334\\ \mathbf{elif}\;t \leq 1:\\ \;\;\;\;0.5\\ \mathbf{else}:\\ \;\;\;\;0.8333333333333334\\ \end{array} \end{array} \]

FPCore

(FPCore (t)
 :precision binary64
 (if (<= t -0.33) 0.8333333333333334 (if (<= t 1.0) 0.5 0.8333333333333334)))

C

double code(double t) {
	double tmp;
	if (t <= -0.33) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-0.33d0)) then
        tmp = 0.8333333333333334d0
    else if (t <= 1.0d0) then
        tmp = 0.5d0
    else
        tmp = 0.8333333333333334d0
    end if
    code = tmp
end function

Java

public static double code(double t) {
	double tmp;
	if (t <= -0.33) {
		tmp = 0.8333333333333334;
	} else if (t <= 1.0) {
		tmp = 0.5;
	} else {
		tmp = 0.8333333333333334;
	}
	return tmp;
}

Python

def code(t):
	tmp = 0
	if t <= -0.33:
		tmp = 0.8333333333333334
	elif t <= 1.0:
		tmp = 0.5
	else:
		tmp = 0.8333333333333334
	return tmp

Julia

function code(t)
	tmp = 0.0
	if (t <= -0.33)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	return tmp
end

MATLAB

function tmp_2 = code(t)
	tmp = 0.0;
	if (t <= -0.33)
		tmp = 0.8333333333333334;
	elseif (t <= 1.0)
		tmp = 0.5;
	else
		tmp = 0.8333333333333334;
	end
	tmp_2 = tmp;
end

Wolfram

code[t_] := If[LessEqual[t, -0.33], 0.8333333333333334, If[LessEqual[t, 1.0], 0.5, 0.8333333333333334]]

Derivation

1. Split input into 2 regimes

2. if t < -0.330000000000000016 or 1 < t

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around inf 96.9%

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

   if -0.330000000000000016 < t < 1

   1. Initial program 100.0%

      \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
   2. Step-by-step derivation

      1. associate-/l* 100.0%

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

      2. associate-/l* 100.0%

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

      3. swap-sqr 100.0%

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

      4. metadata-eval 100.0%

         \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

      5. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

      6. associate-/l* 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

      7. swap-sqr 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

      8. metadata-eval 100.0%

         \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
   4. Add Preprocessing

   5. Taylor expanded in t around 0 99.3%

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

Alternative 9: 59.2% accurate, 35.0× speedup

Math

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

FPCore

(FPCore (t) :precision binary64 0.5)

C

double code(double t) {
	return 0.5;
}

Fortran

real(8) function code(t)
    real(8), intent (in) :: t
    code = 0.5d0
end function

Java

public static double code(double t) {
	return 0.5;
}

Python

def code(t):
	return 0.5

Julia

function code(t)
	return 0.5
end

MATLAB

function tmp = code(t)
	tmp = 0.5;
end

Wolfram

code[t_] := 0.5

Derivation

1. Initial program 100.0%

   \[\frac{1 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]
2. Step-by-step derivation

   1. associate-/l* 100.0%

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

   2. associate-/l* 100.0%

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

   3. swap-sqr 100.0%

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

   4. metadata-eval 100.0%

      \[\leadsto \frac{1 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \frac{2 \cdot t}{1 + t}} \]

   5. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \frac{2 \cdot t}{1 + t} \cdot \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)}} \]

   6. associate-/l* 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot \frac{t}{1 + t}\right)} \cdot \left(2 \cdot \frac{t}{1 + t}\right)} \]

   7. swap-sqr 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{\left(2 \cdot 2\right) \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]

   8. metadata-eval 100.0%

      \[\leadsto \frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + \color{blue}{4} \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{\frac{1 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}{2 + 4 \cdot \left(\frac{t}{1 + t} \cdot \frac{t}{1 + t}\right)}} \]
4. Add Preprocessing

5. Taylor expanded in t around 0 58.3%

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

Reproduce

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