Average Error: 0 → 0
Time: 867.0ms
Precision: 64
\[\left(x \cdot 2\right) \cdot x\]
↓
\[x \cdot \left(x \cdot 2\right)\]
\left(x \cdot 2\right) \cdot x
↓
x \cdot \left(x \cdot 2\right)
double f(double x) {
        double r20225858 = x;
        double r20225859 = 2.0;
        double r20225860 = r20225858 * r20225859;
        double r20225861 = r20225860 * r20225858;
        return r20225861;
}
↓
double f(double x) {
        double r20225862 = x;
        double r20225863 = 2.0;
        double r20225864 = r20225862 * r20225863;
        double r20225865 = r20225862 * r20225864;
        return r20225865;
}

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 x \cdot \left(x \cdot 2\right)\]

Reproduce

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

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

  (* (* x 2.0) x))