Average Error: 0 → 0
Time: 935.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 r18634533 = x;
        double r18634534 = 2.0;
        double r18634535 = r18634533 * r18634534;
        double r18634536 = r18634535 * r18634533;
        return r18634536;
}
↓
double f(double x) {
        double r18634537 = x;
        double r18634538 = 2.0;
        double r18634539 = r18634537 * r18634538;
        double r18634540 = r18634537 * r18634539;
        return r18634540;
}

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

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

  (* (* x 2.0) x))