Numeric.Interval.Internal:bisect from intervals-0.7.1, A

Time bar (total: 15.4s)

analyze1.0ms (0%)

Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 10 to 7 computations (30% saved)

sample14.7s (95.3%)

Results
1.3s8256×0valid-rival
757.0ms8155×0valid-sollya
505.0ms101×0exit-sollya
Bogosity

preprocess462.0ms (3%)

Algorithm
egg-herbie
Rules
2980×fma-neg
638×fma-define
500×sub-neg
366×distribute-lft-out
330×+-commutative
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
025220
156196
2161196
3463133
4845133
51493133
62927133
73527133
83552133
93570133
103570133
115243133
126216133
136442133
146507133
156571133
166571133
176594133
186602133
196602133
Stop Event
node limit
Calls
Call 1
Inputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(+.f64 (neg.f64 x) (/.f64 (-.f64 y (neg.f64 x)) #s(literal 2 binary64)))
(+.f64 x (/.f64 (-.f64 (neg.f64 y) x) #s(literal 2 binary64)))
(neg.f64 (+.f64 (neg.f64 x) (/.f64 (-.f64 y (neg.f64 x)) #s(literal 2 binary64))))
(neg.f64 (+.f64 x (/.f64 (-.f64 (neg.f64 y) x) #s(literal 2 binary64))))
(+.f64 y (/.f64 (-.f64 x y) #s(literal 2 binary64)))
Outputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))
(+.f64 (neg.f64 x) (/.f64 (-.f64 y (neg.f64 x)) #s(literal 2 binary64)))
(-.f64 (/.f64 (+.f64 x y) #s(literal 2 binary64)) x)
(/.f64 (-.f64 y x) #s(literal 2 binary64))
(*.f64 #s(literal -1/2 binary64) (-.f64 x y))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(+.f64 x (/.f64 (-.f64 (neg.f64 y) x) #s(literal 2 binary64)))
(+.f64 x (/.f64 (+.f64 x y) #s(literal -2 binary64)))
(/.f64 (-.f64 x y) #s(literal 2 binary64))
(*.f64 #s(literal 1/2 binary64) (-.f64 x y))
(*.f64 (-.f64 x y) #s(literal 1/2 binary64))
(neg.f64 (+.f64 (neg.f64 x) (/.f64 (-.f64 y (neg.f64 x)) #s(literal 2 binary64))))
(+.f64 x (/.f64 (-.f64 (neg.f64 y) x) #s(literal 2 binary64)))
(+.f64 x (/.f64 (+.f64 x y) #s(literal -2 binary64)))
(/.f64 (-.f64 x y) #s(literal 2 binary64))
(*.f64 #s(literal 1/2 binary64) (-.f64 x y))
(*.f64 (-.f64 x y) #s(literal 1/2 binary64))
(neg.f64 (+.f64 x (/.f64 (-.f64 (neg.f64 y) x) #s(literal 2 binary64))))
(+.f64 (neg.f64 x) (/.f64 (-.f64 y (neg.f64 x)) #s(literal 2 binary64)))
(-.f64 (/.f64 (+.f64 x y) #s(literal 2 binary64)) x)
(/.f64 (-.f64 y x) #s(literal 2 binary64))
(*.f64 #s(literal -1/2 binary64) (-.f64 x y))
(*.f64 (-.f64 x y) #s(literal -1/2 binary64))
(+.f64 y (/.f64 (-.f64 x y) #s(literal 2 binary64)))
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))
Symmetry

(sort x y)

Compiler

Compiled 9 to 6 computations (33.3% saved)

eval0.0ms (0%)

Compiler

Compiled 2 to 2 computations (0% saved)

prune2.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
Compiler

Compiled 18 to 12 computations (33.3% saved)

simplify4.0ms (0%)

Algorithm
egg-herbie
Rules
+-commutative
sub-neg
*-commutative
neg-sub0
neg-mul-1
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01128
11528
22028
32228
42328
Stop Event
saturated
Calls
Call 1
Inputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
Outputs
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

soundness0.0ms (0%)

Stop Event
fuel
Compiler

Compiled 9 to 6 computations (33.3% saved)

preprocess261.0ms (1.7%)

Remove

(sort x y)

Compiler

Compiled 86 to 58 computations (32.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...