Average Error: 0 → 0
Time: 651.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 r313664 = x;
        double r313665 = 2.0;
        double r313666 = r313664 * r313665;
        double r313667 = r313666 * r313664;
        return r313667;
}
↓
double f(double x) {
        double r313668 = x;
        double r313669 = 2.0;
        double r313670 = r313668 * r313669;
        double r313671 = r313670 * r313668;
        return r313671;
}

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

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

  (* (* x 2) x))