Average Error: 0 → 0
Time: 343.0ms
Precision: 64
\[\left(x \cdot 2\right) \cdot x\]
↓
\[\left(x \cdot 2\right) \cdot x\]
\left(x \cdot 2\right) \cdot x
↓
\left(x \cdot 2\right) \cdot x
double f(double x) {
        double r526221 = x;
        double r526222 = 2.0;
        double r526223 = r526221 * r526222;
        double r526224 = r526223 * r526221;
        return r526224;
}
↓
double f(double x) {
        double r526225 = x;
        double r526226 = 2.0;
        double r526227 = r526225 * r526226;
        double r526228 = r526227 * r526225;
        return r526228;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[\left(2 \cdot x\right) \cdot x\]

Derivation

  1. Initial program 0

    \[\left(x \cdot 2\right) \cdot x\]

  2. Final simplification0

    \[\leadsto \left(x \cdot 2\right) \cdot x\]

Reproduce

herbie shell --seed 2019354 
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"
  :precision binary64

  :herbie-target
  (* (* 2 x) x)

  (* (* x 2) x))