TSTP Solution File: SWW678_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat Sep 2 14:14:06 EDT 2023
% Result : Theorem 249.40s 36.08s
% Output : Refutation 249.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 85
% Syntax : Number of formulae : 355 ( 27 unt; 14 typ; 0 def)
% Number of atoms : 1363 ( 314 equ)
% Maximal formula atoms : 42 ( 3 avg)
% Number of connectives : 1650 ( 628 ~; 734 |; 163 &)
% ( 66 <=>; 57 =>; 0 <=; 2 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of FOOLs : 2 ( 2 fml; 0 var)
% Number arithmetic : 436 ( 176 atm; 43 fun; 29 num; 188 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 11 ( 8 >; 3 *; 0 +; 0 <<)
% Number of predicates : 58 ( 52 usr; 52 prp; 0-2 aty)
% Number of functors : 16 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 368 (; 322 !; 46 ?; 367 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'Tree': $tType ).
tff(func_def_0,type,
'empty:Tree': 'Tree' ).
tff(func_def_1,type,
'left:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_2,type,
'val:(Tree)>Int': 'Tree' > $int ).
tff(func_def_3,type,
'node:(Int*Tree*Tree)>Tree': ( $int * 'Tree' * 'Tree' ) > 'Tree' ).
tff(func_def_4,type,
'right:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_9,type,
sK0: 'Tree' ).
tff(func_def_10,type,
sK1: $int ).
tff(func_def_11,type,
sK2: 'Tree' ).
tff(func_def_12,type,
sK3: 'Tree' ).
tff(func_def_13,type,
sK4: 'Tree' > $int ).
tff(func_def_14,type,
sK5: 'Tree' > $int ).
tff(pred_def_1,type,
searchtree: 'Tree' > $o ).
tff(pred_def_2,type,
in: ( $int * 'Tree' ) > $o ).
tff(f1555,plain,
$false,
inference(avatar_smt_refutation,[],[f101,f106,f110,f112,f116,f122,f126,f130,f134,f140,f144,f151,f162,f167,f179,f181,f187,f274,f385,f391,f1303,f1307,f1324,f1336,f1342,f1347,f1352,f1358,f1360,f1362,f1364,f1373,f1377,f1389,f1393,f1399,f1405,f1411,f1416,f1422,f1432,f1438,f1440,f1442,f1445,f1459,f1468,f1470,f1472,f1474,f1476,f1486,f1490,f1494,f1498,f1502,f1506,f1514,f1515,f1516,f1517,f1519,f1520,f1536,f1540,f1541,f1543,f1552]) ).
tff(f1552,plain,
( spl7_2
| spl7_4
| ~ spl7_7 ),
inference(avatar_contradiction_clause,[],[f1551]) ).
tff(f1551,plain,
( $false
| spl7_2
| spl7_4
| ~ spl7_7 ),
inference(subsumption_resolution,[],[f1550,f136]) ).
tff(f136,plain,
( ( 'empty:Tree' != sK0 )
| spl7_2 ),
inference(avatar_component_clause,[],[f93]) ).
tff(f93,plain,
( spl7_2
<=> ( 'empty:Tree' = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
tff(f1550,plain,
( ( 'empty:Tree' = sK0 )
| spl7_4
| ~ spl7_7 ),
inference(subsumption_resolution,[],[f1547,f100]) ).
tff(f100,plain,
( ~ in(sK1,sK0)
| spl7_4 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f99,plain,
( spl7_4
<=> in(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
tff(f1547,plain,
( in(sK1,sK0)
| ( 'empty:Tree' = sK0 )
| ~ spl7_7 ),
inference(superposition,[],[f221,f117]) ).
tff(f117,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f114]) ).
tff(f114,plain,
( spl7_7
<=> ( sK1 = 'val:(Tree)>Int'(sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
tff(f221,plain,
! [X0: 'Tree'] :
( in('val:(Tree)>Int'(X0),X0)
| ( 'empty:Tree' = X0 ) ),
inference(equality_resolution,[],[f80]) ).
tff(f80,plain,
! [X0: $int,X1: 'Tree'] :
( ( 'val:(Tree)>Int'(X1) != X0 )
| in(X0,X1)
| ( 'empty:Tree' = X1 ) ),
inference(cnf_transformation,[],[f54]) ).
tff(f54,plain,
! [X0: $int,X1: 'Tree'] :
( ( in(X0,X1)
| ( ~ in(X0,'right:(Tree)>Tree'(X1))
& ~ in(X0,'left:(Tree)>Tree'(X1))
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( 'empty:Tree' != X1 ) )
| ( 'empty:Tree' = X1 ) )
& ( ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( 'empty:Tree' != X1 ) )
| ~ in(X0,X1) ) ),
inference(flattening,[],[f53]) ).
tff(f53,plain,
! [X0: $int,X1: 'Tree'] :
( ( in(X0,X1)
| ( ~ in(X0,'right:(Tree)>Tree'(X1))
& ~ in(X0,'left:(Tree)>Tree'(X1))
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( 'empty:Tree' != X1 ) )
| ( 'empty:Tree' = X1 ) )
& ( ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( 'empty:Tree' != X1 ) )
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( 'empty:Tree' != X1 ) ) ),
inference(flattening,[],[f38]) ).
tff(f38,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 ) )
& ( 'empty:Tree' != X1 ) ) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( ( 'empty:Tree' != X1 )
=> ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 ) ) )
& ( 'empty:Tree' != X1 ) ) ),
inference(flattening,[],[f29]) ).
tff(f29,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( ( 'empty:Tree' != X1 )
=> ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 ) ) )
& ( ~ 'empty:Tree' = X1 ) ) ),
inference(true_and_false_elimination,[],[f28]) ).
tff(f28,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,X1)
<=> ( ( ( 'empty:Tree' != X1 )
=> ( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 ) ) )
& ( ( 'empty:Tree' = X1 )
=> $false ) ) ),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
! [X4: $int,X5: 'Tree'] :
( in(X4,X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( in(X4,'right:(Tree)>Tree'(X5))
| in(X4,'left:(Tree)>Tree'(X5))
| ( 'val:(Tree)>Int'(X5) = X4 ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_005) ).
tff(f1543,plain,
( spl7_23
| ~ spl7_4
| spl7_7
| ~ spl7_13
| spl7_18 ),
inference(avatar_split_clause,[],[f1542,f185,f142,f114,f99,f1322]) ).
tff(f1322,plain,
( spl7_23
<=> $less('val:(Tree)>Int'(sK0),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_23])]) ).
tff(f142,plain,
( spl7_13
<=> searchtree(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_13])]) ).
tff(f185,plain,
( spl7_18
<=> in(sK1,'left:(Tree)>Tree'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_18])]) ).
tff(f1542,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ in(sK1,sK0)
| $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl7_13
| spl7_18 ),
inference(subsumption_resolution,[],[f1315,f143]) ).
tff(f143,plain,
( searchtree(sK0)
| ~ spl7_13 ),
inference(avatar_component_clause,[],[f142]) ).
tff(f1315,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ in(sK1,sK0)
| $less('val:(Tree)>Int'(sK0),sK1)
| ~ searchtree(sK0)
| spl7_18 ),
inference(resolution,[],[f269,f186]) ).
tff(f186,plain,
( ~ in(sK1,'left:(Tree)>Tree'(sK0))
| spl7_18 ),
inference(avatar_component_clause,[],[f185]) ).
tff(f269,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ~ in(X0,X1)
| $less('val:(Tree)>Int'(X1),X0)
| ~ searchtree(X1) ),
inference(subsumption_resolution,[],[f268,f77]) ).
tff(f77,plain,
! [X0: $int,X1: 'Tree'] :
( ( 'empty:Tree' != X1 )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tff(f268,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 )
| ~ in(X0,X1)
| $less('val:(Tree)>Int'(X1),X0)
| ~ searchtree(X1) ),
inference(duplicate_literal_removal,[],[f263]) ).
tff(f263,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 )
| ~ in(X0,X1)
| $less('val:(Tree)>Int'(X1),X0)
| ( 'empty:Tree' = X1 )
| ~ searchtree(X1) ),
inference(resolution,[],[f78,f71]) ).
tff(f71,plain,
! [X3: $int,X0: 'Tree'] :
( ~ in(X3,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X3)
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f52]) ).
tff(f52,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ( ( ~ $less('val:(Tree)>Int'(X0),sK4(X0))
& in(sK4(X0),'right:(Tree)>Tree'(X0)) )
| ( $less('val:(Tree)>Int'(X0),sK5(X0))
& in(sK5(X0),'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f49,f51,f50]) ).
tff(f50,plain,
! [X0: 'Tree'] :
( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
=> ( ~ $less('val:(Tree)>Int'(X0),sK4(X0))
& in(sK4(X0),'right:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f51,plain,
! [X0: 'Tree'] :
( ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
=> ( $less('val:(Tree)>Int'(X0),sK5(X0))
& in(sK5(X0),'left:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f49,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X3: $int] :
( $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'right:(Tree)>Tree'(X0)) )
& ! [X4: $int] :
( ~ $less('val:(Tree)>Int'(X0),X4)
| ~ in(X4,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(rectify,[],[f48]) ).
tff(f48,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(flattening,[],[f47]) ).
tff(f47,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ? [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
& in(X2,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( 'empty:Tree' != X0 ) ) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(nnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
inference(ennf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) ) ),
inference(true_and_false_elimination,[],[f26]) ).
tff(f26,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty:Tree' != X0 )
=> ( ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(X5)) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> $lesseq(X4,'val:(Tree)>Int'(X5)) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_006) ).
tff(f78,plain,
! [X0: $int,X1: 'Tree'] :
( in(X0,'right:(Tree)>Tree'(X1))
| in(X0,'left:(Tree)>Tree'(X1))
| ( 'val:(Tree)>Int'(X1) = X0 )
| ( 'empty:Tree' = X1 )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tff(f1541,plain,
( spl7_7
| spl7_23
| spl7_6 ),
inference(avatar_split_clause,[],[f1367,f108,f1322,f114]) ).
tff(f108,plain,
( spl7_6
<=> $less(sK1,'val:(Tree)>Int'(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
tff(f1367,plain,
( $less('val:(Tree)>Int'(sK0),sK1)
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| spl7_6 ),
inference(resolution,[],[f111,f18]) ).
tff(f18,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_147,[]) ).
tff(f111,plain,
( ~ $less(sK1,'val:(Tree)>Int'(sK0))
| spl7_6 ),
inference(avatar_component_clause,[],[f108]) ).
tff(f1540,plain,
( spl7_2
| ~ spl7_13
| ~ spl7_18
| ~ spl7_23 ),
inference(avatar_contradiction_clause,[],[f1539]) ).
tff(f1539,plain,
( $false
| spl7_2
| ~ spl7_13
| ~ spl7_18
| ~ spl7_23 ),
inference(subsumption_resolution,[],[f1538,f143]) ).
tff(f1538,plain,
( ~ searchtree(sK0)
| spl7_2
| ~ spl7_18
| ~ spl7_23 ),
inference(subsumption_resolution,[],[f1537,f136]) ).
tff(f1537,plain,
( ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| ~ spl7_18
| ~ spl7_23 ),
inference(subsumption_resolution,[],[f1530,f1323]) ).
tff(f1323,plain,
( $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl7_23 ),
inference(avatar_component_clause,[],[f1322]) ).
tff(f1530,plain,
( ~ $less('val:(Tree)>Int'(sK0),sK1)
| ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| ~ spl7_18 ),
inference(resolution,[],[f1471,f70]) ).
tff(f70,plain,
! [X0: 'Tree',X4: $int] :
( ~ in(X4,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X4)
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f52]) ).
tff(f1471,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_18 ),
inference(avatar_component_clause,[],[f185]) ).
tff(f1536,plain,
( ~ spl7_49
| ~ spl7_5
| ~ spl7_18 ),
inference(avatar_split_clause,[],[f1529,f185,f104,f1534]) ).
tff(f1534,plain,
( spl7_49
<=> ( 'right:(Tree)>Tree'(sK0) = 'left:(Tree)>Tree'(sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_49])]) ).
tff(f104,plain,
( spl7_5
<=> ! [X2: 'Tree'] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
tff(f1529,plain,
( ( 'right:(Tree)>Tree'(sK0) != 'left:(Tree)>Tree'(sK0) )
| ~ spl7_5
| ~ spl7_18 ),
inference(resolution,[],[f1471,f105]) ).
tff(f105,plain,
( ! [X2: 'Tree'] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 ) )
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f104]) ).
tff(f1520,plain,
( spl7_33
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1513,f1409,f1397]) ).
tff(f1397,plain,
( spl7_33
<=> ! [X0: $int] :
( in(X0,sK3)
| in(X0,sK2)
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_33])]) ).
tff(f1409,plain,
( spl7_35
<=> ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_35])]) ).
tff(f1513,plain,
( ! [X3: $int] :
( ~ in(X3,sK0)
| in(X3,sK3)
| in(X3,sK2)
| ( 'val:(Tree)>Int'(sK0) = X3 ) )
| ~ spl7_35 ),
inference(superposition,[],[f277,f1410]) ).
tff(f1410,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,sK2) )
| ~ spl7_35 ),
inference(avatar_component_clause,[],[f1409]) ).
tff(f277,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| in(X3,X1)
| in(X3,X2)
| ( X0 = X3 ) ),
inference(forward_demodulation,[],[f276,f86]) ).
tff(f86,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X0 ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X0 ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X1,X2,X3)) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_001) ).
tff(f276,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( in(X3,X1)
| in(X3,X2)
| ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X3 )
| ~ in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(forward_demodulation,[],[f275,f84]) ).
tff(f84,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X1 ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X1 ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X1,X2,X3)) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_002) ).
tff(f275,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( in(X3,X2)
| in(X3,'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)))
| ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X3 )
| ~ in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(subsumption_resolution,[],[f266,f83]) ).
tff(f83,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'empty:Tree' != 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'empty:Tree' != 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'empty:Tree' != 'node:(Int*Tree*Tree)>Tree'(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_004) ).
tff(f266,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( in(X3,X2)
| in(X3,'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)))
| ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X3 )
| ( 'empty:Tree' = 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) )
| ~ in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(superposition,[],[f78,f85]) ).
tff(f85,plain,
! [X2: 'Tree',X0: $int,X1: 'Tree'] : ( 'right:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X2 ),
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: 'Tree',X2: 'Tree'] : ( 'right:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = X2 ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X1: $int,X2: 'Tree',X3: 'Tree'] : ( 'right:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X1,X2,X3)) = X3 ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_003) ).
tff(f1519,plain,
( spl7_25
| ~ spl7_13
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1518,f1409,f142,f1340]) ).
tff(f1340,plain,
( spl7_25
<=> ! [X1: $int] :
( ~ in(X1,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_25])]) ).
tff(f1518,plain,
( ! [X2: $int] :
( ~ in(X2,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X2) )
| ~ spl7_13
| ~ spl7_35 ),
inference(subsumption_resolution,[],[f1512,f143]) ).
tff(f1512,plain,
( ! [X2: $int] :
( ~ searchtree(sK0)
| ~ in(X2,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X2) )
| ~ spl7_35 ),
inference(superposition,[],[f259,f1410]) ).
tff(f259,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X1)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ~ $less(X0,X3) ),
inference(forward_demodulation,[],[f258,f86]) ).
tff(f258,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X1)
| ~ $less('val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)),X3)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(subsumption_resolution,[],[f257,f83]) ).
tff(f257,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X1)
| ~ $less('val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)),X3)
| ( 'empty:Tree' = 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) )
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(superposition,[],[f70,f84]) ).
tff(f1517,plain,
( spl7_36
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1511,f1409,f1414]) ).
tff(f1414,plain,
( spl7_36
<=> ! [X2: $int] :
( ~ in(X2,sK2)
| in(X2,sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_36])]) ).
tff(f1511,plain,
( ! [X1: $int] :
( in(X1,sK0)
| ~ in(X1,sK2) )
| ~ spl7_35 ),
inference(superposition,[],[f226,f1410]) ).
tff(f226,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ~ in(X3,X2) ),
inference(subsumption_resolution,[],[f225,f83]) ).
tff(f225,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X2)
| in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ( 'empty:Tree' = 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) ) ),
inference(superposition,[],[f82,f85]) ).
tff(f82,plain,
! [X0: $int,X1: 'Tree'] :
( ~ in(X0,'right:(Tree)>Tree'(X1))
| in(X0,X1)
| ( 'empty:Tree' = X1 ) ),
inference(cnf_transformation,[],[f54]) ).
tff(f1516,plain,
( spl7_27
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1510,f1409,f1350]) ).
tff(f1350,plain,
( spl7_27
<=> ! [X2: $int] :
( ~ in(X2,sK3)
| in(X2,sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_27])]) ).
tff(f1510,plain,
( ! [X0: $int] :
( in(X0,sK0)
| ~ in(X0,sK3) )
| ~ spl7_35 ),
inference(superposition,[],[f224,f1410]) ).
tff(f224,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ~ in(X3,X1) ),
inference(subsumption_resolution,[],[f223,f83]) ).
tff(f223,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X1)
| in(X3,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| ( 'empty:Tree' = 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) ) ),
inference(superposition,[],[f81,f84]) ).
tff(f81,plain,
! [X0: $int,X1: 'Tree'] :
( ~ in(X0,'left:(Tree)>Tree'(X1))
| in(X0,X1)
| ( 'empty:Tree' = X1 ) ),
inference(cnf_transformation,[],[f54]) ).
tff(f1515,plain,
( spl7_9
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1509,f1409,f124]) ).
tff(f124,plain,
( spl7_9
<=> ( 'right:(Tree)>Tree'(sK0) = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_9])]) ).
tff(f1509,plain,
( ( 'right:(Tree)>Tree'(sK0) = sK2 )
| ~ spl7_35 ),
inference(superposition,[],[f85,f1410]) ).
tff(f1514,plain,
( spl7_11
| ~ spl7_35 ),
inference(avatar_split_clause,[],[f1508,f1409,f132]) ).
tff(f132,plain,
( spl7_11
<=> ( 'left:(Tree)>Tree'(sK0) = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_11])]) ).
tff(f1508,plain,
( ( 'left:(Tree)>Tree'(sK0) = sK3 )
| ~ spl7_35 ),
inference(superposition,[],[f84,f1410]) ).
tff(f1506,plain,
( ~ spl7_48
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1482,f1375,f1504]) ).
tff(f1504,plain,
( spl7_48
<=> $less(sK1,$sum(-1,'val:(Tree)>Int'(sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_48])]) ).
tff(f1375,plain,
( spl7_30
<=> ! [X2: $int] :
( ~ $less(X2,'val:(Tree)>Int'(sK0))
| ~ $less(sK1,X2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_30])]) ).
tff(f1482,plain,
( ~ $less(sK1,$sum(-1,'val:(Tree)>Int'(sK0)))
| ~ spl7_30 ),
inference(resolution,[],[f1376,f354]) ).
tff(f354,plain,
! [X13: $int] : $less($sum(-1,X13),X13),
inference(evaluation,[],[f350]) ).
tff(f350,plain,
! [X13: $int] : $less($sum($uminus(1),X13),X13),
inference(superposition,[],[f279,f244]) ).
tff(f244,plain,
! [X2: $int,X3: $int] : ( $sum(X2,$sum($uminus(X2),X3)) = X3 ),
inference(evaluation,[],[f228]) ).
tff(f228,plain,
! [X2: $int,X3: $int] : ( $sum(X2,$sum($uminus(X2),X3)) = $sum(0,X3) ),
inference(superposition,[],[f12,f15]) ).
tff(f15,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_143,[]) ).
tff(f12,plain,
! [X2: $int,X0: $int,X1: $int] : ( $sum(X0,$sum(X1,X2)) = $sum($sum(X0,X1),X2) ),
introduced(theory_axiom_139,[]) ).
tff(f279,plain,
! [X0: $int] : $less(X0,$sum(1,X0)),
inference(superposition,[],[f156,f11]) ).
tff(f11,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_138,[]) ).
tff(f156,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f20,f16]) ).
tff(f16,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_145,[]) ).
tff(f20,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,$sum(X0,1)) ),
introduced(theory_axiom_150,[]) ).
tff(f1376,plain,
( ! [X2: $int] :
( ~ $less(X2,'val:(Tree)>Int'(sK0))
| ~ $less(sK1,X2) )
| ~ spl7_30 ),
inference(avatar_component_clause,[],[f1375]) ).
tff(f1502,plain,
( spl7_47
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1481,f1375,f1500]) ).
tff(f1500,plain,
( spl7_47
<=> ! [X7: $int] :
( ~ $less(sK1,$sum(X7,1))
| ( 'val:(Tree)>Int'(sK0) = $sum(X7,1) )
| ~ $less(X7,'val:(Tree)>Int'(sK0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_47])]) ).
tff(f1481,plain,
( ! [X7: $int] :
( ~ $less(sK1,$sum(X7,1))
| ( 'val:(Tree)>Int'(sK0) = $sum(X7,1) )
| ~ $less(X7,'val:(Tree)>Int'(sK0)) )
| ~ spl7_30 ),
inference(resolution,[],[f1376,f193]) ).
tff(f193,plain,
! [X2: $int,X1: $int] :
( $less($sum(X1,1),X2)
| ( $sum(X1,1) = X2 )
| ~ $less(X1,X2) ),
inference(resolution,[],[f18,f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_164,[]) ).
tff(f1498,plain,
( spl7_46
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1480,f1375,f1496]) ).
tff(f1496,plain,
( spl7_46
<=> ! [X6: $int] :
( ~ $less(sK1,X6)
| $less('val:(Tree)>Int'(sK0),$sum(X6,1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_46])]) ).
tff(f1480,plain,
( ! [X6: $int] :
( ~ $less(sK1,X6)
| $less('val:(Tree)>Int'(sK0),$sum(X6,1)) )
| ~ spl7_30 ),
inference(resolution,[],[f1376,f20]) ).
tff(f1494,plain,
( spl7_45
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1479,f1375,f1492]) ).
tff(f1492,plain,
( spl7_45
<=> ! [X4: $int,X5: $int] :
( ~ $less(sK1,X4)
| ~ $less(X5,'val:(Tree)>Int'(sK0))
| ~ $less(X4,X5) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_45])]) ).
tff(f1479,plain,
( ! [X4: $int,X5: $int] :
( ~ $less(sK1,X4)
| ~ $less(X5,'val:(Tree)>Int'(sK0))
| ~ $less(X4,X5) )
| ~ spl7_30 ),
inference(resolution,[],[f1376,f17]) ).
tff(f17,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_146,[]) ).
tff(f1490,plain,
( spl7_44
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1478,f1375,f1488]) ).
tff(f1488,plain,
( spl7_44
<=> ! [X3: $int] :
( ~ $less(sK1,X3)
| $less('val:(Tree)>Int'(sK0),X3)
| ( 'val:(Tree)>Int'(sK0) = X3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_44])]) ).
tff(f1478,plain,
( ! [X3: $int] :
( ~ $less(sK1,X3)
| $less('val:(Tree)>Int'(sK0),X3)
| ( 'val:(Tree)>Int'(sK0) = X3 ) )
| ~ spl7_30 ),
inference(resolution,[],[f1376,f18]) ).
tff(f1486,plain,
( spl7_43
| ~ spl7_30 ),
inference(avatar_split_clause,[],[f1477,f1375,f1484]) ).
tff(f1484,plain,
( spl7_43
<=> ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( ~ $less(sK1,X0)
| ~ in('val:(Tree)>Int'(sK0),X1)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X2,X1)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_43])]) ).
tff(f1477,plain,
( ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( ~ $less(sK1,X0)
| ~ in('val:(Tree)>Int'(sK0),X1)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X2,X1)) )
| ~ spl7_30 ),
inference(resolution,[],[f1376,f262]) ).
tff(f262,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( $less(X0,X3)
| ~ in(X3,X2)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(forward_demodulation,[],[f261,f86]) ).
tff(f261,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X2)
| $less('val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)),X3)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(subsumption_resolution,[],[f260,f83]) ).
tff(f260,plain,
! [X2: 'Tree',X3: $int,X0: $int,X1: 'Tree'] :
( ~ in(X3,X2)
| $less('val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)),X3)
| ( 'empty:Tree' = 'node:(Int*Tree*Tree)>Tree'(X0,X1,X2) )
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ),
inference(superposition,[],[f71,f85]) ).
tff(f1476,plain,
( spl7_18
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1475,f272,f114,f99,f185]) ).
tff(f272,plain,
( spl7_19
<=> ! [X4: 'Tree'] :
( in(sK1,'left:(Tree)>Tree'(X4))
| ( sK1 = 'val:(Tree)>Int'(X4) )
| ~ in(sK1,X4)
| ( 'right:(Tree)>Tree'(sK0) != 'right:(Tree)>Tree'(X4) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_19])]) ).
tff(f1475,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1304,f121]) ).
tff(f121,plain,
( in(sK1,sK0)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f99]) ).
tff(f1304,plain,
( ~ in(sK1,sK0)
| in(sK1,'left:(Tree)>Tree'(sK0))
| spl7_7
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1297,f115]) ).
tff(f115,plain,
( ( sK1 != 'val:(Tree)>Int'(sK0) )
| spl7_7 ),
inference(avatar_component_clause,[],[f114]) ).
tff(f1297,plain,
( ( sK1 = 'val:(Tree)>Int'(sK0) )
| ~ in(sK1,sK0)
| in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_19 ),
inference(equality_resolution,[],[f273]) ).
tff(f273,plain,
( ! [X4: 'Tree'] :
( ( 'right:(Tree)>Tree'(sK0) != 'right:(Tree)>Tree'(X4) )
| ( sK1 = 'val:(Tree)>Int'(X4) )
| ~ in(sK1,X4)
| in(sK1,'left:(Tree)>Tree'(X4)) )
| ~ spl7_19 ),
inference(avatar_component_clause,[],[f272]) ).
tff(f1474,plain,
( spl7_18
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1473,f272,f114,f99,f185]) ).
tff(f1473,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1443,f121]) ).
tff(f1443,plain,
( ~ in(sK1,sK0)
| in(sK1,'left:(Tree)>Tree'(sK0))
| spl7_7
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1297,f115]) ).
tff(f1472,plain,
( spl7_18
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1305,f272,f114,f99,f185]) ).
tff(f1305,plain,
( in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_4
| spl7_7
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1304,f121]) ).
tff(f1470,plain,
( ~ spl7_10
| ~ spl7_23
| ~ spl7_25 ),
inference(avatar_contradiction_clause,[],[f1469]) ).
tff(f1469,plain,
( $false
| ~ spl7_10
| ~ spl7_23
| ~ spl7_25 ),
inference(subsumption_resolution,[],[f1461,f1323]) ).
tff(f1461,plain,
( ~ $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl7_10
| ~ spl7_25 ),
inference(resolution,[],[f1341,f129]) ).
tff(f129,plain,
( in(sK1,sK3)
| ~ spl7_10 ),
inference(avatar_component_clause,[],[f128]) ).
tff(f128,plain,
( spl7_10
<=> in(sK1,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_10])]) ).
tff(f1341,plain,
( ! [X1: $int] :
( ~ in(X1,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X1) )
| ~ spl7_25 ),
inference(avatar_component_clause,[],[f1340]) ).
tff(f1468,plain,
( spl7_41
| ~ spl7_42
| ~ spl7_25 ),
inference(avatar_split_clause,[],[f1460,f1340,f1466,f1463]) ).
tff(f1463,plain,
( spl7_41
<=> ( 'empty:Tree' = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_41])]) ).
tff(f1466,plain,
( spl7_42
<=> $less('val:(Tree)>Int'(sK0),'val:(Tree)>Int'(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_42])]) ).
tff(f1460,plain,
( ~ $less('val:(Tree)>Int'(sK0),'val:(Tree)>Int'(sK3))
| ( 'empty:Tree' = sK3 )
| ~ spl7_25 ),
inference(resolution,[],[f1341,f221]) ).
tff(f1459,plain,
( spl7_40
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f1451,f104,f1457]) ).
tff(f1457,plain,
( spl7_40
<=> ! [X0: 'Tree'] :
( ( 'left:(Tree)>Tree'(X0) != 'right:(Tree)>Tree'(sK0) )
| ( 'val:(Tree)>Int'(X0) = sK1 )
| ~ in(sK1,X0)
| $less('val:(Tree)>Int'(X0),sK1)
| ~ searchtree(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_40])]) ).
tff(f1451,plain,
( ! [X0: 'Tree'] :
( ( 'left:(Tree)>Tree'(X0) != 'right:(Tree)>Tree'(sK0) )
| ( 'val:(Tree)>Int'(X0) = sK1 )
| ~ in(sK1,X0)
| $less('val:(Tree)>Int'(X0),sK1)
| ~ searchtree(X0) )
| ~ spl7_5 ),
inference(resolution,[],[f105,f269]) ).
tff(f1445,plain,
( ~ spl7_4
| spl7_10
| spl7_7
| ~ spl7_11
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1444,f272,f132,f114,f128,f99]) ).
tff(f1444,plain,
( in(sK1,sK3)
| ~ in(sK1,sK0)
| spl7_7
| ~ spl7_11
| ~ spl7_19 ),
inference(forward_demodulation,[],[f1443,f133]) ).
tff(f133,plain,
( ( 'left:(Tree)>Tree'(sK0) = sK3 )
| ~ spl7_11 ),
inference(avatar_component_clause,[],[f132]) ).
tff(f1442,plain,
( ~ spl7_4
| spl7_10
| spl7_7
| ~ spl7_11
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1441,f272,f132,f114,f128,f99]) ).
tff(f1441,plain,
( in(sK1,sK3)
| ~ in(sK1,sK0)
| spl7_7
| ~ spl7_11
| ~ spl7_19 ),
inference(forward_demodulation,[],[f1304,f133]) ).
tff(f1440,plain,
( spl7_4
| ~ spl7_8
| ~ spl7_36 ),
inference(avatar_contradiction_clause,[],[f1439]) ).
tff(f1439,plain,
( $false
| spl7_4
| ~ spl7_8
| ~ spl7_36 ),
inference(subsumption_resolution,[],[f1434,f120]) ).
tff(f120,plain,
( in(sK1,sK2)
| ~ spl7_8 ),
inference(avatar_component_clause,[],[f119]) ).
tff(f119,plain,
( spl7_8
<=> in(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
tff(f1434,plain,
( ~ in(sK1,sK2)
| spl7_4
| ~ spl7_36 ),
inference(resolution,[],[f1415,f100]) ).
tff(f1415,plain,
( ! [X2: $int] :
( in(X2,sK0)
| ~ in(X2,sK2) )
| ~ spl7_36 ),
inference(avatar_component_clause,[],[f1414]) ).
tff(f1438,plain,
( spl7_39
| ~ spl7_36 ),
inference(avatar_split_clause,[],[f1433,f1414,f1436]) ).
tff(f1436,plain,
( spl7_39
<=> ! [X2: 'Tree',X0: $int,X1: $int] :
( ~ in(X0,sK2)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X1,sK0,X2))
| ~ $less(X1,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_39])]) ).
tff(f1433,plain,
( ! [X2: 'Tree',X0: $int,X1: $int] :
( ~ in(X0,sK2)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X1,sK0,X2))
| ~ $less(X1,X0) )
| ~ spl7_36 ),
inference(resolution,[],[f1415,f259]) ).
tff(f1432,plain,
( spl7_38
| ~ spl7_15 ),
inference(avatar_split_clause,[],[f1428,f160,f1430]) ).
tff(f1430,plain,
( spl7_38
<=> ! [X0: $int] :
( ~ $less(X0,$sum(1,'val:(Tree)>Int'(sK0)))
| ~ $less($sum(1,sK1),X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_38])]) ).
tff(f160,plain,
( spl7_15
<=> $less('val:(Tree)>Int'(sK0),$sum(1,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_15])]) ).
tff(f1428,plain,
( ! [X0: $int] :
( ~ $less(X0,$sum(1,'val:(Tree)>Int'(sK0)))
| ~ $less($sum(1,sK1),X0) )
| ~ spl7_15 ),
inference(forward_demodulation,[],[f1424,f11]) ).
tff(f1424,plain,
( ! [X0: $int] :
( ~ $less(X0,$sum('val:(Tree)>Int'(sK0),1))
| ~ $less($sum(1,sK1),X0) )
| ~ spl7_15 ),
inference(resolution,[],[f161,f191]) ).
tff(f191,plain,
! [X2: $int,X3: $int,X4: $int] :
( ~ $less(X2,$sum(X3,1))
| ~ $less(X4,X2)
| ~ $less(X3,X4) ),
inference(resolution,[],[f17,f22]) ).
tff(f161,plain,
( $less('val:(Tree)>Int'(sK0),$sum(1,sK1))
| ~ spl7_15 ),
inference(avatar_component_clause,[],[f160]) ).
tff(f1422,plain,
( spl7_37
| spl7_2
| ~ spl7_9
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f1418,f142,f124,f93,f1420]) ).
tff(f1420,plain,
( spl7_37
<=> searchtree(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_37])]) ).
tff(f1418,plain,
( searchtree(sK2)
| spl7_2
| ~ spl7_9
| ~ spl7_13 ),
inference(subsumption_resolution,[],[f1417,f143]) ).
tff(f1417,plain,
( searchtree(sK2)
| ~ searchtree(sK0)
| spl7_2
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1385,f136]) ).
tff(f1385,plain,
( searchtree(sK2)
| ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| ~ spl7_9 ),
inference(superposition,[],[f69,f125]) ).
tff(f125,plain,
( ( 'right:(Tree)>Tree'(sK0) = sK2 )
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f124]) ).
tff(f69,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f52]) ).
tff(f1416,plain,
( spl7_36
| spl7_2
| ~ spl7_9 ),
inference(avatar_split_clause,[],[f1412,f124,f93,f1414]) ).
tff(f1412,plain,
( ! [X2: $int] :
( ~ in(X2,sK2)
| in(X2,sK0) )
| spl7_2
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1384,f136]) ).
tff(f1384,plain,
( ! [X2: $int] :
( ~ in(X2,sK2)
| in(X2,sK0)
| ( 'empty:Tree' = sK0 ) )
| ~ spl7_9 ),
inference(superposition,[],[f82,f125]) ).
tff(f1411,plain,
( spl7_35
| spl7_2
| ~ spl7_9
| ~ spl7_11 ),
inference(avatar_split_clause,[],[f1407,f132,f124,f93,f1409]) ).
tff(f1407,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,sK2) )
| spl7_2
| ~ spl7_9
| ~ spl7_11 ),
inference(forward_demodulation,[],[f1406,f133]) ).
tff(f1406,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),'left:(Tree)>Tree'(sK0),sK2) )
| spl7_2
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1383,f136]) ).
tff(f1383,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),'left:(Tree)>Tree'(sK0),sK2) )
| ( 'empty:Tree' = sK0 )
| ~ spl7_9 ),
inference(superposition,[],[f67,f125]) ).
tff(f67,plain,
! [X0: 'Tree'] :
( ( 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(X0),'left:(Tree)>Tree'(X0),'right:(Tree)>Tree'(X0)) = X0 )
| ( 'empty:Tree' = X0 ) ),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
! [X0: 'Tree'] :
( ( 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(X0),'left:(Tree)>Tree'(X0),'right:(Tree)>Tree'(X0)) = X0 )
| ( 'empty:Tree' = X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula) ).
tff(f1405,plain,
( spl7_34
| spl7_2
| ~ spl7_9
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f1401,f142,f124,f93,f1403]) ).
tff(f1403,plain,
( spl7_34
<=> ! [X1: $int] :
( ~ in(X1,sK2)
| $less('val:(Tree)>Int'(sK0),X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_34])]) ).
tff(f1401,plain,
( ! [X1: $int] :
( ~ in(X1,sK2)
| $less('val:(Tree)>Int'(sK0),X1) )
| spl7_2
| ~ spl7_9
| ~ spl7_13 ),
inference(subsumption_resolution,[],[f1400,f143]) ).
tff(f1400,plain,
( ! [X1: $int] :
( ~ in(X1,sK2)
| $less('val:(Tree)>Int'(sK0),X1)
| ~ searchtree(sK0) )
| spl7_2
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1382,f136]) ).
tff(f1382,plain,
( ! [X1: $int] :
( ~ in(X1,sK2)
| $less('val:(Tree)>Int'(sK0),X1)
| ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0) )
| ~ spl7_9 ),
inference(superposition,[],[f71,f125]) ).
tff(f1399,plain,
( spl7_33
| spl7_2
| ~ spl7_9
| ~ spl7_11 ),
inference(avatar_split_clause,[],[f1395,f132,f124,f93,f1397]) ).
tff(f1395,plain,
( ! [X0: $int] :
( in(X0,sK3)
| in(X0,sK2)
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0) )
| spl7_2
| ~ spl7_9
| ~ spl7_11 ),
inference(forward_demodulation,[],[f1394,f133]) ).
tff(f1394,plain,
( ! [X0: $int] :
( in(X0,sK2)
| in(X0,'left:(Tree)>Tree'(sK0))
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0) )
| spl7_2
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f1381,f136]) ).
tff(f1381,plain,
( ! [X0: $int] :
( in(X0,sK2)
| in(X0,'left:(Tree)>Tree'(sK0))
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ( 'empty:Tree' = sK0 )
| ~ in(X0,sK0) )
| ~ spl7_9 ),
inference(superposition,[],[f78,f125]) ).
tff(f1393,plain,
( ~ spl7_32
| ~ spl7_9
| spl7_14 ),
inference(avatar_split_clause,[],[f1380,f149,f124,f1391]) ).
tff(f1391,plain,
( spl7_32
<=> ( sK0 = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_32])]) ).
tff(f149,plain,
( spl7_14
<=> ( sK0 = 'right:(Tree)>Tree'(sK0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_14])]) ).
tff(f1380,plain,
( ( sK0 != sK2 )
| ~ spl7_9
| spl7_14 ),
inference(superposition,[],[f150,f125]) ).
tff(f150,plain,
( ( sK0 != 'right:(Tree)>Tree'(sK0) )
| spl7_14 ),
inference(avatar_component_clause,[],[f149]) ).
tff(f1389,plain,
( ~ spl7_31
| ~ spl7_9
| spl7_16 ),
inference(avatar_split_clause,[],[f1379,f165,f124,f1387]) ).
tff(f1387,plain,
( spl7_31
<=> ( sK2 = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_31])]) ).
tff(f165,plain,
( spl7_16
<=> ( 'right:(Tree)>Tree'(sK0) = sK3 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_16])]) ).
tff(f1379,plain,
( ( sK2 != sK3 )
| ~ spl7_9
| spl7_16 ),
inference(superposition,[],[f166,f125]) ).
tff(f166,plain,
( ( 'right:(Tree)>Tree'(sK0) != sK3 )
| spl7_16 ),
inference(avatar_component_clause,[],[f165]) ).
tff(f1377,plain,
( spl7_30
| spl7_6 ),
inference(avatar_split_clause,[],[f1368,f108,f1375]) ).
tff(f1368,plain,
( ! [X2: $int] :
( ~ $less(X2,'val:(Tree)>Int'(sK0))
| ~ $less(sK1,X2) )
| spl7_6 ),
inference(resolution,[],[f111,f17]) ).
tff(f1373,plain,
( spl7_29
| spl7_6 ),
inference(avatar_split_clause,[],[f1366,f108,f1371]) ).
tff(f1371,plain,
( spl7_29
<=> ! [X0: 'Tree',X1: 'Tree'] :
( ~ in('val:(Tree)>Int'(sK0),X0)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(sK1,X1,X0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_29])]) ).
tff(f1366,plain,
( ! [X0: 'Tree',X1: 'Tree'] :
( ~ in('val:(Tree)>Int'(sK0),X0)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(sK1,X1,X0)) )
| spl7_6 ),
inference(resolution,[],[f111,f262]) ).
tff(f1364,plain,
( ~ spl7_10
| ~ spl7_11
| spl7_18 ),
inference(avatar_split_clause,[],[f1363,f185,f132,f128]) ).
tff(f1363,plain,
( ~ in(sK1,sK3)
| ~ spl7_11
| spl7_18 ),
inference(forward_demodulation,[],[f186,f133]) ).
tff(f1362,plain,
( ~ spl7_10
| spl7_4
| ~ spl7_27 ),
inference(avatar_split_clause,[],[f1354,f1350,f99,f128]) ).
tff(f1354,plain,
( ~ in(sK1,sK3)
| spl7_4
| ~ spl7_27 ),
inference(resolution,[],[f1351,f100]) ).
tff(f1351,plain,
( ! [X2: $int] :
( in(X2,sK0)
| ~ in(X2,sK3) )
| ~ spl7_27 ),
inference(avatar_component_clause,[],[f1350]) ).
tff(f1360,plain,
( spl7_4
| ~ spl7_10
| ~ spl7_27 ),
inference(avatar_contradiction_clause,[],[f1359]) ).
tff(f1359,plain,
( $false
| spl7_4
| ~ spl7_10
| ~ spl7_27 ),
inference(subsumption_resolution,[],[f1354,f129]) ).
tff(f1358,plain,
( spl7_28
| ~ spl7_27 ),
inference(avatar_split_clause,[],[f1353,f1350,f1356]) ).
tff(f1356,plain,
( spl7_28
<=> ! [X2: 'Tree',X0: $int,X1: $int] :
( ~ in(X0,sK3)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X1,sK0,X2))
| ~ $less(X1,X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_28])]) ).
tff(f1353,plain,
( ! [X2: 'Tree',X0: $int,X1: $int] :
( ~ in(X0,sK3)
| ~ searchtree('node:(Int*Tree*Tree)>Tree'(X1,sK0,X2))
| ~ $less(X1,X0) )
| ~ spl7_27 ),
inference(resolution,[],[f1351,f259]) ).
tff(f1352,plain,
( spl7_27
| spl7_2
| ~ spl7_11 ),
inference(avatar_split_clause,[],[f1348,f132,f93,f1350]) ).
tff(f1348,plain,
( ! [X2: $int] :
( ~ in(X2,sK3)
| in(X2,sK0) )
| spl7_2
| ~ spl7_11 ),
inference(subsumption_resolution,[],[f1330,f136]) ).
tff(f1330,plain,
( ! [X2: $int] :
( ~ in(X2,sK3)
| in(X2,sK0)
| ( 'empty:Tree' = sK0 ) )
| ~ spl7_11 ),
inference(superposition,[],[f81,f133]) ).
tff(f1347,plain,
( spl7_26
| spl7_2
| ~ spl7_11 ),
inference(avatar_split_clause,[],[f1343,f132,f93,f1345]) ).
tff(f1345,plain,
( spl7_26
<=> ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,'right:(Tree)>Tree'(sK0)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_26])]) ).
tff(f1343,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,'right:(Tree)>Tree'(sK0)) )
| spl7_2
| ~ spl7_11 ),
inference(subsumption_resolution,[],[f1329,f136]) ).
tff(f1329,plain,
( ( sK0 = 'node:(Int*Tree*Tree)>Tree'('val:(Tree)>Int'(sK0),sK3,'right:(Tree)>Tree'(sK0)) )
| ( 'empty:Tree' = sK0 )
| ~ spl7_11 ),
inference(superposition,[],[f67,f133]) ).
tff(f1342,plain,
( spl7_25
| spl7_2
| ~ spl7_11
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f1338,f142,f132,f93,f1340]) ).
tff(f1338,plain,
( ! [X1: $int] :
( ~ in(X1,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X1) )
| spl7_2
| ~ spl7_11
| ~ spl7_13 ),
inference(subsumption_resolution,[],[f1337,f143]) ).
tff(f1337,plain,
( ! [X1: $int] :
( ~ in(X1,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X1)
| ~ searchtree(sK0) )
| spl7_2
| ~ spl7_11 ),
inference(subsumption_resolution,[],[f1328,f136]) ).
tff(f1328,plain,
( ! [X1: $int] :
( ~ in(X1,sK3)
| ~ $less('val:(Tree)>Int'(sK0),X1)
| ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0) )
| ~ spl7_11 ),
inference(superposition,[],[f70,f133]) ).
tff(f1336,plain,
( spl7_24
| ~ spl7_11
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f1332,f142,f132,f1334]) ).
tff(f1334,plain,
( spl7_24
<=> ! [X0: $int] :
( in(X0,sK3)
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0)
| $less('val:(Tree)>Int'(sK0),X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_24])]) ).
tff(f1332,plain,
( ! [X0: $int] :
( in(X0,sK3)
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0)
| $less('val:(Tree)>Int'(sK0),X0) )
| ~ spl7_11
| ~ spl7_13 ),
inference(subsumption_resolution,[],[f1327,f143]) ).
tff(f1327,plain,
( ! [X0: $int] :
( in(X0,sK3)
| ( 'val:(Tree)>Int'(sK0) = X0 )
| ~ in(X0,sK0)
| $less('val:(Tree)>Int'(sK0),X0)
| ~ searchtree(sK0) )
| ~ spl7_11 ),
inference(superposition,[],[f269,f133]) ).
tff(f1324,plain,
( spl7_23
| ~ spl7_4
| spl7_7
| ~ spl7_13
| spl7_18 ),
inference(avatar_split_clause,[],[f1320,f185,f142,f114,f99,f1322]) ).
tff(f1320,plain,
( $less('val:(Tree)>Int'(sK0),sK1)
| ~ spl7_4
| spl7_7
| ~ spl7_13
| spl7_18 ),
inference(subsumption_resolution,[],[f1319,f143]) ).
tff(f1319,plain,
( $less('val:(Tree)>Int'(sK0),sK1)
| ~ searchtree(sK0)
| ~ spl7_4
| spl7_7
| spl7_18 ),
inference(subsumption_resolution,[],[f1318,f121]) ).
tff(f1318,plain,
( ~ in(sK1,sK0)
| $less('val:(Tree)>Int'(sK0),sK1)
| ~ searchtree(sK0)
| spl7_7
| spl7_18 ),
inference(subsumption_resolution,[],[f1315,f115]) ).
tff(f1307,plain,
( ~ spl7_4
| spl7_7
| spl7_18
| ~ spl7_19 ),
inference(avatar_contradiction_clause,[],[f1306]) ).
tff(f1306,plain,
( $false
| ~ spl7_4
| spl7_7
| spl7_18
| ~ spl7_19 ),
inference(subsumption_resolution,[],[f1305,f186]) ).
tff(f1303,plain,
( spl7_22
| ~ spl7_19 ),
inference(avatar_split_clause,[],[f1299,f272,f1301]) ).
tff(f1301,plain,
( spl7_22
<=> ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( in(sK1,X1)
| ( sK1 = X0 )
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ in(sK1,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_22])]) ).
tff(f1299,plain,
( ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( in(sK1,X1)
| ( sK1 = X0 )
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ in(sK1,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) )
| ~ spl7_19 ),
inference(forward_demodulation,[],[f1298,f84]) ).
tff(f1298,plain,
( ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( ( sK1 = X0 )
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ in(sK1,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| in(sK1,'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2))) )
| ~ spl7_19 ),
inference(forward_demodulation,[],[f1296,f86]) ).
tff(f1296,plain,
( ! [X2: 'Tree',X0: $int,X1: 'Tree'] :
( ( 'right:(Tree)>Tree'(sK0) != X2 )
| ( 'val:(Tree)>Int'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2)) = sK1 )
| ~ in(sK1,'node:(Int*Tree*Tree)>Tree'(X0,X1,X2))
| in(sK1,'left:(Tree)>Tree'('node:(Int*Tree*Tree)>Tree'(X0,X1,X2))) )
| ~ spl7_19 ),
inference(superposition,[],[f273,f85]) ).
tff(f391,plain,
( spl7_21
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f386,f104,f389]) ).
tff(f389,plain,
( spl7_21
<=> ! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ~ in(sK1,X0)
| ( 'right:(Tree)>Tree'(sK0) != 'node:(Int*Tree*Tree)>Tree'(X1,X2,X0) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_21])]) ).
tff(f386,plain,
( ! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ~ in(sK1,X0)
| ( 'right:(Tree)>Tree'(sK0) != 'node:(Int*Tree*Tree)>Tree'(X1,X2,X0) ) )
| ~ spl7_5 ),
inference(resolution,[],[f226,f105]) ).
tff(f385,plain,
( spl7_20
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f380,f104,f383]) ).
tff(f383,plain,
( spl7_20
<=> ! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ~ in(sK1,X0)
| ( 'right:(Tree)>Tree'(sK0) != 'node:(Int*Tree*Tree)>Tree'(X1,X0,X2) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_20])]) ).
tff(f380,plain,
( ! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ~ in(sK1,X0)
| ( 'right:(Tree)>Tree'(sK0) != 'node:(Int*Tree*Tree)>Tree'(X1,X0,X2) ) )
| ~ spl7_5 ),
inference(resolution,[],[f224,f105]) ).
tff(f274,plain,
( spl7_19
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f270,f104,f272]) ).
tff(f270,plain,
( ! [X4: 'Tree'] :
( in(sK1,'left:(Tree)>Tree'(X4))
| ( sK1 = 'val:(Tree)>Int'(X4) )
| ~ in(sK1,X4)
| ( 'right:(Tree)>Tree'(sK0) != 'right:(Tree)>Tree'(X4) ) )
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f265,f77]) ).
tff(f265,plain,
( ! [X4: 'Tree'] :
( in(sK1,'left:(Tree)>Tree'(X4))
| ( sK1 = 'val:(Tree)>Int'(X4) )
| ( 'empty:Tree' = X4 )
| ~ in(sK1,X4)
| ( 'right:(Tree)>Tree'(sK0) != 'right:(Tree)>Tree'(X4) ) )
| ~ spl7_5 ),
inference(resolution,[],[f78,f105]) ).
tff(f187,plain,
( ~ spl7_18
| ~ spl7_3 ),
inference(avatar_split_clause,[],[f183,f96,f185]) ).
tff(f96,plain,
( spl7_3
<=> ! [X3: 'Tree'] :
( ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
tff(f183,plain,
( ~ in(sK1,'left:(Tree)>Tree'(sK0))
| ~ spl7_3 ),
inference(equality_resolution,[],[f97]) ).
tff(f97,plain,
( ! [X3: 'Tree'] :
( ( 'left:(Tree)>Tree'(sK0) != X3 )
| ~ in(sK1,X3) )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f96]) ).
tff(f181,plain,
~ spl7_12,
inference(avatar_contradiction_clause,[],[f180]) ).
tff(f180,plain,
( $false
| ~ spl7_12 ),
inference(subsumption_resolution,[],[f139,f146]) ).
tff(f146,plain,
! [X0: $int] : ~ in(X0,'empty:Tree'),
inference(equality_resolution,[],[f77]) ).
tff(f139,plain,
( in(sK1,'empty:Tree')
| ~ spl7_12 ),
inference(avatar_component_clause,[],[f138]) ).
tff(f138,plain,
( spl7_12
<=> in(sK1,'empty:Tree') ),
introduced(avatar_definition,[new_symbols(naming,[spl7_12])]) ).
tff(f179,plain,
( spl7_17
| spl7_2
| ~ spl7_11
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f175,f142,f132,f93,f177]) ).
tff(f177,plain,
( spl7_17
<=> searchtree(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_17])]) ).
tff(f175,plain,
( searchtree(sK3)
| spl7_2
| ~ spl7_11
| ~ spl7_13 ),
inference(subsumption_resolution,[],[f174,f143]) ).
tff(f174,plain,
( searchtree(sK3)
| ~ searchtree(sK0)
| spl7_2
| ~ spl7_11 ),
inference(subsumption_resolution,[],[f172,f136]) ).
tff(f172,plain,
( searchtree(sK3)
| ( 'empty:Tree' = sK0 )
| ~ searchtree(sK0)
| ~ spl7_11 ),
inference(superposition,[],[f68,f133]) ).
tff(f68,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ),
inference(cnf_transformation,[],[f52]) ).
tff(f167,plain,
( ~ spl7_16
| ~ spl7_5
| ~ spl7_10 ),
inference(avatar_split_clause,[],[f163,f128,f104,f165]) ).
tff(f163,plain,
( ( 'right:(Tree)>Tree'(sK0) != sK3 )
| ~ spl7_5
| ~ spl7_10 ),
inference(resolution,[],[f129,f105]) ).
tff(f162,plain,
( spl7_15
| spl7_6 ),
inference(avatar_split_clause,[],[f158,f108,f160]) ).
tff(f158,plain,
( $less('val:(Tree)>Int'(sK0),$sum(1,sK1))
| spl7_6 ),
inference(forward_demodulation,[],[f157,f11]) ).
tff(f157,plain,
( $less('val:(Tree)>Int'(sK0),$sum(sK1,1))
| spl7_6 ),
inference(resolution,[],[f20,f111]) ).
tff(f151,plain,
( ~ spl7_14
| ~ spl7_4
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f147,f104,f99,f149]) ).
tff(f147,plain,
( ( sK0 != 'right:(Tree)>Tree'(sK0) )
| ~ spl7_4
| ~ spl7_5 ),
inference(resolution,[],[f105,f121]) ).
tff(f144,plain,
spl7_13,
inference(avatar_split_clause,[],[f55,f142]) ).
tff(f55,plain,
searchtree(sK0),
inference(cnf_transformation,[],[f46]) ).
tff(f46,plain,
( ( ~ in(sK1,sK0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 ) )
& ~ $less(sK1,'val:(Tree)>Int'(sK0)) )
| ( ! [X3: 'Tree'] :
( ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 ) )
& $less(sK1,'val:(Tree)>Int'(sK0)) ) )
& ( sK1 != 'val:(Tree)>Int'(sK0) )
& ( 'empty:Tree' != sK0 ) )
| ( 'empty:Tree' = sK0 ) )
& ( in(sK1,sK0)
| ( ( ( ( ( in(sK1,sK2)
& ( 'right:(Tree)>Tree'(sK0) = sK2 ) )
| $less(sK1,'val:(Tree)>Int'(sK0)) )
& ( ( in(sK1,sK3)
& ( 'left:(Tree)>Tree'(sK0) = sK3 ) )
| ~ $less(sK1,'val:(Tree)>Int'(sK0)) ) )
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) )
& ( 'empty:Tree' != sK0 ) ) )
& searchtree(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f42,f45,f44,f43]) ).
tff(f43,plain,
( ? [X0: 'Tree',X1: $int] :
( ( ~ in(X1,X0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(X1,X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ in(X1,X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 ) )
| ( 'empty:Tree' = X0 ) )
& ( in(X1,X0)
| ( ( ( ( ? [X4: 'Tree'] :
( in(X1,X4)
& ( 'right:(Tree)>Tree'(X0) = X4 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X5: 'Tree'] :
( in(X1,X5)
& ( 'left:(Tree)>Tree'(X0) = X5 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) ) )
& searchtree(X0) )
=> ( ( ~ in(sK1,sK0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 ) )
& ~ $less(sK1,'val:(Tree)>Int'(sK0)) )
| ( ! [X3: 'Tree'] :
( ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 ) )
& $less(sK1,'val:(Tree)>Int'(sK0)) ) )
& ( sK1 != 'val:(Tree)>Int'(sK0) )
& ( 'empty:Tree' != sK0 ) )
| ( 'empty:Tree' = sK0 ) )
& ( in(sK1,sK0)
| ( ( ( ( ? [X4: 'Tree'] :
( in(sK1,X4)
& ( 'right:(Tree)>Tree'(sK0) = X4 ) )
| $less(sK1,'val:(Tree)>Int'(sK0)) )
& ( ? [X5: 'Tree'] :
( in(sK1,X5)
& ( 'left:(Tree)>Tree'(sK0) = X5 ) )
| ~ $less(sK1,'val:(Tree)>Int'(sK0)) ) )
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) )
& ( 'empty:Tree' != sK0 ) ) )
& searchtree(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f44,plain,
( ? [X4: 'Tree'] :
( in(sK1,X4)
& ( 'right:(Tree)>Tree'(sK0) = X4 ) )
=> ( in(sK1,sK2)
& ( 'right:(Tree)>Tree'(sK0) = sK2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f45,plain,
( ? [X5: 'Tree'] :
( in(sK1,X5)
& ( 'left:(Tree)>Tree'(sK0) = X5 ) )
=> ( in(sK1,sK3)
& ( 'left:(Tree)>Tree'(sK0) = sK3 ) ) ),
introduced(choice_axiom,[]) ).
tff(f42,plain,
? [X0: 'Tree',X1: $int] :
( ( ~ in(X1,X0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(X1,X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ in(X1,X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 ) )
| ( 'empty:Tree' = X0 ) )
& ( in(X1,X0)
| ( ( ( ( ? [X4: 'Tree'] :
( in(X1,X4)
& ( 'right:(Tree)>Tree'(X0) = X4 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X5: 'Tree'] :
( in(X1,X5)
& ( 'left:(Tree)>Tree'(X0) = X5 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) ) )
& searchtree(X0) ),
inference(rectify,[],[f41]) ).
tff(f41,plain,
? [X0: 'Tree',X1: $int] :
( ( ~ in(X1,X0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(X1,X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ in(X1,X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 ) )
| ( 'empty:Tree' = X0 ) )
& ( in(X1,X0)
| ( ( ( ( ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) ) )
& searchtree(X0) ),
inference(flattening,[],[f40]) ).
tff(f40,plain,
? [X0: 'Tree',X1: $int] :
( ( ~ in(X1,X0)
| ( ( ( ! [X2: 'Tree'] :
( ~ in(X1,X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ in(X1,X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 ) )
| ( 'empty:Tree' = X0 ) )
& ( in(X1,X0)
| ( ( ( ( ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) ) )
& searchtree(X0) ),
inference(nnf_transformation,[],[f36]) ).
tff(f36,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ( ( ( ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) )
<~> in(X1,X0) )
& searchtree(X0) ),
inference(flattening,[],[f35]) ).
tff(f35,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ( ( ( ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) )
| $less(X1,'val:(Tree)>Int'(X0)) )
& ( ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) )
| ~ $less(X1,'val:(Tree)>Int'(X0)) ) )
| ( 'val:(Tree)>Int'(X0) = X1 )
| ( 'empty:Tree' = X0 ) )
& ( 'empty:Tree' != X0 ) )
<~> in(X1,X0) )
& searchtree(X0) ),
inference(ennf_transformation,[],[f25]) ).
tff(f25,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( ( 'empty:Tree' != X0 )
=> ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) ) )
& ( 'empty:Tree' != X0 ) )
<=> in(X1,X0) ) ),
inference(flattening,[],[f24]) ).
tff(f24,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( ( 'empty:Tree' != X0 )
=> ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) ) )
& ( ~ 'empty:Tree' = X0 ) )
<=> in(X1,X0) ) ),
inference(true_and_false_elimination,[],[f23]) ).
tff(f23,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( ( 'empty:Tree' != X0 )
=> ( ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( in(X1,X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( in(X1,X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $false ) )
<=> in(X1,X0) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( in(X4,X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( in(X4,X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) )
<=> in(X4,X5) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( in(X4,X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( in(X4,X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $false ) )
<=> in(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.zK8o7MEljo/Vampire---4.8_15905',formula_007) ).
tff(f140,plain,
( ~ spl7_2
| spl7_12 ),
inference(avatar_split_clause,[],[f135,f138,f93]) ).
tff(f135,plain,
( in(sK1,'empty:Tree')
| ( 'empty:Tree' != sK0 ) ),
inference(inner_rewriting,[],[f56]) ).
tff(f56,plain,
( in(sK1,sK0)
| ( 'empty:Tree' != sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f134,plain,
( spl7_2
| spl7_7
| ~ spl7_6
| spl7_11
| spl7_4 ),
inference(avatar_split_clause,[],[f57,f99,f132,f108,f114,f93]) ).
tff(f57,plain,
( in(sK1,sK0)
| ( 'left:(Tree)>Tree'(sK0) = sK3 )
| ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f130,plain,
( spl7_2
| spl7_7
| ~ spl7_6
| spl7_10
| spl7_4 ),
inference(avatar_split_clause,[],[f58,f99,f128,f108,f114,f93]) ).
tff(f58,plain,
( in(sK1,sK0)
| in(sK1,sK3)
| ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f126,plain,
( spl7_2
| spl7_7
| spl7_6
| spl7_9
| spl7_4 ),
inference(avatar_split_clause,[],[f59,f99,f124,f108,f114,f93]) ).
tff(f59,plain,
( in(sK1,sK0)
| ( 'right:(Tree)>Tree'(sK0) = sK2 )
| $less(sK1,'val:(Tree)>Int'(sK0))
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f122,plain,
( spl7_2
| spl7_7
| spl7_6
| spl7_8
| spl7_4 ),
inference(avatar_split_clause,[],[f60,f99,f119,f108,f114,f93]) ).
tff(f60,plain,
( in(sK1,sK0)
| in(sK1,sK2)
| $less(sK1,'val:(Tree)>Int'(sK0))
| ( sK1 = 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f116,plain,
( spl7_2
| ~ spl7_7
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f62,f99,f114,f93]) ).
tff(f62,plain,
( ~ in(sK1,sK0)
| ( sK1 != 'val:(Tree)>Int'(sK0) )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f112,plain,
( spl7_2
| spl7_3
| ~ spl7_6
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f64,f99,f108,f96,f93]) ).
tff(f64,plain,
! [X3: 'Tree'] :
( ~ in(sK1,sK0)
| ~ $less(sK1,'val:(Tree)>Int'(sK0))
| ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f110,plain,
( spl7_2
| spl7_6
| spl7_5
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f65,f99,f104,f108,f93]) ).
tff(f65,plain,
! [X2: 'Tree'] :
( ~ in(sK1,sK0)
| ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| $less(sK1,'val:(Tree)>Int'(sK0))
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f106,plain,
( spl7_1
| spl7_5 ),
inference(avatar_split_clause,[],[f87,f104,f90]) ).
tff(f90,plain,
( spl7_1
<=> sP6 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
tff(f87,plain,
! [X2: 'Tree'] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| sP6 ),
inference(cnf_transformation,[],[f87_D]) ).
tff(f87_D,plain,
( ! [X2] :
( ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 ) )
<=> ~ sP6 ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP6])]) ).
tff(f101,plain,
( ~ spl7_1
| spl7_2
| spl7_3
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f88,f99,f96,f93,f90]) ).
tff(f88,plain,
! [X3: 'Tree'] :
( ~ in(sK1,sK0)
| ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 )
| ( 'empty:Tree' = sK0 )
| ~ sP6 ),
inference(general_splitting,[],[f66,f87_D]) ).
tff(f66,plain,
! [X2: 'Tree',X3: 'Tree'] :
( ~ in(sK1,sK0)
| ~ in(sK1,X2)
| ( 'right:(Tree)>Tree'(sK0) != X2 )
| ~ in(sK1,X3)
| ( 'left:(Tree)>Tree'(sK0) != X3 )
| ( 'empty:Tree' = sK0 ) ),
inference(cnf_transformation,[],[f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SWW678_1 : TPTP v8.1.2. Released v6.4.0.
% 0.12/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 30 16:57:57 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.18/0.42 % (16012)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.43 % (16013)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.18/0.43 % (16014)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.18/0.43 % (16016)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.18/0.43 % (16017)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on Vampire---4 for (531ds/0Mi)
% 0.18/0.43 % (16015)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on Vampire---4 for (569ds/0Mi)
% 0.18/0.43 % (16018)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on Vampire---4 for (522ds/0Mi)
% 0.18/0.43 % (16019)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on Vampire---4 for (497ds/0Mi)
% 0.18/0.43 % (16013)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/0.43 % (16013)Terminated due to inappropriate strategy.
% 0.18/0.43 % (16013)------------------------------
% 0.18/0.43 % (16013)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.18/0.43 % (16013)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.18/0.43 % (16013)Termination reason: Inappropriate
% 0.18/0.43
% 0.18/0.43 % (16013)Memory used [KB]: 895
% 0.18/0.43 % (16013)Time elapsed: 0.002 s
% 0.18/0.43 % (16013)------------------------------
% 0.18/0.43 % (16013)------------------------------
% 0.18/0.43 % (16014)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/0.43 % (16014)Terminated due to inappropriate strategy.
% 0.18/0.43 % (16014)------------------------------
% 0.18/0.43 % (16014)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.18/0.43 % (16014)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.18/0.43 % (16014)Termination reason: Inappropriate
% 0.18/0.43
% 0.18/0.43 % (16014)Memory used [KB]: 895
% 0.18/0.43 % (16014)Time elapsed: 0.002 s
% 0.18/0.43 % (16014)------------------------------
% 0.18/0.43 % (16014)------------------------------
% 0.18/0.43 % (16016)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/0.43 % (16016)Terminated due to inappropriate strategy.
% 0.18/0.43 % (16016)------------------------------
% 0.18/0.43 % (16016)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.18/0.43 % (16016)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.18/0.43 % (16016)Termination reason: Inappropriate
% 0.18/0.43
% 0.18/0.43 % (16016)Memory used [KB]: 895
% 0.18/0.43 % (16016)Time elapsed: 0.002 s
% 0.18/0.43 % (16016)------------------------------
% 0.18/0.43 % (16016)------------------------------
% 0.18/0.43 % (16020)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on Vampire---4 for (411ds/0Mi)
% 0.18/0.43 % (16021)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on Vampire---4 for (382ds/0Mi)
% 0.18/0.43 % (16020)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.18/0.43 % (16020)Terminated due to inappropriate strategy.
% 0.18/0.43 % (16020)------------------------------
% 0.18/0.43 % (16020)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.18/0.43 % (16020)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.18/0.43 % (16020)Termination reason: Inappropriate
% 0.18/0.43
% 0.18/0.43 % (16020)Memory used [KB]: 895
% 0.18/0.43 % (16020)Time elapsed: 0.002 s
% 0.18/0.43 % (16020)------------------------------
% 0.18/0.43 % (16020)------------------------------
% 0.18/0.43 % (16022)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on Vampire---4 for (367ds/0Mi)
% 0.18/0.45 % (16023)ott+4_64_acc=on:anc=none:bs=on:bsr=on:fsd=off:gs=on:gsem=off:irw=on:msp=off:nwc=2.5:nicw=on:sims=off_354 on Vampire---4 for (354ds/0Mi)
% 248.73/35.95 % (16023)Time limit reached!
% 248.73/35.95 % (16023)------------------------------
% 248.73/35.95 % (16023)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 248.73/35.95 % (16023)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 248.73/35.95 % (16023)Termination reason: Time limit
% 248.73/35.95 % (16023)Termination phase: Saturation
% 248.73/35.95
% 248.73/35.95 % (16023)Memory used [KB]: 203791
% 248.73/35.95 % (16023)Time elapsed: 35.500 s
% 248.73/35.95 % (16023)------------------------------
% 248.73/35.95 % (16023)------------------------------
% 248.86/35.98 % (16673)ott-11_10:1_aac=none:add=off:afr=on:amm=off:anc=all_dependent:bd=off:fsd=off:fde=none:gsp=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sas=z3:sp=occurrence_186 on Vampire---4 for (186ds/0Mi)
% 249.40/36.07 % (16673)First to succeed.
% 249.40/36.08 % (16673)Refutation found. Thanks to Tanya!
% 249.40/36.08 % SZS status Theorem for Vampire---4
% 249.40/36.08 % SZS output start Proof for Vampire---4
% See solution above
% 249.40/36.08 % (16673)------------------------------
% 249.40/36.08 % (16673)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 249.40/36.08 % (16673)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 249.40/36.08 % (16673)Termination reason: Refutation
% 249.40/36.08
% 249.40/36.08 % (16673)Memory used [KB]: 2174
% 249.40/36.08 % (16673)Time elapsed: 0.109 s
% 249.40/36.08 % (16673)------------------------------
% 249.40/36.08 % (16673)------------------------------
% 249.40/36.08 % (16012)Success in time 35.724 s
% 249.40/36.08 % Vampire---4.8 exiting
%------------------------------------------------------------------------------