Rust f32::atanh

Percentage Accurate: 99.8% → 99.8%
Time: 5.9s
Alternatives: 8
Speedup: 1.0×

Specification

?
\[\begin{array}{l} \\ \tanh^{-1} x \end{array} \]
(FPCore (x) :precision binary32 (atanh x))
float code(float x) {
	return atanhf(x);
}
function code(x)
	return atanh(x)
end
function tmp = code(x)
	tmp = atanh(x);
end
\begin{array}{l}

\\
\tanh^{-1} x
\end{array}

Sampling outcomes in binary32 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 8 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.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \end{array} \]
(FPCore (x) :precision binary32 (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))
float code(float x) {
	return 0.5f * log1pf(((2.0f * x) / (1.0f - x)));
}
function code(x)
	return Float32(Float32(0.5) * log1p(Float32(Float32(Float32(2.0) * x) / Float32(Float32(1.0) - x))))
end
\begin{array}{l}

\\
0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right)
\end{array}

Alternative 1: 99.8% accurate, 0.8× speedup?

\[\begin{array}{l} \\ \begin{array}{l} t_0 := 2 \cdot \frac{x}{1 - x \cdot x}\\ 0.5 \cdot \mathsf{log1p}\left(\mathsf{fma}\left(t\_0, x, t\_0\right)\right) \end{array} \end{array} \]
(FPCore (x)
 :precision binary32
 (let* ((t_0 (* 2.0 (/ x (- 1.0 (* x x)))))) (* 0.5 (log1p (fma t_0 x t_0)))))
float code(float x) {
	float t_0 = 2.0f * (x / (1.0f - (x * x)));
	return 0.5f * log1pf(fmaf(t_0, x, t_0));
}
function code(x)
	t_0 = Float32(Float32(2.0) * Float32(x / Float32(Float32(1.0) - Float32(x * x))))
	return Float32(Float32(0.5) * log1p(fma(t_0, x, t_0)))
end
\begin{array}{l}

\\
\begin{array}{l}
t_0 := 2 \cdot \frac{x}{1 - x \cdot x}\\
0.5 \cdot \mathsf{log1p}\left(\mathsf{fma}\left(t\_0, x, t\_0\right)\right)
\end{array}
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-/.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\color{blue}{\frac{2 \cdot x}{1 - x}}\right) \]
    2. lift--.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{\color{blue}{1 - x}}\right) \]
    3. flip--N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{\color{blue}{\frac{1 \cdot 1 - x \cdot x}{1 + x}}}\right) \]
    4. associate-/r/N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\color{blue}{\frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot \left(1 + x\right)}\right) \]
    5. +-commutativeN/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot \color{blue}{\left(x + 1\right)}\right) \]
    6. distribute-lft-inN/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\color{blue}{\frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot x + \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1}\right) \]
    7. lower-fma.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{fma}\left(\frac{2 \cdot x}{1 \cdot 1 - x \cdot x}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)}\right) \]
    8. lift-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(\frac{\color{blue}{2 \cdot x}}{1 \cdot 1 - x \cdot x}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    9. associate-/l*N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(\color{blue}{2 \cdot \frac{x}{1 \cdot 1 - x \cdot x}}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    10. lower-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(\color{blue}{2 \cdot \frac{x}{1 \cdot 1 - x \cdot x}}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    11. lower-/.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \color{blue}{\frac{x}{1 \cdot 1 - x \cdot x}}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    12. metadata-evalN/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \frac{x}{\color{blue}{1} - x \cdot x}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    13. lower--.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \frac{x}{\color{blue}{1 - x \cdot x}}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    14. lower-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \frac{x}{1 - \color{blue}{x \cdot x}}, x, \frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1\right)\right) \]
    15. lower-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \frac{x}{1 - x \cdot x}, x, \color{blue}{\frac{2 \cdot x}{1 \cdot 1 - x \cdot x} \cdot 1}\right)\right) \]
  4. Applied rewrites99.8%

    \[\leadsto 0.5 \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{fma}\left(2 \cdot \frac{x}{1 - x \cdot x}, x, \left(2 \cdot \frac{x}{1 - x \cdot x}\right) \cdot 1\right)}\right) \]
  5. Final simplification99.8%

    \[\leadsto 0.5 \cdot \mathsf{log1p}\left(\mathsf{fma}\left(2 \cdot \frac{x}{1 - x \cdot x}, x, 2 \cdot \frac{x}{1 - x \cdot x}\right)\right) \]
  6. Add Preprocessing

Alternative 2: 99.8% accurate, 1.0× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \mathsf{log1p}\left(\frac{x + x}{1 - x}\right) \end{array} \]
(FPCore (x) :precision binary32 (* 0.5 (log1p (/ (+ x x) (- 1.0 x)))))
float code(float x) {
	return 0.5f * log1pf(((x + x) / (1.0f - x)));
}
function code(x)
	return Float32(Float32(0.5) * log1p(Float32(Float32(x + x) / Float32(Float32(1.0) - x))))
end
\begin{array}{l}

\\
0.5 \cdot \mathsf{log1p}\left(\frac{x + x}{1 - x}\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Add Preprocessing
  3. Step-by-step derivation
    1. lift-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\frac{\color{blue}{2 \cdot x}}{1 - x}\right) \]
    2. count-2-revN/A

      \[\leadsto \frac{1}{2} \cdot \mathsf{log1p}\left(\frac{\color{blue}{x + x}}{1 - x}\right) \]
    3. lower-+.f3299.8

      \[\leadsto 0.5 \cdot \mathsf{log1p}\left(\frac{\color{blue}{x + x}}{1 - x}\right) \]
  4. Applied rewrites99.8%

    \[\leadsto 0.5 \cdot \mathsf{log1p}\left(\frac{\color{blue}{x + x}}{1 - x}\right) \]
  5. Add Preprocessing

Alternative 3: 99.2% accurate, 2.6× speedup?

\[\begin{array}{l} \\ 0.5 \cdot \mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x, x, x \cdot 2\right) \end{array} \]
(FPCore (x)
 :precision binary32
 (*
  0.5
  (fma
   (*
    (* (fma (fma 0.2857142857142857 (* x x) 0.4) (* x x) 0.6666666666666666) x)
    x)
   x
   (* x 2.0))))
float code(float x) {
	return 0.5f * fmaf(((fmaf(fmaf(0.2857142857142857f, (x * x), 0.4f), (x * x), 0.6666666666666666f) * x) * x), x, (x * 2.0f));
}
function code(x)
	return Float32(Float32(0.5) * fma(Float32(Float32(fma(fma(Float32(0.2857142857142857), Float32(x * x), Float32(0.4)), Float32(x * x), Float32(0.6666666666666666)) * x) * x), x, Float32(x * Float32(2.0))))
end
\begin{array}{l}

\\
0.5 \cdot \mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x, x, x \cdot 2\right)
\end{array}
Derivation
  1. Initial program 99.8%

    \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in x around 0

    \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(x \cdot \left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right)\right)} \]
  4. Step-by-step derivation
    1. *-commutativeN/A

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right) \cdot x\right)} \]
    2. lower-*.f32N/A

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right) \cdot x\right)} \]
  5. Applied rewrites99.3%

    \[\leadsto 0.5 \cdot \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)} \]
  6. Step-by-step derivation
    1. Applied rewrites99.5%

      \[\leadsto 0.5 \cdot \mathsf{fma}\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x, \color{blue}{x}, x \cdot 2\right) \]
    2. Add Preprocessing

    Alternative 4: 99.1% accurate, 2.8× speedup?

    \[\begin{array}{l} \\ 0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right) \end{array} \]
    (FPCore (x)
     :precision binary32
     (*
      0.5
      (*
       (fma
        (fma (fma 0.2857142857142857 (* x x) 0.4) (* x x) 0.6666666666666666)
        (* x x)
        2.0)
       x)))
    float code(float x) {
    	return 0.5f * (fmaf(fmaf(fmaf(0.2857142857142857f, (x * x), 0.4f), (x * x), 0.6666666666666666f), (x * x), 2.0f) * x);
    }
    
    function code(x)
    	return Float32(Float32(0.5) * Float32(fma(fma(fma(Float32(0.2857142857142857), Float32(x * x), Float32(0.4)), Float32(x * x), Float32(0.6666666666666666)), Float32(x * x), Float32(2.0)) * x))
    end
    
    \begin{array}{l}
    
    \\
    0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)
    \end{array}
    
    Derivation
    1. Initial program 99.8%

      \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(x \cdot \left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right)\right)} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right) \cdot x\right)} \]
      2. lower-*.f32N/A

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + {x}^{2} \cdot \left(\frac{2}{5} + \frac{2}{7} \cdot {x}^{2}\right)\right)\right) \cdot x\right)} \]
    5. Applied rewrites99.3%

      \[\leadsto 0.5 \cdot \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.2857142857142857, x \cdot x, 0.4\right), x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)} \]
    6. Add Preprocessing

    Alternative 5: 99.0% accurate, 3.3× speedup?

    \[\begin{array}{l} \\ 0.5 \cdot \mathsf{fma}\left(x, 2, \left(\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x\right) \cdot x\right) \end{array} \]
    (FPCore (x)
     :precision binary32
     (* 0.5 (fma x 2.0 (* (* (* (fma 0.4 (* x x) 0.6666666666666666) x) x) x))))
    float code(float x) {
    	return 0.5f * fmaf(x, 2.0f, (((fmaf(0.4f, (x * x), 0.6666666666666666f) * x) * x) * x));
    }
    
    function code(x)
    	return Float32(Float32(0.5) * fma(x, Float32(2.0), Float32(Float32(Float32(fma(Float32(0.4), Float32(x * x), Float32(0.6666666666666666)) * x) * x) * x)))
    end
    
    \begin{array}{l}
    
    \\
    0.5 \cdot \mathsf{fma}\left(x, 2, \left(\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x\right) \cdot x\right)
    \end{array}
    
    Derivation
    1. Initial program 99.8%

      \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
    2. Add Preprocessing
    3. Taylor expanded in x around 0

      \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(x \cdot \left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right)\right)} \]
    4. Step-by-step derivation
      1. *-commutativeN/A

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right) \cdot x\right)} \]
      2. lower-*.f32N/A

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right) \cdot x\right)} \]
      3. +-commutativeN/A

        \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left({x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right) + 2\right)} \cdot x\right) \]
      4. *-commutativeN/A

        \[\leadsto \frac{1}{2} \cdot \left(\left(\color{blue}{\left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right) \cdot {x}^{2}} + 2\right) \cdot x\right) \]
      5. lower-fma.f32N/A

        \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}, {x}^{2}, 2\right)} \cdot x\right) \]
      6. +-commutativeN/A

        \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\color{blue}{\frac{2}{5} \cdot {x}^{2} + \frac{2}{3}}, {x}^{2}, 2\right) \cdot x\right) \]
      7. lower-fma.f32N/A

        \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{2}{5}, {x}^{2}, \frac{2}{3}\right)}, {x}^{2}, 2\right) \cdot x\right) \]
      8. unpow2N/A

        \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, \color{blue}{x \cdot x}, \frac{2}{3}\right), {x}^{2}, 2\right) \cdot x\right) \]
      9. lower-*.f32N/A

        \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, \color{blue}{x \cdot x}, \frac{2}{3}\right), {x}^{2}, 2\right) \cdot x\right) \]
      10. unpow2N/A

        \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, x \cdot x, \frac{2}{3}\right), \color{blue}{x \cdot x}, 2\right) \cdot x\right) \]
      11. lower-*.f3299.1

        \[\leadsto 0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), \color{blue}{x \cdot x}, 2\right) \cdot x\right) \]
    5. Applied rewrites99.1%

      \[\leadsto 0.5 \cdot \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)} \]
    6. Step-by-step derivation
      1. Applied rewrites99.3%

        \[\leadsto 0.5 \cdot \mathsf{fma}\left(x, \color{blue}{2}, \left(\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right) \cdot x\right) \cdot x\right) \cdot x\right) \]
      2. Add Preprocessing

      Alternative 6: 98.9% accurate, 3.8× speedup?

      \[\begin{array}{l} \\ 0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right) \end{array} \]
      (FPCore (x)
       :precision binary32
       (* 0.5 (* (fma (fma 0.4 (* x x) 0.6666666666666666) (* x x) 2.0) x)))
      float code(float x) {
      	return 0.5f * (fmaf(fmaf(0.4f, (x * x), 0.6666666666666666f), (x * x), 2.0f) * x);
      }
      
      function code(x)
      	return Float32(Float32(0.5) * Float32(fma(fma(Float32(0.4), Float32(x * x), Float32(0.6666666666666666)), Float32(x * x), Float32(2.0)) * x))
      end
      
      \begin{array}{l}
      
      \\
      0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)
      \end{array}
      
      Derivation
      1. Initial program 99.8%

        \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(x \cdot \left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right)\right)} \]
      4. Step-by-step derivation
        1. *-commutativeN/A

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right) \cdot x\right)} \]
        2. lower-*.f32N/A

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(\left(2 + {x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right)\right) \cdot x\right)} \]
        3. +-commutativeN/A

          \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\left({x}^{2} \cdot \left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right) + 2\right)} \cdot x\right) \]
        4. *-commutativeN/A

          \[\leadsto \frac{1}{2} \cdot \left(\left(\color{blue}{\left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}\right) \cdot {x}^{2}} + 2\right) \cdot x\right) \]
        5. lower-fma.f32N/A

          \[\leadsto \frac{1}{2} \cdot \left(\color{blue}{\mathsf{fma}\left(\frac{2}{3} + \frac{2}{5} \cdot {x}^{2}, {x}^{2}, 2\right)} \cdot x\right) \]
        6. +-commutativeN/A

          \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\color{blue}{\frac{2}{5} \cdot {x}^{2} + \frac{2}{3}}, {x}^{2}, 2\right) \cdot x\right) \]
        7. lower-fma.f32N/A

          \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{2}{5}, {x}^{2}, \frac{2}{3}\right)}, {x}^{2}, 2\right) \cdot x\right) \]
        8. unpow2N/A

          \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, \color{blue}{x \cdot x}, \frac{2}{3}\right), {x}^{2}, 2\right) \cdot x\right) \]
        9. lower-*.f32N/A

          \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, \color{blue}{x \cdot x}, \frac{2}{3}\right), {x}^{2}, 2\right) \cdot x\right) \]
        10. unpow2N/A

          \[\leadsto \frac{1}{2} \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{2}{5}, x \cdot x, \frac{2}{3}\right), \color{blue}{x \cdot x}, 2\right) \cdot x\right) \]
        11. lower-*.f3299.1

          \[\leadsto 0.5 \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), \color{blue}{x \cdot x}, 2\right) \cdot x\right) \]
      5. Applied rewrites99.1%

        \[\leadsto 0.5 \cdot \color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.4, x \cdot x, 0.6666666666666666\right), x \cdot x, 2\right) \cdot x\right)} \]
      6. Add Preprocessing

      Alternative 7: 98.4% accurate, 7.4× speedup?

      \[\begin{array}{l} \\ \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right) \end{array} \]
      (FPCore (x) :precision binary32 (fma (* (* x x) x) 0.3333333333333333 x))
      float code(float x) {
      	return fmaf(((x * x) * x), 0.3333333333333333f, x);
      }
      
      function code(x)
      	return fma(Float32(Float32(x * x) * x), Float32(0.3333333333333333), x)
      end
      
      \begin{array}{l}
      
      \\
      \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right)
      \end{array}
      
      Derivation
      1. Initial program 99.8%

        \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
      2. Add Preprocessing
      3. Taylor expanded in x around 0

        \[\leadsto \color{blue}{x \cdot \left(1 + \frac{1}{3} \cdot {x}^{2}\right)} \]
      4. Step-by-step derivation
        1. distribute-lft-inN/A

          \[\leadsto \color{blue}{x \cdot 1 + x \cdot \left(\frac{1}{3} \cdot {x}^{2}\right)} \]
        2. *-rgt-identityN/A

          \[\leadsto \color{blue}{x} + x \cdot \left(\frac{1}{3} \cdot {x}^{2}\right) \]
        3. +-commutativeN/A

          \[\leadsto \color{blue}{x \cdot \left(\frac{1}{3} \cdot {x}^{2}\right) + x} \]
        4. *-commutativeN/A

          \[\leadsto x \cdot \color{blue}{\left({x}^{2} \cdot \frac{1}{3}\right)} + x \]
        5. associate-*r*N/A

          \[\leadsto \color{blue}{\left(x \cdot {x}^{2}\right) \cdot \frac{1}{3}} + x \]
        6. unpow2N/A

          \[\leadsto \left(x \cdot \color{blue}{\left(x \cdot x\right)}\right) \cdot \frac{1}{3} + x \]
        7. cube-multN/A

          \[\leadsto \color{blue}{{x}^{3}} \cdot \frac{1}{3} + x \]
        8. lower-fma.f32N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \frac{1}{3}, x\right)} \]
        9. lower-pow.f3298.8

          \[\leadsto \mathsf{fma}\left(\color{blue}{{x}^{3}}, 0.3333333333333333, x\right) \]
      5. Applied rewrites98.8%

        \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, 0.3333333333333333, x\right)} \]
      6. Step-by-step derivation
        1. Applied rewrites98.8%

          \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, 0.3333333333333333, x\right) \]
        2. Add Preprocessing

        Alternative 8: 96.7% accurate, 13.9× speedup?

        \[\begin{array}{l} \\ 0.5 \cdot \left(x + x\right) \end{array} \]
        (FPCore (x) :precision binary32 (* 0.5 (+ x x)))
        float code(float x) {
        	return 0.5f * (x + x);
        }
        
        module fmin_fmax_functions
            implicit none
            private
            public fmax
            public fmin
        
            interface fmax
                module procedure fmax88
                module procedure fmax44
                module procedure fmax84
                module procedure fmax48
            end interface
            interface fmin
                module procedure fmin88
                module procedure fmin44
                module procedure fmin84
                module procedure fmin48
            end interface
        contains
            real(8) function fmax88(x, y) result (res)
                real(8), intent (in) :: x
                real(8), intent (in) :: y
                res = merge(y, merge(x, max(x, y), y /= y), x /= x)
            end function
            real(4) function fmax44(x, y) result (res)
                real(4), intent (in) :: x
                real(4), intent (in) :: y
                res = merge(y, merge(x, max(x, y), y /= y), x /= x)
            end function
            real(8) function fmax84(x, y) result(res)
                real(8), intent (in) :: x
                real(4), intent (in) :: y
                res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
            end function
            real(8) function fmax48(x, y) result(res)
                real(4), intent (in) :: x
                real(8), intent (in) :: y
                res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
            end function
            real(8) function fmin88(x, y) result (res)
                real(8), intent (in) :: x
                real(8), intent (in) :: y
                res = merge(y, merge(x, min(x, y), y /= y), x /= x)
            end function
            real(4) function fmin44(x, y) result (res)
                real(4), intent (in) :: x
                real(4), intent (in) :: y
                res = merge(y, merge(x, min(x, y), y /= y), x /= x)
            end function
            real(8) function fmin84(x, y) result(res)
                real(8), intent (in) :: x
                real(4), intent (in) :: y
                res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
            end function
            real(8) function fmin48(x, y) result(res)
                real(4), intent (in) :: x
                real(8), intent (in) :: y
                res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
            end function
        end module
        
        real(4) function code(x)
        use fmin_fmax_functions
            real(4), intent (in) :: x
            code = 0.5e0 * (x + x)
        end function
        
        function code(x)
        	return Float32(Float32(0.5) * Float32(x + x))
        end
        
        function tmp = code(x)
        	tmp = single(0.5) * (x + x);
        end
        
        \begin{array}{l}
        
        \\
        0.5 \cdot \left(x + x\right)
        \end{array}
        
        Derivation
        1. Initial program 99.8%

          \[0.5 \cdot \mathsf{log1p}\left(\frac{2 \cdot x}{1 - x}\right) \]
        2. Add Preprocessing
        3. Taylor expanded in x around 0

          \[\leadsto \frac{1}{2} \cdot \color{blue}{\left(2 \cdot x\right)} \]
        4. Step-by-step derivation
          1. lower-*.f3296.8

            \[\leadsto 0.5 \cdot \color{blue}{\left(2 \cdot x\right)} \]
        5. Applied rewrites96.8%

          \[\leadsto 0.5 \cdot \color{blue}{\left(2 \cdot x\right)} \]
        6. Step-by-step derivation
          1. Applied rewrites96.8%

            \[\leadsto 0.5 \cdot \left(x + \color{blue}{x}\right) \]
          2. Add Preprocessing

          Reproduce

          ?
          herbie shell --seed 2024364 
          (FPCore (x)
            :name "Rust f32::atanh"
            :precision binary32
            (* 0.5 (log1p (/ (* 2.0 x) (- 1.0 x)))))