Average Error: 14.5 → 0.6
Time: 4.4s
Precision: binary64
Cost: 1360
\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]
\[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
\[\begin{array}{l} t_1 := \frac{y}{z} \cdot x\\ \mathbf{if}\;\frac{y}{z} \leq -\infty:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-221}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{-113}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{+304}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \end{array} \]
(FPCore (x y z t) :precision binary64 (* x (/ (* (/ y z) t) t)))
(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (/ y z) x)))
   (if (<= (/ y z) (- INFINITY))
     (* y (/ x z))
     (if (<= (/ y z) -5e-221)
       t_1
       (if (<= (/ y z) 2e-113)
         (/ (* y x) z)
         (if (<= (/ y z) 1e+304) t_1 (/ y (/ z x))))))))
double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}
double code(double x, double y, double z, double t) {
	double t_1 = (y / z) * x;
	double tmp;
	if ((y / z) <= -((double) INFINITY)) {
		tmp = y * (x / z);
	} else if ((y / z) <= -5e-221) {
		tmp = t_1;
	} else if ((y / z) <= 2e-113) {
		tmp = (y * x) / z;
	} else if ((y / z) <= 1e+304) {
		tmp = t_1;
	} else {
		tmp = y / (z / x);
	}
	return tmp;
}
public static double code(double x, double y, double z, double t) {
	return x * (((y / z) * t) / t);
}
public static double code(double x, double y, double z, double t) {
	double t_1 = (y / z) * x;
	double tmp;
	if ((y / z) <= -Double.POSITIVE_INFINITY) {
		tmp = y * (x / z);
	} else if ((y / z) <= -5e-221) {
		tmp = t_1;
	} else if ((y / z) <= 2e-113) {
		tmp = (y * x) / z;
	} else if ((y / z) <= 1e+304) {
		tmp = t_1;
	} else {
		tmp = y / (z / x);
	}
	return tmp;
}
def code(x, y, z, t):
	return x * (((y / z) * t) / t)
def code(x, y, z, t):
	t_1 = (y / z) * x
	tmp = 0
	if (y / z) <= -math.inf:
		tmp = y * (x / z)
	elif (y / z) <= -5e-221:
		tmp = t_1
	elif (y / z) <= 2e-113:
		tmp = (y * x) / z
	elif (y / z) <= 1e+304:
		tmp = t_1
	else:
		tmp = y / (z / x)
	return tmp
function code(x, y, z, t)
	return Float64(x * Float64(Float64(Float64(y / z) * t) / t))
end
function code(x, y, z, t)
	t_1 = Float64(Float64(y / z) * x)
	tmp = 0.0
	if (Float64(y / z) <= Float64(-Inf))
		tmp = Float64(y * Float64(x / z));
	elseif (Float64(y / z) <= -5e-221)
		tmp = t_1;
	elseif (Float64(y / z) <= 2e-113)
		tmp = Float64(Float64(y * x) / z);
	elseif (Float64(y / z) <= 1e+304)
		tmp = t_1;
	else
		tmp = Float64(y / Float64(z / x));
	end
	return tmp
end
function tmp = code(x, y, z, t)
	tmp = x * (((y / z) * t) / t);
end
function tmp_2 = code(x, y, z, t)
	t_1 = (y / z) * x;
	tmp = 0.0;
	if ((y / z) <= -Inf)
		tmp = y * (x / z);
	elseif ((y / z) <= -5e-221)
		tmp = t_1;
	elseif ((y / z) <= 2e-113)
		tmp = (y * x) / z;
	elseif ((y / z) <= 1e+304)
		tmp = t_1;
	else
		tmp = y / (z / x);
	end
	tmp_2 = tmp;
end
code[x_, y_, z_, t_] := N[(x * N[(N[(N[(y / z), $MachinePrecision] * t), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]
code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(y / z), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[N[(y / z), $MachinePrecision], (-Infinity)], N[(y * N[(x / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(y / z), $MachinePrecision], -5e-221], t$95$1, If[LessEqual[N[(y / z), $MachinePrecision], 2e-113], N[(N[(y * x), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[N[(y / z), $MachinePrecision], 1e+304], t$95$1, N[(y / N[(z / x), $MachinePrecision]), $MachinePrecision]]]]]]
x \cdot \frac{\frac{y}{z} \cdot t}{t}
\begin{array}{l}
t_1 := \frac{y}{z} \cdot x\\
\mathbf{if}\;\frac{y}{z} \leq -\infty:\\
\;\;\;\;y \cdot \frac{x}{z}\\

\mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-221}:\\
\;\;\;\;t_1\\

\mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{-113}:\\
\;\;\;\;\frac{y \cdot x}{z}\\

\mathbf{elif}\;\frac{y}{z} \leq 10^{+304}:\\
\;\;\;\;t_1\\

\mathbf{else}:\\
\;\;\;\;\frac{y}{\frac{z}{x}}\\


\end{array}

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original14.5
Target1.6
Herbie0.6
\[\begin{array}{l} \mathbf{if}\;\frac{\frac{y}{z} \cdot t}{t} < -1.20672205123045 \cdot 10^{+245}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;\frac{\frac{y}{z} \cdot t}{t} < -5.907522236933906 \cdot 10^{-275}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{elif}\;\frac{\frac{y}{z} \cdot t}{t} < 5.658954423153415 \cdot 10^{-65}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \mathbf{elif}\;\frac{\frac{y}{z} \cdot t}{t} < 2.0087180502407133 \cdot 10^{+217}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \end{array} \]

Derivation

  1. Split input into 4 regimes
  2. if (/.f64 y z) < -inf.0

    1. Initial program 64.0

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
    2. Simplified0.3

      \[\leadsto \color{blue}{y \cdot \frac{x}{z}} \]
      Proof
      (*.f64 y (/.f64 x z)): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 y x) z)): 43 points increase in error, 61 points decrease in error
      (Rewrite<= associate-*l/_binary64 (*.f64 (/.f64 y z) x)): 63 points increase in error, 45 points decrease in error
      (Rewrite=> *-commutative_binary64 (*.f64 x (/.f64 y z))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= /-rgt-identity_binary64 (/.f64 (/.f64 y z) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (/.f64 (/.f64 y z) (Rewrite<= *-inverses_binary64 (/.f64 t t)))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (/.f64 y z) t) t))): 56 points increase in error, 0 points decrease in error

    if -inf.0 < (/.f64 y z) < -4.99999999999999996e-221 or 1.99999999999999996e-113 < (/.f64 y z) < 9.9999999999999994e303

    1. Initial program 9.9

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
    2. Simplified0.2

      \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
      Proof
      (*.f64 x (/.f64 y z)): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= /-rgt-identity_binary64 (/.f64 (/.f64 y z) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (/.f64 (/.f64 y z) (Rewrite<= *-inverses_binary64 (/.f64 t t)))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (/.f64 y z) t) t))): 56 points increase in error, 0 points decrease in error

    if -4.99999999999999996e-221 < (/.f64 y z) < 1.99999999999999996e-113

    1. Initial program 15.3

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
    2. Simplified7.9

      \[\leadsto \color{blue}{x \cdot \frac{y}{z}} \]
      Proof
      (*.f64 x (/.f64 y z)): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= /-rgt-identity_binary64 (/.f64 (/.f64 y z) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (/.f64 (/.f64 y z) (Rewrite<= *-inverses_binary64 (/.f64 t t)))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (/.f64 y z) t) t))): 56 points increase in error, 0 points decrease in error
    3. Taylor expanded in x around 0 1.4

      \[\leadsto \color{blue}{\frac{y \cdot x}{z}} \]

    if 9.9999999999999994e303 < (/.f64 y z)

    1. Initial program 63.7

      \[x \cdot \frac{\frac{y}{z} \cdot t}{t} \]
    2. Simplified0.3

      \[\leadsto \color{blue}{y \cdot \frac{x}{z}} \]
      Proof
      (*.f64 y (/.f64 x z)): 0 points increase in error, 0 points decrease in error
      (Rewrite=> associate-*r/_binary64 (/.f64 (*.f64 y x) z)): 43 points increase in error, 61 points decrease in error
      (Rewrite<= associate-*l/_binary64 (*.f64 (/.f64 y z) x)): 63 points increase in error, 45 points decrease in error
      (Rewrite=> *-commutative_binary64 (*.f64 x (/.f64 y z))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= /-rgt-identity_binary64 (/.f64 (/.f64 y z) 1))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (/.f64 (/.f64 y z) (Rewrite<= *-inverses_binary64 (/.f64 t t)))): 0 points increase in error, 0 points decrease in error
      (*.f64 x (Rewrite<= associate-/l*_binary64 (/.f64 (*.f64 (/.f64 y z) t) t))): 56 points increase in error, 0 points decrease in error
    3. Applied egg-rr0.3

      \[\leadsto \color{blue}{\frac{y}{\frac{z}{x}}} \]
  3. Recombined 4 regimes into one program.
  4. Final simplification0.6

    \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{y}{z} \leq -\infty:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-221}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{elif}\;\frac{y}{z} \leq 2 \cdot 10^{-113}:\\ \;\;\;\;\frac{y \cdot x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{+304}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{\frac{z}{x}}\\ \end{array} \]

Alternatives

Alternative 1
Error0.3
Cost1360
\[\begin{array}{l} t_1 := \frac{y}{z} \cdot x\\ t_2 := y \cdot \frac{x}{z}\\ \mathbf{if}\;\frac{y}{z} \leq -\infty:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-221}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 5 \cdot 10^{-228}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{y}{z} \leq 5 \cdot 10^{+269}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]
Alternative 2
Error0.5
Cost1360
\[\begin{array}{l} t_1 := y \cdot \frac{x}{z}\\ \mathbf{if}\;\frac{y}{z} \leq -\infty:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq -5 \cdot 10^{-221}:\\ \;\;\;\;\frac{y}{z} \cdot x\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{-202}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{+163}:\\ \;\;\;\;\frac{x}{\frac{z}{y}}\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \]
Alternative 3
Error0.3
Cost1360
\[\begin{array}{l} t_1 := \frac{y}{z} \cdot x\\ t_2 := \frac{y}{\frac{z}{x}}\\ \mathbf{if}\;\frac{y}{z} \leq -\infty:\\ \;\;\;\;y \cdot \frac{x}{z}\\ \mathbf{elif}\;\frac{y}{z} \leq -1 \cdot 10^{-179}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;\frac{y}{z} \leq 5 \cdot 10^{-228}:\\ \;\;\;\;t_2\\ \mathbf{elif}\;\frac{y}{z} \leq 10^{+304}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;t_2\\ \end{array} \]
Alternative 4
Error6.1
Cost320
\[\frac{y}{z} \cdot x \]

Error

Reproduce

herbie shell --seed 2022331 
(FPCore (x y z t)
  :name "Graphics.Rendering.Chart.Backend.Diagrams:calcFontMetrics from Chart-diagrams-1.5.1, B"
  :precision binary64

  :herbie-target
  (if (< (/ (* (/ y z) t) t) -1.20672205123045e+245) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) -5.907522236933906e-275) (* x (/ y z)) (if (< (/ (* (/ y z) t) t) 5.658954423153415e-65) (/ y (/ z x)) (if (< (/ (* (/ y z) t) t) 2.0087180502407133e+217) (* x (/ y z)) (/ (* y x) z)))))

  (* x (/ (* (/ y z) t) t)))