Solving ../../benchmarks/smtlib/true/isaplanner_prop40.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: {
elt -> {a, b}  ;  eltlist -> {cons, nil}  ;  nat -> {s, z}
}
definition:
{
(take, F:
{
take(s(u), nil, nil) <= True
take(z, y, nil) <= True
take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha)
}
eq_eltlist(_kha, _lha) <= take(_iha, _jha, _kha) /\ take(_iha, _jha, _lha)
)
}

properties:
{
eq_eltlist(_mha, nil) <= take(z, xs, _mha)
}


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

Clause system for inference is:

{
take(s(u), nil, nil) <= True -> 0
take(z, y, nil) <= True -> 0
take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha) -> 0
eq_eltlist(_mha, nil) <= take(z, xs, _mha) -> 0
}


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

take ->
[
take : <nat * eltlist * eltlist>
{
  take(s(x_0_0), cons(x_1_0, x_1_1), cons(x_2_0, x_2_1)) <= True
  take(s(x_0_0), nil, nil) <= True
  take(z, cons(x_1_0, x_1_1), nil) <= True
  take(z, nil, nil) <= True
}
]



--
Equality automata are defined for: {elt, eltlist, nat}
_|
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.006887 s (model generation: 0.006764,  model checking: 0.000123):

Clauses:
{
take(s(u), nil, nil) <= True -> 0
take(z, y, nil) <= True -> 0
take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha) -> 0
eq_eltlist(_mha, nil) <= take(z, xs, _mha) -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None

take ->
[
take : <nat * eltlist * eltlist>
{
  
}
]



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




Answer of teacher:

take(s(u), nil, nil) <= True  :
Yes: {

}

take(z, y, nil) <= True  :
Yes: {
y -> nil
}

take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha)  :
No: ()

eq_eltlist(_mha, nil) <= take(z, xs, _mha)  :
No: ()


-------------------------------------------
Step 1, which took 0.007693 s (model generation: 0.007610,  model checking: 0.000083):

Clauses:
{
take(s(u), nil, nil) <= True -> 0
take(z, y, nil) <= True -> 0
take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha) -> 0
eq_eltlist(_mha, nil) <= take(z, xs, _mha) -> 0
}

Accumulated learning constraints:
{
take(s(z), nil, nil) <= True
take(z, nil, nil) <= True
}

Current best model:
|_
name: None

take ->
[
take : <nat * eltlist * eltlist>
{
  take(s(x_0_0), nil, nil) <= True
  take(z, nil, nil) <= True
}
]



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




Answer of teacher:

take(s(u), nil, nil) <= True  :
No: ()

take(z, y, nil) <= True  :
Yes: {
y -> cons(_ytsh_0, _ytsh_1)
}

take(s(u), cons(x2, x3), cons(x2, _hha)) <= take(u, x3, _hha)  :
Yes: {
_hha -> nil  ;  u -> z  ;  x3 -> nil
}

eq_eltlist(_mha, nil) <= take(z, xs, _mha)  :
No: ()


Total time: 0.024342
Learner time: 0.014374
Teacher time: 0.000206
Reasons for stopping: Yes: |_
name: None

take ->
[
take : <nat * eltlist * eltlist>
{
  take(s(x_0_0), cons(x_1_0, x_1_1), cons(x_2_0, x_2_1)) <= True
  take(s(x_0_0), nil, nil) <= True
  take(z, cons(x_1_0, x_1_1), nil) <= True
  take(z, nil, nil) <= True
}
]



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