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)

backward-pass: 0.0ms (0% of total)

sample625.0ms (73.4%)

Results

424.0ms

8256×

valid

Precisions

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

ival-mult: 200.0ms (77.5% of total)

ival-add: 42.0ms (16.3% of total)

const: 13.0ms (5% of total)

backward-pass: 2.0ms (0.8% of total)

Bogosity

preprocess51.0ms (6%)

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

explain102.0ms (12%)

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

72.0ms

512×

valid

Compiler

Compiled 44 to 32 computations (27.3% saved)

Precisions

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

ival-mult: 51.0ms (92.8% of total)

ival-add: 2.0ms (3.6% of total)

const: 2.0ms (3.6% of total)

backward-pass: 0.0ms (0% 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)

localize18.0ms (2.1%)

Results

13.0ms

256×

valid

Compiler

Compiled 7 to 5 computations (28.6% saved)

Precisions

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

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

const: 0.0ms (0% of total)

backward-pass: 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)

regimes4.0ms (0.4%)

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:

2.0ms	(+.f64 (.f64 d #s(literal 10 binary64)) (.f64 d #s(literal 20 binary64)))
2.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)

simplify3.0ms (0.3%)

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

soundness21.0ms (2.5%)

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)

preprocess25.0ms (2.9%)

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

FastMath test1

analyze0.0ms (0%)

sample625.0ms (73.4%)

preprocess51.0ms (6%)

explain102.0ms (12%)

eval0.0ms (0%)

prune1.0ms (0.1%)

localize18.0ms (2.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes4.0ms (0.4%)

simplify3.0ms (0.3%)

soundness21.0ms (2.5%)

preprocess25.0ms (2.9%)

end0.0ms (0%)

Profiling