FastMath test1

Time bar (total: 1.7s)

analyze0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 9 to 8 computations (11.1% saved)

sample903.0ms (52.3%)

Memory
-25.1MiB live, 571.7MiB allocated
Samples
749.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 487.0ms
ival-add: 250.0ms (51.3% of total)
ival-mult: 223.0ms (45.8% of total)
...in/eval/compile.rkt:76:19: 6.0ms (1.2% of total)
ival-true: 6.0ms (1.2% of total)
ival-assert: 3.0ms (0.6% of total)
Bogosity

preprocess44.0ms (2.5%)

Memory
32.8MiB live, 71.4MiB allocated
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)

IterNodesCost
01644
14044
210040
323540
432340
534940
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)

explain64.0ms (3.7%)

Memory
1.4MiB live, 119.7MiB allocated
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 (*.f64 d #s(literal 10 binary64)) (*.f64 d #s(literal 20 binary64)))
00-0-(*.f64 d #s(literal 10 binary64))
00-0-d
00-0-#s(literal 20 binary64)
00-0-(*.f64 d #s(literal 20 binary64))
00-0-#s(literal 10 binary64)
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
20.0ms512×0valid
Compiler

Compiled 52 to 28 computations (46.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 9.0ms
ival-mult: 6.0ms (66.7% of total)
ival-add: 2.0ms (22.2% 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%)

Memory
0.7MiB live, 0.7MiB allocated
Compiler

Compiled 4 to 3 computations (25% saved)

prune1.0ms (0%)

Memory
1.7MiB live, 1.7MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(*.f64 d #s(literal 30 binary64))
Compiler

Compiled 4 to 3 computations (25% saved)

simplify7.0ms (0.4%)

Memory
-33.0MiB live, 5.4MiB allocated
Algorithm
1×egg-herbie
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(*.f64 d #s(literal 30 binary64))
Rules
1×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0715
1815
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)

localize10.0ms (0.6%)

Memory
21.9MiB live, 21.9MiB allocated
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(*.f64 d #s(literal 30 binary64))
Samples
6.0ms256×0valid
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 (102.4% 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%)

Memory
2.8MiB live, 2.8MiB allocated
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:

TimeVariablePointExpression
0.0ms
d
@-inf
(* d 30)
0.0ms
d
@0
(* d 30)
0.0ms
d
@inf
(* d 30)

rewrite399.0ms (23.1%)

Memory
-36.4MiB live, 221.0MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
1 026×log1p-expm1-u
483×expm1-log1p-u
314×associate-*r*
287×associate-*l*
175×unpow-prod-down
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0710
14610
248910
3579510
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)))

simplify67.0ms (3.9%)

Memory
8.8MiB live, 46.8MiB allocated
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)

IterNodesCost
085564
1162560
2408553
31643549
45029549
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%)

Memory
7.3MiB live, 7.3MiB allocated
Compiler

Compiled 345 to 108 computations (68.7% saved)

prune5.0ms (0.3%)

Memory
9.4MiB live, 9.4MiB allocated
Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New34034
Fresh000
Picked011
Done000
Total34135
Accuracy
100.0%
Counts
35 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(*.f64 d #s(literal 30 binary64))
Compiler

Compiled 15 to 11 computations (26.7% saved)

regimes3.0ms (0.2%)

Memory
6.1MiB live, 6.1MiB allocated
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
AccuracySegmentsBranch
100.0%1d
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%)

Memory
0.9MiB live, 0.9MiB allocated
Algorithm
1×egg-herbie
Rules
1×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0710
1810
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 d #s(literal 30 binary64))
Outputs
(*.f64 d #s(literal 30 binary64))

soundness147.0ms (8.5%)

Memory
-28.4MiB live, 10.0MiB allocated
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)

IterNodesCost
01644
14044
210040
323540
432340
534940
Stop Event
1×done
1×saturated
Compiler

Compiled 20 to 13 computations (35% saved)

preprocess69.0ms (4%)

Memory
2.6MiB live, 44.4MiB allocated
Remove

(negabs d)

Compiler

Compiled 48 to 36 computations (25% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...