Average Error: 0.1 → 0
Time: 2.0s
Precision: 64
\[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]
\[{d1}^{10}\]
\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1
{d1}^{10}
double f(double d1) {
        double r240015 = d1;
        double r240016 = r240015 * r240015;
        double r240017 = r240015 * r240016;
        double r240018 = r240017 * r240015;
        double r240019 = r240018 * r240015;
        double r240020 = r240019 * r240016;
        double r240021 = r240020 * r240015;
        double r240022 = r240015 * r240021;
        double r240023 = r240022 * r240015;
        return r240023;
}

double f(double d1) {
        double r240024 = d1;
        double r240025 = 10.0;
        double r240026 = pow(r240024, r240025);
        return r240026;
}

Error

Bits error versus d1

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

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

Derivation

  1. Initial program 0.1

    \[\left(d1 \cdot \left(\left(\left(\left(\left(d1 \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right) \cdot d1\right) \cdot \left(d1 \cdot d1\right)\right) \cdot d1\right)\right) \cdot d1\]
  2. Simplified0

    \[\leadsto \color{blue}{{d1}^{10}}\]
  3. Final simplification0

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

Reproduce

herbie shell --seed 2020046 +o rules:numerics
(FPCore (d1)
  :name "FastMath test5"
  :precision binary64

  :herbie-target
  (pow d1 10)

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