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

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
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)

Precisions

Click to see histograms. Total time spent on operations: 0.0ms

Operation ival-sub, time spent: 0.0ms, 0.0% of total-time

Operation ival-div, time spent: 0.0ms, 0.0% of total-time

Operation ival-add, time spent: 0.0ms, 0.0% of total-time

Operation const, time spent: 0.0ms, 0.0% of total-time

sample872.0ms (46%)

Results

813.0ms	8255×	256	valid
0.0ms	1×	256	valid

Precisions

Click to see histograms. Total time spent on operations: 202.0ms

Operation ival-div, time spent: 70.0ms, 35.0% of total-time

Operation ival-sub, time spent: 67.0ms, 33.0% of total-time

Operation ival-add, time spent: 50.0ms, 25.0% of total-time

Operation const, time spent: 14.0ms, 7.0% of total-time

Bogosity

preprocess398.0ms (21%)

Algorithm

1×	egg-herbie

Rules

2980×	`fmm-def`
653×	`fma-define`
518×	`sub-neg`
365×	`distribute-lft-out`
349×	`+-commutative`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`x`
-	-	`(/.f64 (-.f64 y x) #s(literal 2 binary64))`
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(-.f64 y x)`
-	-	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	25	220
1	56	196
2	161	196
3	463	133
4	845	133
5	1493	133
6	2939	133
7	3539	133
8	3564	133
9	3582	133
10	3582	133
11	5283	133
12	6297	133
13	6523	133
14	6588	133
15	6652	133
16	6652	133
17	6675	133
18	6683	133
19	6683	133

Stop Event

1×	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 51 to 26 computations (49% saved)

Precisions

Click to see histograms. Total time spent on operations: 19.0ms

Operation ival-div, time spent: 11.0ms, 59.0% of total-time

Operation ival-sub, time spent: 4.0ms, 22.0% of total-time

Operation ival-add, time spent: 3.0ms, 16.0% of total-time

Operation const, time spent: 1.0ms, 5.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 (+.f64 x y) #s(literal 1/2 binary64))

Compiler

Compiled 7 to 5 computations (28.6% saved)

localize26.0ms (1.4%)

Compiler: Compiled 14 to 7 computations (50% saved)
Precisions: Click to see histograms. Total time spent on operations: 5.0ms
Operation ival-mult, time spent: 2.0ms, 44.0% of total-time
Operation ival-add, time spent: 2.0ms, 44.0% of total-time
Operation const, time spent: 1.0ms, 22.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 2 to 2 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(*.f64 (+.f64 x y) #s(literal 1/2 binary64))

Compiler

Compiled 21 to 14 computations (33.3% saved)

regimes4.0ms (0.2%)

Accuracy

Total -0.0b remaining (-∞%)

Threshold costs -0b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))
(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))

Outputs
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))

Calls

3 calls:

1.0ms	(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))
1.0ms	y
1.0ms	x

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`(+.f64 x (/.f64 (-.f64 y x) #s(literal 2 binary64)))`

Compiler

Compiled 15 to 10 computations (33.3% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

1×	`*-commutative`
1×	`+-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	19
1	12	19

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))

Outputs
(*.f64 (+.f64 x y) #s(literal 1/2 binary64))

Compiler

Compiled 7 to 5 computations (28.6% saved)

soundness557.0ms (29.3%)

Rules

2980×	`fmm-def`
653×	`fma-define`
518×	`sub-neg`
365×	`distribute-lft-out`
349×	`+-commutative`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	25	220
1	56	196
2	161	196
3	463	133
4	845	133
5	1493	133
6	2939	133
7	3539	133
8	3564	133
9	3582	133
10	3582	133
11	5283	133
12	6297	133
13	6523	133
14	6588	133
15	6652	133
16	6652	133
17	6675	133
18	6683	133
19	6683	133

Stop Event

1×	node limit

Compiler

Compiled 195 to 133 computations (31.8% saved)

end0.0ms (0%)

preprocess35.0ms (1.9%)

Remove: (sort x y)
Compiler: Compiled 74 to 52 computations (29.7% saved)

analyze0.0ms (0%)

sample872.0ms (46%)

preprocess398.0ms (21%)

eval0.0ms (0%)

prune1.0ms (0%)

localize26.0ms (1.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.2%)

simplify2.0ms (0.1%)

soundness557.0ms (29.3%)

end0.0ms (0%)

preprocess35.0ms (1.9%)

Profiling