Average Error: 0.0 → 0.0
Time: 4.8s
Precision: binary64
\[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t\]
↓
\[\left(t + 0.125 \cdot x\right) - 0.5 \cdot \left(z \cdot y\right)\]
\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t
↓
\left(t + 0.125 \cdot x\right) - 0.5 \cdot \left(z \cdot y\right)
(FPCore (x y z t)
 :precision binary64
 (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))
↓
(FPCore (x y z t) :precision binary64 (- (+ t (* 0.125 x)) (* 0.5 (* z y))))
double code(double x, double y, double z, double t) {
	return (((1.0 / 8.0) * x) - ((y * z) / 2.0)) + t;
}
↓
double code(double x, double y, double z, double t) {
	return (t + (0.125 * x)) - (0.5 * (z * y));
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(\frac{x}{8} + t\right) - \frac{z}{2} \cdot y\]

Derivation

  1. Initial program 0.0

    \[\left(\frac{1}{8} \cdot x - \frac{y \cdot z}{2}\right) + t\]

  2. Simplified0.0

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

  3. Taylor expanded around 0 0.0

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

  4. Final simplification0.0

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

Reproduce

herbie shell --seed 2021076 
(FPCore (x y z t)
  :name "Diagrams.Solve.Polynomial:quartForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (+ (/ x 8.0) t) (* (/ z 2.0) y))

  (+ (- (* (/ 1.0 8.0) x) (/ (* y z) 2.0)) t))