TSTP Solution File: LCL546+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : LCL546+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n004.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 : Tue Apr 30 20:27:25 EDT 2024
% Result : Theorem 5.12s 1.01s
% Output : CNFRefutation 5.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL546+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.32 % Computer : n004.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Apr 29 20:15:19 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % Drodi V3.6.0
% 5.12/1.01 % Refutation found
% 5.12/1.01 % SZS status Theorem for theBenchmark: Theorem is valid
% 5.12/1.01 % SZS output start CNFRefutation for theBenchmark
% 5.12/1.01 fof(f1,axiom,(
% 5.12/1.01 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f2,axiom,(
% 5.12/1.01 ( substitution_of_equivalents<=> (! [X,Y] :( is_a_theorem(equiv(X,Y))=> X = Y ) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f3,axiom,(
% 5.12/1.01 ( modus_tollens<=> (! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f4,axiom,(
% 5.12/1.01 ( implies_1<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f5,axiom,(
% 5.12/1.01 ( implies_2<=> (! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f8,axiom,(
% 5.12/1.01 ( and_2<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),Y)) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f9,axiom,(
% 5.12/1.01 ( and_3<=> (! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f10,axiom,(
% 5.12/1.01 ( or_1<=> (! [X,Y] : is_a_theorem(implies(X,or(X,Y))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f12,axiom,(
% 5.12/1.01 ( or_3<=> (! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f21,axiom,(
% 5.12/1.01 ( cn3<=> (! [P] : is_a_theorem(implies(implies(not(P),P),P)) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f27,axiom,(
% 5.12/1.01 ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f29,axiom,(
% 5.12/1.01 ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f31,axiom,(
% 5.12/1.01 ( op_equiv=> (! [X,Y] : equiv(X,Y) = and(implies(X,Y),implies(Y,X)) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f32,axiom,(
% 5.12/1.01 op_or ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f33,axiom,(
% 5.12/1.01 op_implies_and ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f34,axiom,(
% 5.12/1.01 op_equiv ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f35,axiom,(
% 5.12/1.01 modus_ponens ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f36,axiom,(
% 5.12/1.01 modus_tollens ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f37,axiom,(
% 5.12/1.01 implies_1 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f38,axiom,(
% 5.12/1.01 implies_2 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f41,axiom,(
% 5.12/1.01 and_2 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f42,axiom,(
% 5.12/1.01 and_3 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f43,axiom,(
% 5.12/1.01 or_1 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f45,axiom,(
% 5.12/1.01 or_3 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f49,axiom,(
% 5.12/1.01 substitution_of_equivalents ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f50,axiom,(
% 5.12/1.01 ( necessitation<=> (! [X] :( is_a_theorem(X)=> is_a_theorem(necessarily(X)) ) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f52,axiom,(
% 5.12/1.01 ( adjunction<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(Y) )=> is_a_theorem(and(X,Y)) ) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f55,axiom,(
% 5.12/1.01 ( axiom_M<=> (! [X] : is_a_theorem(implies(necessarily(X),X)) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f68,axiom,(
% 5.12/1.01 ( axiom_m6<=> (! [X] : is_a_theorem(strict_implies(X,possibly(X))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f73,axiom,(
% 5.12/1.01 ( op_possibly=> (! [X] : possibly(X) = not(necessarily(not(X))) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f75,axiom,(
% 5.12/1.01 ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f77,axiom,(
% 5.12/1.01 op_possibly ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f78,axiom,(
% 5.12/1.01 necessitation ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f80,axiom,(
% 5.12/1.01 axiom_M ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f86,axiom,(
% 5.12/1.01 op_strict_implies ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f89,conjecture,(
% 5.12/1.01 axiom_m6 ),
% 5.12/1.01 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.12/1.01 fof(f90,negated_conjecture,(
% 5.12/1.01 ~(axiom_m6 )),
% 5.12/1.01 inference(negated_conjecture,[status(cth)],[f89])).
% 5.12/1.01 fof(f91,plain,(
% 5.12/1.01 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f1])).
% 5.12/1.01 fof(f92,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f91])).
% 5.12/1.01 fof(f93,plain,(
% 5.12/1.01 (~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.12/1.01 inference(miniscoping,[status(esa)],[f92])).
% 5.12/1.01 fof(f94,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f93])).
% 5.12/1.01 fof(f95,plain,(
% 5.12/1.01 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f94])).
% 5.12/1.01 fof(f99,plain,(
% 5.12/1.01 substitution_of_equivalents<=>(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f2])).
% 5.12/1.01 fof(f100,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f99])).
% 5.12/1.01 fof(f101,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f100])).
% 5.12/1.01 fof(f102,plain,(
% 5.12/1.01 ![X0,X1]: (~substitution_of_equivalents|~is_a_theorem(equiv(X0,X1))|X0=X1)),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f101])).
% 5.12/1.01 fof(f105,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f3])).
% 5.12/1.01 fof(f106,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f105])).
% 5.12/1.01 fof(f107,plain,(
% 5.12/1.01 ![X0,X1]: (~modus_tollens|is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f106])).
% 5.12/1.01 fof(f109,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f4])).
% 5.12/1.01 fof(f110,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f109])).
% 5.12/1.01 fof(f111,plain,(
% 5.12/1.01 ![X0,X1]: (~implies_1|is_a_theorem(implies(X0,implies(X1,X0))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f110])).
% 5.12/1.01 fof(f113,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f5])).
% 5.12/1.01 fof(f114,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f113])).
% 5.12/1.01 fof(f115,plain,(
% 5.12/1.01 ![X0,X1]: (~implies_2|is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f114])).
% 5.12/1.01 fof(f125,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f8])).
% 5.12/1.01 fof(f126,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f125])).
% 5.12/1.01 fof(f127,plain,(
% 5.12/1.01 ![X0,X1]: (~and_2|is_a_theorem(implies(and(X0,X1),X1)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f126])).
% 5.12/1.01 fof(f129,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f9])).
% 5.12/1.01 fof(f130,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f129])).
% 5.12/1.01 fof(f131,plain,(
% 5.12/1.01 ![X0,X1]: (~and_3|is_a_theorem(implies(X0,implies(X1,and(X0,X1)))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f130])).
% 5.12/1.01 fof(f133,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f10])).
% 5.12/1.01 fof(f134,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f133])).
% 5.12/1.01 fof(f135,plain,(
% 5.12/1.01 ![X0,X1]: (~or_1|is_a_theorem(implies(X0,or(X0,X1))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f134])).
% 5.12/1.01 fof(f141,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f12])).
% 5.12/1.01 fof(f142,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f141])).
% 5.12/1.01 fof(f143,plain,(
% 5.12/1.01 ![X0,X1,X2]: (~or_3|is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f142])).
% 5.12/1.01 fof(f177,plain,(
% 5.12/1.01 (~cn3|(![P]: is_a_theorem(implies(implies(not(P),P),P))))&(cn3|(?[P]: ~is_a_theorem(implies(implies(not(P),P),P))))),
% 5.12/1.01 inference(NNF_transformation,[status(esa)],[f21])).
% 5.12/1.01 fof(f178,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f177])).
% 5.12/1.01 fof(f179,plain,(
% 5.12/1.01 ![X0]: (~cn3|is_a_theorem(implies(implies(not(X0),X0),X0)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f178])).
% 5.12/1.01 fof(f180,plain,(
% 5.12/1.01 cn3|~is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f178])).
% 5.12/1.01 fof(f201,plain,(
% 5.12/1.01 ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f27])).
% 5.12/1.01 fof(f202,plain,(
% 5.12/1.01 ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f201])).
% 5.12/1.01 fof(f205,plain,(
% 5.12/1.01 ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f29])).
% 5.12/1.01 fof(f206,plain,(
% 5.12/1.01 ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f205])).
% 5.12/1.01 fof(f209,plain,(
% 5.12/1.01 ~op_equiv|(![X,Y]: equiv(X,Y)=and(implies(X,Y),implies(Y,X)))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f31])).
% 5.12/1.01 fof(f210,plain,(
% 5.12/1.01 ![X0,X1]: (~op_equiv|equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f209])).
% 5.12/1.01 fof(f211,plain,(
% 5.12/1.01 op_or),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f32])).
% 5.12/1.01 fof(f212,plain,(
% 5.12/1.01 op_implies_and),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f33])).
% 5.12/1.01 fof(f213,plain,(
% 5.12/1.01 op_equiv),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f34])).
% 5.12/1.01 fof(f214,plain,(
% 5.12/1.01 modus_ponens),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f35])).
% 5.12/1.01 fof(f215,plain,(
% 5.12/1.01 modus_tollens),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f36])).
% 5.12/1.01 fof(f216,plain,(
% 5.12/1.01 implies_1),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f37])).
% 5.12/1.01 fof(f217,plain,(
% 5.12/1.01 implies_2),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f38])).
% 5.12/1.01 fof(f220,plain,(
% 5.12/1.01 and_2),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f41])).
% 5.12/1.01 fof(f221,plain,(
% 5.12/1.01 and_3),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f42])).
% 5.12/1.01 fof(f222,plain,(
% 5.12/1.01 or_1),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f43])).
% 5.12/1.01 fof(f224,plain,(
% 5.12/1.01 or_3),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f45])).
% 5.12/1.01 fof(f228,plain,(
% 5.12/1.01 substitution_of_equivalents),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f49])).
% 5.12/1.01 fof(f229,plain,(
% 5.12/1.01 necessitation<=>(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X))))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f50])).
% 5.12/1.01 fof(f230,plain,(
% 5.12/1.01 (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(?[X]: (is_a_theorem(X)&~is_a_theorem(necessarily(X)))))),
% 5.12/1.01 inference(NNF_transformation,[status(esa)],[f229])).
% 5.12/1.01 fof(f231,plain,(
% 5.12/1.01 (~necessitation|(![X]: (~is_a_theorem(X)|is_a_theorem(necessarily(X)))))&(necessitation|(is_a_theorem(sk0_55)&~is_a_theorem(necessarily(sk0_55))))),
% 5.12/1.01 inference(skolemization,[status(esa)],[f230])).
% 5.12/1.01 fof(f232,plain,(
% 5.12/1.01 ![X0]: (~necessitation|~is_a_theorem(X0)|is_a_theorem(necessarily(X0)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f231])).
% 5.12/1.01 fof(f243,plain,(
% 5.12/1.01 adjunction<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(Y))|is_a_theorem(and(X,Y))))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f52])).
% 5.12/1.01 fof(f244,plain,(
% 5.12/1.01 (~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.12/1.01 inference(NNF_transformation,[status(esa)],[f243])).
% 5.12/1.01 fof(f245,plain,(
% 5.12/1.01 (~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.12/1.01 inference(skolemization,[status(esa)],[f244])).
% 5.12/1.01 fof(f246,plain,(
% 5.12/1.01 ![X0,X1]: (~adjunction|~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f245])).
% 5.12/1.01 fof(f247,plain,(
% 5.12/1.01 adjunction|is_a_theorem(sk0_58)),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f245])).
% 5.12/1.01 fof(f248,plain,(
% 5.12/1.01 adjunction|is_a_theorem(sk0_59)),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f245])).
% 5.12/1.01 fof(f249,plain,(
% 5.12/1.01 adjunction|~is_a_theorem(and(sk0_58,sk0_59))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f245])).
% 5.12/1.01 fof(f260,plain,(
% 5.12/1.01 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|(?[X]: ~is_a_theorem(implies(necessarily(X),X))))),
% 5.12/1.01 inference(NNF_transformation,[status(esa)],[f55])).
% 5.12/1.01 fof(f261,plain,(
% 5.12/1.01 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|~is_a_theorem(implies(necessarily(sk0_64),sk0_64)))),
% 5.12/1.01 inference(skolemization,[status(esa)],[f260])).
% 5.12/1.01 fof(f262,plain,(
% 5.12/1.01 ![X0]: (~axiom_M|is_a_theorem(implies(necessarily(X0),X0)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f261])).
% 5.12/1.01 fof(f312,plain,(
% 5.12/1.01 (~axiom_m6|(![X]: is_a_theorem(strict_implies(X,possibly(X)))))&(axiom_m6|(?[X]: ~is_a_theorem(strict_implies(X,possibly(X)))))),
% 5.12/1.01 inference(NNF_transformation,[status(esa)],[f68])).
% 5.12/1.01 fof(f313,plain,(
% 5.12/1.01 (~axiom_m6|(![X]: is_a_theorem(strict_implies(X,possibly(X)))))&(axiom_m6|~is_a_theorem(strict_implies(sk0_87,possibly(sk0_87))))),
% 5.12/1.01 inference(skolemization,[status(esa)],[f312])).
% 5.12/1.01 fof(f315,plain,(
% 5.12/1.01 axiom_m6|~is_a_theorem(strict_implies(sk0_87,possibly(sk0_87)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f313])).
% 5.12/1.01 fof(f332,plain,(
% 5.12/1.01 ~op_possibly|(![X]: possibly(X)=not(necessarily(not(X))))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f73])).
% 5.12/1.01 fof(f333,plain,(
% 5.12/1.01 ![X0]: (~op_possibly|possibly(X0)=not(necessarily(not(X0))))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f332])).
% 5.12/1.01 fof(f336,plain,(
% 5.12/1.01 ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 5.12/1.01 inference(pre_NNF_transformation,[status(esa)],[f75])).
% 5.12/1.01 fof(f337,plain,(
% 5.12/1.01 ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f336])).
% 5.12/1.01 fof(f340,plain,(
% 5.12/1.01 op_possibly),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f77])).
% 5.12/1.01 fof(f341,plain,(
% 5.12/1.01 necessitation),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f78])).
% 5.12/1.01 fof(f343,plain,(
% 5.12/1.01 axiom_M),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f80])).
% 5.12/1.01 fof(f349,plain,(
% 5.12/1.01 op_strict_implies),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f86])).
% 5.12/1.01 fof(f352,plain,(
% 5.12/1.01 ~axiom_m6),
% 5.12/1.01 inference(cnf_transformation,[status(esa)],[f90])).
% 5.12/1.01 fof(f353,plain,(
% 5.12/1.01 spl0_0 <=> modus_ponens),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f355,plain,(
% 5.12/1.01 ~modus_ponens|spl0_0),
% 5.12/1.01 inference(component_clause,[status(thm)],[f353])).
% 5.12/1.01 fof(f356,plain,(
% 5.12/1.01 spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f357,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f356])).
% 5.12/1.01 fof(f359,plain,(
% 5.12/1.01 ~spl0_0|spl0_1),
% 5.12/1.01 inference(split_clause,[status(thm)],[f95,f353,f356])).
% 5.12/1.01 fof(f372,plain,(
% 5.12/1.01 spl0_5 <=> substitution_of_equivalents),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f374,plain,(
% 5.12/1.01 ~substitution_of_equivalents|spl0_5),
% 5.12/1.01 inference(component_clause,[status(thm)],[f372])).
% 5.12/1.01 fof(f375,plain,(
% 5.12/1.01 spl0_6 <=> ~is_a_theorem(equiv(X0,X1))|X0=X1),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f376,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(equiv(X0,X1))|X0=X1|~spl0_6)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f375])).
% 5.12/1.01 fof(f378,plain,(
% 5.12/1.01 ~spl0_5|spl0_6),
% 5.12/1.01 inference(split_clause,[status(thm)],[f102,f372,f375])).
% 5.12/1.01 fof(f387,plain,(
% 5.12/1.01 spl0_9 <=> modus_tollens),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f389,plain,(
% 5.12/1.01 ~modus_tollens|spl0_9),
% 5.12/1.01 inference(component_clause,[status(thm)],[f387])).
% 5.12/1.01 fof(f390,plain,(
% 5.12/1.01 spl0_10 <=> is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f391,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))|~spl0_10)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f390])).
% 5.12/1.01 fof(f393,plain,(
% 5.12/1.01 ~spl0_9|spl0_10),
% 5.12/1.01 inference(split_clause,[status(thm)],[f107,f387,f390])).
% 5.12/1.01 fof(f398,plain,(
% 5.12/1.01 spl0_12 <=> implies_1),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f400,plain,(
% 5.12/1.01 ~implies_1|spl0_12),
% 5.12/1.01 inference(component_clause,[status(thm)],[f398])).
% 5.12/1.01 fof(f401,plain,(
% 5.12/1.01 spl0_13 <=> is_a_theorem(implies(X0,implies(X1,X0)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f402,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,X0)))|~spl0_13)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f401])).
% 5.12/1.01 fof(f404,plain,(
% 5.12/1.01 ~spl0_12|spl0_13),
% 5.12/1.01 inference(split_clause,[status(thm)],[f111,f398,f401])).
% 5.12/1.01 fof(f409,plain,(
% 5.12/1.01 spl0_15 <=> implies_2),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f411,plain,(
% 5.12/1.01 ~implies_2|spl0_15),
% 5.12/1.01 inference(component_clause,[status(thm)],[f409])).
% 5.12/1.01 fof(f412,plain,(
% 5.12/1.01 spl0_16 <=> is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f413,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))|~spl0_16)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f412])).
% 5.12/1.01 fof(f415,plain,(
% 5.12/1.01 ~spl0_15|spl0_16),
% 5.12/1.01 inference(split_clause,[status(thm)],[f115,f409,f412])).
% 5.12/1.01 fof(f442,plain,(
% 5.12/1.01 spl0_24 <=> and_2),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f444,plain,(
% 5.12/1.01 ~and_2|spl0_24),
% 5.12/1.01 inference(component_clause,[status(thm)],[f442])).
% 5.12/1.01 fof(f445,plain,(
% 5.12/1.01 spl0_25 <=> is_a_theorem(implies(and(X0,X1),X1))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f446,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X1))|~spl0_25)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f445])).
% 5.12/1.01 fof(f448,plain,(
% 5.12/1.01 ~spl0_24|spl0_25),
% 5.12/1.01 inference(split_clause,[status(thm)],[f127,f442,f445])).
% 5.12/1.01 fof(f453,plain,(
% 5.12/1.01 spl0_27 <=> and_3),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f455,plain,(
% 5.12/1.01 ~and_3|spl0_27),
% 5.12/1.01 inference(component_clause,[status(thm)],[f453])).
% 5.12/1.01 fof(f456,plain,(
% 5.12/1.01 spl0_28 <=> is_a_theorem(implies(X0,implies(X1,and(X0,X1))))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f457,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(X0,implies(X1,and(X0,X1))))|~spl0_28)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f456])).
% 5.12/1.01 fof(f459,plain,(
% 5.12/1.01 ~spl0_27|spl0_28),
% 5.12/1.01 inference(split_clause,[status(thm)],[f131,f453,f456])).
% 5.12/1.01 fof(f464,plain,(
% 5.12/1.01 spl0_30 <=> or_1),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f466,plain,(
% 5.12/1.01 ~or_1|spl0_30),
% 5.12/1.01 inference(component_clause,[status(thm)],[f464])).
% 5.12/1.01 fof(f467,plain,(
% 5.12/1.01 spl0_31 <=> is_a_theorem(implies(X0,or(X0,X1)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f468,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1)))|~spl0_31)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f467])).
% 5.12/1.01 fof(f470,plain,(
% 5.12/1.01 ~spl0_30|spl0_31),
% 5.12/1.01 inference(split_clause,[status(thm)],[f135,f464,f467])).
% 5.12/1.01 fof(f486,plain,(
% 5.12/1.01 spl0_36 <=> or_3),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f488,plain,(
% 5.12/1.01 ~or_3|spl0_36),
% 5.12/1.01 inference(component_clause,[status(thm)],[f486])).
% 5.12/1.01 fof(f489,plain,(
% 5.12/1.01 spl0_37 <=> is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f490,plain,(
% 5.12/1.01 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))|~spl0_37)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f489])).
% 5.12/1.01 fof(f492,plain,(
% 5.12/1.01 ~spl0_36|spl0_37),
% 5.12/1.01 inference(split_clause,[status(thm)],[f143,f486,f489])).
% 5.12/1.01 fof(f533,plain,(
% 5.12/1.01 spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f534,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f533])).
% 5.12/1.01 fof(f579,plain,(
% 5.12/1.01 spl0_61 <=> cn3),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f582,plain,(
% 5.12/1.01 spl0_62 <=> is_a_theorem(implies(implies(not(X0),X0),X0))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f583,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(implies(not(X0),X0),X0))|~spl0_62)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f582])).
% 5.12/1.01 fof(f585,plain,(
% 5.12/1.01 ~spl0_61|spl0_62),
% 5.12/1.01 inference(split_clause,[status(thm)],[f179,f579,f582])).
% 5.12/1.01 fof(f586,plain,(
% 5.12/1.01 spl0_63 <=> is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f588,plain,(
% 5.12/1.01 ~is_a_theorem(implies(implies(not(sk0_43),sk0_43),sk0_43))|spl0_63),
% 5.12/1.01 inference(component_clause,[status(thm)],[f586])).
% 5.12/1.01 fof(f589,plain,(
% 5.12/1.01 spl0_61|~spl0_63),
% 5.12/1.01 inference(split_clause,[status(thm)],[f180,f579,f586])).
% 5.12/1.01 fof(f642,plain,(
% 5.12/1.01 spl0_78 <=> op_or),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f644,plain,(
% 5.12/1.01 ~op_or|spl0_78),
% 5.12/1.01 inference(component_clause,[status(thm)],[f642])).
% 5.12/1.01 fof(f645,plain,(
% 5.12/1.01 spl0_79 <=> or(X0,X1)=not(and(not(X0),not(X1)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f646,plain,(
% 5.12/1.01 ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~spl0_79)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f645])).
% 5.12/1.01 fof(f648,plain,(
% 5.12/1.01 ~spl0_78|spl0_79),
% 5.12/1.01 inference(split_clause,[status(thm)],[f202,f642,f645])).
% 5.12/1.01 fof(f656,plain,(
% 5.12/1.01 spl0_82 <=> op_implies_and),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f658,plain,(
% 5.12/1.01 ~op_implies_and|spl0_82),
% 5.12/1.01 inference(component_clause,[status(thm)],[f656])).
% 5.12/1.01 fof(f659,plain,(
% 5.12/1.01 spl0_83 <=> implies(X0,X1)=not(and(X0,not(X1)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f660,plain,(
% 5.12/1.01 ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~spl0_83)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f659])).
% 5.12/1.01 fof(f662,plain,(
% 5.12/1.01 ~spl0_82|spl0_83),
% 5.12/1.01 inference(split_clause,[status(thm)],[f206,f656,f659])).
% 5.12/1.01 fof(f666,plain,(
% 5.12/1.01 spl0_85 <=> implies(X0,X1)=or(not(X0),X1)),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f667,plain,(
% 5.12/1.01 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1)|~spl0_85)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f666])).
% 5.12/1.01 fof(f670,plain,(
% 5.12/1.01 spl0_86 <=> op_equiv),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f672,plain,(
% 5.12/1.01 ~op_equiv|spl0_86),
% 5.12/1.01 inference(component_clause,[status(thm)],[f670])).
% 5.12/1.01 fof(f673,plain,(
% 5.12/1.01 spl0_87 <=> equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f674,plain,(
% 5.12/1.01 ![X0,X1]: (equiv(X0,X1)=and(implies(X0,X1),implies(X1,X0))|~spl0_87)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f673])).
% 5.12/1.01 fof(f676,plain,(
% 5.12/1.01 ~spl0_86|spl0_87),
% 5.12/1.01 inference(split_clause,[status(thm)],[f210,f670,f673])).
% 5.12/1.01 fof(f677,plain,(
% 5.12/1.01 spl0_88 <=> necessitation),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f679,plain,(
% 5.12/1.01 ~necessitation|spl0_88),
% 5.12/1.01 inference(component_clause,[status(thm)],[f677])).
% 5.12/1.01 fof(f680,plain,(
% 5.12/1.01 spl0_89 <=> ~is_a_theorem(X0)|is_a_theorem(necessarily(X0))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f681,plain,(
% 5.12/1.01 ![X0]: (~is_a_theorem(X0)|is_a_theorem(necessarily(X0))|~spl0_89)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f680])).
% 5.12/1.01 fof(f683,plain,(
% 5.12/1.01 ~spl0_88|spl0_89),
% 5.12/1.01 inference(split_clause,[status(thm)],[f232,f677,f680])).
% 5.12/1.01 fof(f711,plain,(
% 5.12/1.01 spl0_97 <=> adjunction),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f714,plain,(
% 5.12/1.01 spl0_98 <=> ~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f715,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(X1)|is_a_theorem(and(X0,X1))|~spl0_98)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f714])).
% 5.12/1.01 fof(f717,plain,(
% 5.12/1.01 ~spl0_97|spl0_98),
% 5.12/1.01 inference(split_clause,[status(thm)],[f246,f711,f714])).
% 5.12/1.01 fof(f718,plain,(
% 5.12/1.01 spl0_99 <=> is_a_theorem(sk0_58)),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f721,plain,(
% 5.12/1.01 spl0_97|spl0_99),
% 5.12/1.01 inference(split_clause,[status(thm)],[f247,f711,f718])).
% 5.12/1.01 fof(f722,plain,(
% 5.12/1.01 spl0_100 <=> is_a_theorem(sk0_59)),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f725,plain,(
% 5.12/1.01 spl0_97|spl0_100),
% 5.12/1.01 inference(split_clause,[status(thm)],[f248,f711,f722])).
% 5.12/1.01 fof(f726,plain,(
% 5.12/1.01 spl0_101 <=> is_a_theorem(and(sk0_58,sk0_59))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f728,plain,(
% 5.12/1.01 ~is_a_theorem(and(sk0_58,sk0_59))|spl0_101),
% 5.12/1.01 inference(component_clause,[status(thm)],[f726])).
% 5.12/1.01 fof(f729,plain,(
% 5.12/1.01 spl0_97|~spl0_101),
% 5.12/1.01 inference(split_clause,[status(thm)],[f249,f711,f726])).
% 5.12/1.01 fof(f756,plain,(
% 5.12/1.01 spl0_109 <=> axiom_M),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f758,plain,(
% 5.12/1.01 ~axiom_M|spl0_109),
% 5.12/1.01 inference(component_clause,[status(thm)],[f756])).
% 5.12/1.01 fof(f759,plain,(
% 5.12/1.01 spl0_110 <=> is_a_theorem(implies(necessarily(X0),X0))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f760,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(necessarily(X0),X0))|~spl0_110)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f759])).
% 5.12/1.01 fof(f762,plain,(
% 5.12/1.01 ~spl0_109|spl0_110),
% 5.12/1.01 inference(split_clause,[status(thm)],[f262,f756,f759])).
% 5.12/1.01 fof(f899,plain,(
% 5.12/1.01 spl0_148 <=> axiom_m6),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f900,plain,(
% 5.12/1.01 axiom_m6|~spl0_148),
% 5.12/1.01 inference(component_clause,[status(thm)],[f899])).
% 5.12/1.01 fof(f906,plain,(
% 5.12/1.01 spl0_150 <=> is_a_theorem(strict_implies(sk0_87,possibly(sk0_87)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f908,plain,(
% 5.12/1.01 ~is_a_theorem(strict_implies(sk0_87,possibly(sk0_87)))|spl0_150),
% 5.12/1.01 inference(component_clause,[status(thm)],[f906])).
% 5.12/1.01 fof(f909,plain,(
% 5.12/1.01 spl0_148|~spl0_150),
% 5.12/1.01 inference(split_clause,[status(thm)],[f315,f899,f906])).
% 5.12/1.01 fof(f954,plain,(
% 5.12/1.01 spl0_163 <=> op_possibly),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f956,plain,(
% 5.12/1.01 ~op_possibly|spl0_163),
% 5.12/1.01 inference(component_clause,[status(thm)],[f954])).
% 5.12/1.01 fof(f957,plain,(
% 5.12/1.01 spl0_164 <=> possibly(X0)=not(necessarily(not(X0)))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f958,plain,(
% 5.12/1.01 ![X0]: (possibly(X0)=not(necessarily(not(X0)))|~spl0_164)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f957])).
% 5.12/1.01 fof(f960,plain,(
% 5.12/1.01 ~spl0_163|spl0_164),
% 5.12/1.01 inference(split_clause,[status(thm)],[f333,f954,f957])).
% 5.12/1.01 fof(f968,plain,(
% 5.12/1.01 spl0_167 <=> op_strict_implies),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f970,plain,(
% 5.12/1.01 ~op_strict_implies|spl0_167),
% 5.12/1.01 inference(component_clause,[status(thm)],[f968])).
% 5.12/1.01 fof(f971,plain,(
% 5.12/1.01 spl0_168 <=> strict_implies(X0,X1)=necessarily(implies(X0,X1))),
% 5.12/1.01 introduced(split_symbol_definition)).
% 5.12/1.01 fof(f972,plain,(
% 5.12/1.01 ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1))|~spl0_168)),
% 5.12/1.01 inference(component_clause,[status(thm)],[f971])).
% 5.12/1.01 fof(f974,plain,(
% 5.12/1.01 ~spl0_167|spl0_168),
% 5.12/1.01 inference(split_clause,[status(thm)],[f337,f968,f971])).
% 5.12/1.01 fof(f984,plain,(
% 5.12/1.01 $false|spl0_0),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f355,f214])).
% 5.12/1.01 fof(f985,plain,(
% 5.12/1.01 spl0_0),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f984])).
% 5.12/1.01 fof(f986,plain,(
% 5.12/1.01 $false|spl0_88),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f679,f341])).
% 5.12/1.01 fof(f987,plain,(
% 5.12/1.01 spl0_88),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f986])).
% 5.12/1.01 fof(f988,plain,(
% 5.12/1.01 $false|spl0_5),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f374,f228])).
% 5.12/1.01 fof(f989,plain,(
% 5.12/1.01 spl0_5),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f988])).
% 5.12/1.01 fof(f990,plain,(
% 5.12/1.01 $false|spl0_167),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f970,f349])).
% 5.12/1.01 fof(f991,plain,(
% 5.12/1.01 spl0_167),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f990])).
% 5.12/1.01 fof(f992,plain,(
% 5.12/1.01 $false|spl0_163),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f956,f340])).
% 5.12/1.01 fof(f993,plain,(
% 5.12/1.01 spl0_163),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f992])).
% 5.12/1.01 fof(f994,plain,(
% 5.12/1.01 $false|spl0_86),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f672,f213])).
% 5.12/1.01 fof(f995,plain,(
% 5.12/1.01 spl0_86),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f994])).
% 5.12/1.01 fof(f996,plain,(
% 5.12/1.01 $false|spl0_82),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f658,f212])).
% 5.12/1.01 fof(f997,plain,(
% 5.12/1.01 spl0_82),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f996])).
% 5.12/1.01 fof(f998,plain,(
% 5.12/1.01 $false|spl0_78),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f644,f211])).
% 5.12/1.01 fof(f999,plain,(
% 5.12/1.01 spl0_78),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f998])).
% 5.12/1.01 fof(f1004,plain,(
% 5.12/1.01 $false|spl0_109),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f758,f343])).
% 5.12/1.01 fof(f1005,plain,(
% 5.12/1.01 spl0_109),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1004])).
% 5.12/1.01 fof(f1035,plain,(
% 5.12/1.01 $false|spl0_30),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f466,f222])).
% 5.12/1.01 fof(f1036,plain,(
% 5.12/1.01 spl0_30),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1035])).
% 5.12/1.01 fof(f1039,plain,(
% 5.12/1.01 $false|spl0_24),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f444,f220])).
% 5.12/1.01 fof(f1040,plain,(
% 5.12/1.01 spl0_24),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1039])).
% 5.12/1.01 fof(f1043,plain,(
% 5.12/1.01 $false|spl0_12),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f400,f216])).
% 5.12/1.01 fof(f1044,plain,(
% 5.12/1.01 spl0_12),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1043])).
% 5.12/1.01 fof(f1076,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(implies(X1,and(X0,X1)))|~spl0_1|~spl0_28)),
% 5.12/1.01 inference(resolution,[status(thm)],[f357,f457])).
% 5.12/1.01 fof(f1110,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(strict_implies(X0,X1))|~spl0_89|~spl0_168)),
% 5.12/1.01 inference(paramodulation,[status(thm)],[f972,f681])).
% 5.12/1.01 fof(f1176,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(and(X1,X0))|~is_a_theorem(X1)|~spl0_1|~spl0_28)),
% 5.12/1.01 inference(resolution,[status(thm)],[f357,f1076])).
% 5.12/1.01 fof(f1231,plain,(
% 5.12/1.01 ![X0,X1]: (implies(necessarily(not(X0)),X1)=or(possibly(X0),X1)|~spl0_85|~spl0_164)),
% 5.12/1.01 inference(paramodulation,[status(thm)],[f958,f667])).
% 5.12/1.01 fof(f1278,plain,(
% 5.12/1.01 ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~spl0_83|~spl0_79)),
% 5.12/1.01 inference(forward_demodulation,[status(thm)],[f660,f646])).
% 5.12/1.01 fof(f1282,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0)))|~spl0_83|~spl0_79|~spl0_10)),
% 5.12/1.01 inference(backward_demodulation,[status(thm)],[f1278,f391])).
% 5.12/1.01 fof(f1362,plain,(
% 5.12/1.01 ~is_a_theorem(sk0_59)|~is_a_theorem(sk0_58)|~spl0_1|~spl0_28|spl0_101),
% 5.12/1.01 inference(resolution,[status(thm)],[f1176,f728])).
% 5.12/1.01 fof(f1363,plain,(
% 5.12/1.01 ~spl0_100|~spl0_99|~spl0_1|~spl0_28|spl0_101),
% 5.12/1.01 inference(split_clause,[status(thm)],[f1362,f722,f718,f356,f456,f726])).
% 5.12/1.01 fof(f1390,plain,(
% 5.12/1.01 $false|spl0_27),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f455,f221])).
% 5.12/1.01 fof(f1391,plain,(
% 5.12/1.01 spl0_27),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1390])).
% 5.12/1.01 fof(f1407,plain,(
% 5.12/1.01 ![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.12/1.01 inference(paramodulation,[status(thm)],[f674,f715])).
% 5.12/1.01 fof(f1432,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(implies(X0,implies(X0,X1)))|is_a_theorem(implies(X0,X1))|~spl0_1|~spl0_16)),
% 5.12/1.01 inference(resolution,[status(thm)],[f357,f413])).
% 5.12/1.01 fof(f1466,plain,(
% 5.12/1.01 ~is_a_theorem(implies(or(sk0_43,sk0_43),sk0_43))|~spl0_83|~spl0_79|spl0_63),
% 5.12/1.01 inference(forward_demodulation,[status(thm)],[f1278,f588])).
% 5.12/1.01 fof(f1612,plain,(
% 5.12/1.01 $false|spl0_15),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f411,f217])).
% 5.12/1.01 fof(f1613,plain,(
% 5.12/1.01 spl0_15),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1612])).
% 5.12/1.01 fof(f1662,plain,(
% 5.12/1.01 $false|spl0_36),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f488,f224])).
% 5.12/1.01 fof(f1663,plain,(
% 5.12/1.01 spl0_36),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1662])).
% 5.12/1.01 fof(f1799,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(or(possibly(X0),not(X0)))|~spl0_110|~spl0_85|~spl0_164)),
% 5.12/1.01 inference(paramodulation,[status(thm)],[f1231,f760])).
% 5.12/1.01 fof(f1849,plain,(
% 5.12/1.01 $false|spl0_9),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f389,f215])).
% 5.12/1.01 fof(f1850,plain,(
% 5.12/1.01 spl0_9),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f1849])).
% 5.12/1.01 fof(f1856,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(or(X0,not(X1)))|is_a_theorem(implies(X1,X0))|~spl0_83|~spl0_79|~spl0_10|~spl0_1)),
% 5.12/1.01 inference(resolution,[status(thm)],[f1282,f357])).
% 5.12/1.01 fof(f2653,plain,(
% 5.12/1.01 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(or(X0,X0),X1)))|~spl0_1|~spl0_16|~spl0_37)),
% 5.12/1.01 inference(resolution,[status(thm)],[f1432,f490])).
% 5.12/1.01 fof(f2655,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_1|~spl0_16|~spl0_28)),
% 5.12/1.01 inference(resolution,[status(thm)],[f1432,f457])).
% 5.12/1.01 fof(f2656,plain,(
% 5.12/1.01 spl0_49|~spl0_1|~spl0_16|~spl0_28),
% 5.12/1.01 inference(split_clause,[status(thm)],[f2655,f533,f356,f412,f456])).
% 5.12/1.01 fof(f2657,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(X0,X0))|~spl0_1|~spl0_16|~spl0_13)),
% 5.12/1.01 inference(resolution,[status(thm)],[f1432,f402])).
% 5.12/1.01 fof(f2956,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(X0,X0),X1))|~spl0_16|~spl0_37|~spl0_1)),
% 5.12/1.01 inference(resolution,[status(thm)],[f2653,f357])).
% 5.12/1.01 fof(f2996,plain,(
% 5.12/1.01 ~is_a_theorem(implies(sk0_43,sk0_43))|~spl0_16|~spl0_37|~spl0_1|~spl0_83|~spl0_79|spl0_63),
% 5.12/1.01 inference(resolution,[status(thm)],[f2956,f1466])).
% 5.12/1.01 fof(f2997,plain,(
% 5.12/1.01 $false|~spl0_13|~spl0_16|~spl0_37|~spl0_1|~spl0_83|~spl0_79|spl0_63),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f2996,f2657])).
% 5.12/1.01 fof(f2998,plain,(
% 5.12/1.01 ~spl0_13|~spl0_16|~spl0_37|~spl0_1|~spl0_83|~spl0_79|spl0_63),
% 5.12/1.01 inference(contradiction_clause,[status(thm)],[f2997])).
% 5.12/1.01 fof(f3007,plain,(
% 5.12/1.01 ![X0]: (is_a_theorem(implies(or(X0,X0),X0))|~spl0_83|~spl0_79|~spl0_62)),
% 5.12/1.01 inference(forward_demodulation,[status(thm)],[f1278,f583])).
% 5.12/1.01 fof(f3314,plain,(
% 5.12/1.01 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|X0=X1|~spl0_98|~spl0_87|~spl0_6)),
% 5.12/1.01 inference(resolution,[status(thm)],[f1407,f376])).
% 5.12/1.01 fof(f3326,plain,(
% 5.12/1.01 ![X0]: (~is_a_theorem(implies(X0,or(X0,X0)))|X0=or(X0,X0)|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_62)),
% 5.12/1.01 inference(resolution,[status(thm)],[f3314,f3007])).
% 5.12/1.01 fof(f3327,plain,(
% 5.12/1.01 ![X0]: (X0=or(X0,X0)|~spl0_31|~spl0_98|~spl0_87|~spl0_6|~spl0_83|~spl0_79|~spl0_62)),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f3326,f468])).
% 5.12/1.01 fof(f3383,plain,(
% 5.12/1.01 ![X0]: (~is_a_theorem(implies(and(X0,X0),X0))|and(X0,X0)=X0|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.01 inference(resolution,[status(thm)],[f3314,f534])).
% 5.12/1.01 fof(f3384,plain,(
% 5.12/1.01 ![X0]: (and(X0,X0)=X0|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.01 inference(forward_subsumption_resolution,[status(thm)],[f3383,f446])).
% 5.12/1.01 fof(f3456,plain,(
% 5.12/1.01 ![X0]: (implies(not(X0),X0)=not(not(X0))|~spl0_83|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.01 inference(paramodulation,[status(thm)],[f3384,f660])).
% 5.12/1.01 fof(f3457,plain,(
% 5.12/1.01 ![X0]: (or(X0,X0)=not(not(X0))|~spl0_79|~spl0_83|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.01 inference(forward_demodulation,[status(thm)],[f1278,f3456])).
% 5.12/1.01 fof(f3458,plain,(
% 5.12/1.01 ![X0]: (X0=not(not(X0))|~spl0_31|~spl0_62|~spl0_79|~spl0_83|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.02 inference(forward_demodulation,[status(thm)],[f3327,f3457])).
% 5.12/1.02 fof(f3514,plain,(
% 5.12/1.02 ![X0,X1]: (or(not(X0),X1)=implies(X0,X1)|~spl0_31|~spl0_62|~spl0_79|~spl0_83|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49)),
% 5.12/1.02 inference(paramodulation,[status(thm)],[f3458,f1278])).
% 5.12/1.02 fof(f3515,plain,(
% 5.12/1.02 spl0_85|~spl0_31|~spl0_62|~spl0_79|~spl0_83|~spl0_25|~spl0_98|~spl0_87|~spl0_6|~spl0_49),
% 5.12/1.02 inference(split_clause,[status(thm)],[f3514,f666,f467,f582,f645,f659,f445,f714,f673,f375,f533])).
% 5.12/1.02 fof(f4797,plain,(
% 5.12/1.02 $false|~spl0_148),
% 5.12/1.02 inference(forward_subsumption_resolution,[status(thm)],[f900,f352])).
% 5.12/1.02 fof(f4798,plain,(
% 5.12/1.02 ~spl0_148),
% 5.12/1.02 inference(contradiction_clause,[status(thm)],[f4797])).
% 5.12/1.02 fof(f10869,plain,(
% 5.12/1.02 ![X0]: (is_a_theorem(implies(X0,possibly(X0)))|~spl0_83|~spl0_79|~spl0_10|~spl0_1|~spl0_110|~spl0_85|~spl0_164)),
% 5.12/1.02 inference(resolution,[status(thm)],[f1856,f1799])).
% 5.12/1.02 fof(f12522,plain,(
% 5.12/1.02 ~is_a_theorem(implies(sk0_87,possibly(sk0_87)))|spl0_150|~spl0_89|~spl0_168),
% 5.12/1.02 inference(resolution,[status(thm)],[f908,f1110])).
% 5.12/1.02 fof(f12523,plain,(
% 5.12/1.02 $false|~spl0_83|~spl0_79|~spl0_10|~spl0_1|~spl0_110|~spl0_85|~spl0_164|spl0_150|~spl0_89|~spl0_168),
% 5.12/1.02 inference(forward_subsumption_resolution,[status(thm)],[f12522,f10869])).
% 5.12/1.02 fof(f12524,plain,(
% 5.12/1.02 ~spl0_83|~spl0_79|~spl0_10|~spl0_1|~spl0_110|~spl0_85|~spl0_164|spl0_150|~spl0_89|~spl0_168),
% 5.12/1.02 inference(contradiction_clause,[status(thm)],[f12523])).
% 5.12/1.02 fof(f12525,plain,(
% 5.12/1.02 $false),
% 5.12/1.02 inference(sat_refutation,[status(thm)],[f359,f378,f393,f404,f415,f448,f459,f470,f492,f585,f589,f648,f662,f676,f683,f717,f721,f725,f729,f762,f909,f960,f974,f985,f987,f989,f991,f993,f995,f997,f999,f1005,f1036,f1040,f1044,f1363,f1391,f1613,f1663,f1850,f2656,f2998,f3515,f4798,f12524])).
% 5.12/1.02 % SZS output end CNFRefutation for theBenchmark.p
% 5.12/1.03 % Elapsed time: 0.692410 seconds
% 5.12/1.03 % CPU time: 5.353935 seconds
% 5.12/1.03 % Total memory used: 185.749 MB
% 5.12/1.03 % Net memory used: 179.624 MB
%------------------------------------------------------------------------------