Average Error: 0.0 → 0.0
Time: 981.0ms
Precision: binary64
\[\mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)\]
↓
\[\mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)\]
\mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)
↓
\mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)
double code(double x) {
	return ((double) log1p(((double) (((double) (1.0 - x)) * ((double) (1.0 + x))))));
}
↓
double code(double x) {
	return ((double) log1p(((double) (((double) (1.0 - x)) * ((double) (1.0 + x))))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)\]

  2. Final simplification0.0

    \[\leadsto \mathsf{log1p}\left(\left(1 - x\right) \cdot \left(1 + x\right)\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x)
  :name "(log1p (* (- 1 x) (+ 1 x)))"
  :precision binary64
  (log1p (* (- 1.0 x) (+ 1.0 x))))