TSTP Solution File: LCL539+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : LCL539+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n017.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:33 EDT 2023
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL539+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n017.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue May 30 09:11:25 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.5.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% 0.14/0.40 fof(f1,axiom,(
% 0.14/0.40 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f2,axiom,(
% 0.14/0.40 ( substitution_of_equivalents<=> (! [X,Y] :( is_a_theorem(equiv(X,Y))=> X = Y ) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f7,axiom,(
% 0.14/0.40 ( and_1<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),X)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f8,axiom,(
% 0.14/0.40 ( and_2<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),Y)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f9,axiom,(
% 0.14/0.40 ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f31,axiom,(
% 0.14/0.40 ( op_equiv=> (! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f34,axiom,(
% 0.14/0.40 op_equiv ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f35,axiom,(
% 0.14/0.40 modus_ponens ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f36,axiom,(
% 0.14/0.40 modus_tollens ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f38,axiom,(
% 0.14/0.40 implies_2 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f40,axiom,(
% 0.14/0.40 and_1 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f41,axiom,(
% 0.14/0.40 and_2 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f42,axiom,(
% 0.14/0.40 and_3 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f45,axiom,(
% 0.14/0.40 or_3 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f46,axiom,(
% 0.14/0.40 equivalence_1 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f47,axiom,(
% 0.14/0.40 equivalence_2 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f48,axiom,(
% 0.14/0.40 equivalence_3 ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f49,axiom,(
% 0.14/0.40 substitution_of_equivalents ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f52,axiom,(
% 0.14/0.40 ( adjunction<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(Y) )=> is_a_theorem(and(X,Y)) ) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f53,axiom,(
% 0.14/0.40 ( substitution_strict_equiv<=> (! [X,Y] :( is_a_theorem(strict_equiv(X,Y))=> X = Y ) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f55,axiom,(
% 0.14/0.40 ( axiom_M<=> (! [X] : is_a_theorem(implies(necessarily(X),X)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f75,axiom,(
% 0.14/0.40 ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f76,axiom,(
% 0.14/0.40 ( op_strict_equiv=> (! [X,Y] : strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X)) )) ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f80,axiom,(
% 0.14/0.40 axiom_M ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f86,axiom,(
% 0.14/0.40 op_strict_implies ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f88,axiom,(
% 0.14/0.40 op_strict_equiv ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f89,conjecture,(
% 0.14/0.40 substitution_strict_equiv ),
% 0.14/0.40 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.14/0.40 fof(f90,negated_conjecture,(
% 0.14/0.40 ~(substitution_strict_equiv )),
% 0.14/0.40 inference(negated_conjecture,[status(cth)],[f89])).
% 0.14/0.40 fof(f91,plain,(
% 0.14/0.40 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f1])).
% 0.14/0.40 fof(f92,plain,(
% 0.14/0.40 (~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))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f91])).
% 0.14/0.40 fof(f93,plain,(
% 0.14/0.40 (~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))))),
% 0.14/0.40 inference(miniscoping,[status(esa)],[f92])).
% 0.14/0.40 fof(f94,plain,(
% 0.14/0.40 (~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)))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f93])).
% 0.14/0.40 fof(f95,plain,(
% 0.14/0.40 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f94])).
% 0.14/0.40 fof(f99,plain,(
% 0.14/0.40 substitution_of_equivalents<=>(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 0.14/0.40 fof(f100,plain,(
% 0.14/0.40 (~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)))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f99])).
% 0.14/0.40 fof(f101,plain,(
% 0.14/0.40 (~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))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f100])).
% 0.14/0.40 fof(f102,plain,(
% 0.14/0.40 ![X0,X1]: (~substitution_of_equivalents|~is_a_theorem(equiv(X0,X1))|X0=X1)),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f101])).
% 0.14/0.40 fof(f121,plain,(
% 0.14/0.40 (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|(?[X,Y]: ~is_a_theorem(implies(and(X,Y),X))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f7])).
% 0.14/0.40 fof(f122,plain,(
% 0.14/0.40 (~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)))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f121])).
% 0.14/0.40 fof(f123,plain,(
% 0.14/0.40 ![X0,X1]: (~and_1|is_a_theorem(implies(and(X0,X1),X0)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f122])).
% 0.14/0.40 fof(f125,plain,(
% 0.14/0.40 (~and_2|(![X,Y]: is_a_theorem(implies(and(X,Y),Y))))&(and_2|(?[X,Y]: ~is_a_theorem(implies(and(X,Y),Y))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f8])).
% 0.14/0.40 fof(f126,plain,(
% 0.14/0.40 (~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)))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f125])).
% 0.14/0.40 fof(f127,plain,(
% 0.14/0.40 ![X0,X1]: (~and_2|is_a_theorem(implies(and(X0,X1),X1)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f126])).
% 0.14/0.40 fof(f129,plain,(
% 0.14/0.40 (~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))))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f9])).
% 0.14/0.40 fof(f130,plain,(
% 0.14/0.40 (~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)))))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f129])).
% 0.14/0.40 fof(f131,plain,(
% 0.14/0.40 ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f130])).
% 0.14/0.40 fof(f209,plain,(
% 0.14/0.40 ~op_equiv|(![X,Y]: equiv(X,Y)=and(implies(X,Y),implies(Y,X)))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f31])).
% 0.14/0.40 fof(f210,plain,(
% 0.14/0.40 ![X0,X1]: (~op_equiv|equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f209])).
% 0.14/0.40 fof(f213,plain,(
% 0.14/0.40 op_equiv),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f34])).
% 0.14/0.40 fof(f214,plain,(
% 0.14/0.40 modus_ponens),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f35])).
% 0.14/0.40 fof(f215,plain,(
% 0.14/0.40 modus_tollens),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f36])).
% 0.14/0.40 fof(f217,plain,(
% 0.14/0.40 implies_2),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f38])).
% 0.14/0.40 fof(f219,plain,(
% 0.14/0.40 and_1),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f40])).
% 0.14/0.40 fof(f220,plain,(
% 0.14/0.40 and_2),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f41])).
% 0.14/0.40 fof(f221,plain,(
% 0.14/0.40 and_3),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f42])).
% 0.14/0.40 fof(f224,plain,(
% 0.14/0.40 or_3),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f45])).
% 0.14/0.40 fof(f225,plain,(
% 0.14/0.40 equivalence_1),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f46])).
% 0.14/0.40 fof(f226,plain,(
% 0.14/0.40 equivalence_2),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f47])).
% 0.14/0.40 fof(f227,plain,(
% 0.14/0.40 equivalence_3),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f48])).
% 0.14/0.40 fof(f228,plain,(
% 0.14/0.40 substitution_of_equivalents),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f49])).
% 0.14/0.40 fof(f243,plain,(
% 0.14/0.40 adjunction<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y))))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f52])).
% 0.14/0.40 fof(f244,plain,(
% 0.14/0.40 (~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)))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f243])).
% 0.14/0.40 fof(f245,plain,(
% 0.14/0.40 (~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))))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f244])).
% 0.14/0.40 fof(f246,plain,(
% 0.14/0.40 ![X0,X1]: (~adjunction|~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f245])).
% 0.14/0.40 fof(f247,plain,(
% 0.14/0.40 adjunction|is_a_theorem(sk0_58)),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f245])).
% 0.14/0.40 fof(f248,plain,(
% 0.14/0.40 adjunction|is_a_theorem(sk0_59)),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f245])).
% 0.14/0.40 fof(f249,plain,(
% 0.14/0.40 adjunction|~is_a_theorem(and(sk0_58,sk0_59))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f245])).
% 0.14/0.40 fof(f250,plain,(
% 0.14/0.40 substitution_strict_equiv<=>(![X,Y]: (~is_a_theorem(strict_equiv(X,Y))|X=Y))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f53])).
% 0.14/0.40 fof(f251,plain,(
% 0.14/0.40 (~substitution_strict_equiv|(![X,Y]: (~is_a_theorem(strict_equiv(X,Y))|X=Y)))&(substitution_strict_equiv|(?[X,Y]: (is_a_theorem(strict_equiv(X,Y))&~X=Y)))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f250])).
% 0.14/0.40 fof(f252,plain,(
% 0.14/0.40 (~substitution_strict_equiv|(![X,Y]: (~is_a_theorem(strict_equiv(X,Y))|X=Y)))&(substitution_strict_equiv|(is_a_theorem(strict_equiv(sk0_60,sk0_61))&~sk0_60=sk0_61))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f251])).
% 0.14/0.40 fof(f254,plain,(
% 0.14/0.40 substitution_strict_equiv|is_a_theorem(strict_equiv(sk0_60,sk0_61))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f252])).
% 0.14/0.40 fof(f255,plain,(
% 0.14/0.40 substitution_strict_equiv|~sk0_60=sk0_61),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f252])).
% 0.14/0.40 fof(f260,plain,(
% 0.14/0.40 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|(?[X]: ~is_a_theorem(implies(necessarily(X),X))))),
% 0.14/0.40 inference(NNF_transformation,[status(esa)],[f55])).
% 0.14/0.40 fof(f261,plain,(
% 0.14/0.40 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|~is_a_theorem(implies(necessarily(sk0_64),sk0_64)))),
% 0.14/0.40 inference(skolemization,[status(esa)],[f260])).
% 0.14/0.40 fof(f262,plain,(
% 0.14/0.40 ![X0]: (~axiom_M|is_a_theorem(implies(necessarily(X0),X0)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f261])).
% 0.14/0.40 fof(f336,plain,(
% 0.14/0.40 ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f75])).
% 0.14/0.40 fof(f337,plain,(
% 0.14/0.40 ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f336])).
% 0.14/0.40 fof(f338,plain,(
% 0.14/0.40 ~op_strict_equiv|(![X,Y]: strict_equiv(X,Y)=and(strict_implies(X,Y),strict_implies(Y,X)))),
% 0.14/0.40 inference(pre_NNF_transformation,[status(esa)],[f76])).
% 0.14/0.40 fof(f339,plain,(
% 0.14/0.40 ![X0,X1]: (~op_strict_equiv|strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0)))),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f338])).
% 0.14/0.40 fof(f343,plain,(
% 0.14/0.40 axiom_M),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f80])).
% 0.14/0.40 fof(f349,plain,(
% 0.14/0.40 op_strict_implies),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f86])).
% 0.14/0.40 fof(f351,plain,(
% 0.14/0.40 op_strict_equiv),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f88])).
% 0.14/0.40 fof(f352,plain,(
% 0.14/0.40 ~substitution_strict_equiv),
% 0.14/0.40 inference(cnf_transformation,[status(esa)],[f90])).
% 0.14/0.40 fof(f353,plain,(
% 0.14/0.40 spl0_0 <=> modus_ponens),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f355,plain,(
% 0.14/0.40 ~modus_ponens|spl0_0),
% 0.14/0.40 inference(component_clause,[status(thm)],[f353])).
% 0.14/0.40 fof(f356,plain,(
% 0.14/0.40 spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f357,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f356])).
% 0.14/0.40 fof(f359,plain,(
% 0.14/0.40 ~spl0_0|spl0_1),
% 0.14/0.40 inference(split_clause,[status(thm)],[f95,f353,f356])).
% 0.14/0.40 fof(f372,plain,(
% 0.14/0.40 spl0_5 <=> substitution_of_equivalents),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f374,plain,(
% 0.14/0.40 ~substitution_of_equivalents|spl0_5),
% 0.14/0.40 inference(component_clause,[status(thm)],[f372])).
% 0.14/0.40 fof(f375,plain,(
% 0.14/0.40 spl0_6 <=> ~is_a_theorem(equiv(X0,X1))|X0=X1),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f376,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(equiv(X0,X1))|X0=X1|~spl0_6)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f375])).
% 0.14/0.40 fof(f378,plain,(
% 0.14/0.40 ~spl0_5|spl0_6),
% 0.14/0.40 inference(split_clause,[status(thm)],[f102,f372,f375])).
% 0.14/0.40 fof(f387,plain,(
% 0.14/0.40 spl0_9 <=> modus_tollens),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f389,plain,(
% 0.14/0.40 ~modus_tollens|spl0_9),
% 0.14/0.40 inference(component_clause,[status(thm)],[f387])).
% 0.14/0.40 fof(f409,plain,(
% 0.14/0.40 spl0_15 <=> implies_2),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f411,plain,(
% 0.14/0.40 ~implies_2|spl0_15),
% 0.14/0.40 inference(component_clause,[status(thm)],[f409])).
% 0.14/0.40 fof(f431,plain,(
% 0.14/0.40 spl0_21 <=> and_1),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f433,plain,(
% 0.14/0.40 ~and_1|spl0_21),
% 0.14/0.40 inference(component_clause,[status(thm)],[f431])).
% 0.14/0.40 fof(f434,plain,(
% 0.14/0.40 spl0_22 <=> is_a_theorem(implies(and(X0,X1),X0))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f435,plain,(
% 0.14/0.40 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0))|~spl0_22)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f434])).
% 0.14/0.40 fof(f437,plain,(
% 0.14/0.40 ~spl0_21|spl0_22),
% 0.14/0.40 inference(split_clause,[status(thm)],[f123,f431,f434])).
% 0.14/0.40 fof(f442,plain,(
% 0.14/0.40 spl0_24 <=> and_2),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f444,plain,(
% 0.14/0.40 ~and_2|spl0_24),
% 0.14/0.40 inference(component_clause,[status(thm)],[f442])).
% 0.14/0.40 fof(f445,plain,(
% 0.14/0.40 spl0_25 <=> is_a_theorem(implies(and(X0,X1),X1))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f446,plain,(
% 0.14/0.40 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X1))|~spl0_25)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f445])).
% 0.14/0.40 fof(f448,plain,(
% 0.14/0.40 ~spl0_24|spl0_25),
% 0.14/0.40 inference(split_clause,[status(thm)],[f127,f442,f445])).
% 0.14/0.40 fof(f453,plain,(
% 0.14/0.40 spl0_27 <=> and_3),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f455,plain,(
% 0.14/0.40 ~and_3|spl0_27),
% 0.14/0.40 inference(component_clause,[status(thm)],[f453])).
% 0.14/0.40 fof(f456,plain,(
% 0.14/0.40 spl0_28 <=> is_a_theorem(implies(X0,implies(X1,and(X0,X1))))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f457,plain,(
% 0.14/0.40 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1))))|~spl0_28)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f456])).
% 0.14/0.40 fof(f459,plain,(
% 0.14/0.40 ~spl0_27|spl0_28),
% 0.14/0.40 inference(split_clause,[status(thm)],[f131,f453,f456])).
% 0.14/0.40 fof(f486,plain,(
% 0.14/0.40 spl0_36 <=> or_3),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f488,plain,(
% 0.14/0.40 ~or_3|spl0_36),
% 0.14/0.40 inference(component_clause,[status(thm)],[f486])).
% 0.14/0.40 fof(f497,plain,(
% 0.14/0.40 spl0_39 <=> equivalence_1),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f499,plain,(
% 0.14/0.40 ~equivalence_1|spl0_39),
% 0.14/0.40 inference(component_clause,[status(thm)],[f497])).
% 0.14/0.40 fof(f508,plain,(
% 0.14/0.40 spl0_42 <=> equivalence_2),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f510,plain,(
% 0.14/0.40 ~equivalence_2|spl0_42),
% 0.14/0.40 inference(component_clause,[status(thm)],[f508])).
% 0.14/0.40 fof(f519,plain,(
% 0.14/0.40 spl0_45 <=> equivalence_3),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f521,plain,(
% 0.14/0.40 ~equivalence_3|spl0_45),
% 0.14/0.40 inference(component_clause,[status(thm)],[f519])).
% 0.14/0.40 fof(f670,plain,(
% 0.14/0.40 spl0_86 <=> op_equiv),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f672,plain,(
% 0.14/0.40 ~op_equiv|spl0_86),
% 0.14/0.40 inference(component_clause,[status(thm)],[f670])).
% 0.14/0.40 fof(f673,plain,(
% 0.14/0.40 spl0_87 <=> equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f674,plain,(
% 0.14/0.40 ![X0,X1]: (equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))|~spl0_87)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f673])).
% 0.14/0.40 fof(f676,plain,(
% 0.14/0.40 ~spl0_86|spl0_87),
% 0.14/0.40 inference(split_clause,[status(thm)],[f210,f670,f673])).
% 0.14/0.40 fof(f711,plain,(
% 0.14/0.40 spl0_97 <=> adjunction),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f714,plain,(
% 0.14/0.40 spl0_98 <=> ~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f715,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))|~spl0_98)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f714])).
% 0.14/0.40 fof(f717,plain,(
% 0.14/0.40 ~spl0_97|spl0_98),
% 0.14/0.40 inference(split_clause,[status(thm)],[f246,f711,f714])).
% 0.14/0.40 fof(f718,plain,(
% 0.14/0.40 spl0_99 <=> is_a_theorem(sk0_58)),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f721,plain,(
% 0.14/0.40 spl0_97|spl0_99),
% 0.14/0.40 inference(split_clause,[status(thm)],[f247,f711,f718])).
% 0.14/0.40 fof(f722,plain,(
% 0.14/0.40 spl0_100 <=> is_a_theorem(sk0_59)),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f725,plain,(
% 0.14/0.40 spl0_97|spl0_100),
% 0.14/0.40 inference(split_clause,[status(thm)],[f248,f711,f722])).
% 0.14/0.40 fof(f726,plain,(
% 0.14/0.40 spl0_101 <=> is_a_theorem(and(sk0_58,sk0_59))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f728,plain,(
% 0.14/0.40 ~is_a_theorem(and(sk0_58,sk0_59))|spl0_101),
% 0.14/0.40 inference(component_clause,[status(thm)],[f726])).
% 0.14/0.40 fof(f729,plain,(
% 0.14/0.40 spl0_97|~spl0_101),
% 0.14/0.40 inference(split_clause,[status(thm)],[f249,f711,f726])).
% 0.14/0.40 fof(f730,plain,(
% 0.14/0.40 spl0_102 <=> substitution_strict_equiv),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f731,plain,(
% 0.14/0.40 substitution_strict_equiv|~spl0_102),
% 0.14/0.40 inference(component_clause,[status(thm)],[f730])).
% 0.14/0.40 fof(f737,plain,(
% 0.14/0.40 spl0_104 <=> is_a_theorem(strict_equiv(sk0_60,sk0_61))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f738,plain,(
% 0.14/0.40 is_a_theorem(strict_equiv(sk0_60,sk0_61))|~spl0_104),
% 0.14/0.40 inference(component_clause,[status(thm)],[f737])).
% 0.14/0.40 fof(f740,plain,(
% 0.14/0.40 spl0_102|spl0_104),
% 0.14/0.40 inference(split_clause,[status(thm)],[f254,f730,f737])).
% 0.14/0.40 fof(f741,plain,(
% 0.14/0.40 spl0_105 <=> sk0_60=sk0_61),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f744,plain,(
% 0.14/0.40 spl0_102|~spl0_105),
% 0.14/0.40 inference(split_clause,[status(thm)],[f255,f730,f741])).
% 0.14/0.40 fof(f756,plain,(
% 0.14/0.40 spl0_109 <=> axiom_M),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f758,plain,(
% 0.14/0.40 ~axiom_M|spl0_109),
% 0.14/0.40 inference(component_clause,[status(thm)],[f756])).
% 0.14/0.40 fof(f759,plain,(
% 0.14/0.40 spl0_110 <=> is_a_theorem(implies(necessarily(X0),X0))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f760,plain,(
% 0.14/0.40 ![X0]: (is_a_theorem(implies(necessarily(X0),X0))|~spl0_110)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f759])).
% 0.14/0.40 fof(f762,plain,(
% 0.14/0.40 ~spl0_109|spl0_110),
% 0.14/0.40 inference(split_clause,[status(thm)],[f262,f756,f759])).
% 0.14/0.40 fof(f968,plain,(
% 0.14/0.40 spl0_167 <=> op_strict_implies),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f970,plain,(
% 0.14/0.40 ~op_strict_implies|spl0_167),
% 0.14/0.40 inference(component_clause,[status(thm)],[f968])).
% 0.14/0.40 fof(f971,plain,(
% 0.14/0.40 spl0_168 <=> strict_implies(X0,X1)=necessarily(implies(X0,X1))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f972,plain,(
% 0.14/0.40 ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1))|~spl0_168)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f971])).
% 0.14/0.40 fof(f974,plain,(
% 0.14/0.40 ~spl0_167|spl0_168),
% 0.14/0.40 inference(split_clause,[status(thm)],[f337,f968,f971])).
% 0.14/0.40 fof(f975,plain,(
% 0.14/0.40 spl0_169 <=> op_strict_equiv),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f977,plain,(
% 0.14/0.40 ~op_strict_equiv|spl0_169),
% 0.14/0.40 inference(component_clause,[status(thm)],[f975])).
% 0.14/0.40 fof(f978,plain,(
% 0.14/0.40 spl0_170 <=> strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0))),
% 0.14/0.40 introduced(split_symbol_definition)).
% 0.14/0.40 fof(f979,plain,(
% 0.14/0.40 ![X0,X1]: (strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0))|~spl0_170)),
% 0.14/0.40 inference(component_clause,[status(thm)],[f978])).
% 0.14/0.40 fof(f981,plain,(
% 0.14/0.40 ~spl0_169|spl0_170),
% 0.14/0.40 inference(split_clause,[status(thm)],[f339,f975,f978])).
% 0.14/0.40 fof(f982,plain,(
% 0.14/0.40 $false|spl0_169),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f977,f351])).
% 0.14/0.40 fof(f983,plain,(
% 0.14/0.40 spl0_169),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f982])).
% 0.14/0.40 fof(f984,plain,(
% 0.14/0.40 $false|spl0_0),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f355,f214])).
% 0.14/0.40 fof(f985,plain,(
% 0.14/0.40 spl0_0),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f984])).
% 0.14/0.40 fof(f988,plain,(
% 0.14/0.40 $false|spl0_5),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f374,f228])).
% 0.14/0.40 fof(f989,plain,(
% 0.14/0.40 spl0_5),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f988])).
% 0.14/0.40 fof(f990,plain,(
% 0.14/0.40 $false|spl0_167),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f970,f349])).
% 0.14/0.40 fof(f991,plain,(
% 0.14/0.40 spl0_167),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f990])).
% 0.14/0.40 fof(f994,plain,(
% 0.14/0.40 $false|spl0_86),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f672,f213])).
% 0.14/0.40 fof(f995,plain,(
% 0.14/0.40 spl0_86),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f994])).
% 0.14/0.40 fof(f1006,plain,(
% 0.14/0.40 $false|spl0_109),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f758,f343])).
% 0.14/0.40 fof(f1007,plain,(
% 0.14/0.40 spl0_109),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1006])).
% 0.14/0.40 fof(f1029,plain,(
% 0.14/0.40 $false|spl0_21),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f433,f219])).
% 0.14/0.40 fof(f1030,plain,(
% 0.14/0.40 spl0_21),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1029])).
% 0.14/0.40 fof(f1039,plain,(
% 0.14/0.40 $false|spl0_24),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f444,f220])).
% 0.14/0.40 fof(f1040,plain,(
% 0.14/0.40 spl0_24),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1039])).
% 0.14/0.40 fof(f1071,plain,(
% 0.14/0.40 ![X0]: (~is_a_theorem(necessarily(X0))|is_a_theorem(X0)|~spl0_1|~spl0_110)),
% 0.14/0.40 inference(resolution,[status(thm)],[f357,f760])).
% 0.14/0.40 fof(f1072,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(and(X0,X1))|is_a_theorem(X1)|~spl0_1|~spl0_25)),
% 0.14/0.40 inference(resolution,[status(thm)],[f357,f446])).
% 0.14/0.40 fof(f1073,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(and(X0,X1))|is_a_theorem(X0)|~spl0_1|~spl0_22)),
% 0.14/0.40 inference(resolution,[status(thm)],[f357,f435])).
% 0.14/0.40 fof(f1076,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,and(X0,X1)))|~spl0_1|~spl0_28)),
% 0.14/0.40 inference(resolution,[status(thm)],[f357,f457])).
% 0.14/0.40 fof(f1109,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(strict_implies(X0,X1))|is_a_theorem(implies(X0,X1))|~spl0_1|~spl0_110|~spl0_168)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f972,f1071])).
% 0.14/0.40 fof(f1176,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(and(X1,X0))|~is_a_theorem(X1)|~spl0_1|~spl0_28)),
% 0.14/0.40 inference(resolution,[status(thm)],[f357,f1076])).
% 0.14/0.40 fof(f1208,plain,(
% 0.14/0.40 $false|~spl0_102),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f731,f352])).
% 0.14/0.40 fof(f1209,plain,(
% 0.14/0.40 ~spl0_102),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1208])).
% 0.14/0.40 fof(f1265,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(strict_equiv(X0,X1))|is_a_theorem(strict_implies(X0,X1))|~spl0_1|~spl0_22|~spl0_170)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f979,f1073])).
% 0.14/0.40 fof(f1266,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(strict_equiv(X0,X1))|is_a_theorem(strict_implies(X1,X0))|~spl0_1|~spl0_25|~spl0_170)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f979,f1072])).
% 0.14/0.40 fof(f1364,plain,(
% 0.14/0.40 ~is_a_theorem(sk0_59)|~is_a_theorem(sk0_58)|~spl0_1|~spl0_28|spl0_101),
% 0.14/0.40 inference(resolution,[status(thm)],[f1176,f728])).
% 0.14/0.40 fof(f1365,plain,(
% 0.14/0.40 ~spl0_100|~spl0_99|~spl0_1|~spl0_28|spl0_101),
% 0.14/0.40 inference(split_clause,[status(thm)],[f1364,f722,f718,f356,f456,f726])).
% 0.14/0.40 fof(f1392,plain,(
% 0.14/0.40 $false|spl0_27),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f455,f221])).
% 0.14/0.40 fof(f1393,plain,(
% 0.14/0.40 spl0_27),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1392])).
% 0.14/0.40 fof(f1409,plain,(
% 0.14/0.40 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|is_a_theorem(equiv(X0,X1))|~spl0_98|~spl0_87)),
% 0.14/0.40 inference(paramodulation,[status(thm)],[f674,f715])).
% 0.14/0.40 fof(f1486,plain,(
% 0.14/0.40 is_a_theorem(strict_implies(sk0_60,sk0_61))|~spl0_1|~spl0_22|~spl0_170|~spl0_104),
% 0.14/0.40 inference(resolution,[status(thm)],[f1265,f738])).
% 0.14/0.40 fof(f1495,plain,(
% 0.14/0.40 is_a_theorem(implies(sk0_60,sk0_61))|~spl0_22|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168),
% 0.14/0.40 inference(resolution,[status(thm)],[f1486,f1109])).
% 0.14/0.40 fof(f1498,plain,(
% 0.14/0.40 is_a_theorem(strict_implies(sk0_61,sk0_60))|~spl0_1|~spl0_25|~spl0_170|~spl0_104),
% 0.14/0.40 inference(resolution,[status(thm)],[f1266,f738])).
% 0.14/0.40 fof(f1501,plain,(
% 0.14/0.40 is_a_theorem(implies(sk0_61,sk0_60))|~spl0_25|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168),
% 0.14/0.40 inference(resolution,[status(thm)],[f1498,f1109])).
% 0.14/0.40 fof(f1531,plain,(
% 0.14/0.40 $false|spl0_39),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f499,f225])).
% 0.14/0.40 fof(f1532,plain,(
% 0.14/0.40 spl0_39),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1531])).
% 0.14/0.40 fof(f1569,plain,(
% 0.14/0.40 $false|spl0_42),
% 0.14/0.40 inference(forward_subsumption_resolution,[status(thm)],[f510,f226])).
% 0.14/0.40 fof(f1570,plain,(
% 0.14/0.40 spl0_42),
% 0.14/0.40 inference(contradiction_clause,[status(thm)],[f1569])).
% 0.14/0.40 fof(f1593,plain,(
% 0.14/0.43 $false|spl0_15),
% 0.14/0.43 inference(forward_subsumption_resolution,[status(thm)],[f411,f217])).
% 0.14/0.43 fof(f1594,plain,(
% 0.14/0.43 spl0_15),
% 0.14/0.43 inference(contradiction_clause,[status(thm)],[f1593])).
% 0.14/0.43 fof(f1651,plain,(
% 0.14/0.43 $false|spl0_36),
% 0.14/0.43 inference(forward_subsumption_resolution,[status(thm)],[f488,f224])).
% 0.14/0.43 fof(f1652,plain,(
% 0.14/0.43 spl0_36),
% 0.14/0.43 inference(contradiction_clause,[status(thm)],[f1651])).
% 0.14/0.43 fof(f1660,plain,(
% 0.14/0.43 $false|spl0_45),
% 0.14/0.43 inference(forward_subsumption_resolution,[status(thm)],[f521,f227])).
% 0.14/0.43 fof(f1661,plain,(
% 0.14/0.43 spl0_45),
% 0.14/0.43 inference(contradiction_clause,[status(thm)],[f1660])).
% 0.14/0.43 fof(f1855,plain,(
% 0.14/0.43 $false|spl0_9),
% 0.14/0.43 inference(forward_subsumption_resolution,[status(thm)],[f389,f215])).
% 0.14/0.43 fof(f1856,plain,(
% 0.14/0.43 spl0_9),
% 0.14/0.43 inference(contradiction_clause,[status(thm)],[f1855])).
% 0.14/0.43 fof(f3197,plain,(
% 0.14/0.43 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|X0=X1|~spl0_98|~spl0_87|~spl0_6)),
% 0.14/0.43 inference(resolution,[status(thm)],[f1409,f376])).
% 0.14/0.43 fof(f3224,plain,(
% 0.14/0.43 spl0_199 <=> is_a_theorem(implies(sk0_60,sk0_61))),
% 0.14/0.43 introduced(split_symbol_definition)).
% 0.14/0.43 fof(f3226,plain,(
% 0.14/0.43 ~is_a_theorem(implies(sk0_60,sk0_61))|spl0_199),
% 0.14/0.43 inference(component_clause,[status(thm)],[f3224])).
% 0.14/0.43 fof(f3227,plain,(
% 0.14/0.43 ~is_a_theorem(implies(sk0_60,sk0_61))|sk0_60=sk0_61|~spl0_98|~spl0_87|~spl0_6|~spl0_25|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168),
% 0.14/0.43 inference(resolution,[status(thm)],[f3197,f1501])).
% 0.14/0.43 fof(f3228,plain,(
% 0.14/0.43 ~spl0_199|spl0_105|~spl0_98|~spl0_87|~spl0_6|~spl0_25|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168),
% 0.14/0.43 inference(split_clause,[status(thm)],[f3227,f3224,f741,f714,f673,f375,f445,f978,f737,f356,f759,f971])).
% 0.14/0.43 fof(f3284,plain,(
% 0.14/0.43 $false|~spl0_22|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168|spl0_199),
% 0.14/0.43 inference(forward_subsumption_resolution,[status(thm)],[f3226,f1495])).
% 0.14/0.43 fof(f3285,plain,(
% 0.14/0.43 ~spl0_22|~spl0_170|~spl0_104|~spl0_1|~spl0_110|~spl0_168|spl0_199),
% 0.14/0.43 inference(contradiction_clause,[status(thm)],[f3284])).
% 0.14/0.43 fof(f3286,plain,(
% 0.14/0.43 $false),
% 0.14/0.43 inference(sat_refutation,[status(thm)],[f359,f378,f437,f448,f459,f676,f717,f721,f725,f729,f740,f744,f762,f974,f981,f983,f985,f989,f991,f995,f1007,f1030,f1040,f1209,f1365,f1393,f1532,f1570,f1594,f1652,f1661,f1856,f3228,f3285])).
% 0.14/0.43 % SZS output end CNFRefutation for theBenchmark.p
% 0.14/0.43 % Elapsed time: 0.122042 seconds
% 0.14/0.43 % CPU time: 0.329736 seconds
% 0.14/0.43 % Memory used: 53.303 MB
%------------------------------------------------------------------------------