Average Error: 0.0 → 0.0
Time: 2.1s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
↓
\[x + \left(y \cdot z + y \cdot \left(-x\right)\right)\]
x + y \cdot \left(z - x\right)
↓
x + \left(y \cdot z + y \cdot \left(-x\right)\right)
double f(double x, double y, double z) {
        double r5796 = x;
        double r5797 = y;
        double r5798 = z;
        double r5799 = r5798 - r5796;
        double r5800 = r5797 * r5799;
        double r5801 = r5796 + r5800;
        return r5801;
}
↓
double f(double x, double y, double z) {
        double r5802 = x;
        double r5803 = y;
        double r5804 = z;
        double r5805 = r5803 * r5804;
        double r5806 = -r5802;
        double r5807 = r5803 * r5806;
        double r5808 = r5805 + r5807;
        double r5809 = r5802 + r5808;
        return r5809;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + y \cdot \left(z - x\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

    \[\leadsto x + y \cdot \color{blue}{\left(z + \left(-x\right)\right)}\]

  4. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot \left(-x\right)\right)}\]

  5. Final simplification0.0

    \[\leadsto x + \left(y \cdot z + y \cdot \left(-x\right)\right)\]

Reproduce

herbie shell --seed 2020018 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))