TSTP Solution File: LCL541+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : LCL541+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n022.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 : Wed May 31 12:19:34 EDT 2023

% Result   : Theorem 5.21s 1.08s
% Output   : CNFRefutation 5.75s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL541+1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.06/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34  % Computer : n022.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue May 30 09:36:27 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % Drodi V3.5.1
% 5.21/1.08  % Refutation found
% 5.21/1.08  % SZS status Theorem for theBenchmark: Theorem is valid
% 5.21/1.08  % SZS output start CNFRefutation for theBenchmark
% 5.21/1.08  fof(f1,axiom,(
% 5.21/1.08    ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f2,axiom,(
% 5.21/1.08    ( substitution_of_equivalents<=> (! [X,Y] :( is_a_theorem(equiv(X,Y))=> X = Y ) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f3,axiom,(
% 5.21/1.08    ( modus_tollens<=> (! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f4,axiom,(
% 5.21/1.08    ( implies_1<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f5,axiom,(
% 5.21/1.08    ( implies_2<=> (! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f6,axiom,(
% 5.21/1.08    ( implies_3<=> (! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f7,axiom,(
% 5.21/1.08    ( and_1<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),X)) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f8,axiom,(
% 5.21/1.08    ( and_2<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),Y)) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f9,axiom,(
% 5.21/1.08    ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f10,axiom,(
% 5.21/1.08    ( or_1<=> (! [X,Y] : is_a_theorem(implies(X,or(X,Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f11,axiom,(
% 5.21/1.08    ( or_2<=> (! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f12,axiom,(
% 5.21/1.08    ( or_3<=> (! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f13,axiom,(
% 5.21/1.08    ( equivalence_1<=> (! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(X,Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f14,axiom,(
% 5.21/1.08    ( equivalence_2<=> (! [X,Y] : is_a_theorem(implies(equiv(X,Y),implies(Y,X))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f16,axiom,(
% 5.21/1.08    ( kn1<=> (! [P] : is_a_theorem(implies(P,and(P,P))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f17,axiom,(
% 5.21/1.08    ( kn2<=> (! [P,Q] : is_a_theorem(implies(and(P,Q),P)) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f19,axiom,(
% 5.21/1.08    ( cn1<=> (! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R)))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f20,axiom,(
% 5.21/1.08    ( cn2<=> (! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f21,axiom,(
% 5.21/1.08    ( cn3<=> (! [P] : is_a_theorem(implies(implies(not(P),P),P)) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f23,axiom,(
% 5.21/1.08    ( r2<=> (! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f27,axiom,(
% 5.21/1.08    ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f29,axiom,(
% 5.21/1.08    ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f31,axiom,(
% 5.21/1.08    ( op_equiv=> (! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) )) ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f32,axiom,(
% 5.21/1.08    op_or ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f33,axiom,(
% 5.21/1.08    op_implies_and ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f34,axiom,(
% 5.21/1.08    op_equiv ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.21/1.08  fof(f35,axiom,(
% 5.21/1.08    modus_ponens ),
% 5.21/1.08    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f36,axiom,(
% 5.75/1.10    modus_tollens ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f37,axiom,(
% 5.75/1.10    implies_1 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f38,axiom,(
% 5.75/1.10    implies_2 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f39,axiom,(
% 5.75/1.10    implies_3 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f40,axiom,(
% 5.75/1.10    and_1 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f41,axiom,(
% 5.75/1.10    and_2 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f42,axiom,(
% 5.75/1.10    and_3 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f43,axiom,(
% 5.75/1.10    or_1 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f44,axiom,(
% 5.75/1.10    or_2 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f45,axiom,(
% 5.75/1.10    or_3 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f46,axiom,(
% 5.75/1.10    equivalence_1 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f47,axiom,(
% 5.75/1.10    equivalence_2 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f48,axiom,(
% 5.75/1.10    equivalence_3 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f49,axiom,(
% 5.75/1.10    substitution_of_equivalents ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f50,axiom,(
% 5.75/1.10    ( necessitation<=> (! [X] :( is_a_theorem(X)=> is_a_theorem(necessarily(X)) ) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f52,axiom,(
% 5.75/1.10    ( adjunction<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(Y) )=> is_a_theorem(and(X,Y)) ) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f54,axiom,(
% 5.75/1.10    ( axiom_K<=> (! [X,Y] : is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y)))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f55,axiom,(
% 5.75/1.10    ( axiom_M<=> (! [X] : is_a_theorem(implies(necessarily(X),X)) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f56,axiom,(
% 5.75/1.10    ( axiom_4<=> (! [X] : is_a_theorem(implies(necessarily(X),necessarily(necessarily(X)))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f57,axiom,(
% 5.75/1.10    ( axiom_B<=> (! [X] : is_a_theorem(implies(X,necessarily(possibly(X)))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f59,axiom,(
% 5.75/1.10    ( axiom_s1<=> (! [X,Y,Z] : is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z)))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f62,axiom,(
% 5.75/1.10    ( axiom_s4<=> (! [X] : is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X)))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f63,axiom,(
% 5.75/1.10    ( axiom_m1<=> (! [X,Y] : is_a_theorem(strict_implies(and(X,Y),and(Y,X))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f64,axiom,(
% 5.75/1.10    ( axiom_m2<=> (! [X,Y] : is_a_theorem(strict_implies(and(X,Y),X)) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f66,axiom,(
% 5.75/1.10    ( axiom_m4<=> (! [X] : is_a_theorem(strict_implies(X,and(X,X))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f67,axiom,(
% 5.75/1.10    ( axiom_m5<=> (! [X,Y,Z] : is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f73,axiom,(
% 5.75/1.10    ( op_possibly=> (! [X] : possibly(X) = not(necessarily(not(X))) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f75,axiom,(
% 5.75/1.10    ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f76,axiom,(
% 5.75/1.10    ( op_strict_equiv=> (! [X,Y] : strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X)) )) ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f77,axiom,(
% 5.75/1.10    op_possibly ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f78,axiom,(
% 5.75/1.10    necessitation ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f80,axiom,(
% 5.75/1.10    axiom_M ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f81,axiom,(
% 5.75/1.10    axiom_4 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f82,axiom,(
% 5.75/1.10    axiom_B ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f86,axiom,(
% 5.75/1.10    op_strict_implies ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f88,axiom,(
% 5.75/1.10    op_strict_equiv ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f89,conjecture,(
% 5.75/1.10    axiom_m1 ),
% 5.75/1.10    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.75/1.10  fof(f90,negated_conjecture,(
% 5.75/1.10    ~(axiom_m1 )),
% 5.75/1.10    inference(negated_conjecture,[status(cth)],[f89])).
% 5.75/1.10  fof(f91,plain,(
% 5.75/1.10    modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f1])).
% 5.75/1.10  fof(f92,plain,(
% 5.75/1.10    (~modus_ponens|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y))))&(modus_ponens|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(implies(X,Y)))&~is_a_theorem(Y))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f91])).
% 5.75/1.10  fof(f93,plain,(
% 5.75/1.10    (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|(?[Y]: ((?[X]: (is_a_theorem(X)&is_a_theorem(implies(X,Y))))&~is_a_theorem(Y))))),
% 5.75/1.10    inference(miniscoping,[status(esa)],[f92])).
% 5.75/1.10  fof(f94,plain,(
% 5.75/1.10    (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|((is_a_theorem(sk0_1)&is_a_theorem(implies(sk0_1,sk0_0)))&~is_a_theorem(sk0_0)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f93])).
% 5.75/1.10  fof(f95,plain,(
% 5.75/1.10    ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f94])).
% 5.75/1.10  fof(f99,plain,(
% 5.75/1.10    substitution_of_equivalents<=>(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f2])).
% 5.75/1.10  fof(f100,plain,(
% 5.75/1.10    (~substitution_of_equivalents|(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y)))&(substitution_of_equivalents|(?[X,Y]: (is_a_theorem(equiv(X,Y))&~X=Y)))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f99])).
% 5.75/1.10  fof(f101,plain,(
% 5.75/1.10    (~substitution_of_equivalents|(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y)))&(substitution_of_equivalents|(is_a_theorem(equiv(sk0_2,sk0_3))&~sk0_2=sk0_3))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f100])).
% 5.75/1.10  fof(f102,plain,(
% 5.75/1.10    ![X0,X1]: (~substitution_of_equivalents|~is_a_theorem(equiv(X0,X1))|X0=X1)),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f101])).
% 5.75/1.10  fof(f105,plain,(
% 5.75/1.10    (~modus_tollens|(![X,Y]: is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))))&(modus_tollens|(?[X,Y]: ~is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f3])).
% 5.75/1.10  fof(f106,plain,(
% 5.75/1.10    (~modus_tollens|(![X,Y]: is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))))&(modus_tollens|~is_a_theorem(implies(implies(not(sk0_5),not(sk0_4)),implies(sk0_4,sk0_5))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f105])).
% 5.75/1.10  fof(f107,plain,(
% 5.75/1.10    ![X0,X1]: (~modus_tollens|is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f106])).
% 5.75/1.10  fof(f109,plain,(
% 5.75/1.10    (~implies_1|(![X,Y]: is_a_theorem(implies(X,implies(Y,X)))))&(implies_1|(?[X,Y]: ~is_a_theorem(implies(X,implies(Y,X)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f4])).
% 5.75/1.10  fof(f110,plain,(
% 5.75/1.10    (~implies_1|(![X,Y]: is_a_theorem(implies(X,implies(Y,X)))))&(implies_1|~is_a_theorem(implies(sk0_6,implies(sk0_7,sk0_6))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f109])).
% 5.75/1.10  fof(f111,plain,(
% 5.75/1.10    ![X0,X1]: (~implies_1|is_a_theorem(implies(X0,implies(X1,X0))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f110])).
% 5.75/1.10  fof(f113,plain,(
% 5.75/1.10    (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|(?[X,Y]: ~is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f5])).
% 5.75/1.10  fof(f114,plain,(
% 5.75/1.10    (~implies_2|(![X,Y]: is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))))&(implies_2|~is_a_theorem(implies(implies(sk0_8,implies(sk0_8,sk0_9)),implies(sk0_8,sk0_9))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f113])).
% 5.75/1.10  fof(f115,plain,(
% 5.75/1.10    ![X0,X1]: (~implies_2|is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f114])).
% 5.75/1.10  fof(f117,plain,(
% 5.75/1.10    (~implies_3|(![X,Y,Z]: is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))))&(implies_3|(?[X,Y,Z]: ~is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f6])).
% 5.75/1.10  fof(f118,plain,(
% 5.75/1.10    (~implies_3|(![X,Y,Z]: is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))))&(implies_3|~is_a_theorem(implies(implies(sk0_10,sk0_11),implies(implies(sk0_11,sk0_12),implies(sk0_10,sk0_12)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f117])).
% 5.75/1.10  fof(f119,plain,(
% 5.75/1.10    ![X0,X1,X2]: (~implies_3|is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f118])).
% 5.75/1.10  fof(f121,plain,(
% 5.75/1.10    (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|(?[X,Y]: ~is_a_theorem(implies(and(X,Y),X))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f7])).
% 5.75/1.10  fof(f122,plain,(
% 5.75/1.10    (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|~is_a_theorem(implies(and(sk0_13,sk0_14),sk0_13)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f121])).
% 5.75/1.10  fof(f123,plain,(
% 5.75/1.10    ![X0,X1]: (~and_1|is_a_theorem(implies(and(X0,X1),X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f122])).
% 5.75/1.10  fof(f125,plain,(
% 5.75/1.10    (~and_2|(![X,Y]: is_a_theorem(implies(and(X,Y),Y))))&(and_2|(?[X,Y]: ~is_a_theorem(implies(and(X,Y),Y))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f8])).
% 5.75/1.10  fof(f126,plain,(
% 5.75/1.10    (~and_2|(![X,Y]: is_a_theorem(implies(and(X,Y),Y))))&(and_2|~is_a_theorem(implies(and(sk0_15,sk0_16),sk0_16)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f125])).
% 5.75/1.10  fof(f127,plain,(
% 5.75/1.10    ![X0,X1]: (~and_2|is_a_theorem(implies(and(X0,X1),X1)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f126])).
% 5.75/1.10  fof(f129,plain,(
% 5.75/1.10    (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|(?[X,Y]: ~is_a_theorem(implies(X,implies(Y,and(X,Y))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f9])).
% 5.75/1.10  fof(f130,plain,(
% 5.75/1.10    (~and_3|(![X,Y]: is_a_theorem(implies(X,implies(Y,and(X,Y))))))&(and_3|~is_a_theorem(implies(sk0_17,implies(sk0_18,and(sk0_17,sk0_18)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f129])).
% 5.75/1.10  fof(f131,plain,(
% 5.75/1.10    ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f130])).
% 5.75/1.10  fof(f133,plain,(
% 5.75/1.10    (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|(?[X,Y]: ~is_a_theorem(implies(X,or(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f10])).
% 5.75/1.10  fof(f134,plain,(
% 5.75/1.10    (~or_1|(![X,Y]: is_a_theorem(implies(X,or(X,Y)))))&(or_1|~is_a_theorem(implies(sk0_19,or(sk0_19,sk0_20))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f133])).
% 5.75/1.10  fof(f135,plain,(
% 5.75/1.10    ![X0,X1]: (~or_1|is_a_theorem(implies(X0,or(X0,X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f134])).
% 5.75/1.10  fof(f137,plain,(
% 5.75/1.10    (~or_2|(![X,Y]: is_a_theorem(implies(Y,or(X,Y)))))&(or_2|(?[X,Y]: ~is_a_theorem(implies(Y,or(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f11])).
% 5.75/1.10  fof(f138,plain,(
% 5.75/1.10    (~or_2|(![X,Y]: is_a_theorem(implies(Y,or(X,Y)))))&(or_2|~is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f137])).
% 5.75/1.10  fof(f139,plain,(
% 5.75/1.10    ![X0,X1]: (~or_2|is_a_theorem(implies(X0,or(X1,X0))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f138])).
% 5.75/1.10  fof(f141,plain,(
% 5.75/1.10    (~or_3|(![X,Y,Z]: is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))))&(or_3|(?[X,Y,Z]: ~is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f12])).
% 5.75/1.10  fof(f142,plain,(
% 5.75/1.10    (~or_3|(![X,Y,Z]: is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))))&(or_3|~is_a_theorem(implies(implies(sk0_23,sk0_25),implies(implies(sk0_24,sk0_25),implies(or(sk0_23,sk0_24),sk0_25)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f141])).
% 5.75/1.10  fof(f143,plain,(
% 5.75/1.10    ![X0,X1,X2]: (~or_3|is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f142])).
% 5.75/1.10  fof(f145,plain,(
% 5.75/1.10    (~equivalence_1|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))&(equivalence_1|(?[X,Y]: ~is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f13])).
% 5.75/1.10  fof(f146,plain,(
% 5.75/1.10    (~equivalence_1|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(X,Y)))))&(equivalence_1|~is_a_theorem(implies(equiv(sk0_26,sk0_27),implies(sk0_26,sk0_27))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f145])).
% 5.75/1.10  fof(f147,plain,(
% 5.75/1.10    ![X0,X1]: (~equivalence_1|is_a_theorem(implies(equiv(X0,X1),implies(X0,X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f146])).
% 5.75/1.10  fof(f149,plain,(
% 5.75/1.10    (~equivalence_2|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(Y,X)))))&(equivalence_2|(?[X,Y]: ~is_a_theorem(implies(equiv(X,Y),implies(Y,X)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f14])).
% 5.75/1.10  fof(f150,plain,(
% 5.75/1.10    (~equivalence_2|(![X,Y]: is_a_theorem(implies(equiv(X,Y),implies(Y,X)))))&(equivalence_2|~is_a_theorem(implies(equiv(sk0_28,sk0_29),implies(sk0_29,sk0_28))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f149])).
% 5.75/1.10  fof(f151,plain,(
% 5.75/1.10    ![X0,X1]: (~equivalence_2|is_a_theorem(implies(equiv(X0,X1),implies(X1,X0))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f150])).
% 5.75/1.10  fof(f157,plain,(
% 5.75/1.10    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|(?[P]: ~is_a_theorem(implies(P,and(P,P)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f16])).
% 5.75/1.10  fof(f158,plain,(
% 5.75/1.10    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f157])).
% 5.75/1.10  fof(f160,plain,(
% 5.75/1.10    kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f158])).
% 5.75/1.10  fof(f161,plain,(
% 5.75/1.10    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|(?[P,Q]: ~is_a_theorem(implies(and(P,Q),P))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f17])).
% 5.75/1.10  fof(f162,plain,(
% 5.75/1.10    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|~is_a_theorem(implies(and(sk0_33,sk0_34),sk0_33)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f161])).
% 5.75/1.10  fof(f164,plain,(
% 5.75/1.10    kn2|~is_a_theorem(implies(and(sk0_33,sk0_34),sk0_33))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f162])).
% 5.75/1.10  fof(f169,plain,(
% 5.75/1.10    (~cn1|(![P,Q,R]: is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))))&(cn1|(?[P,Q,R]: ~is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f19])).
% 5.75/1.10  fof(f170,plain,(
% 5.75/1.10    (~cn1|(![P,Q,R]: is_a_theorem(implies(implies(P,Q),implies(implies(Q,R),implies(P,R))))))&(cn1|~is_a_theorem(implies(implies(sk0_38,sk0_39),implies(implies(sk0_39,sk0_40),implies(sk0_38,sk0_40)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f169])).
% 5.75/1.10  fof(f172,plain,(
% 5.75/1.10    cn1|~is_a_theorem(implies(implies(sk0_38,sk0_39),implies(implies(sk0_39,sk0_40),implies(sk0_38,sk0_40))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f170])).
% 5.75/1.10  fof(f173,plain,(
% 5.75/1.10    (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|(?[P,Q]: ~is_a_theorem(implies(P,implies(not(P),Q)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f20])).
% 5.75/1.10  fof(f174,plain,(
% 5.75/1.10    (~cn2|(![P,Q]: is_a_theorem(implies(P,implies(not(P),Q)))))&(cn2|~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f173])).
% 5.75/1.10  fof(f175,plain,(
% 5.75/1.10    ![X0,X1]: (~cn2|is_a_theorem(implies(X0,implies(not(X0),X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f174])).
% 5.75/1.10  fof(f176,plain,(
% 5.75/1.10    cn2|~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f174])).
% 5.75/1.10  fof(f177,plain,(
% 5.75/1.10    (~cn3|(![P]: is_a_theorem(implies(implies(not(P),P),P))))&(cn3|(?[P]: ~is_a_theorem(implies(implies(not(P),P),P))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f21])).
% 5.75/1.10  fof(f178,plain,(
% 5.75/1.10    (~cn3|(![P]: is_a_theorem(implies(implies(not(P),P),P))))&(cn3|~is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f177])).
% 5.75/1.10  fof(f179,plain,(
% 5.75/1.10    ![X0]: (~cn3|is_a_theorem(implies(implies(not(X0),X0),X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f178])).
% 5.75/1.10  fof(f180,plain,(
% 5.75/1.10    cn3|~is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f178])).
% 5.75/1.10  fof(f185,plain,(
% 5.75/1.10    (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|(?[P,Q]: ~is_a_theorem(implies(Q,or(P,Q)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f23])).
% 5.75/1.10  fof(f186,plain,(
% 5.75/1.10    (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|~is_a_theorem(implies(sk0_46,or(sk0_45,sk0_46))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f185])).
% 5.75/1.10  fof(f188,plain,(
% 5.75/1.10    r2|~is_a_theorem(implies(sk0_46,or(sk0_45,sk0_46)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f186])).
% 5.75/1.10  fof(f201,plain,(
% 5.75/1.10    ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f27])).
% 5.75/1.10  fof(f202,plain,(
% 5.75/1.10    ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f201])).
% 5.75/1.10  fof(f205,plain,(
% 5.75/1.10    ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f29])).
% 5.75/1.10  fof(f206,plain,(
% 5.75/1.10    ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f205])).
% 5.75/1.10  fof(f209,plain,(
% 5.75/1.10    ~op_equiv|(![X,Y]: equiv(X,Y)=and(implies(X,Y),implies(Y,X)))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f31])).
% 5.75/1.10  fof(f210,plain,(
% 5.75/1.10    ![X0,X1]: (~op_equiv|equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f209])).
% 5.75/1.10  fof(f211,plain,(
% 5.75/1.10    op_or),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f32])).
% 5.75/1.10  fof(f212,plain,(
% 5.75/1.10    op_implies_and),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f33])).
% 5.75/1.10  fof(f213,plain,(
% 5.75/1.10    op_equiv),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f34])).
% 5.75/1.10  fof(f214,plain,(
% 5.75/1.10    modus_ponens),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f35])).
% 5.75/1.10  fof(f215,plain,(
% 5.75/1.10    modus_tollens),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f36])).
% 5.75/1.10  fof(f216,plain,(
% 5.75/1.10    implies_1),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f37])).
% 5.75/1.10  fof(f217,plain,(
% 5.75/1.10    implies_2),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f38])).
% 5.75/1.10  fof(f218,plain,(
% 5.75/1.10    implies_3),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f39])).
% 5.75/1.10  fof(f219,plain,(
% 5.75/1.10    and_1),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f40])).
% 5.75/1.10  fof(f220,plain,(
% 5.75/1.10    and_2),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f41])).
% 5.75/1.10  fof(f221,plain,(
% 5.75/1.10    and_3),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f42])).
% 5.75/1.10  fof(f222,plain,(
% 5.75/1.10    or_1),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f43])).
% 5.75/1.10  fof(f223,plain,(
% 5.75/1.10    or_2),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f44])).
% 5.75/1.10  fof(f224,plain,(
% 5.75/1.10    or_3),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f45])).
% 5.75/1.10  fof(f225,plain,(
% 5.75/1.10    equivalence_1),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f46])).
% 5.75/1.10  fof(f226,plain,(
% 5.75/1.10    equivalence_2),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f47])).
% 5.75/1.10  fof(f227,plain,(
% 5.75/1.10    equivalence_3),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f48])).
% 5.75/1.10  fof(f228,plain,(
% 5.75/1.10    substitution_of_equivalents),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f49])).
% 5.75/1.10  fof(f229,plain,(
% 5.75/1.10    necessitation<=>(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X))))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f50])).
% 5.75/1.10  fof(f230,plain,(
% 5.75/1.10    (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(?[X]: (is_a_theorem(X)&~is_a_theorem(necessarily(X)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f229])).
% 5.75/1.10  fof(f231,plain,(
% 5.75/1.10    (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(is_a_theorem(sk0_55)&~is_a_theorem(necessarily(sk0_55))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f230])).
% 5.75/1.10  fof(f232,plain,(
% 5.75/1.10    ![X0]: (~necessitation|~is_a_theorem(X0)|is_a_theorem(necessarily(X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f231])).
% 5.75/1.10  fof(f243,plain,(
% 5.75/1.10    adjunction<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y))))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f52])).
% 5.75/1.10  fof(f244,plain,(
% 5.75/1.10    (~adjunction|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y)))))&(adjunction|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(Y))&~is_a_theorem(and(X,Y)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f243])).
% 5.75/1.10  fof(f245,plain,(
% 5.75/1.10    (~adjunction|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y)))))&(adjunction|((is_a_theorem(sk0_58)&is_a_theorem(sk0_59))&~is_a_theorem(and(sk0_58,sk0_59))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f244])).
% 5.75/1.10  fof(f246,plain,(
% 5.75/1.10    ![X0,X1]: (~adjunction|~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f245])).
% 5.75/1.10  fof(f247,plain,(
% 5.75/1.10    adjunction|is_a_theorem(sk0_58)),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f245])).
% 5.75/1.10  fof(f248,plain,(
% 5.75/1.10    adjunction|is_a_theorem(sk0_59)),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f245])).
% 5.75/1.10  fof(f249,plain,(
% 5.75/1.10    adjunction|~is_a_theorem(and(sk0_58,sk0_59))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f245])).
% 5.75/1.10  fof(f256,plain,(
% 5.75/1.10    (~axiom_K|(![X,Y]: is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))))&(axiom_K|(?[X,Y]: ~is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f54])).
% 5.75/1.10  fof(f257,plain,(
% 5.75/1.10    (~axiom_K|(![X,Y]: is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))))&(axiom_K|~is_a_theorem(implies(necessarily(implies(sk0_62,sk0_63)),implies(necessarily(sk0_62),necessarily(sk0_63)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f256])).
% 5.75/1.10  fof(f258,plain,(
% 5.75/1.10    ![X0,X1]: (~axiom_K|is_a_theorem(implies(necessarily(implies(X0,X1)),implies(necessarily(X0),necessarily(X1)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f257])).
% 5.75/1.10  fof(f259,plain,(
% 5.75/1.10    axiom_K|~is_a_theorem(implies(necessarily(implies(sk0_62,sk0_63)),implies(necessarily(sk0_62),necessarily(sk0_63))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f257])).
% 5.75/1.10  fof(f260,plain,(
% 5.75/1.10    (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|(?[X]: ~is_a_theorem(implies(necessarily(X),X))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f55])).
% 5.75/1.10  fof(f261,plain,(
% 5.75/1.10    (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|~is_a_theorem(implies(necessarily(sk0_64),sk0_64)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f260])).
% 5.75/1.10  fof(f262,plain,(
% 5.75/1.10    ![X0]: (~axiom_M|is_a_theorem(implies(necessarily(X0),X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f261])).
% 5.75/1.10  fof(f264,plain,(
% 5.75/1.10    (~axiom_4|(![X]: is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))))&(axiom_4|(?[X]: ~is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f56])).
% 5.75/1.10  fof(f265,plain,(
% 5.75/1.10    (~axiom_4|(![X]: is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))))&(axiom_4|~is_a_theorem(implies(necessarily(sk0_65),necessarily(necessarily(sk0_65)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f264])).
% 5.75/1.10  fof(f266,plain,(
% 5.75/1.10    ![X0]: (~axiom_4|is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f265])).
% 5.75/1.10  fof(f268,plain,(
% 5.75/1.10    (~axiom_B|(![X]: is_a_theorem(implies(X,necessarily(possibly(X))))))&(axiom_B|(?[X]: ~is_a_theorem(implies(X,necessarily(possibly(X))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f57])).
% 5.75/1.10  fof(f269,plain,(
% 5.75/1.10    (~axiom_B|(![X]: is_a_theorem(implies(X,necessarily(possibly(X))))))&(axiom_B|~is_a_theorem(implies(sk0_66,necessarily(possibly(sk0_66)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f268])).
% 5.75/1.10  fof(f270,plain,(
% 5.75/1.10    ![X0]: (~axiom_B|is_a_theorem(implies(X0,necessarily(possibly(X0)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f269])).
% 5.75/1.10  fof(f276,plain,(
% 5.75/1.10    (~axiom_s1|(![X,Y,Z]: is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))))&(axiom_s1|(?[X,Y,Z]: ~is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f59])).
% 5.75/1.10  fof(f277,plain,(
% 5.75/1.10    (~axiom_s1|(![X,Y,Z]: is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))))&(axiom_s1|~is_a_theorem(implies(and(necessarily(implies(sk0_68,sk0_69)),necessarily(implies(sk0_69,sk0_70))),necessarily(implies(sk0_68,sk0_70)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f276])).
% 5.75/1.10  fof(f278,plain,(
% 5.75/1.10    ![X0,X1,X2]: (~axiom_s1|is_a_theorem(implies(and(necessarily(implies(X0,X1)),necessarily(implies(X1,X2))),necessarily(implies(X0,X2)))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f277])).
% 5.75/1.10  fof(f279,plain,(
% 5.75/1.10    axiom_s1|~is_a_theorem(implies(and(necessarily(implies(sk0_68,sk0_69)),necessarily(implies(sk0_69,sk0_70))),necessarily(implies(sk0_68,sk0_70))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f277])).
% 5.75/1.10  fof(f288,plain,(
% 5.75/1.10    (~axiom_s4|(![X]: is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))))&(axiom_s4|(?[X]: ~is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f62])).
% 5.75/1.10  fof(f289,plain,(
% 5.75/1.10    (~axiom_s4|(![X]: is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))))&(axiom_s4|~is_a_theorem(strict_implies(necessarily(sk0_75),necessarily(necessarily(sk0_75)))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f288])).
% 5.75/1.10  fof(f291,plain,(
% 5.75/1.10    axiom_s4|~is_a_theorem(strict_implies(necessarily(sk0_75),necessarily(necessarily(sk0_75))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f289])).
% 5.75/1.10  fof(f292,plain,(
% 5.75/1.10    (~axiom_m1|(![X,Y]: is_a_theorem(strict_implies(and(X,Y),and(Y,X)))))&(axiom_m1|(?[X,Y]: ~is_a_theorem(strict_implies(and(X,Y),and(Y,X)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f63])).
% 5.75/1.10  fof(f293,plain,(
% 5.75/1.10    (~axiom_m1|(![X,Y]: is_a_theorem(strict_implies(and(X,Y),and(Y,X)))))&(axiom_m1|~is_a_theorem(strict_implies(and(sk0_76,sk0_77),and(sk0_77,sk0_76))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f292])).
% 5.75/1.10  fof(f295,plain,(
% 5.75/1.10    axiom_m1|~is_a_theorem(strict_implies(and(sk0_76,sk0_77),and(sk0_77,sk0_76)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f293])).
% 5.75/1.10  fof(f296,plain,(
% 5.75/1.10    (~axiom_m2|(![X,Y]: is_a_theorem(strict_implies(and(X,Y),X))))&(axiom_m2|(?[X,Y]: ~is_a_theorem(strict_implies(and(X,Y),X))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f64])).
% 5.75/1.10  fof(f297,plain,(
% 5.75/1.10    (~axiom_m2|(![X,Y]: is_a_theorem(strict_implies(and(X,Y),X))))&(axiom_m2|~is_a_theorem(strict_implies(and(sk0_78,sk0_79),sk0_78)))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f296])).
% 5.75/1.10  fof(f299,plain,(
% 5.75/1.10    axiom_m2|~is_a_theorem(strict_implies(and(sk0_78,sk0_79),sk0_78))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f297])).
% 5.75/1.10  fof(f304,plain,(
% 5.75/1.10    (~axiom_m4|(![X]: is_a_theorem(strict_implies(X,and(X,X)))))&(axiom_m4|(?[X]: ~is_a_theorem(strict_implies(X,and(X,X)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f66])).
% 5.75/1.10  fof(f305,plain,(
% 5.75/1.10    (~axiom_m4|(![X]: is_a_theorem(strict_implies(X,and(X,X)))))&(axiom_m4|~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f304])).
% 5.75/1.10  fof(f307,plain,(
% 5.75/1.10    axiom_m4|~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f305])).
% 5.75/1.10  fof(f308,plain,(
% 5.75/1.10    (~axiom_m5|(![X,Y,Z]: is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))))&(axiom_m5|(?[X,Y,Z]: ~is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))))),
% 5.75/1.10    inference(NNF_transformation,[status(esa)],[f67])).
% 5.75/1.10  fof(f309,plain,(
% 5.75/1.10    (~axiom_m5|(![X,Y,Z]: is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))))&(axiom_m5|~is_a_theorem(strict_implies(and(strict_implies(sk0_84,sk0_85),strict_implies(sk0_85,sk0_86)),strict_implies(sk0_84,sk0_86))))),
% 5.75/1.10    inference(skolemization,[status(esa)],[f308])).
% 5.75/1.10  fof(f310,plain,(
% 5.75/1.10    ![X0,X1,X2]: (~axiom_m5|is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f309])).
% 5.75/1.10  fof(f311,plain,(
% 5.75/1.10    axiom_m5|~is_a_theorem(strict_implies(and(strict_implies(sk0_84,sk0_85),strict_implies(sk0_85,sk0_86)),strict_implies(sk0_84,sk0_86)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f309])).
% 5.75/1.10  fof(f332,plain,(
% 5.75/1.10    ~op_possibly|(![X]: possibly(X)=not(necessarily(not(X))))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f73])).
% 5.75/1.10  fof(f333,plain,(
% 5.75/1.10    ![X0]: (~op_possibly|possibly(X0)=not(necessarily(not(X0))))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f332])).
% 5.75/1.10  fof(f336,plain,(
% 5.75/1.10    ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f75])).
% 5.75/1.10  fof(f337,plain,(
% 5.75/1.10    ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f336])).
% 5.75/1.10  fof(f338,plain,(
% 5.75/1.10    ~op_strict_equiv|(![X,Y]: strict_equiv(X,Y)=and(strict_implies(X,Y),strict_implies(Y,X)))),
% 5.75/1.10    inference(pre_NNF_transformation,[status(esa)],[f76])).
% 5.75/1.10  fof(f339,plain,(
% 5.75/1.10    ![X0,X1]: (~op_strict_equiv|strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0)))),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f338])).
% 5.75/1.10  fof(f340,plain,(
% 5.75/1.10    op_possibly),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f77])).
% 5.75/1.10  fof(f341,plain,(
% 5.75/1.10    necessitation),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f78])).
% 5.75/1.10  fof(f343,plain,(
% 5.75/1.10    axiom_M),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f80])).
% 5.75/1.10  fof(f344,plain,(
% 5.75/1.10    axiom_4),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f81])).
% 5.75/1.10  fof(f345,plain,(
% 5.75/1.10    axiom_B),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f82])).
% 5.75/1.10  fof(f349,plain,(
% 5.75/1.10    op_strict_implies),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f86])).
% 5.75/1.10  fof(f351,plain,(
% 5.75/1.10    op_strict_equiv),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f88])).
% 5.75/1.10  fof(f352,plain,(
% 5.75/1.10    ~axiom_m1),
% 5.75/1.10    inference(cnf_transformation,[status(esa)],[f90])).
% 5.75/1.10  fof(f353,plain,(
% 5.75/1.10    spl0_0 <=> modus_ponens),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f355,plain,(
% 5.75/1.10    ~modus_ponens|spl0_0),
% 5.75/1.10    inference(component_clause,[status(thm)],[f353])).
% 5.75/1.10  fof(f356,plain,(
% 5.75/1.10    spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f357,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f356])).
% 5.75/1.10  fof(f359,plain,(
% 5.75/1.10    ~spl0_0|spl0_1),
% 5.75/1.10    inference(split_clause,[status(thm)],[f95,f353,f356])).
% 5.75/1.10  fof(f372,plain,(
% 5.75/1.10    spl0_5 <=> substitution_of_equivalents),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f374,plain,(
% 5.75/1.10    ~substitution_of_equivalents|spl0_5),
% 5.75/1.10    inference(component_clause,[status(thm)],[f372])).
% 5.75/1.10  fof(f375,plain,(
% 5.75/1.10    spl0_6 <=> ~is_a_theorem(equiv(X0,X1))|X0=X1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f376,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(equiv(X0,X1))|X0=X1|~spl0_6)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f375])).
% 5.75/1.10  fof(f378,plain,(
% 5.75/1.10    ~spl0_5|spl0_6),
% 5.75/1.10    inference(split_clause,[status(thm)],[f102,f372,f375])).
% 5.75/1.10  fof(f387,plain,(
% 5.75/1.10    spl0_9 <=> modus_tollens),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f389,plain,(
% 5.75/1.10    ~modus_tollens|spl0_9),
% 5.75/1.10    inference(component_clause,[status(thm)],[f387])).
% 5.75/1.10  fof(f390,plain,(
% 5.75/1.10    spl0_10 <=> is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f391,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))|~spl0_10)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f390])).
% 5.75/1.10  fof(f393,plain,(
% 5.75/1.10    ~spl0_9|spl0_10),
% 5.75/1.10    inference(split_clause,[status(thm)],[f107,f387,f390])).
% 5.75/1.10  fof(f394,plain,(
% 5.75/1.10    spl0_11 <=> is_a_theorem(implies(implies(not(sk0_5),not(sk0_4)),implies(sk0_4,sk0_5)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f396,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(not(sk0_5),not(sk0_4)),implies(sk0_4,sk0_5)))|spl0_11),
% 5.75/1.10    inference(component_clause,[status(thm)],[f394])).
% 5.75/1.10  fof(f398,plain,(
% 5.75/1.10    spl0_12 <=> implies_1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f400,plain,(
% 5.75/1.10    ~implies_1|spl0_12),
% 5.75/1.10    inference(component_clause,[status(thm)],[f398])).
% 5.75/1.10  fof(f401,plain,(
% 5.75/1.10    spl0_13 <=> is_a_theorem(implies(X0,implies(X1,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f402,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0)))|~spl0_13)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f401])).
% 5.75/1.10  fof(f404,plain,(
% 5.75/1.10    ~spl0_12|spl0_13),
% 5.75/1.10    inference(split_clause,[status(thm)],[f111,f398,f401])).
% 5.75/1.10  fof(f405,plain,(
% 5.75/1.10    spl0_14 <=> is_a_theorem(implies(sk0_6,implies(sk0_7,sk0_6)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f407,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_6,implies(sk0_7,sk0_6)))|spl0_14),
% 5.75/1.10    inference(component_clause,[status(thm)],[f405])).
% 5.75/1.10  fof(f409,plain,(
% 5.75/1.10    spl0_15 <=> implies_2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f411,plain,(
% 5.75/1.10    ~implies_2|spl0_15),
% 5.75/1.10    inference(component_clause,[status(thm)],[f409])).
% 5.75/1.10  fof(f412,plain,(
% 5.75/1.10    spl0_16 <=> is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f413,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))|~spl0_16)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f412])).
% 5.75/1.10  fof(f415,plain,(
% 5.75/1.10    ~spl0_15|spl0_16),
% 5.75/1.10    inference(split_clause,[status(thm)],[f115,f409,f412])).
% 5.75/1.10  fof(f416,plain,(
% 5.75/1.10    spl0_17 <=> is_a_theorem(implies(implies(sk0_8,implies(sk0_8,sk0_9)),implies(sk0_8,sk0_9)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f418,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(sk0_8,implies(sk0_8,sk0_9)),implies(sk0_8,sk0_9)))|spl0_17),
% 5.75/1.10    inference(component_clause,[status(thm)],[f416])).
% 5.75/1.10  fof(f420,plain,(
% 5.75/1.10    spl0_18 <=> implies_3),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f422,plain,(
% 5.75/1.10    ~implies_3|spl0_18),
% 5.75/1.10    inference(component_clause,[status(thm)],[f420])).
% 5.75/1.10  fof(f423,plain,(
% 5.75/1.10    spl0_19 <=> is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f424,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))|~spl0_19)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f423])).
% 5.75/1.10  fof(f426,plain,(
% 5.75/1.10    ~spl0_18|spl0_19),
% 5.75/1.10    inference(split_clause,[status(thm)],[f119,f420,f423])).
% 5.75/1.10  fof(f427,plain,(
% 5.75/1.10    spl0_20 <=> is_a_theorem(implies(implies(sk0_10,sk0_11),implies(implies(sk0_11,sk0_12),implies(sk0_10,sk0_12))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f429,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(sk0_10,sk0_11),implies(implies(sk0_11,sk0_12),implies(sk0_10,sk0_12))))|spl0_20),
% 5.75/1.10    inference(component_clause,[status(thm)],[f427])).
% 5.75/1.10  fof(f431,plain,(
% 5.75/1.10    spl0_21 <=> and_1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f433,plain,(
% 5.75/1.10    ~and_1|spl0_21),
% 5.75/1.10    inference(component_clause,[status(thm)],[f431])).
% 5.75/1.10  fof(f434,plain,(
% 5.75/1.10    spl0_22 <=> is_a_theorem(implies(and(X0,X1),X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f435,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0))|~spl0_22)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f434])).
% 5.75/1.10  fof(f437,plain,(
% 5.75/1.10    ~spl0_21|spl0_22),
% 5.75/1.10    inference(split_clause,[status(thm)],[f123,f431,f434])).
% 5.75/1.10  fof(f438,plain,(
% 5.75/1.10    spl0_23 <=> is_a_theorem(implies(and(sk0_13,sk0_14),sk0_13))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f440,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(sk0_13,sk0_14),sk0_13))|spl0_23),
% 5.75/1.10    inference(component_clause,[status(thm)],[f438])).
% 5.75/1.10  fof(f442,plain,(
% 5.75/1.10    spl0_24 <=> and_2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f444,plain,(
% 5.75/1.10    ~and_2|spl0_24),
% 5.75/1.10    inference(component_clause,[status(thm)],[f442])).
% 5.75/1.10  fof(f445,plain,(
% 5.75/1.10    spl0_25 <=> is_a_theorem(implies(and(X0,X1),X1))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f446,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X1))|~spl0_25)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f445])).
% 5.75/1.10  fof(f448,plain,(
% 5.75/1.10    ~spl0_24|spl0_25),
% 5.75/1.10    inference(split_clause,[status(thm)],[f127,f442,f445])).
% 5.75/1.10  fof(f449,plain,(
% 5.75/1.10    spl0_26 <=> is_a_theorem(implies(and(sk0_15,sk0_16),sk0_16))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f451,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(sk0_15,sk0_16),sk0_16))|spl0_26),
% 5.75/1.10    inference(component_clause,[status(thm)],[f449])).
% 5.75/1.10  fof(f453,plain,(
% 5.75/1.10    spl0_27 <=> and_3),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f455,plain,(
% 5.75/1.10    ~and_3|spl0_27),
% 5.75/1.10    inference(component_clause,[status(thm)],[f453])).
% 5.75/1.10  fof(f456,plain,(
% 5.75/1.10    spl0_28 <=> is_a_theorem(implies(X0,implies(X1,and(X0,X1))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f457,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1))))|~spl0_28)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f456])).
% 5.75/1.10  fof(f459,plain,(
% 5.75/1.10    ~spl0_27|spl0_28),
% 5.75/1.10    inference(split_clause,[status(thm)],[f131,f453,f456])).
% 5.75/1.10  fof(f464,plain,(
% 5.75/1.10    spl0_30 <=> or_1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f466,plain,(
% 5.75/1.10    ~or_1|spl0_30),
% 5.75/1.10    inference(component_clause,[status(thm)],[f464])).
% 5.75/1.10  fof(f467,plain,(
% 5.75/1.10    spl0_31 <=> is_a_theorem(implies(X0,or(X0,X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f468,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1)))|~spl0_31)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f467])).
% 5.75/1.10  fof(f470,plain,(
% 5.75/1.10    ~spl0_30|spl0_31),
% 5.75/1.10    inference(split_clause,[status(thm)],[f135,f464,f467])).
% 5.75/1.10  fof(f471,plain,(
% 5.75/1.10    spl0_32 <=> is_a_theorem(implies(sk0_19,or(sk0_19,sk0_20)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f473,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_19,or(sk0_19,sk0_20)))|spl0_32),
% 5.75/1.10    inference(component_clause,[status(thm)],[f471])).
% 5.75/1.10  fof(f475,plain,(
% 5.75/1.10    spl0_33 <=> or_2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f477,plain,(
% 5.75/1.10    ~or_2|spl0_33),
% 5.75/1.10    inference(component_clause,[status(thm)],[f475])).
% 5.75/1.10  fof(f478,plain,(
% 5.75/1.10    spl0_34 <=> is_a_theorem(implies(X0,or(X1,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f479,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(X0,or(X1,X0)))|~spl0_34)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f478])).
% 5.75/1.10  fof(f481,plain,(
% 5.75/1.10    ~spl0_33|spl0_34),
% 5.75/1.10    inference(split_clause,[status(thm)],[f139,f475,f478])).
% 5.75/1.10  fof(f482,plain,(
% 5.75/1.10    spl0_35 <=> is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f484,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22)))|spl0_35),
% 5.75/1.10    inference(component_clause,[status(thm)],[f482])).
% 5.75/1.10  fof(f486,plain,(
% 5.75/1.10    spl0_36 <=> or_3),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f488,plain,(
% 5.75/1.10    ~or_3|spl0_36),
% 5.75/1.10    inference(component_clause,[status(thm)],[f486])).
% 5.75/1.10  fof(f489,plain,(
% 5.75/1.10    spl0_37 <=> is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f490,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))|~spl0_37)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f489])).
% 5.75/1.10  fof(f492,plain,(
% 5.75/1.10    ~spl0_36|spl0_37),
% 5.75/1.10    inference(split_clause,[status(thm)],[f143,f486,f489])).
% 5.75/1.10  fof(f493,plain,(
% 5.75/1.10    spl0_38 <=> is_a_theorem(implies(implies(sk0_23,sk0_25),implies(implies(sk0_24,sk0_25),implies(or(sk0_23,sk0_24),sk0_25))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f495,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(sk0_23,sk0_25),implies(implies(sk0_24,sk0_25),implies(or(sk0_23,sk0_24),sk0_25))))|spl0_38),
% 5.75/1.10    inference(component_clause,[status(thm)],[f493])).
% 5.75/1.10  fof(f497,plain,(
% 5.75/1.10    spl0_39 <=> equivalence_1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f499,plain,(
% 5.75/1.10    ~equivalence_1|spl0_39),
% 5.75/1.10    inference(component_clause,[status(thm)],[f497])).
% 5.75/1.10  fof(f500,plain,(
% 5.75/1.10    spl0_40 <=> is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f501,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(equiv(X0,X1),implies(X0,X1)))|~spl0_40)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f500])).
% 5.75/1.10  fof(f503,plain,(
% 5.75/1.10    ~spl0_39|spl0_40),
% 5.75/1.10    inference(split_clause,[status(thm)],[f147,f497,f500])).
% 5.75/1.10  fof(f504,plain,(
% 5.75/1.10    spl0_41 <=> is_a_theorem(implies(equiv(sk0_26,sk0_27),implies(sk0_26,sk0_27)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f506,plain,(
% 5.75/1.10    ~is_a_theorem(implies(equiv(sk0_26,sk0_27),implies(sk0_26,sk0_27)))|spl0_41),
% 5.75/1.10    inference(component_clause,[status(thm)],[f504])).
% 5.75/1.10  fof(f508,plain,(
% 5.75/1.10    spl0_42 <=> equivalence_2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f510,plain,(
% 5.75/1.10    ~equivalence_2|spl0_42),
% 5.75/1.10    inference(component_clause,[status(thm)],[f508])).
% 5.75/1.10  fof(f511,plain,(
% 5.75/1.10    spl0_43 <=> is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f512,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(equiv(X0,X1),implies(X1,X0)))|~spl0_43)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f511])).
% 5.75/1.10  fof(f514,plain,(
% 5.75/1.10    ~spl0_42|spl0_43),
% 5.75/1.10    inference(split_clause,[status(thm)],[f151,f508,f511])).
% 5.75/1.10  fof(f515,plain,(
% 5.75/1.10    spl0_44 <=> is_a_theorem(implies(equiv(sk0_28,sk0_29),implies(sk0_29,sk0_28)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f517,plain,(
% 5.75/1.10    ~is_a_theorem(implies(equiv(sk0_28,sk0_29),implies(sk0_29,sk0_28)))|spl0_44),
% 5.75/1.10    inference(component_clause,[status(thm)],[f515])).
% 5.75/1.10  fof(f519,plain,(
% 5.75/1.10    spl0_45 <=> equivalence_3),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f521,plain,(
% 5.75/1.10    ~equivalence_3|spl0_45),
% 5.75/1.10    inference(component_clause,[status(thm)],[f519])).
% 5.75/1.10  fof(f522,plain,(
% 5.75/1.10    spl0_46 <=> is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f523,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))|~spl0_46)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f522])).
% 5.75/1.10  fof(f526,plain,(
% 5.75/1.10    spl0_47 <=> is_a_theorem(implies(implies(sk0_30,sk0_31),implies(implies(sk0_31,sk0_30),equiv(sk0_30,sk0_31))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f528,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(sk0_30,sk0_31),implies(implies(sk0_31,sk0_30),equiv(sk0_30,sk0_31))))|spl0_47),
% 5.75/1.10    inference(component_clause,[status(thm)],[f526])).
% 5.75/1.10  fof(f530,plain,(
% 5.75/1.10    spl0_48 <=> kn1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f533,plain,(
% 5.75/1.10    spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f534,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f533])).
% 5.75/1.10  fof(f537,plain,(
% 5.75/1.10    spl0_50 <=> is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f539,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32)))|spl0_50),
% 5.75/1.10    inference(component_clause,[status(thm)],[f537])).
% 5.75/1.10  fof(f540,plain,(
% 5.75/1.10    spl0_48|~spl0_50),
% 5.75/1.10    inference(split_clause,[status(thm)],[f160,f530,f537])).
% 5.75/1.10  fof(f541,plain,(
% 5.75/1.10    spl0_51 <=> kn2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f545,plain,(
% 5.75/1.10    spl0_52 <=> is_a_theorem(implies(and(sk0_33,sk0_34),sk0_33))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f547,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(sk0_33,sk0_34),sk0_33))|spl0_52),
% 5.75/1.10    inference(component_clause,[status(thm)],[f545])).
% 5.75/1.10  fof(f548,plain,(
% 5.75/1.10    spl0_51|~spl0_52),
% 5.75/1.10    inference(split_clause,[status(thm)],[f164,f541,f545])).
% 5.75/1.10  fof(f560,plain,(
% 5.75/1.10    spl0_56 <=> cn1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f564,plain,(
% 5.75/1.10    spl0_57 <=> is_a_theorem(implies(implies(sk0_38,sk0_39),implies(implies(sk0_39,sk0_40),implies(sk0_38,sk0_40))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f566,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(sk0_38,sk0_39),implies(implies(sk0_39,sk0_40),implies(sk0_38,sk0_40))))|spl0_57),
% 5.75/1.10    inference(component_clause,[status(thm)],[f564])).
% 5.75/1.10  fof(f567,plain,(
% 5.75/1.10    spl0_56|~spl0_57),
% 5.75/1.10    inference(split_clause,[status(thm)],[f172,f560,f564])).
% 5.75/1.10  fof(f568,plain,(
% 5.75/1.10    spl0_58 <=> cn2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f571,plain,(
% 5.75/1.10    spl0_59 <=> is_a_theorem(implies(X0,implies(not(X0),X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f572,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(X0,implies(not(X0),X1)))|~spl0_59)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f571])).
% 5.75/1.10  fof(f574,plain,(
% 5.75/1.10    ~spl0_58|spl0_59),
% 5.75/1.10    inference(split_clause,[status(thm)],[f175,f568,f571])).
% 5.75/1.10  fof(f575,plain,(
% 5.75/1.10    spl0_60 <=> is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f577,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_41,implies(not(sk0_41),sk0_42)))|spl0_60),
% 5.75/1.10    inference(component_clause,[status(thm)],[f575])).
% 5.75/1.10  fof(f578,plain,(
% 5.75/1.10    spl0_58|~spl0_60),
% 5.75/1.10    inference(split_clause,[status(thm)],[f176,f568,f575])).
% 5.75/1.10  fof(f579,plain,(
% 5.75/1.10    spl0_61 <=> cn3),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f582,plain,(
% 5.75/1.10    spl0_62 <=> is_a_theorem(implies(implies(not(X0),X0),X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f583,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(implies(not(X0),X0),X0))|~spl0_62)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f582])).
% 5.75/1.10  fof(f585,plain,(
% 5.75/1.10    ~spl0_61|spl0_62),
% 5.75/1.10    inference(split_clause,[status(thm)],[f179,f579,f582])).
% 5.75/1.10  fof(f586,plain,(
% 5.75/1.10    spl0_63 <=> is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f588,plain,(
% 5.75/1.10    ~is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))|spl0_63),
% 5.75/1.10    inference(component_clause,[status(thm)],[f586])).
% 5.75/1.10  fof(f589,plain,(
% 5.75/1.10    spl0_61|~spl0_63),
% 5.75/1.10    inference(split_clause,[status(thm)],[f180,f579,f586])).
% 5.75/1.10  fof(f601,plain,(
% 5.75/1.10    spl0_67 <=> r2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f605,plain,(
% 5.75/1.10    spl0_68 <=> is_a_theorem(implies(sk0_46,or(sk0_45,sk0_46)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f607,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_46,or(sk0_45,sk0_46)))|spl0_68),
% 5.75/1.10    inference(component_clause,[status(thm)],[f605])).
% 5.75/1.10  fof(f608,plain,(
% 5.75/1.10    spl0_67|~spl0_68),
% 5.75/1.10    inference(split_clause,[status(thm)],[f188,f601,f605])).
% 5.75/1.10  fof(f642,plain,(
% 5.75/1.10    spl0_78 <=> op_or),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f644,plain,(
% 5.75/1.10    ~op_or|spl0_78),
% 5.75/1.10    inference(component_clause,[status(thm)],[f642])).
% 5.75/1.10  fof(f645,plain,(
% 5.75/1.10    spl0_79 <=> or(X0,X1)=not(and(not(X0),not(X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f646,plain,(
% 5.75/1.10    ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~spl0_79)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f645])).
% 5.75/1.10  fof(f648,plain,(
% 5.75/1.10    ~spl0_78|spl0_79),
% 5.75/1.10    inference(split_clause,[status(thm)],[f202,f642,f645])).
% 5.75/1.10  fof(f656,plain,(
% 5.75/1.10    spl0_82 <=> op_implies_and),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f658,plain,(
% 5.75/1.10    ~op_implies_and|spl0_82),
% 5.75/1.10    inference(component_clause,[status(thm)],[f656])).
% 5.75/1.10  fof(f659,plain,(
% 5.75/1.10    spl0_83 <=> implies(X0,X1)=not(and(X0,not(X1)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f660,plain,(
% 5.75/1.10    ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~spl0_83)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f659])).
% 5.75/1.10  fof(f662,plain,(
% 5.75/1.10    ~spl0_82|spl0_83),
% 5.75/1.10    inference(split_clause,[status(thm)],[f206,f656,f659])).
% 5.75/1.10  fof(f666,plain,(
% 5.75/1.10    spl0_85 <=> implies(X0,X1)=or(not(X0),X1)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f667,plain,(
% 5.75/1.10    ![X0,X1]: (implies(X0,X1)=or(not(X0),X1)|~spl0_85)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f666])).
% 5.75/1.10  fof(f670,plain,(
% 5.75/1.10    spl0_86 <=> op_equiv),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f672,plain,(
% 5.75/1.10    ~op_equiv|spl0_86),
% 5.75/1.10    inference(component_clause,[status(thm)],[f670])).
% 5.75/1.10  fof(f673,plain,(
% 5.75/1.10    spl0_87 <=> equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f674,plain,(
% 5.75/1.10    ![X0,X1]: (equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))|~spl0_87)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f673])).
% 5.75/1.10  fof(f676,plain,(
% 5.75/1.10    ~spl0_86|spl0_87),
% 5.75/1.10    inference(split_clause,[status(thm)],[f210,f670,f673])).
% 5.75/1.10  fof(f677,plain,(
% 5.75/1.10    spl0_88 <=> necessitation),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f679,plain,(
% 5.75/1.10    ~necessitation|spl0_88),
% 5.75/1.10    inference(component_clause,[status(thm)],[f677])).
% 5.75/1.10  fof(f680,plain,(
% 5.75/1.10    spl0_89 <=> ~is_a_theorem(X0)|is_a_theorem(necessarily(X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f681,plain,(
% 5.75/1.10    ![X0]: (~is_a_theorem(X0)|is_a_theorem(necessarily(X0))|~spl0_89)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f680])).
% 5.75/1.10  fof(f683,plain,(
% 5.75/1.10    ~spl0_88|spl0_89),
% 5.75/1.10    inference(split_clause,[status(thm)],[f232,f677,f680])).
% 5.75/1.10  fof(f711,plain,(
% 5.75/1.10    spl0_97 <=> adjunction),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f714,plain,(
% 5.75/1.10    spl0_98 <=> ~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f715,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))|~spl0_98)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f714])).
% 5.75/1.10  fof(f717,plain,(
% 5.75/1.10    ~spl0_97|spl0_98),
% 5.75/1.10    inference(split_clause,[status(thm)],[f246,f711,f714])).
% 5.75/1.10  fof(f718,plain,(
% 5.75/1.10    spl0_99 <=> is_a_theorem(sk0_58)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f721,plain,(
% 5.75/1.10    spl0_97|spl0_99),
% 5.75/1.10    inference(split_clause,[status(thm)],[f247,f711,f718])).
% 5.75/1.10  fof(f722,plain,(
% 5.75/1.10    spl0_100 <=> is_a_theorem(sk0_59)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f725,plain,(
% 5.75/1.10    spl0_97|spl0_100),
% 5.75/1.10    inference(split_clause,[status(thm)],[f248,f711,f722])).
% 5.75/1.10  fof(f726,plain,(
% 5.75/1.10    spl0_101 <=> is_a_theorem(and(sk0_58,sk0_59))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f728,plain,(
% 5.75/1.10    ~is_a_theorem(and(sk0_58,sk0_59))|spl0_101),
% 5.75/1.10    inference(component_clause,[status(thm)],[f726])).
% 5.75/1.10  fof(f729,plain,(
% 5.75/1.10    spl0_97|~spl0_101),
% 5.75/1.10    inference(split_clause,[status(thm)],[f249,f711,f726])).
% 5.75/1.10  fof(f745,plain,(
% 5.75/1.10    spl0_106 <=> axiom_K),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f748,plain,(
% 5.75/1.10    spl0_107 <=> is_a_theorem(implies(necessarily(implies(X0,X1)),implies(necessarily(X0),necessarily(X1))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f751,plain,(
% 5.75/1.10    ~spl0_106|spl0_107),
% 5.75/1.10    inference(split_clause,[status(thm)],[f258,f745,f748])).
% 5.75/1.10  fof(f752,plain,(
% 5.75/1.10    spl0_108 <=> is_a_theorem(implies(necessarily(implies(sk0_62,sk0_63)),implies(necessarily(sk0_62),necessarily(sk0_63))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f755,plain,(
% 5.75/1.10    spl0_106|~spl0_108),
% 5.75/1.10    inference(split_clause,[status(thm)],[f259,f745,f752])).
% 5.75/1.10  fof(f756,plain,(
% 5.75/1.10    spl0_109 <=> axiom_M),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f758,plain,(
% 5.75/1.10    ~axiom_M|spl0_109),
% 5.75/1.10    inference(component_clause,[status(thm)],[f756])).
% 5.75/1.10  fof(f759,plain,(
% 5.75/1.10    spl0_110 <=> is_a_theorem(implies(necessarily(X0),X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f760,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(necessarily(X0),X0))|~spl0_110)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f759])).
% 5.75/1.10  fof(f762,plain,(
% 5.75/1.10    ~spl0_109|spl0_110),
% 5.75/1.10    inference(split_clause,[status(thm)],[f262,f756,f759])).
% 5.75/1.10  fof(f763,plain,(
% 5.75/1.10    spl0_111 <=> is_a_theorem(implies(necessarily(sk0_64),sk0_64))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f765,plain,(
% 5.75/1.10    ~is_a_theorem(implies(necessarily(sk0_64),sk0_64))|spl0_111),
% 5.75/1.10    inference(component_clause,[status(thm)],[f763])).
% 5.75/1.10  fof(f767,plain,(
% 5.75/1.10    spl0_112 <=> axiom_4),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f769,plain,(
% 5.75/1.10    ~axiom_4|spl0_112),
% 5.75/1.10    inference(component_clause,[status(thm)],[f767])).
% 5.75/1.10  fof(f770,plain,(
% 5.75/1.10    spl0_113 <=> is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f771,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(necessarily(X0),necessarily(necessarily(X0))))|~spl0_113)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f770])).
% 5.75/1.10  fof(f773,plain,(
% 5.75/1.10    ~spl0_112|spl0_113),
% 5.75/1.10    inference(split_clause,[status(thm)],[f266,f767,f770])).
% 5.75/1.10  fof(f774,plain,(
% 5.75/1.10    spl0_114 <=> is_a_theorem(implies(necessarily(sk0_65),necessarily(necessarily(sk0_65))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f776,plain,(
% 5.75/1.10    ~is_a_theorem(implies(necessarily(sk0_65),necessarily(necessarily(sk0_65))))|spl0_114),
% 5.75/1.10    inference(component_clause,[status(thm)],[f774])).
% 5.75/1.10  fof(f778,plain,(
% 5.75/1.10    spl0_115 <=> axiom_B),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f780,plain,(
% 5.75/1.10    ~axiom_B|spl0_115),
% 5.75/1.10    inference(component_clause,[status(thm)],[f778])).
% 5.75/1.10  fof(f781,plain,(
% 5.75/1.10    spl0_116 <=> is_a_theorem(implies(X0,necessarily(possibly(X0))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f782,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(X0,necessarily(possibly(X0))))|~spl0_116)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f781])).
% 5.75/1.10  fof(f784,plain,(
% 5.75/1.10    ~spl0_115|spl0_116),
% 5.75/1.10    inference(split_clause,[status(thm)],[f270,f778,f781])).
% 5.75/1.10  fof(f785,plain,(
% 5.75/1.10    spl0_117 <=> is_a_theorem(implies(sk0_66,necessarily(possibly(sk0_66))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f787,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_66,necessarily(possibly(sk0_66))))|spl0_117),
% 5.75/1.10    inference(component_clause,[status(thm)],[f785])).
% 5.75/1.10  fof(f800,plain,(
% 5.75/1.10    spl0_121 <=> axiom_s1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f803,plain,(
% 5.75/1.10    spl0_122 <=> is_a_theorem(implies(and(necessarily(implies(X0,X1)),necessarily(implies(X1,X2))),necessarily(implies(X0,X2))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f804,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(and(necessarily(implies(X0,X1)),necessarily(implies(X1,X2))),necessarily(implies(X0,X2))))|~spl0_122)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f803])).
% 5.75/1.10  fof(f806,plain,(
% 5.75/1.10    ~spl0_121|spl0_122),
% 5.75/1.10    inference(split_clause,[status(thm)],[f278,f800,f803])).
% 5.75/1.10  fof(f807,plain,(
% 5.75/1.10    spl0_123 <=> is_a_theorem(implies(and(necessarily(implies(sk0_68,sk0_69)),necessarily(implies(sk0_69,sk0_70))),necessarily(implies(sk0_68,sk0_70))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f809,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(necessarily(implies(sk0_68,sk0_69)),necessarily(implies(sk0_69,sk0_70))),necessarily(implies(sk0_68,sk0_70))))|spl0_123),
% 5.75/1.10    inference(component_clause,[status(thm)],[f807])).
% 5.75/1.10  fof(f810,plain,(
% 5.75/1.10    spl0_121|~spl0_123),
% 5.75/1.10    inference(split_clause,[status(thm)],[f279,f800,f807])).
% 5.75/1.10  fof(f833,plain,(
% 5.75/1.10    spl0_130 <=> axiom_s4),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f836,plain,(
% 5.75/1.10    spl0_131 <=> is_a_theorem(strict_implies(necessarily(X0),necessarily(necessarily(X0))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f837,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(strict_implies(necessarily(X0),necessarily(necessarily(X0))))|~spl0_131)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f836])).
% 5.75/1.10  fof(f840,plain,(
% 5.75/1.10    spl0_132 <=> is_a_theorem(strict_implies(necessarily(sk0_75),necessarily(necessarily(sk0_75))))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f842,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(necessarily(sk0_75),necessarily(necessarily(sk0_75))))|spl0_132),
% 5.75/1.10    inference(component_clause,[status(thm)],[f840])).
% 5.75/1.10  fof(f843,plain,(
% 5.75/1.10    spl0_130|~spl0_132),
% 5.75/1.10    inference(split_clause,[status(thm)],[f291,f833,f840])).
% 5.75/1.10  fof(f844,plain,(
% 5.75/1.10    spl0_133 <=> axiom_m1),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f845,plain,(
% 5.75/1.10    axiom_m1|~spl0_133),
% 5.75/1.10    inference(component_clause,[status(thm)],[f844])).
% 5.75/1.10  fof(f847,plain,(
% 5.75/1.10    spl0_134 <=> is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f848,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(strict_implies(and(X0,X1),and(X1,X0)))|~spl0_134)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f847])).
% 5.75/1.10  fof(f851,plain,(
% 5.75/1.10    spl0_135 <=> is_a_theorem(strict_implies(and(sk0_76,sk0_77),and(sk0_77,sk0_76)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f853,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(and(sk0_76,sk0_77),and(sk0_77,sk0_76)))|spl0_135),
% 5.75/1.10    inference(component_clause,[status(thm)],[f851])).
% 5.75/1.10  fof(f854,plain,(
% 5.75/1.10    spl0_133|~spl0_135),
% 5.75/1.10    inference(split_clause,[status(thm)],[f295,f844,f851])).
% 5.75/1.10  fof(f855,plain,(
% 5.75/1.10    spl0_136 <=> axiom_m2),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f858,plain,(
% 5.75/1.10    spl0_137 <=> is_a_theorem(strict_implies(and(X0,X1),X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f859,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(strict_implies(and(X0,X1),X0))|~spl0_137)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f858])).
% 5.75/1.10  fof(f862,plain,(
% 5.75/1.10    spl0_138 <=> is_a_theorem(strict_implies(and(sk0_78,sk0_79),sk0_78))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f864,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(and(sk0_78,sk0_79),sk0_78))|spl0_138),
% 5.75/1.10    inference(component_clause,[status(thm)],[f862])).
% 5.75/1.10  fof(f865,plain,(
% 5.75/1.10    spl0_136|~spl0_138),
% 5.75/1.10    inference(split_clause,[status(thm)],[f299,f855,f862])).
% 5.75/1.10  fof(f877,plain,(
% 5.75/1.10    spl0_142 <=> axiom_m4),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f880,plain,(
% 5.75/1.10    spl0_143 <=> is_a_theorem(strict_implies(X0,and(X0,X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f881,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(strict_implies(X0,and(X0,X0)))|~spl0_143)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f880])).
% 5.75/1.10  fof(f884,plain,(
% 5.75/1.10    spl0_144 <=> is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f886,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(sk0_83,and(sk0_83,sk0_83)))|spl0_144),
% 5.75/1.10    inference(component_clause,[status(thm)],[f884])).
% 5.75/1.10  fof(f887,plain,(
% 5.75/1.10    spl0_142|~spl0_144),
% 5.75/1.10    inference(split_clause,[status(thm)],[f307,f877,f884])).
% 5.75/1.10  fof(f888,plain,(
% 5.75/1.10    spl0_145 <=> axiom_m5),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f891,plain,(
% 5.75/1.10    spl0_146 <=> is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f892,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))|~spl0_146)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f891])).
% 5.75/1.10  fof(f894,plain,(
% 5.75/1.10    ~spl0_145|spl0_146),
% 5.75/1.10    inference(split_clause,[status(thm)],[f310,f888,f891])).
% 5.75/1.10  fof(f895,plain,(
% 5.75/1.10    spl0_147 <=> is_a_theorem(strict_implies(and(strict_implies(sk0_84,sk0_85),strict_implies(sk0_85,sk0_86)),strict_implies(sk0_84,sk0_86)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f897,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(and(strict_implies(sk0_84,sk0_85),strict_implies(sk0_85,sk0_86)),strict_implies(sk0_84,sk0_86)))|spl0_147),
% 5.75/1.10    inference(component_clause,[status(thm)],[f895])).
% 5.75/1.10  fof(f898,plain,(
% 5.75/1.10    spl0_145|~spl0_147),
% 5.75/1.10    inference(split_clause,[status(thm)],[f311,f888,f895])).
% 5.75/1.10  fof(f954,plain,(
% 5.75/1.10    spl0_163 <=> op_possibly),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f956,plain,(
% 5.75/1.10    ~op_possibly|spl0_163),
% 5.75/1.10    inference(component_clause,[status(thm)],[f954])).
% 5.75/1.10  fof(f957,plain,(
% 5.75/1.10    spl0_164 <=> possibly(X0)=not(necessarily(not(X0)))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f960,plain,(
% 5.75/1.10    ~spl0_163|spl0_164),
% 5.75/1.10    inference(split_clause,[status(thm)],[f333,f954,f957])).
% 5.75/1.10  fof(f968,plain,(
% 5.75/1.10    spl0_167 <=> op_strict_implies),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f970,plain,(
% 5.75/1.10    ~op_strict_implies|spl0_167),
% 5.75/1.10    inference(component_clause,[status(thm)],[f968])).
% 5.75/1.10  fof(f971,plain,(
% 5.75/1.10    spl0_168 <=> strict_implies(X0,X1)=necessarily(implies(X0,X1))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f972,plain,(
% 5.75/1.10    ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1))|~spl0_168)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f971])).
% 5.75/1.10  fof(f974,plain,(
% 5.75/1.10    ~spl0_167|spl0_168),
% 5.75/1.10    inference(split_clause,[status(thm)],[f337,f968,f971])).
% 5.75/1.10  fof(f975,plain,(
% 5.75/1.10    spl0_169 <=> op_strict_equiv),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f977,plain,(
% 5.75/1.10    ~op_strict_equiv|spl0_169),
% 5.75/1.10    inference(component_clause,[status(thm)],[f975])).
% 5.75/1.10  fof(f978,plain,(
% 5.75/1.10    spl0_170 <=> strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f981,plain,(
% 5.75/1.10    ~spl0_169|spl0_170),
% 5.75/1.10    inference(split_clause,[status(thm)],[f339,f975,f978])).
% 5.75/1.10  fof(f982,plain,(
% 5.75/1.10    $false|spl0_169),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f977,f351])).
% 5.75/1.10  fof(f983,plain,(
% 5.75/1.10    spl0_169),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f982])).
% 5.75/1.10  fof(f984,plain,(
% 5.75/1.10    $false|spl0_0),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f355,f214])).
% 5.75/1.10  fof(f985,plain,(
% 5.75/1.10    spl0_0),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f984])).
% 5.75/1.10  fof(f986,plain,(
% 5.75/1.10    $false|spl0_88),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f679,f341])).
% 5.75/1.10  fof(f987,plain,(
% 5.75/1.10    spl0_88),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f986])).
% 5.75/1.10  fof(f988,plain,(
% 5.75/1.10    $false|spl0_5),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f374,f228])).
% 5.75/1.10  fof(f989,plain,(
% 5.75/1.10    spl0_5),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f988])).
% 5.75/1.10  fof(f990,plain,(
% 5.75/1.10    $false|spl0_167),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f970,f349])).
% 5.75/1.10  fof(f991,plain,(
% 5.75/1.10    spl0_167),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f990])).
% 5.75/1.10  fof(f992,plain,(
% 5.75/1.10    $false|spl0_163),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f956,f340])).
% 5.75/1.10  fof(f993,plain,(
% 5.75/1.10    spl0_163),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f992])).
% 5.75/1.10  fof(f994,plain,(
% 5.75/1.10    $false|spl0_86),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f672,f213])).
% 5.75/1.10  fof(f995,plain,(
% 5.75/1.10    spl0_86),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f994])).
% 5.75/1.10  fof(f996,plain,(
% 5.75/1.10    $false|spl0_82),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f658,f212])).
% 5.75/1.10  fof(f997,plain,(
% 5.75/1.10    spl0_82),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f996])).
% 5.75/1.10  fof(f998,plain,(
% 5.75/1.10    $false|spl0_78),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f644,f211])).
% 5.75/1.10  fof(f999,plain,(
% 5.75/1.10    spl0_78),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f998])).
% 5.75/1.10  fof(f1002,plain,(
% 5.75/1.10    $false|~spl0_143|spl0_144),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f886,f881])).
% 5.75/1.10  fof(f1003,plain,(
% 5.75/1.10    ~spl0_143|spl0_144),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1002])).
% 5.75/1.10  fof(f1004,plain,(
% 5.75/1.10    $false|~spl0_110|spl0_111),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f765,f760])).
% 5.75/1.10  fof(f1005,plain,(
% 5.75/1.10    ~spl0_110|spl0_111),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1004])).
% 5.75/1.10  fof(f1006,plain,(
% 5.75/1.10    $false|spl0_109),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f758,f343])).
% 5.75/1.10  fof(f1007,plain,(
% 5.75/1.10    spl0_109),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1006])).
% 5.75/1.10  fof(f1009,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(strict_implies(X0,X1))|~spl0_89|~spl0_168)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f972,f681])).
% 5.75/1.10  fof(f1015,plain,(
% 5.75/1.10    $false|~spl0_137|spl0_138),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f864,f859])).
% 5.75/1.10  fof(f1016,plain,(
% 5.75/1.10    ~spl0_137|spl0_138),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1015])).
% 5.75/1.10  fof(f1017,plain,(
% 5.75/1.10    $false|~spl0_134|spl0_135),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f853,f848])).
% 5.75/1.10  fof(f1018,plain,(
% 5.75/1.10    ~spl0_134|spl0_135),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1017])).
% 5.75/1.10  fof(f1019,plain,(
% 5.75/1.10    $false|~spl0_116|spl0_117),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f787,f782])).
% 5.75/1.10  fof(f1020,plain,(
% 5.75/1.10    ~spl0_116|spl0_117),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1019])).
% 5.75/1.10  fof(f1021,plain,(
% 5.75/1.10    $false|spl0_115),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f780,f345])).
% 5.75/1.10  fof(f1022,plain,(
% 5.75/1.10    spl0_115),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1021])).
% 5.75/1.10  fof(f1023,plain,(
% 5.75/1.10    $false|~spl0_34|spl0_68),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f607,f479])).
% 5.75/1.10  fof(f1024,plain,(
% 5.75/1.10    ~spl0_34|spl0_68),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1023])).
% 5.75/1.10  fof(f1025,plain,(
% 5.75/1.10    $false|spl0_33),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f477,f223])).
% 5.75/1.10  fof(f1026,plain,(
% 5.75/1.10    spl0_33),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1025])).
% 5.75/1.10  fof(f1029,plain,(
% 5.75/1.10    $false|~spl0_22|spl0_52),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f547,f435])).
% 5.75/1.10  fof(f1030,plain,(
% 5.75/1.10    ~spl0_22|spl0_52),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1029])).
% 5.75/1.10  fof(f1031,plain,(
% 5.75/1.10    $false|spl0_21),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f433,f219])).
% 5.75/1.10  fof(f1032,plain,(
% 5.75/1.10    spl0_21),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1031])).
% 5.75/1.10  fof(f1033,plain,(
% 5.75/1.10    $false|~spl0_49|spl0_50),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f539,f534])).
% 5.75/1.10  fof(f1034,plain,(
% 5.75/1.10    ~spl0_49|spl0_50),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1033])).
% 5.75/1.10  fof(f1035,plain,(
% 5.75/1.10    $false|~spl0_31|spl0_32),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f473,f468])).
% 5.75/1.10  fof(f1036,plain,(
% 5.75/1.10    ~spl0_31|spl0_32),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1035])).
% 5.75/1.10  fof(f1037,plain,(
% 5.75/1.10    $false|spl0_30),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f466,f222])).
% 5.75/1.10  fof(f1038,plain,(
% 5.75/1.10    spl0_30),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1037])).
% 5.75/1.10  fof(f1039,plain,(
% 5.75/1.10    $false|~spl0_25|spl0_26),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f451,f446])).
% 5.75/1.10  fof(f1040,plain,(
% 5.75/1.10    ~spl0_25|spl0_26),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1039])).
% 5.75/1.10  fof(f1041,plain,(
% 5.75/1.10    $false|spl0_24),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f444,f220])).
% 5.75/1.10  fof(f1042,plain,(
% 5.75/1.10    spl0_24),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1041])).
% 5.75/1.10  fof(f1043,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(strict_implies(sk0_68,sk0_69),necessarily(implies(sk0_69,sk0_70))),necessarily(implies(sk0_68,sk0_70))))|~spl0_168|spl0_123),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f809])).
% 5.75/1.10  fof(f1044,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(strict_implies(sk0_68,sk0_69),strict_implies(sk0_69,sk0_70)),necessarily(implies(sk0_68,sk0_70))))|~spl0_168|spl0_123),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f1043])).
% 5.75/1.10  fof(f1045,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(strict_implies(sk0_68,sk0_69),strict_implies(sk0_69,sk0_70)),strict_implies(sk0_68,sk0_70)))|~spl0_168|spl0_123),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f1044])).
% 5.75/1.10  fof(f1046,plain,(
% 5.75/1.10    $false|~spl0_13|spl0_14),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f407,f402])).
% 5.75/1.10  fof(f1047,plain,(
% 5.75/1.10    ~spl0_13|spl0_14),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1046])).
% 5.75/1.10  fof(f1048,plain,(
% 5.75/1.10    $false|spl0_12),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f400,f216])).
% 5.75/1.10  fof(f1049,plain,(
% 5.75/1.10    spl0_12),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1048])).
% 5.75/1.10  fof(f1054,plain,(
% 5.75/1.10    $false|~spl0_131|spl0_132),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f842,f837])).
% 5.75/1.10  fof(f1055,plain,(
% 5.75/1.10    ~spl0_131|spl0_132),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1054])).
% 5.75/1.10  fof(f1062,plain,(
% 5.75/1.10    $false|~spl0_113|spl0_114),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f776,f771])).
% 5.75/1.10  fof(f1063,plain,(
% 5.75/1.10    ~spl0_113|spl0_114),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1062])).
% 5.75/1.10  fof(f1064,plain,(
% 5.75/1.10    $false|spl0_112),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f769,f344])).
% 5.75/1.10  fof(f1065,plain,(
% 5.75/1.10    spl0_112),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1064])).
% 5.75/1.10  fof(f1075,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(not(X0),X1))|~spl0_1|~spl0_59)),
% 5.75/1.10    inference(resolution,[status(thm)],[f357,f572])).
% 5.75/1.10  fof(f1076,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,and(X0,X1)))|~spl0_1|~spl0_28)),
% 5.75/1.10    inference(resolution,[status(thm)],[f357,f457])).
% 5.75/1.10  fof(f1077,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,X0))|~spl0_1|~spl0_13)),
% 5.75/1.10    inference(resolution,[status(thm)],[f357,f402])).
% 5.75/1.10  fof(f1093,plain,(
% 5.75/1.10    spl0_173 <=> ~is_a_theorem(X0)|~is_a_theorem(not(X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f1096,plain,(
% 5.75/1.10    spl0_174 <=> is_a_theorem(X1)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f1097,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(X0)|~spl0_174)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f1096])).
% 5.75/1.10  fof(f1099,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(not(X0))|is_a_theorem(X1)|~spl0_59|~spl0_1)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1075,f357])).
% 5.75/1.10  fof(f1100,plain,(
% 5.75/1.10    spl0_173|spl0_174|~spl0_59|~spl0_1),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1099,f1093,f1096,f571,f356])).
% 5.75/1.10  fof(f1102,plain,(
% 5.75/1.10    $false|~spl0_22|spl0_23),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f440,f435])).
% 5.75/1.10  fof(f1103,plain,(
% 5.75/1.10    ~spl0_22|spl0_23),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1102])).
% 5.75/1.10  fof(f1104,plain,(
% 5.75/1.10    $false|~spl0_34|spl0_35),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f484,f479])).
% 5.75/1.10  fof(f1105,plain,(
% 5.75/1.10    ~spl0_34|spl0_35),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1104])).
% 5.75/1.10  fof(f1110,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(strict_implies(X0,X1))|~spl0_89|~spl0_168)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f972,f681])).
% 5.75/1.10  fof(f1137,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(strict_implies(and(X0,X1),X0))|~spl0_89|~spl0_168|~spl0_22)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1009,f435])).
% 5.75/1.10  fof(f1138,plain,(
% 5.75/1.10    spl0_137|~spl0_89|~spl0_168|~spl0_22),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1137,f858,f680,f971,f434])).
% 5.75/1.10  fof(f1139,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(strict_implies(and(X0,X1),X1))|~spl0_89|~spl0_168|~spl0_25)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1009,f446])).
% 5.75/1.10  fof(f1145,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(strict_implies(X0,X1))|~is_a_theorem(X1)|~spl0_89|~spl0_168|~spl0_1|~spl0_13)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1009,f1077])).
% 5.75/1.10  fof(f1159,plain,(
% 5.75/1.10    $false|~spl0_19|spl0_20),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f429,f424])).
% 5.75/1.10  fof(f1160,plain,(
% 5.75/1.10    ~spl0_19|spl0_20),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1159])).
% 5.75/1.10  fof(f1161,plain,(
% 5.75/1.10    $false|spl0_18),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f422,f218])).
% 5.75/1.10  fof(f1162,plain,(
% 5.75/1.10    spl0_18),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1161])).
% 5.75/1.10  fof(f1163,plain,(
% 5.75/1.10    $false|~spl0_19|spl0_57),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f566,f424])).
% 5.75/1.10  fof(f1164,plain,(
% 5.75/1.10    ~spl0_19|spl0_57),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1163])).
% 5.75/1.10  fof(f1167,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(strict_implies(necessarily(X0),necessarily(necessarily(X0))))|~spl0_113|~spl0_89|~spl0_168)),
% 5.75/1.10    inference(resolution,[status(thm)],[f771,f1009])).
% 5.75/1.10  fof(f1168,plain,(
% 5.75/1.10    spl0_131|~spl0_113|~spl0_89|~spl0_168),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1167,f836,f770,f680,f971])).
% 5.75/1.10  fof(f1196,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(and(X1,X0))|~is_a_theorem(X1)|~spl0_1|~spl0_28)),
% 5.75/1.10    inference(resolution,[status(thm)],[f357,f1076])).
% 5.75/1.10  fof(f1205,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(and(strict_implies(X0,X1),necessarily(implies(X1,X2))),necessarily(implies(X0,X2))))|~spl0_168|~spl0_122)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f804])).
% 5.75/1.10  fof(f1206,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),necessarily(implies(X0,X2))))|~spl0_168|~spl0_122)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f1205])).
% 5.75/1.10  fof(f1207,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))|~spl0_168|~spl0_122)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f972,f1206])).
% 5.75/1.10  fof(f1293,plain,(
% 5.75/1.10    ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~spl0_83|~spl0_79)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f660,f646])).
% 5.75/1.10  fof(f1295,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0)))|~spl0_83|~spl0_79|~spl0_10)),
% 5.75/1.10    inference(backward_demodulation,[status(thm)],[f1293,f391])).
% 5.75/1.10  fof(f1299,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(or(X0,or(not(X0),X1)))|~spl0_31|~spl0_83|~spl0_79)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f1293,f468])).
% 5.75/1.10  fof(f1346,plain,(
% 5.75/1.10    ~is_a_theorem(and(sk0_77,sk0_76))|spl0_135|~spl0_89|~spl0_168|~spl0_1|~spl0_13),
% 5.75/1.10    inference(resolution,[status(thm)],[f853,f1145])).
% 5.75/1.10  fof(f1391,plain,(
% 5.75/1.10    ![X0,X1,X2]: (is_a_theorem(strict_implies(and(strict_implies(X0,X1),strict_implies(X1,X2)),strict_implies(X0,X2)))|~spl0_89|~spl0_168|~spl0_122)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1110,f1207])).
% 5.75/1.10  fof(f1409,plain,(
% 5.75/1.10    $false|~spl0_122|~spl0_168|spl0_123),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f1045,f1207])).
% 5.75/1.10  fof(f1410,plain,(
% 5.75/1.10    ~spl0_122|~spl0_168|spl0_123),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1409])).
% 5.75/1.10  fof(f1441,plain,(
% 5.75/1.10    ~is_a_theorem(implies(or(sk0_43,sk0_43),sk0_43))|~spl0_83|~spl0_79|spl0_63),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f588])).
% 5.75/1.10  fof(f1460,plain,(
% 5.75/1.10    spl0_177 <=> is_a_theorem(sk0_76)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f1463,plain,(
% 5.75/1.10    spl0_178 <=> is_a_theorem(sk0_77)),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f1466,plain,(
% 5.75/1.10    ~is_a_theorem(sk0_76)|~is_a_theorem(sk0_77)|~spl0_28|spl0_135|~spl0_89|~spl0_168|~spl0_1|~spl0_13),
% 5.75/1.10    inference(resolution,[status(thm)],[f1196,f1346])).
% 5.75/1.10  fof(f1467,plain,(
% 5.75/1.10    ~spl0_177|~spl0_178|~spl0_28|spl0_135|~spl0_89|~spl0_168|~spl0_1|~spl0_13),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1466,f1460,f1463,f456,f851,f680,f971,f356,f401])).
% 5.75/1.10  fof(f1468,plain,(
% 5.75/1.10    ~is_a_theorem(sk0_59)|~is_a_theorem(sk0_58)|~spl0_1|~spl0_28|spl0_101),
% 5.75/1.10    inference(resolution,[status(thm)],[f1196,f728])).
% 5.75/1.10  fof(f1469,plain,(
% 5.75/1.10    ~spl0_100|~spl0_99|~spl0_1|~spl0_28|spl0_101),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1468,f722,f718,f356,f456,f726])).
% 5.75/1.10  fof(f1505,plain,(
% 5.75/1.10    $false|spl0_27),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f455,f221])).
% 5.75/1.10  fof(f1506,plain,(
% 5.75/1.10    spl0_27),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1505])).
% 5.75/1.10  fof(f1521,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|is_a_theorem(equiv(X0,X1))|~spl0_98|~spl0_87)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f674,f715])).
% 5.75/1.10  fof(f1566,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(implies(X0,implies(X0,X1)))|is_a_theorem(implies(X0,X1))|~spl0_1|~spl0_16)),
% 5.75/1.10    inference(resolution,[status(thm)],[f357,f413])).
% 5.75/1.10  fof(f1614,plain,(
% 5.75/1.10    $false|~spl0_40|spl0_41),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f506,f501])).
% 5.75/1.10  fof(f1615,plain,(
% 5.75/1.10    ~spl0_40|spl0_41),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1614])).
% 5.75/1.10  fof(f1616,plain,(
% 5.75/1.10    $false|spl0_39),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f499,f225])).
% 5.75/1.10  fof(f1617,plain,(
% 5.75/1.10    spl0_39),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1616])).
% 5.75/1.10  fof(f1618,plain,(
% 5.75/1.10    $false|~spl0_43|spl0_44),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f517,f512])).
% 5.75/1.10  fof(f1619,plain,(
% 5.75/1.10    ~spl0_43|spl0_44),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1618])).
% 5.75/1.10  fof(f1620,plain,(
% 5.75/1.10    $false|spl0_42),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f510,f226])).
% 5.75/1.10  fof(f1621,plain,(
% 5.75/1.10    spl0_42),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1620])).
% 5.75/1.10  fof(f1622,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_41,or(sk0_41,sk0_42)))|~spl0_83|~spl0_79|spl0_60),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f577])).
% 5.75/1.10  fof(f1623,plain,(
% 5.75/1.10    $false|~spl0_31|~spl0_83|~spl0_79|spl0_60),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f1622,f468])).
% 5.75/1.10  fof(f1624,plain,(
% 5.75/1.10    ~spl0_31|~spl0_83|~spl0_79|spl0_60),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1623])).
% 5.75/1.10  fof(f1654,plain,(
% 5.75/1.10    ~is_a_theorem(implies(or(sk0_5,not(sk0_4)),implies(sk0_4,sk0_5)))|~spl0_83|~spl0_79|spl0_11),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f396])).
% 5.75/1.10  fof(f1700,plain,(
% 5.75/1.10    $false|~spl0_16|spl0_17),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f418,f413])).
% 5.75/1.10  fof(f1701,plain,(
% 5.75/1.10    ~spl0_16|spl0_17),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1700])).
% 5.75/1.10  fof(f1702,plain,(
% 5.75/1.10    $false|spl0_15),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f411,f217])).
% 5.75/1.10  fof(f1703,plain,(
% 5.75/1.10    spl0_15),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1702])).
% 5.75/1.10  fof(f1704,plain,(
% 5.75/1.10    $false|~spl0_37|spl0_38),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f495,f490])).
% 5.75/1.10  fof(f1705,plain,(
% 5.75/1.10    ~spl0_37|spl0_38),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1704])).
% 5.75/1.10  fof(f1706,plain,(
% 5.75/1.10    $false|spl0_36),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f488,f224])).
% 5.75/1.10  fof(f1707,plain,(
% 5.75/1.10    spl0_36),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1706])).
% 5.75/1.10  fof(f1708,plain,(
% 5.75/1.10    $false|~spl0_46|spl0_47),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f528,f523])).
% 5.75/1.10  fof(f1709,plain,(
% 5.75/1.10    ~spl0_46|spl0_47),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1708])).
% 5.75/1.10  fof(f1710,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))|~spl0_28|~spl0_87)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f674,f457])).
% 5.75/1.10  fof(f1711,plain,(
% 5.75/1.10    spl0_46|~spl0_28|~spl0_87),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1710,f522,f456,f673])).
% 5.75/1.10  fof(f1712,plain,(
% 5.75/1.10    $false|spl0_45),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f521,f227])).
% 5.75/1.10  fof(f1713,plain,(
% 5.75/1.10    spl0_45),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1712])).
% 5.75/1.10  fof(f1742,plain,(
% 5.75/1.10    $false|~spl0_146|spl0_147),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f897,f892])).
% 5.75/1.10  fof(f1743,plain,(
% 5.75/1.10    ~spl0_146|spl0_147),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1742])).
% 5.75/1.10  fof(f1746,plain,(
% 5.75/1.10    $false|~spl0_10|~spl0_83|~spl0_79|spl0_11),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f1654,f1295])).
% 5.75/1.10  fof(f1747,plain,(
% 5.75/1.10    ~spl0_10|~spl0_83|~spl0_79|spl0_11),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1746])).
% 5.75/1.10  fof(f1748,plain,(
% 5.75/1.10    $false|spl0_9),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f389,f215])).
% 5.75/1.10  fof(f1749,plain,(
% 5.75/1.10    spl0_9),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f1748])).
% 5.75/1.10  fof(f1753,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(or(X0,not(X1)))|is_a_theorem(implies(X1,X0))|~spl0_83|~spl0_79|~spl0_10|~spl0_1)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1295,f357])).
% 5.75/1.10  fof(f1758,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(or(X0,not(not(X1))),or(X1,X0)))|~spl0_10|~spl0_83|~spl0_79)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f1293,f1295])).
% 5.75/1.10  fof(f2434,plain,(
% 5.75/1.10    spl0_146|~spl0_89|~spl0_168|~spl0_122),
% 5.75/1.10    inference(split_clause,[status(thm)],[f1391,f891,f680,f971,f803])).
% 5.75/1.10  fof(f2773,plain,(
% 5.75/1.10    $false|~spl0_174|spl0_101),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f728,f1097])).
% 5.75/1.10  fof(f2774,plain,(
% 5.75/1.10    ~spl0_174|spl0_101),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f2773])).
% 5.75/1.10  fof(f2874,plain,(
% 5.75/1.10    spl0_198 <=> is_a_theorem(implies(sk0_60,sk0_60))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f2876,plain,(
% 5.75/1.10    ~is_a_theorem(implies(sk0_60,sk0_60))|spl0_198),
% 5.75/1.10    inference(component_clause,[status(thm)],[f2874])).
% 5.75/1.10  fof(f3155,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_1|~spl0_16|~spl0_28)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1566,f457])).
% 5.75/1.10  fof(f3156,plain,(
% 5.75/1.10    spl0_49|~spl0_1|~spl0_16|~spl0_28),
% 5.75/1.10    inference(split_clause,[status(thm)],[f3155,f533,f356,f412,f456])).
% 5.75/1.10  fof(f3157,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(X0,X0))|~spl0_1|~spl0_16|~spl0_13)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1566,f402])).
% 5.75/1.10  fof(f3165,plain,(
% 5.75/1.10    $false|~spl0_1|~spl0_16|~spl0_13|spl0_198),
% 5.75/1.10    inference(backward_subsumption_resolution,[status(thm)],[f2876,f3157])).
% 5.75/1.10  fof(f3166,plain,(
% 5.75/1.10    ~spl0_1|~spl0_16|~spl0_13|spl0_198),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f3165])).
% 5.75/1.10  fof(f3169,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(strict_implies(X0,X0))|~spl0_1|~spl0_16|~spl0_13|~spl0_89|~spl0_168)),
% 5.75/1.10    inference(resolution,[status(thm)],[f3157,f1110])).
% 5.75/1.10  fof(f3173,plain,(
% 5.75/1.10    spl0_202 <=> is_a_theorem(implies(and(sk0_32,sk0_32),sk0_32))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f3175,plain,(
% 5.75/1.10    ~is_a_theorem(implies(and(sk0_32,sk0_32),sk0_32))|spl0_202),
% 5.75/1.10    inference(component_clause,[status(thm)],[f3173])).
% 5.75/1.10  fof(f3187,plain,(
% 5.75/1.10    $false|~spl0_25|spl0_202),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f3175,f446])).
% 5.75/1.10  fof(f3188,plain,(
% 5.75/1.10    ~spl0_25|spl0_202),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f3187])).
% 5.75/1.10  fof(f3216,plain,(
% 5.75/1.10    ![X0]: (~is_a_theorem(implies(and(X0,X0),X0))|is_a_theorem(equiv(and(X0,X0),X0))|~spl0_49|~spl0_98|~spl0_87)),
% 5.75/1.10    inference(resolution,[status(thm)],[f534,f1521])).
% 5.75/1.10  fof(f3217,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(equiv(and(X0,X0),X0))|~spl0_25|~spl0_49|~spl0_98|~spl0_87)),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f3216,f446])).
% 5.75/1.10  fof(f3219,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(strict_implies(X0,and(X0,X0)))|~spl0_49|~spl0_89|~spl0_168)),
% 5.75/1.10    inference(resolution,[status(thm)],[f534,f1110])).
% 5.75/1.10  fof(f3220,plain,(
% 5.75/1.10    spl0_143|~spl0_49|~spl0_89|~spl0_168),
% 5.75/1.10    inference(split_clause,[status(thm)],[f3219,f880,f533,f680,f971])).
% 5.75/1.10  fof(f3224,plain,(
% 5.75/1.10    spl0_205 <=> is_a_theorem(strict_implies(and(sk0_83,sk0_83),sk0_83))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f3226,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(and(sk0_83,sk0_83),sk0_83))|spl0_205),
% 5.75/1.10    inference(component_clause,[status(thm)],[f3224])).
% 5.75/1.10  fof(f3237,plain,(
% 5.75/1.10    $false|~spl0_89|~spl0_168|~spl0_25|spl0_205),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f3226,f1139])).
% 5.75/1.10  fof(f3238,plain,(
% 5.75/1.10    ~spl0_89|~spl0_168|~spl0_25|spl0_205),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f3237])).
% 5.75/1.10  fof(f3251,plain,(
% 5.75/1.10    ![X0]: (and(X0,X0)=X0|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(resolution,[status(thm)],[f3217,f376])).
% 5.75/1.10  fof(f3267,plain,(
% 5.75/1.10    ![X0]: (implies(not(X0),X0)=not(not(X0))|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f3251,f660])).
% 5.75/1.10  fof(f3268,plain,(
% 5.75/1.10    ![X0]: (or(X0,X0)=not(not(X0))|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f3267])).
% 5.75/1.10  fof(f3283,plain,(
% 5.75/1.10    ~is_a_theorem(implies(not(not(sk0_43)),sk0_43))|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|spl0_63),
% 5.75/1.10    inference(backward_demodulation,[status(thm)],[f3268,f1441])).
% 5.75/1.10  fof(f3284,plain,(
% 5.75/1.10    ~is_a_theorem(or(not(sk0_43),sk0_43))|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|spl0_63),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f3283])).
% 5.75/1.10  fof(f3296,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(or(X0,not(not(not(X0)))))|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f3268,f1299])).
% 5.75/1.10  fof(f3324,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(X0,not(not(X0))))|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f3268,f468])).
% 5.75/1.10  fof(f3452,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(or(X0,X0),X0))|~spl0_83|~spl0_79|~spl0_62)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f583])).
% 5.75/1.10  fof(f3453,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(not(not(X0)),X0))|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_62)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f3268,f3452])).
% 5.75/1.10  fof(f3454,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(or(not(X0),X0))|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_62)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f3453])).
% 5.75/1.10  fof(f3587,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(implies(not(not(X0)),X0))|~spl0_31|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_10|~spl0_1)),
% 5.75/1.10    inference(resolution,[status(thm)],[f3296,f1753])).
% 5.75/1.10  fof(f6729,plain,(
% 5.75/1.10    spl0_219 <=> ~is_a_theorem(strict_implies(X0,X0))),
% 5.75/1.10    introduced(split_symbol_definition)).
% 5.75/1.10  fof(f6730,plain,(
% 5.75/1.10    ![X0]: (~is_a_theorem(strict_implies(X0,X0))|~spl0_219)),
% 5.75/1.10    inference(component_clause,[status(thm)],[f6729])).
% 5.75/1.10  fof(f6871,plain,(
% 5.75/1.10    $false|~spl0_1|~spl0_16|~spl0_13|~spl0_89|~spl0_168|~spl0_219),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f6730,f3169])).
% 5.75/1.10  fof(f6872,plain,(
% 5.75/1.10    ~spl0_1|~spl0_16|~spl0_13|~spl0_89|~spl0_168|~spl0_219),
% 5.75/1.10    inference(contradiction_clause,[status(thm)],[f6871])).
% 5.75/1.10  fof(f7439,plain,(
% 5.75/1.10    ![X0]: (~is_a_theorem(implies(not(not(X0)),X0))|is_a_theorem(equiv(not(not(X0)),X0))|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(resolution,[status(thm)],[f1521,f3324])).
% 5.75/1.10  fof(f7440,plain,(
% 5.75/1.10    ![X0]: (~is_a_theorem(or(not(X0),X0))|is_a_theorem(equiv(not(not(X0)),X0))|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f1293,f7439])).
% 5.75/1.10  fof(f7441,plain,(
% 5.75/1.10    ![X0]: (is_a_theorem(equiv(not(not(X0)),X0))|~spl0_62|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f7440,f3454])).
% 5.75/1.10  fof(f7451,plain,(
% 5.75/1.10    ![X0]: (not(not(X0))=X0|~spl0_62|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(resolution,[status(thm)],[f7441,f376])).
% 5.75/1.10  fof(f7468,plain,(
% 5.75/1.10    ![X0,X1]: (not(implies(X0,X1))=and(X0,not(X1))|~spl0_62|~spl0_31|~spl0_79|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f660,f7451])).
% 5.75/1.10  fof(f7487,plain,(
% 5.75/1.10    ![X0,X1]: (or(not(X0),X1)=implies(X0,X1)|~spl0_62|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f7451,f1293])).
% 5.75/1.10  fof(f7488,plain,(
% 5.75/1.10    spl0_85|~spl0_62|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6),
% 5.75/1.10    inference(split_clause,[status(thm)],[f7487,f666,f582,f467,f645,f659,f445,f533,f714,f673,f375])).
% 5.75/1.10  fof(f8068,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,X0)))|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_10|~spl0_83|~spl0_79)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f7451,f1758])).
% 5.75/1.10  fof(f8072,plain,(
% 5.75/1.10    ![X0,X1]: (~is_a_theorem(implies(or(X0,X1),or(X1,X0)))|is_a_theorem(equiv(or(X0,X1),or(X1,X0)))|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_6|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87)),
% 5.75/1.10    inference(resolution,[status(thm)],[f8068,f1521])).
% 5.75/1.10  fof(f8073,plain,(
% 5.75/1.10    ![X0,X1]: (is_a_theorem(equiv(or(X0,X1),or(X1,X0)))|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_6|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87)),
% 5.75/1.10    inference(forward_subsumption_resolution,[status(thm)],[f8072,f8068])).
% 5.75/1.10  fof(f9132,plain,(
% 5.75/1.10    ![X0,X1]: (not(implies(X0,not(X1)))=and(X0,X1)|~spl0_62|~spl0_31|~spl0_79|~spl0_83|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f7451,f7468])).
% 5.75/1.10  fof(f9512,plain,(
% 5.75/1.10    ![X0,X1]: (or(X0,X1)=or(X1,X0)|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6)),
% 5.75/1.10    inference(resolution,[status(thm)],[f8073,f376])).
% 5.75/1.10  fof(f9524,plain,(
% 5.75/1.10    ![X0,X1]: (implies(X0,X1)=or(X1,not(X0))|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f667,f9512])).
% 5.75/1.10  fof(f9685,plain,(
% 5.75/1.10    ![X0,X1]: (implies(X0,not(X1))=implies(X1,not(X0))|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f667,f9524])).
% 5.75/1.10  fof(f10470,plain,(
% 5.75/1.10    ![X0,X1]: (not(implies(X0,not(X1)))=and(X1,X0)|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85)),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f9685,f9132])).
% 5.75/1.10  fof(f10471,plain,(
% 5.75/1.10    ![X0,X1]: (and(X0,X1)=and(X1,X0)|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85)),
% 5.75/1.10    inference(forward_demodulation,[status(thm)],[f9132,f10470])).
% 5.75/1.10  fof(f10809,plain,(
% 5.75/1.10    ~is_a_theorem(strict_implies(and(sk0_76,sk0_77),and(sk0_76,sk0_77)))|spl0_135|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85),
% 5.75/1.10    inference(paramodulation,[status(thm)],[f10471,f853])).
% 5.75/1.11  fof(f10810,plain,(
% 5.75/1.11    $false|~spl0_1|~spl0_16|~spl0_13|~spl0_89|~spl0_168|spl0_135|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85),
% 5.75/1.11    inference(forward_subsumption_resolution,[status(thm)],[f10809,f3169])).
% 5.75/1.11  fof(f10811,plain,(
% 5.75/1.11    ~spl0_1|~spl0_16|~spl0_13|~spl0_89|~spl0_168|spl0_135|~spl0_62|~spl0_31|~spl0_25|~spl0_49|~spl0_10|~spl0_83|~spl0_79|~spl0_98|~spl0_87|~spl0_6|~spl0_85),
% 5.75/1.11    inference(contradiction_clause,[status(thm)],[f10810])).
% 5.75/1.11  fof(f10883,plain,(
% 5.75/1.11    $false|~spl0_133),
% 5.75/1.11    inference(forward_subsumption_resolution,[status(thm)],[f845,f352])).
% 5.75/1.11  fof(f10884,plain,(
% 5.75/1.11    ~spl0_133),
% 5.75/1.11    inference(contradiction_clause,[status(thm)],[f10883])).
% 5.75/1.11  fof(f10893,plain,(
% 5.75/1.11    ![X0]: (is_a_theorem(or(not(X0),X0))|~spl0_31|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_10|~spl0_1)),
% 5.75/1.11    inference(forward_demodulation,[status(thm)],[f1293,f3587])).
% 5.75/1.11  fof(f11075,plain,(
% 5.75/1.11    $false|~spl0_31|~spl0_10|~spl0_1|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|spl0_63),
% 5.75/1.11    inference(forward_subsumption_resolution,[status(thm)],[f3284,f10893])).
% 5.75/1.11  fof(f11076,plain,(
% 5.75/1.11    ~spl0_31|~spl0_10|~spl0_1|~spl0_25|~spl0_49|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|spl0_63),
% 5.75/1.11    inference(contradiction_clause,[status(thm)],[f11075])).
% 5.75/1.11  fof(f11077,plain,(
% 5.75/1.11    $false),
% 5.75/1.11    inference(sat_refutation,[status(thm)],[f359,f378,f393,f404,f415,f426,f437,f448,f459,f470,f481,f492,f503,f514,f540,f548,f567,f574,f578,f585,f589,f608,f648,f662,f676,f683,f717,f721,f725,f729,f751,f755,f762,f773,f784,f806,f810,f843,f854,f865,f887,f894,f898,f960,f974,f981,f983,f985,f987,f989,f991,f993,f995,f997,f999,f1003,f1005,f1007,f1016,f1018,f1020,f1022,f1024,f1026,f1030,f1032,f1034,f1036,f1038,f1040,f1042,f1047,f1049,f1055,f1063,f1065,f1100,f1103,f1105,f1138,f1160,f1162,f1164,f1168,f1410,f1467,f1469,f1506,f1615,f1617,f1619,f1621,f1624,f1701,f1703,f1705,f1707,f1709,f1711,f1713,f1743,f1747,f1749,f2434,f2774,f3156,f3166,f3188,f3220,f3238,f6872,f7488,f10811,f10884,f11076])).
% 5.75/1.11  % SZS output end CNFRefutation for theBenchmark.p
% 5.75/1.13  % Elapsed time: 0.768432 seconds
% 5.75/1.13  % CPU time: 5.887137 seconds
% 5.75/1.13  % Memory used: 196.629 MB
%------------------------------------------------------------------------------