Average Error: 0 → 0
Time: 671.0ms
Precision: binary64
Cost: 64
\[100 \cdot \frac{x - x}{x} \]
↓
\[0 \]
(FPCore (x) :precision binary64 (* 100.0 (/ (- x x) x)))
↓
(FPCore (x) :precision binary64 0.0)
double code(double x) {
	return 100.0 * ((x - x) / x);
}
↓
double code(double x) {
	return 0.0;
}

real(8) function code(x)
    real(8), intent (in) :: x
    code = 100.0d0 * ((x - x) / x)
end function
↓
real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.0d0
end function

public static double code(double x) {
	return 100.0 * ((x - x) / x);
}
↓
public static double code(double x) {
	return 0.0;
}

def code(x):
	return 100.0 * ((x - x) / x)
↓
def code(x):
	return 0.0

function code(x)
	return Float64(100.0 * Float64(Float64(x - x) / x))
end
↓
function code(x)
	return 0.0
end

function tmp = code(x)
	tmp = 100.0 * ((x - x) / x);
end
↓
function tmp = code(x)
	tmp = 0.0;
end

code[x_] := N[(100.0 * N[(N[(x - x), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]
↓
code[x_] := 0.0

100 \cdot \frac{x - x}{x}
↓
0

Error

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[0 \]

Derivation

  1. Initial program 0

    \[100 \cdot \frac{x - x}{x} \]

  2. Simplified0

    \[\leadsto \color{blue}{0} \]
    Proof
    0: 0 points increase in error, 0 points decrease in error
    (Rewrite<= metadata-eval (*.f64 100 0)): 0 points increase in error, 0 points decrease in error
    (*.f64 100 (Rewrite<= div0_binary64 (/.f64 0 x))): 0 points increase in error, 0 points decrease in error
    (*.f64 100 (/.f64 (Rewrite<= +-inverses_binary64 (-.f64 x x)) x)): 0 points increase in error, 0 points decrease in error

  3. Final simplification0

    \[\leadsto 0 \]

Reproduce

herbie shell --seed 2022291 
(FPCore (x)
  :name "ReportTypes:explainFloat from gipeda-0.1.2.1"
  :precision binary64

  :herbie-target
  0.0

  (* 100.0 (/ (- x x) x)))