Average Error: 0.1 → 0.0
Time: 5.3s
Precision: binary64
\[\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1\]
↓
\[{d1}^{4}\]
\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1
↓
{d1}^{4}
double code(double d1) {
	return ((double) (((double) (((double) (d1 * d1)) * d1)) * d1));
}
↓
double code(double d1) {
	return ((double) pow(d1, 4.0));
}

Error

Bits error versus d1

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.1
Target0.0
Herbie0.0
\[{d1}^{4}\]

Derivation

  1. Initial program 0.1

    \[\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1\]

  2. Simplified0.0

    \[\leadsto \color{blue}{{d1}^{4}}\]

  3. Final simplification0.0

    \[\leadsto {d1}^{4}\]

Reproduce

herbie shell --seed 2020182 
(FPCore (d1)
  :name "FastMath repmul"
  :precision binary64

  :herbie-target
  (pow d1 4.0)

  (* (* (* d1 d1) d1) d1))