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

ival-add: 0.0ms (0% of total)

ival-mult: 0.0ms (0% of total)

const: 0.0ms (0% of total)

sample880.0ms (79.9%)

Results

619.0ms	8245×	0	valid
1.0ms	11×	0	infinite

Precisions

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

ival-mult: 158.0ms (69.7% of total)

ival-add: 50.0ms (22.1% of total)

const: 16.0ms (7.1% of total)

backward-pass: 4.0ms (1.8% of total)

Bogosity

preprocess49.0ms (4.5%)

Algorithm

1×	egg-herbie

Rules

70×	`fma-neg`
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

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 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)

explain90.0ms (8.2%)

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)))`

Results

62.0ms

512×

256

valid

Compiler

Compiled 44 to 32 computations (27.3% saved)

Precisions

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

ival-mult: 17.0ms (80.9% of total)

ival-add: 3.0ms (14.3% of total)

const: 2.0ms (9.5% of total)

eval0.0ms (0%)

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

prune1.0ms (0.1%)

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)

localize21.0ms (1.9%)

Results

16.0ms

256×

256

valid

Compiler

Compiled 7 to 5 computations (28.6% saved)

Precisions

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

ival-mult: 2.0ms (77% of total)

const: 0.0ms (0% of total)

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)

regimes7.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:

5.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
1.0ms	d

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×

saturated

Calls

Call 1

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

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

soundness20.0ms (1.9%)

Rules

70×	`fma-neg`
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×	done
1×	saturated

Compiler

Compiled 20 to 15 computations (25% saved)

preprocess29.0ms (2.6%)

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

FastMath test1

analyze0.0ms (0%)

sample880.0ms (79.9%)

preprocess49.0ms (4.5%)

explain90.0ms (8.2%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize21.0ms (1.9%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes7.0ms (0.6%)

simplify2.0ms (0.1%)

soundness20.0ms (1.9%)

preprocess29.0ms (2.6%)

end0.0ms (0%)

Profiling