Solving ../../benchmarks/smtlib/true/isaplanner_prop22.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(_lz)) <= max(u, x2, _lz)
}
eq_nat(_oz, _pz) <= max(_mz, _nz, _oz) /\ max(_mz, _nz, _pz)
)
}

properties:
{
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)
}


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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 0
}


Solving took 0.103962 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.007413 s (model generation: 0.007370,  model checking: 0.000043):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
No: ()

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


-------------------------------------------
Step 1, which took 0.006969 s (model generation: 0.006864,  model checking: 0.000105):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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(_boye_0)
}

eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
Yes: {
_qz -> s(_coye_0)  ;  _rz -> s(z)  ;  _sz -> z  ;  _tz -> s(s(_uoye_0))  ;  a -> s(_goye_0)  ;  b -> z  ;  c -> z
}

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


-------------------------------------------
Step 2, which took 0.010692 s (model generation: 0.009991,  model checking: 0.000701):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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(_sqye_0)
}

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

eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
Yes: {
_qz -> z  ;  _rz -> s(z)  ;  _sz -> s(_nqye_0)  ;  _tz -> s(s(_zqye_0))  ;  a -> z  ;  b -> z  ;  c -> s(_rqye_0)
}

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


-------------------------------------------
Step 3, which took 0.016210 s (model generation: 0.015957,  model checking: 0.000253):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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), 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)) <= True
  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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
Yes: {
_qz -> s(_brye_0)  ;  _rz -> s(z)  ;  _sz -> s(_drye_0)  ;  _tz -> s(s(_htye_0))  ;  a -> s(_frye_0)  ;  b -> s(_grye_0)  ;  c -> s(_hrye_0)
}

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


-------------------------------------------
Step 4, which took 0.013889 s (model generation: 0.013470,  model checking: 0.000419):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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)))
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_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)) <= _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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
Yes: {
_qz -> z  ;  _rz -> s(s(z))  ;  _sz -> s(s(_bwye_0))  ;  _tz -> s(s(s(_jwye_0)))  ;  a -> z  ;  b -> z  ;  c -> s(s(_awye_0))
}

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


-------------------------------------------
Step 5, which took 0.014115 s (model generation: 0.013792,  model checking: 0.000323):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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(s(z)), s(s(s(z)))) /\ max(z, s(s(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_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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
No: ()

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


-------------------------------------------
Step 6, which took 0.016619 s (model generation: 0.015433,  model checking: 0.001186):

Clauses:
{
max(s(u), z, s(u)) <= True -> 0
max(z, y, y) <= True -> 0
eq_nat(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz) -> 0
max(s(u), s(x2), s(_lz)) <= max(u, x2, _lz) -> 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(z), s(z), s(s(z)))
False <= max(s(z), z, s(s(z)))
False <= max(z, s(s(z)), s(s(s(z)))) /\ max(z, s(s(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(_rz, _tz) <= max(_qz, c, _rz) /\ max(a, _sz, _tz) /\ max(a, b, _qz) /\ max(b, c, _sz)  :
Yes: {
_qz -> s(z)  ;  _rz -> s(z)  ;  _sz -> s(z)  ;  _tz -> s(s(z))  ;  a -> s(s(z))  ;  b -> s(z)  ;  c -> s(z)
}

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


Total time: 0.103962
Learner time: 0.082877
Teacher time: 0.003030
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}
_|