%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL500+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:11 PM UTC 2026
% Result : Theorem 15.40s 2.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL500+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.52 % Computer : n016.cluster.edu
% 0.09/0.52 % Model : x86_64 x86_64
% 0.09/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52 % Memory : 8046.5625MB
% 0.09/0.52 % OS : Linux 6.8.0-71-generic
% 0.09/0.52 % CPULimit : 300
% 0.09/0.52 % WCLimit : 300
% 0.09/0.52 % DateTime : Mon Sep 21 00:40:54 UTC 2026
% 0.09/0.53 % CPUTime :
% 0.09/0.53 % Drodi V4.1.1
% 15.40/2.60 % Refutation found
% 15.40/2.60 % SZS status Theorem for theBenchmark: Theorem is valid
% 15.40/2.60 % SZS output start CNFRefutation for theBenchmark
% 15.40/2.60 fof(f1,axiom,(
% 15.40/2.60 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f17,axiom,(
% 15.40/2.60 ( kn2<=> (! [P,Q] : is_a_theorem(implies(and(P,Q),P)) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f22,axiom,(
% 15.40/2.60 ( r1<=> (! [P] : is_a_theorem(implies(or(P,P),P)) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f23,axiom,(
% 15.40/2.60 ( r2<=> (! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f24,axiom,(
% 15.40/2.60 ( r3<=> (! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f26,axiom,(
% 15.40/2.60 ( r5<=> (! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f27,axiom,(
% 15.40/2.60 ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f28,axiom,(
% 15.40/2.60 ( op_and=> (! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f29,axiom,(
% 15.40/2.60 ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f30,axiom,(
% 15.40/2.60 ( op_implies_or=> (! [X,Y] : implies(X,Y) = or(not(X),Y) )) ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f32,axiom,(
% 15.40/2.60 op_implies_or ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f33,axiom,(
% 15.40/2.60 op_and ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f35,axiom,(
% 15.40/2.60 modus_ponens ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f36,axiom,(
% 15.40/2.60 r1 ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f37,axiom,(
% 15.40/2.60 r2 ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f38,axiom,(
% 15.40/2.60 r3 ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f40,axiom,(
% 15.40/2.60 r5 ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f42,axiom,(
% 15.40/2.60 op_or ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f43,axiom,(
% 15.40/2.60 op_implies_and ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f45,conjecture,(
% 15.40/2.60 kn2 ),
% 15.40/2.60 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 15.40/2.60 fof(f46,negated_conjecture,(
% 15.40/2.60 ~(kn2 )),
% 15.40/2.60 inference(negated_conjecture,[status(cth)],[f45])).
% 15.40/2.60 fof(f47,plain,(
% 15.40/2.60 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 15.40/2.60 inference(pre_NNF_transformation,[status(thm)],[f1])).
% 15.40/2.60 fof(f48,plain,(
% 15.40/2.60 (~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))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f47])).
% 15.40/2.60 fof(f49,plain,(
% 15.40/2.60 (~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))))),
% 15.40/2.60 inference(miniscoping,[status(thm)],[f48])).
% 15.40/2.60 fof(f50,plain,(
% 15.40/2.60 (~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)))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f49])).
% 15.40/2.60 fof(f51,plain,(
% 15.40/2.60 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f50])).
% 15.40/2.60 fof(f117,plain,(
% 15.40/2.60 (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|(?[P,Q]: ~is_a_theorem(implies(and(P,Q),P))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f17])).
% 15.40/2.60 fof(f118,plain,(
% 15.40/2.60 (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|~is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl)))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK33_skl,sK34_skl]),skolemize(P,sK33_skl),skolemize(Q,sK34_skl)],[f117])).
% 15.40/2.60 fof(f120,plain,(
% 15.40/2.60 kn2|~is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f118])).
% 15.40/2.60 fof(f137,plain,(
% 15.40/2.60 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|(?[P]: ~is_a_theorem(implies(or(P,P),P))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f22])).
% 15.40/2.60 fof(f138,plain,(
% 15.40/2.60 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|~is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl)))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK44_skl]),skolemize(P,sK44_skl)],[f137])).
% 15.40/2.60 fof(f139,plain,(
% 15.40/2.60 ![X0]: (~r1|is_a_theorem(implies(or(X0,X0),X0)))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f138])).
% 15.40/2.60 fof(f141,plain,(
% 15.40/2.60 (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|(?[P,Q]: ~is_a_theorem(implies(Q,or(P,Q)))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f23])).
% 15.40/2.60 fof(f142,plain,(
% 15.40/2.60 (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|~is_a_theorem(implies(sK46_skl,or(sK45_skl,sK46_skl))))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK45_skl,sK46_skl]),skolemize(P,sK45_skl),skolemize(Q,sK46_skl)],[f141])).
% 15.40/2.60 fof(f143,plain,(
% 15.40/2.60 ![X0,X1]: (~r2|is_a_theorem(implies(X0,or(X1,X0))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f142])).
% 15.40/2.60 fof(f145,plain,(
% 15.40/2.60 (~r3|(![P,Q]: is_a_theorem(implies(or(P,Q),or(Q,P)))))&(r3|(?[P,Q]: ~is_a_theorem(implies(or(P,Q),or(Q,P)))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f24])).
% 15.40/2.60 fof(f146,plain,(
% 15.40/2.60 (~r3|(![P,Q]: is_a_theorem(implies(or(P,Q),or(Q,P)))))&(r3|~is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl))))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl]),skolemize(P,sK47_skl),skolemize(Q,sK48_skl)],[f145])).
% 15.40/2.60 fof(f147,plain,(
% 15.40/2.60 ![X0,X1]: (~r3|is_a_theorem(implies(or(X0,X1),or(X1,X0))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f146])).
% 15.40/2.60 fof(f153,plain,(
% 15.40/2.60 (~r5|(![P,Q,R]: is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))))&(r5|(?[P,Q,R]: ~is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))))),
% 15.40/2.60 inference(NNF_transformation,[status(thm)],[f26])).
% 15.40/2.60 fof(f154,plain,(
% 15.40/2.60 (~r5|(![P,Q,R]: is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R))))))&(r5|~is_a_theorem(implies(implies(sK53_skl,sK54_skl),implies(or(sK52_skl,sK53_skl),or(sK52_skl,sK54_skl)))))),
% 15.40/2.60 inference(skolemize,[status(esa),new_symbols(skolem,[sK52_skl,sK53_skl,sK54_skl]),skolemize(P,sK52_skl),skolemize(Q,sK53_skl),skolemize(R,sK54_skl)],[f153])).
% 15.40/2.60 fof(f155,plain,(
% 15.40/2.60 ![X0,X1,X2]: (~r5|is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f154])).
% 15.40/2.60 fof(f157,plain,(
% 15.40/2.60 ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 15.40/2.60 inference(pre_NNF_transformation,[status(thm)],[f27])).
% 15.40/2.60 fof(f158,plain,(
% 15.40/2.60 ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f157])).
% 15.40/2.60 fof(f159,plain,(
% 15.40/2.60 ~op_and|(![X,Y]: and(X,Y)=not(or(not(X),not(Y))))),
% 15.40/2.60 inference(pre_NNF_transformation,[status(thm)],[f28])).
% 15.40/2.60 fof(f160,plain,(
% 15.40/2.60 ![X0,X1]: (~op_and|and(X0,X1)=not(or(not(X0),not(X1))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f159])).
% 15.40/2.60 fof(f161,plain,(
% 15.40/2.60 ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 15.40/2.60 inference(pre_NNF_transformation,[status(thm)],[f29])).
% 15.40/2.60 fof(f162,plain,(
% 15.40/2.60 ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f161])).
% 15.40/2.60 fof(f163,plain,(
% 15.40/2.60 ~op_implies_or|(![X,Y]: implies(X,Y)=or(not(X),Y))),
% 15.40/2.60 inference(pre_NNF_transformation,[status(thm)],[f30])).
% 15.40/2.60 fof(f164,plain,(
% 15.40/2.60 ![X0,X1]: (~op_implies_or|implies(X0,X1)=or(not(X0),X1))),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f163])).
% 15.40/2.60 fof(f167,plain,(
% 15.40/2.60 op_implies_or),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f32])).
% 15.40/2.60 fof(f168,plain,(
% 15.40/2.60 op_and),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f33])).
% 15.40/2.60 fof(f170,plain,(
% 15.40/2.60 modus_ponens),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f35])).
% 15.40/2.60 fof(f171,plain,(
% 15.40/2.60 r1),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f36])).
% 15.40/2.60 fof(f172,plain,(
% 15.40/2.60 r2),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f37])).
% 15.40/2.60 fof(f173,plain,(
% 15.40/2.60 r3),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f38])).
% 15.40/2.60 fof(f175,plain,(
% 15.40/2.60 r5),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f40])).
% 15.40/2.60 fof(f177,plain,(
% 15.40/2.60 op_or),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f42])).
% 15.40/2.60 fof(f178,plain,(
% 15.40/2.60 op_implies_and),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f43])).
% 15.40/2.60 fof(f180,plain,(
% 15.40/2.60 ~kn2),
% 15.40/2.60 inference(cnf_transformation,[status(thm)],[f46])).
% 15.40/2.60 fof(f181,plain,(
% 15.40/2.60 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f51,f170])).
% 15.40/2.60 fof(f183,plain,(
% 15.40/2.60 ![X0]: (is_a_theorem(implies(or(X0,X0),X0)))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f139,f171])).
% 15.40/2.60 fof(f185,plain,(
% 15.40/2.60 ![X0,X1]: (is_a_theorem(implies(X0,or(X1,X0))))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f143,f172])).
% 15.40/2.60 fof(f186,plain,(
% 15.40/2.60 ![X0,X1]: (~is_a_theorem(X0)|is_a_theorem(or(X1,X0)))),
% 15.40/2.60 inference(resolution,[status(thm)],[f185,f181])).
% 15.40/2.60 fof(f189,plain,(
% 15.40/2.60 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f164,f167])).
% 15.40/2.60 fof(f192,plain,(
% 15.40/2.60 ![X0]: (is_a_theorem(implies(implies(X0,not(X0)),not(X0))))),
% 15.40/2.60 inference(paramodulation,[status(thm)],[f189,f183])).
% 15.40/2.60 fof(f228,plain,(
% 15.40/2.60 ~is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f120,f180])).
% 15.40/2.60 fof(f229,plain,(
% 15.40/2.60 ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,X0))))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f147,f173])).
% 15.40/2.60 fof(f230,plain,(
% 15.40/2.60 ![X0,X1]: (~is_a_theorem(or(X0,X1))|is_a_theorem(or(X1,X0)))),
% 15.40/2.60 inference(resolution,[status(thm)],[f229,f181])).
% 15.40/2.60 fof(f238,plain,(
% 15.40/2.60 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(or(X1,not(X0))))),
% 15.40/2.60 inference(paramodulation,[status(thm)],[f189,f230])).
% 15.40/2.60 fof(f253,plain,(
% 15.40/2.60 ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1))))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f162,f178])).
% 15.40/2.60 fof(f272,plain,(
% 15.40/2.60 ![X0]: (is_a_theorem(or(not(X0),not(implies(X0,not(X0))))))),
% 15.40/2.60 inference(resolution,[status(thm)],[f238,f192])).
% 15.40/2.60 fof(f275,plain,(
% 15.40/2.60 ![X0,X1]: (is_a_theorem(or(or(X0,X1),not(or(X1,X0)))))),
% 15.40/2.60 inference(resolution,[status(thm)],[f238,f229])).
% 15.40/2.60 fof(f281,plain,(
% 15.40/2.60 ![X0,X1]: (is_a_theorem(or(or(X0,X1),not(X1))))),
% 15.40/2.60 inference(resolution,[status(thm)],[f238,f185])).
% 15.40/2.60 fof(f282,plain,(
% 15.40/2.60 ![X0]: (is_a_theorem(implies(X0,not(implies(X0,not(X0))))))),
% 15.40/2.60 inference(forward_demodulation,[status(thm)],[f189,f272])).
% 15.40/2.60 fof(f298,plain,(
% 15.40/2.60 ![X0,X1,X2]: (is_a_theorem(or(X0,or(or(X1,X2),not(X2)))))),
% 15.40/2.60 inference(resolution,[status(thm)],[f281,f186])).
% 15.40/2.60 fof(f383,plain,(
% 15.40/2.60 ![X0,X1,X2]: (is_a_theorem(or(or(or(X0,X1),not(X1)),X2)))),
% 15.40/2.60 inference(resolution,[status(thm)],[f298,f230])).
% 15.40/2.60 fof(f619,plain,(
% 15.40/2.60 ![X0,X1]: (~op_or|or(X0,X1)=implies(not(X0),X1))),
% 15.40/2.60 inference(forward_demodulation,[status(thm)],[f253,f158])).
% 15.40/2.60 fof(f628,plain,(
% 15.40/2.60 ![X0,X1]: (or(X0,X1)=implies(not(X0),X1))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f619,f177])).
% 15.40/2.60 fof(f629,plain,(
% 15.40/2.60 ![X0,X1,X2]: (or(and(X0,not(X1)),X2)=implies(implies(X0,X1),X2))),
% 15.40/2.60 inference(paramodulation,[status(thm)],[f253,f628])).
% 15.40/2.60 fof(f935,plain,(
% 15.40/2.60 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f155,f175])).
% 15.40/2.60 fof(f937,plain,(
% 15.40/2.60 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(X2,X0),or(X2,X1))))),
% 15.40/2.60 inference(resolution,[status(thm)],[f935,f181])).
% 15.40/2.60 fof(f1022,plain,(
% 15.40/2.60 ![X0,X1]: (~op_and|and(X0,X1)=not(implies(X0,not(X1))))),
% 15.40/2.60 inference(forward_demodulation,[status(thm)],[f189,f160])).
% 15.40/2.60 fof(f1024,plain,(
% 15.40/2.60 ![X0]: (is_a_theorem(implies(X0,and(X0,X0))))),
% 15.40/2.60 inference(backward_demodulation,[status(thm)],[f1025,f282])).
% 15.40/2.60 fof(f1025,plain,(
% 15.40/2.60 ![X0,X1]: (and(X0,X1)=not(implies(X0,not(X1))))),
% 15.40/2.60 inference(forward_subsumption_resolution,[status(thm)],[f1022,f168])).
% 15.40/2.60 fof(f1026,plain,(
% 15.40/2.60 ![X0,X1]: (and(not(X0),X1)=not(or(X0,not(X1))))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f628,f1025])).
% 13.80/2.65 fof(f1046,plain,(
% 13.80/2.65 ![X0,X1,X2]: (or(implies(X0,not(X1)),X2)=implies(and(X0,X1),X2))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f1025,f628])).
% 13.80/2.65 fof(f1144,plain,(
% 13.80/2.65 ![X0]: (is_a_theorem(or(and(X0,X0),not(X0))))),
% 13.80/2.65 inference(resolution,[status(thm)],[f1024,f238])).
% 13.80/2.65 fof(f1368,plain,(
% 13.80/2.65 ![X0,X1]: (and(not(not(X0)),X1)=not(implies(X0,not(X1))))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f189,f1026])).
% 13.80/2.65 fof(f1375,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(or(or(not(X0),X1),and(not(X1),X0))))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f1026,f275])).
% 13.80/2.65 fof(f1421,plain,(
% 13.80/2.65 ![X0,X1]: (and(not(not(X0)),X1)=and(X0,X1))),
% 13.80/2.65 inference(forward_demodulation,[status(thm)],[f1025,f1368])).
% 13.80/2.65 fof(f1425,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(or(implies(X0,X1),and(not(X1),X0))))),
% 13.80/2.65 inference(forward_demodulation,[status(thm)],[f189,f1375])).
% 13.80/2.65 fof(f1638,plain,(
% 13.80/2.65 ![X0]: (is_a_theorem(implies(implies(not(X0),X0),not(not(X0)))))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f629,f1144])).
% 13.80/2.65 fof(f1755,plain,(
% 13.80/2.65 ![X0]: (is_a_theorem(implies(or(X0,X0),not(not(X0)))))),
% 13.80/2.65 inference(forward_demodulation,[status(thm)],[f628,f1638])).
% 13.80/2.65 fof(f1837,plain,(
% 13.80/2.65 ![X0]: (~is_a_theorem(or(X0,X0))|is_a_theorem(not(not(X0))))),
% 13.80/2.65 inference(resolution,[status(thm)],[f1755,f181])).
% 13.80/2.65 fof(f1861,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(not(not(or(or(X0,X1),not(X1))))))),
% 13.80/2.65 inference(resolution,[status(thm)],[f1837,f383])).
% 13.80/2.65 fof(f1904,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(not(and(not(or(X0,X1)),X1))))),
% 13.80/2.65 inference(forward_demodulation,[status(thm)],[f1026,f1861])).
% 13.80/2.65 fof(f1919,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(not(and(and(not(X0),X1),not(X1)))))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f1026,f1904])).
% 13.80/2.65 fof(f1923,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(implies(and(not(X0),X1),X1)))),
% 13.80/2.65 inference(forward_demodulation,[status(thm)],[f253,f1919])).
% 13.80/2.65 fof(f1933,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X1)))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f1421,f1923])).
% 13.80/2.65 fof(f2296,plain,(
% 13.80/2.65 ![X0,X1,X2]: (is_a_theorem(implies(or(X0,and(X1,X2)),or(X0,X2))))),
% 13.80/2.65 inference(resolution,[status(thm)],[f937,f1933])).
% 13.80/2.65 fof(f17705,plain,(
% 13.80/2.65 ![X0,X1,X2]: (~is_a_theorem(or(X0,and(X1,X2)))|is_a_theorem(or(X0,X2)))),
% 13.80/2.65 inference(resolution,[status(thm)],[f2296,f181])).
% 13.80/2.65 fof(f35094,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(or(implies(X0,X1),X0)))),
% 13.80/2.65 inference(resolution,[status(thm)],[f17705,f1425])).
% 13.80/2.65 fof(f35156,plain,(
% 13.80/2.65 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0)))),
% 13.80/2.65 inference(paramodulation,[status(thm)],[f1046,f35094])).
% 13.80/2.65 fof(f35278,plain,(
% 13.80/2.65 $false),
% 13.80/2.65 inference(backward_subsumption_resolution,[status(thm)],[f228,f35156])).
% 13.80/2.65 % SZS output end CNFRefutation for theBenchmark.p
% 13.80/2.67 % Elapsed time: 2.127207 seconds
% 13.80/2.67 % CPU time: 16.612624 seconds
% 13.80/2.67 % Total memory used: 388.504 MB
% 13.80/2.67 % Net memory used: 372.586 MB
%------------------------------------------------------------------------------