Metrics for FastMath test1

analyze0.0ms (0%)

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 9 to 7 computations (22.2% saved)

Precisions

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

Operation ival-add, 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 (77%)

Results

947.0ms	8235×	256	valid
2.0ms	20×	256	infinite
0.0ms	1×	256	valid

Precisions

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

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

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

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

Bogosity

preprocess205.0ms (14%)

Algorithm

1×	egg-herbie

Rules

70×	`fmm-def`
26×	`fma-define`
22×	`distribute-lft-neg-in`
13×	`distribute-rgt-neg-in`
12×	`cancel-sign-sub-inv`

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`#s(literal 10 binary64)`
-	-	`(*.f64 d #s(literal 20 binary64))`
-	-	`#s(literal 20 binary64)`
-	-	`(*.f64 d #s(literal 10 binary64))`
-	-	`d`
-	-	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	44
1	40	44
2	100	40
3	235	40
4	323	40
5	349	40

Stop Event

1×

saturated

Calls

Call 1

Inputs
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(+.f64 (.f64 (neg.f64 d) #s(literal 10 binary64)) (.f64 (neg.f64 d) #s(literal 20 binary64)))
(neg.f64 (+.f64 (.f64 (neg.f64 d) #s(literal 10 binary64)) (.f64 (neg.f64 d) #s(literal 20 binary64))))

Outputs
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(*.f64 d #s(literal 30 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
(*.f64 d #s(literal 30 binary64))
(+.f64 (.f64 (neg.f64 d) #s(literal 10 binary64)) (.f64 (neg.f64 d) #s(literal 20 binary64)))
(*.f64 (neg.f64 d) #s(literal 30 binary64))
(*.f64 d #s(literal -30 binary64))
(neg.f64 (+.f64 (.f64 (neg.f64 d) #s(literal 10 binary64)) (.f64 (neg.f64 d) #s(literal 20 binary64))))
(*.f64 d #s(literal 30 binary64))

Symmetry

(negabs d)

Compiler

Compiled 44 to 32 computations (27.3% saved)

Precisions

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

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

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

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

eval0.0ms (0%)

Compiler: Compiled 4 to 3 computations (25% saved)

prune1.0ms (0%)

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 4 to 3 computations (25% saved)

localize64.0ms (4.4%)

Compiler: Compiled 7 to 5 computations (28.6% saved)
Precisions: Click to see histograms. Total time spent on operations: 3.0ms
Operation ival-mult, time spent: 2.0ms, 71.0% of total-time
Operation const, time spent: 1.0ms, 36.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%	(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 15 to 11 computations (26.7% saved)

regimes9.0ms (0.6%)

Accuracy

Total -0.3b remaining (-∞%)

Threshold costs -0.3b (-∞%)

Counts

2 → 1

Calls

Call 1

Inputs
(*.f64 d #s(literal 30 binary64))
(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Outputs
(*.f64 d #s(literal 30 binary64))

Calls

2 calls:

7.0ms	d
2.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))

Results

Accuracy	Segments	Branch
100.0%	1	`d`
100.0%	1	`(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))`

Compiler

Compiled 10 to 7 computations (30% saved)

simplify2.0ms (0.1%)

Algorithm

1×	egg-herbie

Rules

1×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	8	10

Stop Event

1×	done
1×	saturated

Calls

Call 1

Inputs
(*.f64 d #s(literal 30 binary64))

Outputs
(*.f64 d #s(literal 30 binary64))

Compiler

Compiled 4 to 3 computations (25% saved)

soundness24.0ms (1.7%)

Rules

70×	`fmm-def`
26×	`fma-define`
22×	`distribute-lft-neg-in`
13×	`distribute-rgt-neg-in`
12×	`cancel-sign-sub-inv`

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	16	44
1	40	44
2	100	40
3	235	40
4	323	40
5	349	40

Stop Event

1×

saturated

Compiler

Compiled 16 to 12 computations (25% saved)

end0.0ms (0%)

preprocess31.0ms (2.1%)

Remove: (negabs d)
Compiler: Compiled 48 to 36 computations (25% saved)

analyze0.0ms (0%)

sample1.1s (77%)

preprocess205.0ms (14%)

eval0.0ms (0%)

prune1.0ms (0%)

localize64.0ms (4.4%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes9.0ms (0.6%)

simplify2.0ms (0.1%)

soundness24.0ms (1.7%)

end0.0ms (0%)

preprocess31.0ms (2.1%)

Profiling