Metrics for ReportTypes:explainFloat from gipeda-0.1.2.1

analyze3.0ms (0.2%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
0%	0%	100%	0%	0%	0%	0%	1
50%	50%	50%	0%	0%	0%	0%	2
75%	75%	25%	0%	0%	0%	0%	3
87.5%	87.5%	12.5%	0%	0%	0%	0%	4
93.8%	93.7%	6.2%	0%	0%	0%	0%	5
96.9%	96.8%	3.1%	0%	0%	0%	0%	6
98.4%	98.4%	1.6%	0%	0%	0%	0%	7
99.2%	99.2%	0.8%	0%	0%	0%	0%	8
99.6%	99.6%	0.4%	0%	0%	0%	0%	9
99.8%	99.8%	0.2%	0%	0%	0%	0%	10
99.9%	99.9%	0.1%	0%	0%	0%	0%	11
100%	99.9%	0%	0%	0%	0%	0%	12

Compiler

Compiled 9 to 6 computations (33.3% saved)

Precisions

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

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

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

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

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

sample1.1s (87.3%)

Results

1.0s	8255×	0	valid
0.0ms	1×	0	valid

Precisions

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

Operation ival-mult, time spent: 231.0ms, 63.0% of total-time

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

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

Operation const, time spent: 11.0ms, 3.0% of total-time

Operation backward-pass, time spent: 4.0ms, 1.0% of total-time

Bogosity

preprocess96.0ms (7.7%)

Algorithm

1×	egg-herbie

Rules

12×	`fma-define`
11×	`associate-/r*`
10×	`div-sub`
9×	`sub-neg`
7×	`distribute-lft-neg-in`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`#s(literal 100 binary64)`
-	-	`x`
-	-	`(/.f64 (-.f64 x x) x)`
-	-	`(-.f64 x x)`
-	-	`(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	40
1	44	4
2	94	4
3	129	4
4	158	4
5	170	4
6	176	4
7	178	4
8	190	4

Stop Event

1×

saturated

Calls

Call 1

Inputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 (neg.f64 x) (neg.f64 x)) (neg.f64 x)))
(neg.f64 (*.f64 #s(literal 100 binary64) (/.f64 (-.f64 (neg.f64 x) (neg.f64 x)) (neg.f64 x))))

Outputs
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
(/.f64 #s(literal 0 binary64) x)
#s(literal 0 binary64)
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
(/.f64 #s(literal 0 binary64) x)
#s(literal 0 binary64)
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 (neg.f64 x) (neg.f64 x)) (neg.f64 x)))
(/.f64 #s(literal 0 binary64) x)
#s(literal 0 binary64)
(neg.f64 (*.f64 #s(literal 100 binary64) (/.f64 (-.f64 (neg.f64 x) (neg.f64 x)) (neg.f64 x))))
(/.f64 #s(literal 0 binary64) x)
#s(literal 0 binary64)

Symmetry

(abs x)

(negabs x)

Compiler

Compiled 46 to 19 computations (58.7% saved)

Precisions

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

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

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

Operation ival-mult, time spent: 2.0ms, 21.0% of total-time

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

eval0.0ms (0%)

Compiler: Compiled 5 to 4 computations (20% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(literal 0 binary64)

Compiler

Compiled 2 to 2 computations (0% saved)

localize8.0ms (0.7%)

Compiler: Compiled 3 to 3 computations (0% saved)
Precisions: Click to see histograms. Total time spent on operations: 0.0ms
Operation const, time spent: 0.0ms, 0.0% of total-time

eval0.0ms (0%)

Compiler: Compiled 1 to 1 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%	#s(literal 0 binary64)

Compiler

Compiled 11 to 8 computations (27.3% saved)

regimes4.0ms (0.3%)

Accuracy

Total 0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(literal 0 binary64)
(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))

Outputs
#s(literal 0 binary64)

Calls

3 calls:

3.0ms	x
1.0ms	(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))
1.0ms	(/.f64 (-.f64 x x) x)

Results

Accuracy	Segments	Branch
100.0%	1	`x`
100.0%	1	`(*.f64 #s(literal 100 binary64) (/.f64 (-.f64 x x) x))`
100.0%	1	`(/.f64 (-.f64 x x) x)`

Compiler

Compiled 16 to 9 computations (43.8% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	1	1

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
#s(literal 0 binary64)

Outputs
#s(literal 0 binary64)

Compiler

Compiled 2 to 2 computations (0% saved)

soundness14.0ms (1.1%)

Rules

12×	`fma-define`
11×	`associate-/r*`
10×	`div-sub`
9×	`sub-neg`
7×	`distribute-lft-neg-in`

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	40
1	44	4
2	94	4
3	129	4
4	158	4
5	170	4
6	176	4
7	178	4
8	190	4

Stop Event

1×

saturated

Compiler

Compiled 21 to 13 computations (38.1% saved)

end0.0ms (0%)

preprocess28.0ms (2.2%)

Remove

(negabs x)

(abs x)

Compiler

Compiled 40 to 34 computations (15% saved)

analyze3.0ms (0.2%)

sample1.1s (87.3%)

preprocess96.0ms (7.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize8.0ms (0.7%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.3%)

simplify2.0ms (0.1%)

soundness14.0ms (1.1%)

end0.0ms (0%)

preprocess28.0ms (2.2%)

Profiling