TSTP Solution File: LCL456+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : LCL456+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 31 12:19:22 EDT 2023

% Result   : Theorem 1.79s 0.63s
% Output   : CNFRefutation 2.29s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL456+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33  % Computer : n001.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 300
% 0.13/0.33  % DateTime : Tue May 30 10:14:15 EDT 2023
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  % Drodi V3.5.1
% 1.79/0.63  % Refutation found
% 1.79/0.63  % SZS status Theorem for theBenchmark: Theorem is valid
% 1.79/0.63  % SZS output start CNFRefutation for theBenchmark
% 1.79/0.63  fof(f3,axiom,(
% 1.79/0.63    ( modus_tollens<=> (! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y))) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f24,axiom,(
% 1.79/0.63    ( r3<=> (! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f27,axiom,(
% 1.79/0.63    ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f28,axiom,(
% 1.79/0.63    ( op_and=> (! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f29,axiom,(
% 1.79/0.63    ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f30,axiom,(
% 1.79/0.63    ( op_implies_or=> (! [X,Y] : implies(X,Y) = or(not(X),Y) )) ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f32,axiom,(
% 1.79/0.63    op_or ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f33,axiom,(
% 1.79/0.63    op_implies_and ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f36,axiom,(
% 1.79/0.63    modus_tollens ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f50,axiom,(
% 1.79/0.63    op_implies_or ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f51,axiom,(
% 1.79/0.63    op_and ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f53,conjecture,(
% 1.79/0.63    r3 ),
% 1.79/0.63    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 1.79/0.63  fof(f54,negated_conjecture,(
% 1.79/0.63    ~(r3 )),
% 1.79/0.63    inference(negated_conjecture,[status(cth)],[f53])).
% 1.79/0.63  fof(f69,plain,(
% 1.79/0.63    (~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)))))),
% 1.79/0.63    inference(NNF_transformation,[status(esa)],[f3])).
% 1.79/0.63  fof(f70,plain,(
% 1.79/0.63    (~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))))),
% 1.79/0.63    inference(skolemization,[status(esa)],[f69])).
% 1.79/0.63  fof(f71,plain,(
% 1.79/0.63    ![X0,X1]: (~modus_tollens|is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f70])).
% 1.79/0.63  fof(f153,plain,(
% 1.79/0.63    (~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)))))),
% 1.79/0.63    inference(NNF_transformation,[status(esa)],[f24])).
% 1.79/0.63  fof(f154,plain,(
% 1.79/0.63    (~r3|(![P,Q]: is_a_theorem(implies(or(P,Q),or(Q,P)))))&(r3|~is_a_theorem(implies(or(sk0_47,sk0_48),or(sk0_48,sk0_47))))),
% 1.79/0.63    inference(skolemization,[status(esa)],[f153])).
% 1.79/0.63  fof(f156,plain,(
% 1.79/0.63    r3|~is_a_theorem(implies(or(sk0_47,sk0_48),or(sk0_48,sk0_47)))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f154])).
% 1.79/0.63  fof(f165,plain,(
% 1.79/0.63    ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 1.79/0.63    inference(pre_NNF_transformation,[status(esa)],[f27])).
% 1.79/0.63  fof(f166,plain,(
% 1.79/0.63    ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f165])).
% 1.79/0.63  fof(f167,plain,(
% 1.79/0.63    ~op_and|(![X,Y]: and(X,Y)=not(or(not(X),not(Y))))),
% 1.79/0.63    inference(pre_NNF_transformation,[status(esa)],[f28])).
% 1.79/0.63  fof(f168,plain,(
% 1.79/0.63    ![X0,X1]: (~op_and|and(X0,X1)=not(or(not(X0),not(X1))))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f167])).
% 1.79/0.63  fof(f169,plain,(
% 1.79/0.63    ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 1.79/0.63    inference(pre_NNF_transformation,[status(esa)],[f29])).
% 1.79/0.63  fof(f170,plain,(
% 1.79/0.63    ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f169])).
% 1.79/0.63  fof(f171,plain,(
% 1.79/0.63    ~op_implies_or|(![X,Y]: implies(X,Y)=or(not(X),Y))),
% 1.79/0.63    inference(pre_NNF_transformation,[status(esa)],[f30])).
% 1.79/0.63  fof(f172,plain,(
% 1.79/0.63    ![X0,X1]: (~op_implies_or|implies(X0,X1)=or(not(X0),X1))),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f171])).
% 1.79/0.63  fof(f175,plain,(
% 1.79/0.63    op_or),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f32])).
% 1.79/0.63  fof(f176,plain,(
% 1.79/0.63    op_implies_and),
% 1.79/0.63    inference(cnf_transformation,[status(esa)],[f33])).
% 1.79/0.63  fof(f179,plain,(
% 1.79/0.63    modus_tollens),
% 2.29/0.65    inference(cnf_transformation,[status(esa)],[f36])).
% 2.29/0.65  fof(f193,plain,(
% 2.29/0.65    op_implies_or),
% 2.29/0.65    inference(cnf_transformation,[status(esa)],[f50])).
% 2.29/0.65  fof(f194,plain,(
% 2.29/0.65    op_and),
% 2.29/0.65    inference(cnf_transformation,[status(esa)],[f51])).
% 2.29/0.65  fof(f196,plain,(
% 2.29/0.65    ~r3),
% 2.29/0.65    inference(cnf_transformation,[status(esa)],[f54])).
% 2.29/0.65  fof(f231,plain,(
% 2.29/0.65    spl0_9 <=> modus_tollens),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f233,plain,(
% 2.29/0.65    ~modus_tollens|spl0_9),
% 2.29/0.65    inference(component_clause,[status(thm)],[f231])).
% 2.29/0.65  fof(f234,plain,(
% 2.29/0.65    spl0_10 <=> is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f235,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))|~spl0_10)),
% 2.29/0.65    inference(component_clause,[status(thm)],[f234])).
% 2.29/0.65  fof(f237,plain,(
% 2.29/0.65    ~spl0_9|spl0_10),
% 2.29/0.65    inference(split_clause,[status(thm)],[f71,f231,f234])).
% 2.29/0.65  fof(f453,plain,(
% 2.29/0.65    spl0_69 <=> r3),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f454,plain,(
% 2.29/0.65    r3|~spl0_69),
% 2.29/0.65    inference(component_clause,[status(thm)],[f453])).
% 2.29/0.65  fof(f460,plain,(
% 2.29/0.65    spl0_71 <=> is_a_theorem(implies(or(sk0_47,sk0_48),or(sk0_48,sk0_47)))),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f462,plain,(
% 2.29/0.65    ~is_a_theorem(implies(or(sk0_47,sk0_48),or(sk0_48,sk0_47)))|spl0_71),
% 2.29/0.65    inference(component_clause,[status(thm)],[f460])).
% 2.29/0.65  fof(f463,plain,(
% 2.29/0.65    spl0_69|~spl0_71),
% 2.29/0.65    inference(split_clause,[status(thm)],[f156,f453,f460])).
% 2.29/0.65  fof(f486,plain,(
% 2.29/0.65    spl0_78 <=> op_or),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f488,plain,(
% 2.29/0.65    ~op_or|spl0_78),
% 2.29/0.65    inference(component_clause,[status(thm)],[f486])).
% 2.29/0.65  fof(f489,plain,(
% 2.29/0.65    spl0_79 <=> or(X0,X1)=not(and(not(X0),not(X1)))),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f490,plain,(
% 2.29/0.65    ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~spl0_79)),
% 2.29/0.65    inference(component_clause,[status(thm)],[f489])).
% 2.29/0.65  fof(f492,plain,(
% 2.29/0.65    ~spl0_78|spl0_79),
% 2.29/0.65    inference(split_clause,[status(thm)],[f166,f486,f489])).
% 2.29/0.65  fof(f493,plain,(
% 2.29/0.65    spl0_80 <=> op_and),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f495,plain,(
% 2.29/0.65    ~op_and|spl0_80),
% 2.29/0.65    inference(component_clause,[status(thm)],[f493])).
% 2.29/0.65  fof(f496,plain,(
% 2.29/0.65    spl0_81 <=> and(X0,X1)=not(or(not(X0),not(X1)))),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f497,plain,(
% 2.29/0.65    ![X0,X1]: (and(X0,X1)=not(or(not(X0),not(X1)))|~spl0_81)),
% 2.29/0.65    inference(component_clause,[status(thm)],[f496])).
% 2.29/0.65  fof(f499,plain,(
% 2.29/0.65    ~spl0_80|spl0_81),
% 2.29/0.65    inference(split_clause,[status(thm)],[f168,f493,f496])).
% 2.29/0.65  fof(f500,plain,(
% 2.29/0.65    spl0_82 <=> op_implies_and),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f502,plain,(
% 2.29/0.65    ~op_implies_and|spl0_82),
% 2.29/0.65    inference(component_clause,[status(thm)],[f500])).
% 2.29/0.65  fof(f503,plain,(
% 2.29/0.65    spl0_83 <=> implies(X0,X1)=not(and(X0,not(X1)))),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f504,plain,(
% 2.29/0.65    ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~spl0_83)),
% 2.29/0.65    inference(component_clause,[status(thm)],[f503])).
% 2.29/0.65  fof(f506,plain,(
% 2.29/0.65    ~spl0_82|spl0_83),
% 2.29/0.65    inference(split_clause,[status(thm)],[f170,f500,f503])).
% 2.29/0.65  fof(f507,plain,(
% 2.29/0.65    spl0_84 <=> op_implies_or),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f509,plain,(
% 2.29/0.65    ~op_implies_or|spl0_84),
% 2.29/0.65    inference(component_clause,[status(thm)],[f507])).
% 2.29/0.65  fof(f510,plain,(
% 2.29/0.65    spl0_85 <=> implies(X0,X1)=or(not(X0),X1)),
% 2.29/0.65    introduced(split_symbol_definition)).
% 2.29/0.65  fof(f511,plain,(
% 2.29/0.65    ![X0,X1]: (implies(X0,X1)=or(not(X0),X1)|~spl0_85)),
% 2.29/0.65    inference(component_clause,[status(thm)],[f510])).
% 2.29/0.65  fof(f513,plain,(
% 2.29/0.65    ~spl0_84|spl0_85),
% 2.29/0.65    inference(split_clause,[status(thm)],[f172,f507,f510])).
% 2.29/0.65  fof(f527,plain,(
% 2.29/0.65    $false|spl0_84),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f509,f193])).
% 2.29/0.65  fof(f528,plain,(
% 2.29/0.65    spl0_84),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f527])).
% 2.29/0.65  fof(f529,plain,(
% 2.29/0.65    $false|spl0_82),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f502,f176])).
% 2.29/0.65  fof(f530,plain,(
% 2.29/0.65    spl0_82),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f529])).
% 2.29/0.65  fof(f531,plain,(
% 2.29/0.65    $false|spl0_80),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f495,f194])).
% 2.29/0.65  fof(f532,plain,(
% 2.29/0.65    spl0_80),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f531])).
% 2.29/0.65  fof(f533,plain,(
% 2.29/0.65    $false|spl0_78),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f488,f175])).
% 2.29/0.65  fof(f534,plain,(
% 2.29/0.65    spl0_78),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f533])).
% 2.29/0.65  fof(f572,plain,(
% 2.29/0.65    ![X0,X1]: (and(X0,X1)=not(implies(X0,not(X1)))|~spl0_85|~spl0_81)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f511,f497])).
% 2.29/0.65  fof(f576,plain,(
% 2.29/0.65    ![X0,X1,X2]: (implies(implies(X0,not(X1)),X2)=or(and(X0,X1),X2)|~spl0_85|~spl0_81)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f572,f511])).
% 2.29/0.65  fof(f577,plain,(
% 2.29/0.65    ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f504,f490])).
% 2.29/0.65  fof(f591,plain,(
% 2.29/0.65    ![X0,X1]: (and(not(X0),X1)=not(or(X0,not(X1)))|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f577,f572])).
% 2.29/0.65  fof(f610,plain,(
% 2.29/0.65    ![X0,X1]: (and(not(not(X0)),X1)=not(implies(X0,not(X1)))|~spl0_81|~spl0_79|~spl0_83|~spl0_85)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f511,f591])).
% 2.29/0.65  fof(f622,plain,(
% 2.29/0.65    ![X0,X1,X2]: (implies(or(X0,not(X1)),X2)=or(and(not(X0),X1),X2)|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f591,f511])).
% 2.29/0.65  fof(f688,plain,(
% 2.29/0.65    ![X0,X1]: (or(not(X0),X1)=not(not(implies(X0,not(not(X1)))))|~spl0_81|~spl0_79|~spl0_83|~spl0_85)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f610,f490])).
% 2.29/0.65  fof(f689,plain,(
% 2.29/0.65    ![X0,X1]: (or(not(X0),X1)=not(and(X0,not(X1)))|~spl0_81|~spl0_79|~spl0_83|~spl0_85)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f572,f688])).
% 2.29/0.65  fof(f698,plain,(
% 2.29/0.65    ![X0,X1]: (or(not(not(X0)),X1)=or(X0,X1)|~spl0_81|~spl0_83|~spl0_85|~spl0_79)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f490,f689])).
% 2.29/0.65  fof(f738,plain,(
% 2.29/0.65    ![X0,X1,X2]: (or(not(or(not(X0),X1)),X2)=or(and(X0,not(X1)),X2)|~spl0_81|~spl0_79|~spl0_83|~spl0_85)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f689,f698])).
% 2.29/0.65  fof(f739,plain,(
% 2.29/0.65    ![X0,X1,X2]: (or(not(implies(X0,X1)),X2)=or(and(X0,not(X1)),X2)|~spl0_81|~spl0_79|~spl0_83|~spl0_85)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f511,f738])).
% 2.29/0.65  fof(f1308,plain,(
% 2.29/0.65    ![X0,X1,X2]: (or(not(implies(not(X0),X1)),X2)=implies(or(X0,not(not(X1))),X2)|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f622,f739])).
% 2.29/0.65  fof(f1309,plain,(
% 2.29/0.65    ![X0,X1,X2]: (or(not(or(X0,X1)),X2)=implies(or(X0,not(not(X1))),X2)|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f577,f1308])).
% 2.29/0.65  fof(f2135,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(or(and(not(X0),X1),implies(X1,X0)))|~spl0_85|~spl0_81|~spl0_10)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f576,f235])).
% 2.29/0.65  fof(f2136,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0)))|~spl0_79|~spl0_83|~spl0_85|~spl0_81|~spl0_10)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f622,f2135])).
% 2.29/0.65  fof(f2139,plain,(
% 2.29/0.65    $false|spl0_9),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f233,f179])).
% 2.29/0.65  fof(f2140,plain,(
% 2.29/0.65    spl0_9),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f2139])).
% 2.29/0.65  fof(f2734,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(or(not(or(X0,X1)),implies(not(X1),X0)))|~spl0_10|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(paramodulation,[status(thm)],[f1309,f2136])).
% 2.29/0.65  fof(f2735,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(implies(or(X0,X1),implies(not(X1),X0)))|~spl0_10|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f511,f2734])).
% 2.29/0.65  fof(f2736,plain,(
% 2.29/0.65    ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,X0)))|~spl0_10|~spl0_85|~spl0_81|~spl0_79|~spl0_83)),
% 2.29/0.65    inference(forward_demodulation,[status(thm)],[f577,f2735])).
% 2.29/0.65  fof(f3257,plain,(
% 2.29/0.65    $false|~spl0_10|~spl0_85|~spl0_81|~spl0_79|~spl0_83|spl0_71),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f462,f2736])).
% 2.29/0.65  fof(f3258,plain,(
% 2.29/0.65    ~spl0_10|~spl0_85|~spl0_81|~spl0_79|~spl0_83|spl0_71),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f3257])).
% 2.29/0.65  fof(f3259,plain,(
% 2.29/0.65    $false|~spl0_69),
% 2.29/0.65    inference(forward_subsumption_resolution,[status(thm)],[f454,f196])).
% 2.29/0.65  fof(f3260,plain,(
% 2.29/0.65    ~spl0_69),
% 2.29/0.65    inference(contradiction_clause,[status(thm)],[f3259])).
% 2.29/0.65  fof(f3261,plain,(
% 2.29/0.65    $false),
% 2.29/0.65    inference(sat_refutation,[status(thm)],[f237,f463,f492,f499,f506,f513,f528,f530,f532,f534,f2140,f3258,f3260])).
% 2.29/0.65  % SZS output end CNFRefutation for theBenchmark.p
% 2.29/0.67  % Elapsed time: 0.318267 seconds
% 2.29/0.67  % CPU time: 2.332428 seconds
% 2.29/0.67  % Memory used: 93.409 MB
%------------------------------------------------------------------------------