%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL526+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:10:13 PM UTC 2026
% Result : Theorem 5.54s 1.38s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL526+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:37:05 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 5.54/1.38 % Refutation found
% 5.54/1.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 5.54/1.38 % SZS output start CNFRefutation for theBenchmark
% 5.54/1.38 fof(f1,axiom,(
% 5.54/1.38 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f2,axiom,(
% 5.54/1.38 ( substitution_of_equivalents<=> (! [X,Y] :( is_a_theorem(equiv(X,Y))=> X = Y ) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f7,axiom,(
% 5.54/1.38 ( and_1<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),X)) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f8,axiom,(
% 5.54/1.38 ( and_2<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),Y)) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f15,axiom,(
% 5.54/1.38 ( equivalence_3<=> (! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y)))) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f35,axiom,(
% 5.54/1.38 modus_ponens ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f40,axiom,(
% 5.54/1.38 and_1 ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f41,axiom,(
% 5.54/1.38 and_2 ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f48,axiom,(
% 5.54/1.38 equivalence_3 ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f49,axiom,(
% 5.54/1.38 substitution_of_equivalents ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f53,axiom,(
% 5.54/1.38 ( substitution_strict_equiv<=> (! [X,Y] :( is_a_theorem(strict_equiv(X,Y))=> X = Y ) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f55,axiom,(
% 5.54/1.38 ( axiom_M<=> (! [X] : is_a_theorem(implies(necessarily(X),X)) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f75,axiom,(
% 5.54/1.38 ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f76,axiom,(
% 5.54/1.38 ( op_strict_equiv=> (! [X,Y] : strict_equiv(X,Y) = and(strict_implies(X,Y),strict_implies(Y,X)) )) ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f80,axiom,(
% 5.54/1.38 axiom_M ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f85,axiom,(
% 5.54/1.38 op_strict_implies ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f87,axiom,(
% 5.54/1.38 op_strict_equiv ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f88,conjecture,(
% 5.54/1.38 substitution_strict_equiv ),
% 5.54/1.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 5.54/1.38 fof(f89,negated_conjecture,(
% 5.54/1.38 ~(substitution_strict_equiv )),
% 5.54/1.38 inference(negated_conjecture,[status(cth)],[f88])).
% 5.54/1.38 fof(f90,plain,(
% 5.54/1.38 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 5.54/1.38 inference(pre_NNF_transformation,[status(thm)],[f1])).
% 5.54/1.38 fof(f91,plain,(
% 5.54/1.38 (~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.54/1.38 inference(NNF_transformation,[status(thm)],[f90])).
% 5.54/1.38 fof(f92,plain,(
% 5.54/1.38 (~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.54/1.38 inference(miniscoping,[status(thm)],[f91])).
% 5.54/1.38 fof(f93,plain,(
% 5.54/1.38 (~modus_ponens|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens|((is_a_theorem(sK1_skl)&is_a_theorem(implies(sK1_skl,sK0_skl)))&~is_a_theorem(sK0_skl)))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f92])).
% 5.54/1.38 fof(f94,plain,(
% 5.54/1.38 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f93])).
% 5.54/1.38 fof(f98,plain,(
% 5.54/1.38 substitution_of_equivalents<=>(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y))),
% 5.54/1.38 inference(pre_NNF_transformation,[status(thm)],[f2])).
% 5.54/1.38 fof(f99,plain,(
% 5.54/1.38 (~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.54/1.38 inference(NNF_transformation,[status(thm)],[f98])).
% 5.54/1.38 fof(f100,plain,(
% 5.54/1.38 (~substitution_of_equivalents|(![X,Y]: (~is_a_theorem(equiv(X,Y))|X=Y)))&(substitution_of_equivalents|(is_a_theorem(equiv(sK2_skl,sK3_skl))&~sK2_skl=sK3_skl))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(X,sK2_skl),skolemize(Y,sK3_skl)],[f99])).
% 5.54/1.38 fof(f101,plain,(
% 5.54/1.38 ![X0,X1]: (~substitution_of_equivalents|~is_a_theorem(equiv(X0,X1))|X0=X1)),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f100])).
% 5.54/1.38 fof(f120,plain,(
% 5.54/1.38 (~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.54/1.38 inference(NNF_transformation,[status(thm)],[f7])).
% 5.54/1.38 fof(f121,plain,(
% 5.54/1.38 (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|~is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl)))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl]),skolemize(X,sK13_skl),skolemize(Y,sK14_skl)],[f120])).
% 5.54/1.38 fof(f122,plain,(
% 5.54/1.38 ![X0,X1]: (~and_1|is_a_theorem(implies(and(X0,X1),X0)))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f121])).
% 5.54/1.38 fof(f124,plain,(
% 5.54/1.38 (~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.54/1.38 inference(NNF_transformation,[status(thm)],[f8])).
% 5.54/1.38 fof(f125,plain,(
% 5.54/1.38 (~and_2|(![X,Y]: is_a_theorem(implies(and(X,Y),Y))))&(and_2|~is_a_theorem(implies(and(sK15_skl,sK16_skl),sK16_skl)))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK15_skl,sK16_skl]),skolemize(X,sK15_skl),skolemize(Y,sK16_skl)],[f124])).
% 5.54/1.38 fof(f126,plain,(
% 5.54/1.38 ![X0,X1]: (~and_2|is_a_theorem(implies(and(X0,X1),X1)))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f125])).
% 5.54/1.38 fof(f152,plain,(
% 5.54/1.38 (~equivalence_3|(![X,Y]: is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))))&(equivalence_3|(?[X,Y]: ~is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))))),
% 5.54/1.38 inference(NNF_transformation,[status(thm)],[f15])).
% 5.54/1.38 fof(f153,plain,(
% 5.54/1.38 (~equivalence_3|(![X,Y]: is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))))&(equivalence_3|~is_a_theorem(implies(implies(sK30_skl,sK31_skl),implies(implies(sK31_skl,sK30_skl),equiv(sK30_skl,sK31_skl)))))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK30_skl,sK31_skl]),skolemize(X,sK30_skl),skolemize(Y,sK31_skl)],[f152])).
% 5.54/1.38 fof(f154,plain,(
% 5.54/1.38 ![X0,X1]: (~equivalence_3|is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f153])).
% 5.54/1.38 fof(f213,plain,(
% 5.54/1.38 modus_ponens),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f35])).
% 5.54/1.38 fof(f218,plain,(
% 5.54/1.38 and_1),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f40])).
% 5.54/1.38 fof(f219,plain,(
% 5.54/1.38 and_2),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f41])).
% 5.54/1.38 fof(f226,plain,(
% 5.54/1.38 equivalence_3),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f48])).
% 5.54/1.38 fof(f227,plain,(
% 5.54/1.38 substitution_of_equivalents),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f49])).
% 5.54/1.38 fof(f249,plain,(
% 5.54/1.38 substitution_strict_equiv<=>(![X,Y]: (~is_a_theorem(strict_equiv(X,Y))|X=Y))),
% 5.54/1.38 inference(pre_NNF_transformation,[status(thm)],[f53])).
% 5.54/1.38 fof(f250,plain,(
% 5.54/1.38 (~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)))),
% 5.54/1.38 inference(NNF_transformation,[status(thm)],[f249])).
% 5.54/1.38 fof(f251,plain,(
% 5.54/1.38 (~substitution_strict_equiv|(![X,Y]: (~is_a_theorem(strict_equiv(X,Y))|X=Y)))&(substitution_strict_equiv|(is_a_theorem(strict_equiv(sK60_skl,sK61_skl))&~sK60_skl=sK61_skl))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK60_skl,sK61_skl]),skolemize(X,sK60_skl),skolemize(Y,sK61_skl)],[f250])).
% 5.54/1.38 fof(f253,plain,(
% 5.54/1.38 substitution_strict_equiv|is_a_theorem(strict_equiv(sK60_skl,sK61_skl))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f251])).
% 5.54/1.38 fof(f254,plain,(
% 5.54/1.38 substitution_strict_equiv|~sK60_skl=sK61_skl),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f251])).
% 5.54/1.38 fof(f259,plain,(
% 5.54/1.38 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|(?[X]: ~is_a_theorem(implies(necessarily(X),X))))),
% 5.54/1.38 inference(NNF_transformation,[status(thm)],[f55])).
% 5.54/1.38 fof(f260,plain,(
% 5.54/1.38 (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|~is_a_theorem(implies(necessarily(sK64_skl),sK64_skl)))),
% 5.54/1.38 inference(skolemize,[status(esa),new_symbols(skolem,[sK64_skl]),skolemize(X,sK64_skl)],[f259])).
% 5.54/1.38 fof(f261,plain,(
% 5.54/1.38 ![X0]: (~axiom_M|is_a_theorem(implies(necessarily(X0),X0)))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f260])).
% 5.54/1.38 fof(f335,plain,(
% 5.54/1.38 ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 5.54/1.38 inference(pre_NNF_transformation,[status(thm)],[f75])).
% 5.54/1.38 fof(f336,plain,(
% 5.54/1.38 ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f335])).
% 5.54/1.38 fof(f337,plain,(
% 5.54/1.38 ~op_strict_equiv|(![X,Y]: strict_equiv(X,Y)=and(strict_implies(X,Y),strict_implies(Y,X)))),
% 5.54/1.38 inference(pre_NNF_transformation,[status(thm)],[f76])).
% 5.54/1.38 fof(f338,plain,(
% 5.54/1.38 ![X0,X1]: (~op_strict_equiv|strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0)))),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f337])).
% 5.54/1.38 fof(f342,plain,(
% 5.54/1.38 axiom_M),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f80])).
% 5.54/1.38 fof(f347,plain,(
% 5.54/1.38 op_strict_implies),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f85])).
% 5.54/1.38 fof(f349,plain,(
% 5.54/1.38 op_strict_equiv),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f87])).
% 5.54/1.38 fof(f350,plain,(
% 5.54/1.38 ~substitution_strict_equiv),
% 5.54/1.38 inference(cnf_transformation,[status(thm)],[f89])).
% 5.54/1.38 fof(f351,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 5.54/1.38 inference(backward_subsumption_resolution,[status(thm)],[f94,f213])).
% 5.54/1.38 fof(f357,plain,(
% 5.54/1.38 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0)))),
% 5.54/1.38 inference(backward_subsumption_resolution,[status(thm)],[f122,f218])).
% 5.54/1.38 fof(f358,plain,(
% 5.54/1.38 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X1)))),
% 5.54/1.38 inference(backward_subsumption_resolution,[status(thm)],[f126,f219])).
% 5.54/1.38 fof(f365,plain,(
% 5.54/1.38 ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))))),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f154,f226])).
% 5.54/1.38 fof(f366,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(equiv(X0,X1))|X0=X1)),
% 5.54/1.38 inference(backward_subsumption_resolution,[status(thm)],[f101,f227])).
% 5.54/1.38 fof(f380,plain,(
% 5.54/1.38 ~sK60_skl=sK61_skl),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f254,f350])).
% 5.54/1.38 fof(f381,plain,(
% 5.54/1.38 is_a_theorem(strict_equiv(sK60_skl,sK61_skl))),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f253,f350])).
% 5.54/1.38 fof(f383,plain,(
% 5.54/1.38 ![X0]: (is_a_theorem(implies(necessarily(X0),X0)))),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f261,f342])).
% 5.54/1.38 fof(f424,plain,(
% 5.54/1.38 ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f336,f347])).
% 5.54/1.38 fof(f432,plain,(
% 5.54/1.38 ![X0,X1]: (strict_equiv(X0,X1)=and(strict_implies(X0,X1),strict_implies(X1,X0)))),
% 5.54/1.38 inference(forward_subsumption_resolution,[status(thm)],[f338,f349])).
% 5.54/1.38 fof(f437,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(and(X0,X1))|is_a_theorem(X1))),
% 5.54/1.38 inference(resolution,[status(thm)],[f351,f358])).
% 5.54/1.38 fof(f438,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(and(X0,X1))|is_a_theorem(X0))),
% 5.54/1.38 inference(resolution,[status(thm)],[f351,f357])).
% 5.54/1.38 fof(f439,plain,(
% 5.54/1.38 ![X0]: (~is_a_theorem(necessarily(X0))|is_a_theorem(X0))),
% 5.54/1.38 inference(resolution,[status(thm)],[f351,f383])).
% 5.54/1.38 fof(f440,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(X1,X0),equiv(X0,X1))))),
% 5.54/1.38 inference(resolution,[status(thm)],[f351,f365])).
% 5.54/1.38 fof(f457,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(strict_implies(X0,X1))|is_a_theorem(implies(X0,X1)))),
% 5.54/1.38 inference(paramodulation,[status(thm)],[f424,f439])).
% 5.54/1.38 fof(f468,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(strict_equiv(X0,X1))|is_a_theorem(strict_implies(X1,X0)))),
% 5.54/1.38 inference(paramodulation,[status(thm)],[f432,f437])).
% 5.54/1.38 fof(f474,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(strict_equiv(X0,X1))|is_a_theorem(strict_implies(X0,X1)))),
% 5.54/1.38 inference(paramodulation,[status(thm)],[f432,f438])).
% 5.54/1.38 fof(f977,plain,(
% 5.54/1.38 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|is_a_theorem(equiv(X0,X1)))),
% 5.54/1.41 inference(resolution,[status(thm)],[f440,f351])).
% 5.54/1.41 fof(f1285,plain,(
% 5.54/1.41 is_a_theorem(strict_implies(sK61_skl,sK60_skl))),
% 5.54/1.41 inference(resolution,[status(thm)],[f468,f381])).
% 5.54/1.41 fof(f1333,plain,(
% 5.54/1.41 is_a_theorem(implies(sK61_skl,sK60_skl))),
% 5.54/1.41 inference(resolution,[status(thm)],[f1285,f457])).
% 5.54/1.41 fof(f1340,plain,(
% 5.54/1.41 is_a_theorem(strict_implies(sK60_skl,sK61_skl))),
% 5.54/1.41 inference(resolution,[status(thm)],[f474,f381])).
% 5.54/1.41 fof(f1343,plain,(
% 5.54/1.41 is_a_theorem(implies(sK60_skl,sK61_skl))),
% 5.54/1.41 inference(resolution,[status(thm)],[f1340,f457])).
% 5.54/1.41 fof(f7207,plain,(
% 5.54/1.41 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X1,X0))|X0=X1)),
% 5.54/1.41 inference(resolution,[status(thm)],[f977,f366])).
% 5.54/1.41 fof(f7712,plain,(
% 5.54/1.41 ~is_a_theorem(implies(sK61_skl,sK60_skl))|sK61_skl=sK60_skl),
% 5.54/1.41 inference(resolution,[status(thm)],[f7207,f1343])).
% 5.54/1.41 fof(f7835,plain,(
% 5.54/1.41 sK61_skl=sK60_skl),
% 5.54/1.41 inference(forward_subsumption_resolution,[status(thm)],[f7712,f1333])).
% 5.54/1.41 fof(f7895,plain,(
% 5.54/1.41 $false),
% 5.54/1.41 inference(forward_subsumption_resolution,[status(thm)],[f7835,f380])).
% 5.54/1.41 % SZS output end CNFRefutation for theBenchmark.p
% 4.07/1.43 % Elapsed time: 1.045813 seconds
% 4.07/1.43 % CPU time: 7.909094 seconds
% 4.07/1.43 % Total memory used: 218.171 MB
% 4.07/1.43 % Net memory used: 208.099 MB
%------------------------------------------------------------------------------