Average Error: 0 → 0
Time: 1.0s
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 r282189 = x;
        double r282190 = 2.0;
        double r282191 = r282189 * r282190;
        double r282192 = r282191 * r282189;
        return r282192;
}
↓
double f(double x) {
        double r282193 = x;
        double r282194 = 2.0;
        double r282195 = r282193 * r282194;
        double r282196 = r282195 * r282193;
        return r282196;
}

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 2019306 +o rules:numerics
(FPCore (x)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, A"
  :precision binary64

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

  (* (* x 2) x))