Solving ../../benchmarks/smtlib/true/isaplanner_prop10.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:
{
(minus, F:
{
minus(s(u), z, s(u)) <= True
minus(z, y, z) <= True
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)
}
eq_nat(_zoa, _apa) <= minus(_xoa, _yoa, _apa) /\ minus(_xoa, _yoa, _zoa)
)
}

properties:
{
eq_nat(_bpa, z) <= minus(m, m, _bpa)
}


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

Clause system for inference is:

{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}


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

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



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

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

Accumulated learning constraints:
{

}

Current best model:
|_
name: None

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



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




Answer of teacher:

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

}

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

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
No: ()

minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)  :
No: ()


-------------------------------------------
Step 1, which took 0.006495 s (model generation: 0.006453,  model checking: 0.000042):

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

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

minus(z, y, z) <= True  :
Yes: {
y -> s(_njoe_0)
}

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
No: ()

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


-------------------------------------------
Step 2, which took 0.007015 s (model generation: 0.006907,  model checking: 0.000108):

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

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

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

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
No: ()

minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)  :
Yes: {
_woa -> s(_ujoe_0)  ;  u -> s(_vjoe_0)  ;  x2 -> z
}


-------------------------------------------
Step 3, which took 0.014074 s (model generation: 0.013997,  model checking: 0.000077):

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

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

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

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
Yes: {
_bpa -> s(_xjoe_0)  ;  m -> s(_yjoe_0)
}

minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)  :
No: ()


-------------------------------------------
Step 4, which took 0.022698 s (model generation: 0.022605,  model checking: 0.000093):

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

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

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

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
Yes: {
_bpa -> s(_zjoe_0)  ;  m -> s(s(_hkoe_0))
}

minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)  :
No: ()


-------------------------------------------
Step 5, which took 0.016686 s (model generation: 0.016581,  model checking: 0.000105):

Clauses:
{
minus(s(u), z, s(u)) <= True -> 0
minus(z, y, z) <= True -> 0
eq_nat(_bpa, z) <= minus(m, m, _bpa) -> 0
minus(s(u), s(x2), _woa) <= minus(u, x2, _woa) -> 0
}

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

Current best model:
|_
name: None

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



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




Answer of teacher:

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

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

eq_nat(_bpa, z) <= minus(m, m, _bpa)  :
No: ()

minus(s(u), s(x2), _woa) <= minus(u, x2, _woa)  :
Yes: {
_woa -> s(_kkoe_0)  ;  u -> s(s(_qkoe_0))  ;  x2 -> s(z)
}


Total time: 0.099233
Learner time: 0.072352
Teacher time: 0.000470
Reasons for stopping: Yes: |_
name: None

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



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