Average Error: 0 → 0
Time: 445.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 r440378 = x;
        double r440379 = 2.0;
        double r440380 = r440378 * r440379;
        double r440381 = r440380 * r440378;
        return r440381;
}
↓
double f(double x) {
        double r440382 = x;
        double r440383 = 2.0;
        double r440384 = r440382 * r440383;
        double r440385 = r440384 * r440382;
        return r440385;
}

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

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

  (* (* x 2) x))