Average Error: 0.1 → 0
Time: 4.6s
Precision: 64
\[\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 f(double d1) {
        double r163138014 = d1;
        double r163138015 = r163138014 * r163138014;
        double r163138016 = r163138015 * r163138014;
        double r163138017 = r163138016 * r163138014;
        return r163138017;
}
↓
double f(double d1) {
        double r163138018 = d1;
        double r163138019 = 4.0;
        double r163138020 = pow(r163138018, r163138019);
        return r163138020;
}

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}^{4}\]

Derivation

  1. Initial program 0.1

    \[\left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot d1\]
  2. Using strategy rm

  3. Applied pow10.1

    \[\leadsto \left(\left(d1 \cdot d1\right) \cdot d1\right) \cdot \color{blue}{{d1}^{1}}\]

  4. Applied pow10.1

    \[\leadsto \left(\left(d1 \cdot \color{blue}{{d1}^{1}}\right) \cdot d1\right) \cdot {d1}^{1}\]

  5. Applied pow10.1

    \[\leadsto \left(\left(\color{blue}{{d1}^{1}} \cdot {d1}^{1}\right) \cdot d1\right) \cdot {d1}^{1}\]

  6. Applied pow-sqr0.1

    \[\leadsto \left(\color{blue}{{d1}^{\left(2 \cdot 1\right)}} \cdot d1\right) \cdot {d1}^{1}\]

  7. Applied pow-plus0.1

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

  8. Applied pow-prod-up0

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

  9. Simplified0

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

  10. Final simplification0

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

Reproduce

herbie shell --seed 2019120 
(FPCore (d1)
  :name "FastMath repmul"

  :herbie-target
  (pow d1 4)

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