Metrics for FastMath test1

analyze315.0ms (19.4%)

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
0%	0%	100%	0%	0%	0%	0%	2
0%	0%	100%	0%	0%	0%	0%	3
0%	0%	100%	0%	0%	0%	0%	4
0%	0%	100%	0%	0%	0%	0%	5
0%	0%	100%	0%	0%	0%	0%	6
0%	0%	100%	0%	0%	0%	0%	7
0%	0%	100%	0%	0%	0%	0%	8
0%	0%	100%	0%	0%	0%	0%	9
0%	0%	100%	0%	0%	0%	0%	10
0.2%	0.2%	99.8%	0%	0%	0%	0%	11
0.2%	0.2%	99.8%	0%	0%	0%	0%	12

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample681.0ms (41.9%)

Results

463.0ms

8256×

valid

Precisions

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

ival-mult: 161.0ms (75.1% of total)

ival-add: 37.0ms (17.3% of total)

...in/eval/compile.rkt:76:19: 6.0ms (2.8% of total)

ival-true: 6.0ms (2.8% of total)

ival-assert: 4.0ms (1.9% of total)

Bogosity

preprocess46.0ms (2.8%)

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`

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)

explain108.0ms (6.6%)

FPErrors

Click to see full error table

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

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Results

73.0ms

512×

valid

Compiler

Compiled 52 to 28 computations (46.2% saved)

Precisions

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

ival-mult: 57.0ms (94% of total)

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

...in/eval/compile.rkt:76:19: 0.0ms (0% of total)

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

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

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)

simplify5.0ms (0.3%)

Algorithm

1×	egg-herbie

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	cost-diff	0	(*.f64 d #s(literal 30 binary64))

Rules

1×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	15
1	8	15

Stop Event

1×

saturated

Calls

Call 1

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

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

localize16.0ms (1%)

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 d #s(literal 30 binary64))

Results

12.0ms

256×

valid

Compiler

Compiled 7 to 5 computations (28.6% saved)

Precisions

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

ival-mult: 7.0ms (96.7% of total)

...in/eval/compile.rkt:76:19: 0.0ms (0% of total)

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

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

series1.0ms (0.1%)

Counts

1 → 12

Calls

Call 1

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

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

Calls

3 calls:

Time	Variable		Point	Expression
0.0ms	d	@	-inf	(* d 30)
0.0ms	d	@	inf	(* d 30)
0.0ms	d	@	0	(* d 30)

rewrite317.0ms (19.5%)

Algorithm

1×	batch-egg-rewrite

Rules

1026×	`log1p-expm1-u`
483×	`expm1-log1p-u`
314×	`associate-r`
287×	`associate-l`
175×	`unpow-prod-down`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	46	10
2	489	10
3	5795	10

Stop Event

1×	node limit

Counts

1 → 25

Calls

Call 1

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

Outputs
(+.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal -1 binary64))
(+.f64 #s(literal 0 binary64) (*.f64 d #s(literal 30 binary64)))
(+.f64 (log.f64 (cbrt.f64 (pow.f64 (exp.f64 d) #s(literal 60 binary64)))) (log.f64 (cbrt.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))))
(+.f64 (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))) (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))))
(-.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64))
(/.f64 (-.f64 (pow.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 3 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)))))
(/.f64 (-.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) #s(literal 1 binary64)) (+.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64)))
(pow.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))
(pow.f64 (cbrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 3 binary64))
(pow.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)) #s(literal 1/2 binary64))
(pow.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)) #s(literal 1/3 binary64))
(pow.f64 (sqrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 2 binary64))
(pow.f64 (E.f64) (log.f64 (*.f64 d #s(literal 30 binary64))))
(pow.f64 (exp.f64 (cbrt.f64 (pow.f64 (log.f64 (.f64 d #s(literal 30 binary64))) #s(literal 2 binary64)))) (cbrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(pow.f64 (exp.f64 (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64))))) (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(sqrt.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)))
(fabs.f64 (*.f64 d #s(literal 30 binary64)))
(log.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))
(cbrt.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)))
(expm1.f64 (log1p.f64 (*.f64 d #s(literal 30 binary64))))
(log1p.f64 (expm1.f64 (*.f64 d #s(literal 30 binary64))))
(exp.f64 (log.f64 (*.f64 d #s(literal 30 binary64))))
(exp.f64 (.f64 (log.f64 (cbrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 3 binary64)))
(exp.f64 (.f64 (.f64 #s(literal 3 binary64) (log.f64 (*.f64 d #s(literal 30 binary64)))) #s(literal 1/3 binary64)))
(exp.f64 (.f64 (log.f64 (sqrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 2 binary64)))

simplify73.0ms (4.5%)

Algorithm

1×	egg-herbie

Rules

622×	`sub-neg`
532×	`times-frac`
389×	`associate-r`
382×	`prod-exp`
329×	`associate-l`

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	85	564
1	162	560
2	408	553
3	1643	549
4	5029	549

Stop Event

1×	node limit

Counts

37 → 34

Calls

Call 1

Inputs
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(+.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal -1 binary64))
(+.f64 #s(literal 0 binary64) (*.f64 d #s(literal 30 binary64)))
(+.f64 (log.f64 (cbrt.f64 (pow.f64 (exp.f64 d) #s(literal 60 binary64)))) (log.f64 (cbrt.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))))
(+.f64 (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))) (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))))
(-.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64))
(/.f64 (-.f64 (pow.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 3 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)))))
(/.f64 (-.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) #s(literal 1 binary64)) (+.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64)))
(pow.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))
(pow.f64 (cbrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 3 binary64))
(pow.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)) #s(literal 1/2 binary64))
(pow.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)) #s(literal 1/3 binary64))
(pow.f64 (sqrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 2 binary64))
(pow.f64 (E.f64) (log.f64 (*.f64 d #s(literal 30 binary64))))
(pow.f64 (exp.f64 (cbrt.f64 (pow.f64 (log.f64 (.f64 d #s(literal 30 binary64))) #s(literal 2 binary64)))) (cbrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(pow.f64 (exp.f64 (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64))))) (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(sqrt.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)))
(fabs.f64 (*.f64 d #s(literal 30 binary64)))
(log.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))
(cbrt.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)))
(expm1.f64 (log1p.f64 (*.f64 d #s(literal 30 binary64))))
(log1p.f64 (expm1.f64 (*.f64 d #s(literal 30 binary64))))
(exp.f64 (log.f64 (*.f64 d #s(literal 30 binary64))))
(exp.f64 (.f64 (log.f64 (cbrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 3 binary64)))
(exp.f64 (.f64 (.f64 #s(literal 3 binary64) (log.f64 (*.f64 d #s(literal 30 binary64)))) #s(literal 1/3 binary64)))
(exp.f64 (.f64 (log.f64 (sqrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 2 binary64)))

Outputs
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(*.f64 #s(literal 30 binary64) d)
(+.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal -1 binary64))
(*.f64 #s(literal 30 binary64) d)
(+.f64 #s(literal 0 binary64) (*.f64 d #s(literal 30 binary64)))
(*.f64 #s(literal 30 binary64) d)
(+.f64 (log.f64 (cbrt.f64 (pow.f64 (exp.f64 d) #s(literal 60 binary64)))) (log.f64 (cbrt.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))))
(+.f64 (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))) (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))))
(*.f64 #s(literal 2 binary64) (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))))
(*.f64 (log.f64 (pow.f64 (exp.f64 d) #s(literal 15 binary64))) #s(literal 2 binary64))
(-.f64 (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64))
(*.f64 #s(literal 30 binary64) d)
(/.f64 (-.f64 (pow.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 3 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) (+.f64 #s(literal 1 binary64) (+.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)))))
(/.f64 (+.f64 (pow.f64 (fma.f64 d #s(literal 30 binary64) #s(literal 1 binary64)) #s(literal 3 binary64)) #s(literal -1 binary64)) (fma.f64 (fma.f64 d #s(literal 30 binary64) #s(literal 1 binary64)) (fma.f64 d #s(literal 30 binary64) #s(literal 1 binary64)) (+.f64 (*.f64 #s(literal 30 binary64) d) #s(literal 2 binary64))))
(/.f64 (+.f64 #s(literal -1 binary64) (pow.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) (fma.f64 #s(literal 30 binary64) d #s(literal 2 binary64))))
(/.f64 (+.f64 #s(literal -1 binary64) (pow.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) #s(literal 3 binary64))) (+.f64 #s(literal 1 binary64) (*.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) (fma.f64 #s(literal 30 binary64) d #s(literal 2 binary64)))))
(/.f64 (+.f64 #s(literal -1 binary64) (pow.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 (fma.f64 #s(literal 30 binary64) d #s(literal 1 binary64)) (fma.f64 #s(literal 30 binary64) d #s(literal 2 binary64)) #s(literal 1 binary64)))
(/.f64 (-.f64 (.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))) #s(literal 1 binary64)) (+.f64 (+.f64 (.f64 d #s(literal 30 binary64)) #s(literal 1 binary64)) #s(literal 1 binary64)))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (*.f64 d #s(literal 30 binary64)) #s(literal 1 binary64))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (cbrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 3 binary64))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)) #s(literal 1/2 binary64))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)) #s(literal 1/3 binary64))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (sqrt.f64 (*.f64 d #s(literal 30 binary64))) #s(literal 2 binary64))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (E.f64) (log.f64 (*.f64 d #s(literal 30 binary64))))
(*.f64 #s(literal 30 binary64) d)
(pow.f64 (exp.f64 (cbrt.f64 (pow.f64 (log.f64 (.f64 d #s(literal 30 binary64))) #s(literal 2 binary64)))) (cbrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(pow.f64 (exp.f64 (cbrt.f64 (pow.f64 (log.f64 (.f64 #s(literal 30 binary64) d)) #s(literal 2 binary64)))) (cbrt.f64 (log.f64 (.f64 #s(literal 30 binary64) d))))
(pow.f64 (exp.f64 (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64))))) (sqrt.f64 (log.f64 (.f64 d #s(literal 30 binary64)))))
(pow.f64 (exp.f64 (sqrt.f64 (log.f64 (.f64 #s(literal 30 binary64) d)))) (sqrt.f64 (log.f64 (.f64 #s(literal 30 binary64) d))))
(sqrt.f64 (*.f64 (pow.f64 d #s(literal 2 binary64)) #s(literal 900 binary64)))
(*.f64 #s(literal 30 binary64) d)
(fabs.f64 (*.f64 d #s(literal 30 binary64)))
(*.f64 #s(literal 30 binary64) d)
(log.f64 (pow.f64 (exp.f64 #s(literal 30 binary64)) d))
(*.f64 #s(literal 30 binary64) d)
(cbrt.f64 (*.f64 (pow.f64 d #s(literal 3 binary64)) #s(literal 27000 binary64)))
(*.f64 #s(literal 30 binary64) d)
(expm1.f64 (log1p.f64 (*.f64 d #s(literal 30 binary64))))
(*.f64 #s(literal 30 binary64) d)
(log1p.f64 (expm1.f64 (*.f64 d #s(literal 30 binary64))))
(*.f64 #s(literal 30 binary64) d)
(exp.f64 (log.f64 (*.f64 d #s(literal 30 binary64))))
(*.f64 #s(literal 30 binary64) d)
(exp.f64 (.f64 (log.f64 (cbrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 3 binary64)))
(*.f64 #s(literal 30 binary64) d)
(exp.f64 (.f64 (.f64 #s(literal 3 binary64) (log.f64 (*.f64 d #s(literal 30 binary64)))) #s(literal 1/3 binary64)))
(*.f64 #s(literal 30 binary64) d)
(exp.f64 (.f64 (log.f64 (sqrt.f64 (.f64 d #s(literal 30 binary64)))) #s(literal 2 binary64)))
(*.f64 #s(literal 30 binary64) d)

eval4.0ms (0.3%)

Compiler: Compiled 345 to 108 computations (68.7% saved)

prune6.0ms (0.4%)

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	34	0	34
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	34	1	35

Accuracy

100.0%

Counts

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

regimes3.0ms (0.2%)

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

soundness21.0ms (1.3%)

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×	done
1×	saturated

Compiler

Compiled 20 to 13 computations (35% saved)

preprocess25.0ms (1.6%)

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

FastMath test1

analyze315.0ms (19.4%)

sample681.0ms (41.9%)

preprocess46.0ms (2.8%)

explain108.0ms (6.6%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify5.0ms (0.3%)

localize16.0ms (1%)

series1.0ms (0.1%)

rewrite317.0ms (19.5%)

simplify73.0ms (4.5%)

eval4.0ms (0.3%)

prune6.0ms (0.4%)

regimes3.0ms (0.2%)

simplify2.0ms (0.1%)

soundness21.0ms (1.3%)

preprocess25.0ms (1.6%)

end0.0ms (0%)

Profiling