Solving ../../benchmarks/smtlib/false/cons_is_equal.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}  ;  natlist -> {cons, nil}
}
definition:
{

}

properties:
{
eq_natlist(x, cons(y, x)) <= True
}


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

Clause system for inference is:

{
eq_natlist(x, cons(y, x)) <= True -> 0
}


Solving took 0.011758 seconds.
No: Contradictory set of ground constraints:
{
False <= True
}
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.006171 s (model generation: 0.006111,  model checking: 0.000060):

Clauses:
{
eq_natlist(x, cons(y, x)) <= True -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None



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




Answer of teacher:

eq_natlist(x, cons(y, x)) <= True  :
Yes: {
x -> nil
}


Total time: 0.011758
Learner time: 0.006111
Teacher time: 0.000060
Reasons for stopping: No: Contradictory set of ground constraints:
{
False <= True
}