Solving ../../benchmarks/smtlib/true/tree_injectivity_1.smt2...

Inference procedure has parameters:
Ice fuel: 200
Timeout: Some(60.) (sec)
Teacher_type: Checks all clauses every time
Approximation method: remove every clause that can be safely removed



Learning problem is:

env: {
nat -> {s, z}  ;  nat_bin_tree -> {leaf, node}
}
definition:
{

}

properties:
{

}


over-approximation: {}
under-approximation: {}

Clause system for inference is:

{

}


Solving took 0.006257 seconds.
Yes: |_
name: None



--
Equality automata are defined for: {nat, nat_bin_tree}
_|
-------------------
STEPS:
Total time: 0.006257
Learner time: 0.000000
Teacher time: 0.000000
Reasons for stopping: Yes: |_
name: None



--
Equality automata are defined for: {nat, nat_bin_tree}
_|