↑ Up

Drodi-SAT---4.1.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi-SAT---4.1.1
% Problem  : LCL517+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 : n017.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:12 PM UTC 2026

% Result   : Theorem 0.15s 0.46s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL517+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.11/0.37  % Computer : n017.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 00:32:13 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Drodi V4.1.1
% 0.15/0.46  % Refutation found
% 0.15/0.46  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.46  % SZS output start CNFRefutation for theBenchmark
% 0.15/0.46  fof(f1,axiom,(
% 0.15/0.46    ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f16,axiom,(
% 0.15/0.46    ( kn1<=> (! [P] : is_a_theorem(implies(P,and(P,P))) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f17,axiom,(
% 0.15/0.46    ( kn2<=> (! [P,Q] : is_a_theorem(implies(and(P,Q),P)) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f18,axiom,(
% 0.15/0.46    ( kn3<=> (! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P))))) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f21,axiom,(
% 0.15/0.46    ( cn3<=> (! [P] : is_a_theorem(implies(implies(not(P),P),P)) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f27,axiom,(
% 0.15/0.46    ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f29,axiom,(
% 0.15/0.46    ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f32,axiom,(
% 0.15/0.46    op_or ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f33,axiom,(
% 0.15/0.46    op_implies_and ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f35,axiom,(
% 0.15/0.46    modus_ponens ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f36,axiom,(
% 0.15/0.46    kn1 ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f37,axiom,(
% 0.15/0.46    kn2 ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f38,axiom,(
% 0.15/0.46    kn3 ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f43,conjecture,(
% 0.15/0.46    cn3 ),
% 0.15/0.46    file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.46  fof(f44,negated_conjecture,(
% 0.15/0.46    ~(cn3 )),
% 0.15/0.46    inference(negated_conjecture,[status(cth)],[f43])).
% 0.15/0.46  fof(f45,plain,(
% 0.15/0.46    modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.15/0.46    inference(pre_NNF_transformation,[status(thm)],[f1])).
% 0.15/0.46  fof(f46,plain,(
% 0.15/0.46    (~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.15/0.46    inference(NNF_transformation,[status(thm)],[f45])).
% 0.15/0.46  fof(f47,plain,(
% 0.15/0.46    (~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.15/0.46    inference(miniscoping,[status(thm)],[f46])).
% 0.15/0.46  fof(f48,plain,(
% 0.15/0.46    (~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)))),
% 0.15/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f47])).
% 0.15/0.46  fof(f49,plain,(
% 0.15/0.46    ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f48])).
% 0.15/0.46  fof(f111,plain,(
% 0.15/0.46    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|(?[P]: ~is_a_theorem(implies(P,and(P,P)))))),
% 0.15/0.46    inference(NNF_transformation,[status(thm)],[f16])).
% 0.15/0.46  fof(f112,plain,(
% 0.15/0.46    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|~is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl))))),
% 0.15/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[sK32_skl]),skolemize(P,sK32_skl)],[f111])).
% 0.15/0.46  fof(f113,plain,(
% 0.15/0.46    ![X0]: (~kn1|is_a_theorem(implies(X0,and(X0,X0))))),
% 0.15/0.46    inference(cnf_transformation,[status(thm)],[f112])).
% 0.15/0.46  fof(f115,plain,(
% 0.15/0.46    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|(?[P,Q]: ~is_a_theorem(implies(and(P,Q),P))))),
% 0.15/0.46    inference(NNF_transformation,[status(thm)],[f17])).
% 0.15/0.46  fof(f116,plain,(
% 0.15/0.46    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|~is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl)))),
% 0.15/0.46    inference(skolemize,[status(esa),new_symbols(skolem,[sK33_skl,sK34_skl]),skolemize(P,sK33_skl),skolemize(Q,sK34_skl)],[f115])).
% 0.15/0.47  fof(f117,plain,(
% 0.15/0.47    ![X0,X1]: (~kn2|is_a_theorem(implies(and(X0,X1),X0)))),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f116])).
% 0.15/0.47  fof(f119,plain,(
% 0.15/0.47    (~kn3|(![P,Q,R]: is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))))&(kn3|(?[P,Q,R]: ~is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))))),
% 0.15/0.47    inference(NNF_transformation,[status(thm)],[f18])).
% 0.15/0.47  fof(f120,plain,(
% 0.15/0.47    (~kn3|(![P,Q,R]: is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))))&(kn3|~is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(not(and(sK36_skl,sK37_skl)),not(and(sK37_skl,sK35_skl))))))),
% 0.15/0.47    inference(skolemize,[status(esa),new_symbols(skolem,[sK35_skl,sK36_skl,sK37_skl]),skolemize(P,sK35_skl),skolemize(Q,sK36_skl),skolemize(R,sK37_skl)],[f119])).
% 0.15/0.47  fof(f121,plain,(
% 0.15/0.47    ![X0,X1,X2]: (~kn3|is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))))),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f120])).
% 0.15/0.47  fof(f131,plain,(
% 0.15/0.47    (~cn3|(![P]: is_a_theorem(implies(implies(not(P),P),P))))&(cn3|(?[P]: ~is_a_theorem(implies(implies(not(P),P),P))))),
% 0.15/0.47    inference(NNF_transformation,[status(thm)],[f21])).
% 0.15/0.47  fof(f132,plain,(
% 0.15/0.47    (~cn3|(![P]: is_a_theorem(implies(implies(not(P),P),P))))&(cn3|~is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl)))),
% 0.15/0.47    inference(skolemize,[status(esa),new_symbols(skolem,[sK43_skl]),skolemize(P,sK43_skl)],[f131])).
% 0.15/0.47  fof(f134,plain,(
% 0.15/0.47    cn3|~is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl))),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f132])).
% 0.15/0.47  fof(f155,plain,(
% 0.15/0.47    ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 0.15/0.47    inference(pre_NNF_transformation,[status(thm)],[f27])).
% 0.15/0.47  fof(f156,plain,(
% 0.15/0.47    ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f155])).
% 0.15/0.47  fof(f159,plain,(
% 0.15/0.47    ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 0.15/0.47    inference(pre_NNF_transformation,[status(thm)],[f29])).
% 0.15/0.47  fof(f160,plain,(
% 0.15/0.47    ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f159])).
% 0.15/0.47  fof(f165,plain,(
% 0.15/0.47    op_or),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f32])).
% 0.15/0.47  fof(f166,plain,(
% 0.15/0.47    op_implies_and),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f33])).
% 0.15/0.47  fof(f168,plain,(
% 0.15/0.47    modus_ponens),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f35])).
% 0.15/0.47  fof(f169,plain,(
% 0.15/0.47    kn1),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f36])).
% 0.15/0.47  fof(f170,plain,(
% 0.15/0.47    kn2),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f37])).
% 0.15/0.47  fof(f171,plain,(
% 0.15/0.47    kn3),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f38])).
% 0.15/0.47  fof(f176,plain,(
% 0.15/0.47    ~cn3),
% 0.15/0.47    inference(cnf_transformation,[status(thm)],[f44])).
% 0.15/0.47  fof(f177,plain,(
% 0.15/0.47    ~is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f134,f176])).
% 0.15/0.47  fof(f178,plain,(
% 0.15/0.47    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.15/0.47    inference(backward_subsumption_resolution,[status(thm)],[f49,f168])).
% 0.15/0.47  fof(f180,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(implies(X0,and(X0,X0))))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f113,f169])).
% 0.15/0.47  fof(f181,plain,(
% 0.15/0.47    ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0)))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f117,f170])).
% 0.15/0.47  fof(f187,plain,(
% 0.15/0.47    ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1))))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f160,f166])).
% 0.15/0.47  fof(f189,plain,(
% 0.15/0.47    ![X0,X1]: (~op_or|or(X0,X1)=implies(not(X0),X1))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f187,f156])).
% 0.15/0.47  fof(f192,plain,(
% 0.15/0.47    ~is_a_theorem(implies(or(sK43_skl,sK43_skl),sK43_skl))),
% 0.15/0.47    inference(backward_demodulation,[status(thm)],[f195,f177])).
% 0.15/0.47  fof(f195,plain,(
% 0.15/0.47    ![X0,X1]: (or(X0,X1)=implies(not(X0),X1))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f189,f165])).
% 0.15/0.47  fof(f196,plain,(
% 0.15/0.47    ![X0,X1,X2]: (or(and(X0,not(X1)),X2)=implies(implies(X0,X1),X2))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f187,f195])).
% 0.15/0.47  fof(f197,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(or(X0,and(not(X0),not(X0)))))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f195,f180])).
% 0.15/0.47  fof(f198,plain,(
% 0.15/0.47    ![X0,X1]: (~is_a_theorem(not(X0))|~is_a_theorem(or(X0,X1))|is_a_theorem(X1))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f195,f178])).
% 0.15/0.47  fof(f436,plain,(
% 0.15/0.47    ![X0,X1,X2]: (~kn3|is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f195,f121])).
% 0.15/0.47  fof(f437,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))))),
% 0.15/0.47    inference(forward_subsumption_resolution,[status(thm)],[f436,f171])).
% 0.15/0.47  fof(f440,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),or(and(X1,X2),not(and(X2,not(X0)))))))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f195,f437])).
% 0.15/0.47  fof(f453,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),or(and(X1,X2),implies(X2,X0)))))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f187,f440])).
% 0.15/0.47  fof(f458,plain,(
% 0.15/0.47    ![X0,X1,X2]: (~is_a_theorem(or(X0,X1))|is_a_theorem(or(and(X1,X2),implies(X2,X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f453,f178])).
% 0.15/0.47  fof(f461,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),implies(not(X2),X0)))))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f196,f453])).
% 0.15/0.47  fof(f469,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X2,X0)))))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f195,f461])).
% 0.15/0.47  fof(f475,plain,(
% 0.15/0.47    ![X0,X1,X2]: (~is_a_theorem(or(X0,X1))|is_a_theorem(implies(implies(X1,X2),or(X2,X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f469,f178])).
% 0.15/0.47  fof(f485,plain,(
% 0.15/0.47    ![X0,X1]: (is_a_theorem(implies(implies(and(not(X0),not(X0)),X1),or(X1,X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f475,f197])).
% 0.15/0.47  fof(f508,plain,(
% 0.15/0.47    ![X0,X1]: (~is_a_theorem(implies(and(not(X0),not(X0)),X1))|is_a_theorem(or(X1,X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f485,f178])).
% 0.15/0.47  fof(f524,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(or(not(X0),X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f508,f181])).
% 0.15/0.47  fof(f536,plain,(
% 0.15/0.47    ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f524,f475])).
% 0.15/0.47  fof(f538,plain,(
% 0.15/0.47    ![X0]: (~is_a_theorem(not(not(X0)))|is_a_theorem(X0))),
% 0.15/0.47    inference(resolution,[status(thm)],[f524,f198])).
% 0.15/0.47  fof(f544,plain,(
% 0.15/0.47    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(or(X1,not(X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f536,f178])).
% 0.15/0.47  fof(f604,plain,(
% 0.15/0.47    ![X0,X1]: (is_a_theorem(or(X0,not(and(X0,X1)))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f544,f181])).
% 0.15/0.47  fof(f605,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(or(and(X0,X0),not(X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f544,f180])).
% 0.15/0.47  fof(f609,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(implies(not(and(X0,X1)),X2),or(X2,X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f604,f475])).
% 0.15/0.47  fof(f615,plain,(
% 0.15/0.47    ![X0,X1]: (is_a_theorem(or(X0,implies(X0,X1))))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f187,f604])).
% 0.15/0.47  fof(f620,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(implies(or(and(X0,X1),X2),or(X2,X0))))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f195,f609])).
% 0.15/0.47  fof(f622,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(or(and(implies(X0,X1),X2),implies(X2,X0))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f615,f458])).
% 0.15/0.47  fof(f630,plain,(
% 0.15/0.47    ![X0]: (~is_a_theorem(not(and(X0,X0)))|is_a_theorem(not(X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f605,f198])).
% 0.15/0.47  fof(f658,plain,(
% 0.15/0.47    ![X0]: (~is_a_theorem(implies(not(X0),X0))|is_a_theorem(not(not(X0))))),
% 0.15/0.47    inference(paramodulation,[status(thm)],[f187,f630])).
% 0.15/0.47  fof(f661,plain,(
% 0.15/0.47    ![X0]: (~is_a_theorem(or(X0,X0))|is_a_theorem(not(not(X0))))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f195,f658])).
% 0.15/0.47  fof(f829,plain,(
% 0.15/0.47    ![X0,X1,X2]: (~is_a_theorem(or(and(X0,X1),X2))|is_a_theorem(or(X2,X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f620,f178])).
% 0.15/0.47  fof(f893,plain,(
% 0.15/0.47    ![X0,X1,X2]: (is_a_theorem(or(implies(X0,X1),implies(X1,X2))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f829,f622])).
% 0.15/0.47  fof(f921,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(not(not(implies(X0,X0)))))),
% 0.15/0.47    inference(resolution,[status(thm)],[f893,f661])).
% 0.15/0.47  fof(f931,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(implies(X0,X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f921,f538])).
% 0.15/0.47  fof(f939,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(or(and(not(X0),not(X0)),X0)))),
% 0.15/0.47    inference(resolution,[status(thm)],[f931,f508])).
% 0.15/0.47  fof(f946,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(implies(implies(not(X0),X0),X0)))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f196,f939])).
% 0.15/0.47  fof(f947,plain,(
% 0.15/0.47    ![X0]: (is_a_theorem(implies(or(X0,X0),X0)))),
% 0.15/0.47    inference(forward_demodulation,[status(thm)],[f195,f946])).
% 0.15/0.47  fof(f1022,plain,(
% 0.15/0.47    $false),
% 0.15/0.47    inference(backward_subsumption_resolution,[status(thm)],[f192,f947])).
% 0.15/0.47  % SZS output end CNFRefutation for theBenchmark.p
% 0.17/0.57  % Elapsed time: 0.192896 seconds
% 0.17/0.57  % CPU time: 0.669559 seconds
% 0.17/0.57  % Total memory used: 97.523 MB
% 0.17/0.57  % Net memory used: 97.195 MB
%------------------------------------------------------------------------------