Solving ../../benchmarks/smtlib/true/isaplanner_prop23.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}
}
definition:
{
(max, F:
{
max(s(u), z, s(u)) <= True
max(z, y, y) <= True
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)
}
eq_nat(_nea, _oea) <= max(_lea, _mea, _nea) /\ max(_lea, _mea, _oea)
)
}

properties:
{
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)
}


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

Clause system for inference is:

{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}


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

max ->
[
max : <nat * nat * nat>
{
  _r_1(s(x_0_0), s(x_1_0)) <= _r_1(x_0_0, x_1_0)
  _r_1(z, z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= max(x_0_0, x_1_0, x_2_0)
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(z, z, z) <= True
}
]



--
Equality automata are defined for: {nat}
_|
-------------------
STEPS:
-------------------------------------------
Step 0, which took 0.006151 s (model generation: 0.006105,  model checking: 0.000046):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
Yes: {

}

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

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
No: ()

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
No: ()


-------------------------------------------
Step 1, which took 0.006580 s (model generation: 0.006529,  model checking: 0.000051):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

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

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  max(s(x_0_0), z, s(x_2_0)) <= True
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
No: ()

max(z, y, y) <= True  :
Yes: {
y -> s(_hqze_0)
}

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
No: ()

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
Yes: {
_kea -> z  ;  u -> z  ;  x2 -> z
}


-------------------------------------------
Step 2, which took 0.007635 s (model generation: 0.007565,  model checking: 0.000070):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

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

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= True
  max(s(x_0_0), z, s(x_2_0)) <= True
  max(z, s(x_1_0), s(x_2_0)) <= True
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
No: ()

max(z, y, y) <= True  :
No: ()

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
Yes: {
_pea -> s(z)  ;  _qea -> s(s(_frze_0))  ;  a -> z  ;  b -> s(_zqze_0)
}

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
No: ()


-------------------------------------------
Step 3, which took 0.011824 s (model generation: 0.011606,  model checking: 0.000218):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

Accumulated learning constraints:
{
max(s(z), s(z), s(z)) <= True
max(s(z), z, s(z)) <= True
max(z, s(z), s(z)) <= True
max(z, z, z) <= True
False <= max(s(z), z, s(s(z)))
}

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  _r_1(z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= True
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= True
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
Yes: {
u -> s(_srze_0)
}

max(z, y, y) <= True  :
No: ()

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
Yes: {
_pea -> s(z)  ;  _qea -> s(s(_yrze_0))  ;  a -> s(_irze_0)  ;  b -> s(_jrze_0)
}

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
No: ()


-------------------------------------------
Step 4, which took 0.016481 s (model generation: 0.015716,  model checking: 0.000765):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

Accumulated learning constraints:
{
max(s(s(z)), z, s(s(z))) <= True
max(s(z), s(z), s(z)) <= True
max(s(z), z, s(z)) <= True
max(z, s(z), s(z)) <= True
max(z, z, z) <= True
False <= max(s(z), s(z), s(s(z)))
False <= max(s(z), z, s(s(z)))
}

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  _r_1(s(x_0_0), s(x_1_0)) <= True
  _r_1(z, z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= True
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
No: ()

max(z, y, y) <= True  :
No: ()

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
Yes: {
_pea -> s(z)  ;  _qea -> s(s(_ftze_0))  ;  a -> s(z)  ;  b -> z
}

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
Yes: {
_kea -> s(_rsze_0)  ;  u -> z  ;  x2 -> s(_tsze_0)
}


-------------------------------------------
Step 5, which took 0.013532 s (model generation: 0.013332,  model checking: 0.000200):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

Accumulated learning constraints:
{
max(s(s(z)), z, s(s(z))) <= True
max(s(z), s(s(z)), s(s(z))) <= True
max(s(z), s(z), s(z)) <= True
max(s(z), z, s(z)) <= True
max(z, s(z), s(z)) <= True
max(z, z, z) <= True
False <= max(s(z), s(z), s(s(z)))
False <= max(s(z), z, s(s(z)))
False <= max(z, s(z), s(s(z)))
}

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  _r_1(s(x_0_0), s(x_1_0)) <= True
  _r_1(z, z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
No: ()

max(z, y, y) <= True  :
No: ()

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
Yes: {
_pea -> s(s(z))  ;  _qea -> s(s(s(_nuze_0)))  ;  a -> z  ;  b -> s(s(_fuze_0))
}

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
Yes: {
_kea -> s(z)  ;  u -> s(z)  ;  x2 -> z
}


-------------------------------------------
Step 6, which took 0.016020 s (model generation: 0.015714,  model checking: 0.000306):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea) -> 0
max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea) -> 0
}

Accumulated learning constraints:
{
max(s(s(z)), s(z), s(s(z))) <= True
max(s(s(z)), z, s(s(z))) <= True
max(s(z), s(s(z)), s(s(z))) <= True
max(s(z), s(z), s(z)) <= True
max(s(z), z, s(z)) <= True
max(z, s(z), s(z)) <= True
max(z, z, z) <= True
False <= max(s(s(z)), z, s(s(s(z)))) /\ max(z, s(s(z)), s(s(z)))
False <= max(s(z), s(z), s(s(z)))
False <= max(s(z), z, s(s(z)))
False <= max(z, s(z), s(s(z)))
}

Current best model:
|_
name: None

max ->
[
max : <nat * nat * nat>
{
  _r_1(s(x_0_0), s(x_1_0)) <= _r_1(x_0_0, x_1_0)
  _r_1(z, z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(z, z, z) <= True
}
]



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




Answer of teacher:

max(s(u), z, s(u)) <= True  :
No: ()

max(z, y, y) <= True  :
No: ()

eq_nat(_pea, _qea) <= max(a, b, _pea) /\ max(b, a, _qea)  :
Yes: {
_pea -> s(z)  ;  _qea -> s(s(z))  ;  a -> s(s(z))  ;  b -> s(z)
}

max(s(u), s(x2), s(_kea)) <= max(u, x2, _kea)  :
No: ()


Total time: 0.092507
Learner time: 0.076567
Teacher time: 0.001656
Reasons for stopping: Yes: |_
name: None

max ->
[
max : <nat * nat * nat>
{
  _r_1(s(x_0_0), s(x_1_0)) <= _r_1(x_0_0, x_1_0)
  _r_1(z, z) <= True
  max(s(x_0_0), s(x_1_0), s(x_2_0)) <= max(x_0_0, x_1_0, x_2_0)
  max(s(x_0_0), z, s(x_2_0)) <= _r_1(x_0_0, x_2_0)
  max(z, s(x_1_0), s(x_2_0)) <= _r_1(x_1_0, x_2_0)
  max(z, z, z) <= True
}
]



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