Average Error: 0.0 → 0.0
Time: 3.3s
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 r12772 = x;
        double r12773 = y;
        double r12774 = z;
        double r12775 = r12774 - r12772;
        double r12776 = r12773 * r12775;
        double r12777 = r12772 + r12776;
        return r12777;
}
↓
double f(double x, double y, double z) {
        double r12778 = x;
        double r12779 = y;
        double r12780 = z;
        double r12781 = r12779 * r12780;
        double r12782 = -r12778;
        double r12783 = r12779 * r12782;
        double r12784 = r12781 + r12783;
        double r12785 = r12778 + r12784;
        return r12785;
}

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 2020089 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))