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

View Problem - Process Solution

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

% Computer : n014.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:33 EDT 2023

% Result   : Theorem 0.07s 0.28s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : LCL538+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.08  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.27  % Computer : n014.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 300
% 0.07/0.27  % DateTime : Tue May 30 09:44:03 EDT 2023
% 0.07/0.27  % CPUTime  : 
% 0.07/0.27  % Drodi V3.5.1
% 0.07/0.28  % Refutation found
% 0.07/0.28  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.28  % SZS output start CNFRefutation for theBenchmark
% 0.07/0.28  fof(f1,axiom,(
% 0.07/0.28    ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f35,axiom,(
% 0.07/0.28    modus_ponens ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f37,axiom,(
% 0.07/0.28    implies_1 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f39,axiom,(
% 0.07/0.28    implies_3 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f40,axiom,(
% 0.07/0.28    and_1 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f41,axiom,(
% 0.07/0.28    and_2 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f43,axiom,(
% 0.07/0.28    or_1 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f44,axiom,(
% 0.07/0.28    or_2 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f51,axiom,(
% 0.07/0.28    ( modus_ponens_strict_implies<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(strict_implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f55,axiom,(
% 0.07/0.28    ( axiom_M<=> (! [X] : is_a_theorem(implies(necessarily(X),X)) )) ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f75,axiom,(
% 0.07/0.28    ( op_strict_implies=> (! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) )) ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f80,axiom,(
% 0.07/0.28    axiom_M ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f81,axiom,(
% 0.07/0.28    axiom_4 ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f82,axiom,(
% 0.07/0.28    axiom_B ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f86,axiom,(
% 0.07/0.28    op_strict_implies ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f89,conjecture,(
% 0.07/0.28    modus_ponens_strict_implies ),
% 0.07/0.28    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.07/0.28  fof(f90,negated_conjecture,(
% 0.07/0.28    ~(modus_ponens_strict_implies )),
% 0.07/0.28    inference(negated_conjecture,[status(cth)],[f89])).
% 0.07/0.28  fof(f91,plain,(
% 0.07/0.28    modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 0.07/0.28    inference(pre_NNF_transformation,[status(esa)],[f1])).
% 0.07/0.28  fof(f92,plain,(
% 0.07/0.28    (~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.07/0.28    inference(NNF_transformation,[status(esa)],[f91])).
% 0.07/0.28  fof(f93,plain,(
% 0.07/0.28    (~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.07/0.28    inference(miniscoping,[status(esa)],[f92])).
% 0.07/0.28  fof(f94,plain,(
% 0.07/0.28    (~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)))),
% 0.07/0.28    inference(skolemization,[status(esa)],[f93])).
% 0.07/0.28  fof(f95,plain,(
% 0.07/0.28    ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f94])).
% 0.07/0.28  fof(f214,plain,(
% 0.07/0.28    modus_ponens),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f35])).
% 0.07/0.28  fof(f216,plain,(
% 0.07/0.28    implies_1),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f37])).
% 0.07/0.28  fof(f218,plain,(
% 0.07/0.28    implies_3),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f39])).
% 0.07/0.28  fof(f219,plain,(
% 0.07/0.28    and_1),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f40])).
% 0.07/0.28  fof(f220,plain,(
% 0.07/0.28    and_2),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f41])).
% 0.07/0.28  fof(f222,plain,(
% 0.07/0.28    or_1),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f43])).
% 0.07/0.28  fof(f223,plain,(
% 0.07/0.28    or_2),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f44])).
% 0.07/0.28  fof(f235,plain,(
% 0.07/0.28    modus_ponens_strict_implies<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(strict_implies(X,Y)))|is_a_theorem(Y)))),
% 0.07/0.28    inference(pre_NNF_transformation,[status(esa)],[f51])).
% 0.07/0.28  fof(f236,plain,(
% 0.07/0.28    (~modus_ponens_strict_implies|(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(strict_implies(X,Y)))|is_a_theorem(Y))))&(modus_ponens_strict_implies|(?[X,Y]: ((is_a_theorem(X)&is_a_theorem(strict_implies(X,Y)))&~is_a_theorem(Y))))),
% 0.07/0.28    inference(NNF_transformation,[status(esa)],[f235])).
% 0.07/0.28  fof(f237,plain,(
% 0.07/0.28    (~modus_ponens_strict_implies|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(strict_implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens_strict_implies|(?[Y]: ((?[X]: (is_a_theorem(X)&is_a_theorem(strict_implies(X,Y))))&~is_a_theorem(Y))))),
% 0.07/0.28    inference(miniscoping,[status(esa)],[f236])).
% 0.07/0.28  fof(f238,plain,(
% 0.07/0.28    (~modus_ponens_strict_implies|(![Y]: ((![X]: (~is_a_theorem(X)|~is_a_theorem(strict_implies(X,Y))))|is_a_theorem(Y))))&(modus_ponens_strict_implies|((is_a_theorem(sk0_57)&is_a_theorem(strict_implies(sk0_57,sk0_56)))&~is_a_theorem(sk0_56)))),
% 0.07/0.28    inference(skolemization,[status(esa)],[f237])).
% 0.07/0.28  fof(f240,plain,(
% 0.07/0.28    modus_ponens_strict_implies|is_a_theorem(sk0_57)),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f238])).
% 0.07/0.28  fof(f241,plain,(
% 0.07/0.28    modus_ponens_strict_implies|is_a_theorem(strict_implies(sk0_57,sk0_56))),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f238])).
% 0.07/0.28  fof(f242,plain,(
% 0.07/0.28    modus_ponens_strict_implies|~is_a_theorem(sk0_56)),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f238])).
% 0.07/0.28  fof(f260,plain,(
% 0.07/0.28    (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|(?[X]: ~is_a_theorem(implies(necessarily(X),X))))),
% 0.07/0.28    inference(NNF_transformation,[status(esa)],[f55])).
% 0.07/0.28  fof(f261,plain,(
% 0.07/0.28    (~axiom_M|(![X]: is_a_theorem(implies(necessarily(X),X))))&(axiom_M|~is_a_theorem(implies(necessarily(sk0_64),sk0_64)))),
% 0.07/0.28    inference(skolemization,[status(esa)],[f260])).
% 0.07/0.28  fof(f262,plain,(
% 0.07/0.28    ![X0]: (~axiom_M|is_a_theorem(implies(necessarily(X0),X0)))),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f261])).
% 0.07/0.28  fof(f336,plain,(
% 0.07/0.28    ~op_strict_implies|(![X,Y]: strict_implies(X,Y)=necessarily(implies(X,Y)))),
% 0.07/0.28    inference(pre_NNF_transformation,[status(esa)],[f75])).
% 0.07/0.28  fof(f337,plain,(
% 0.07/0.28    ![X0,X1]: (~op_strict_implies|strict_implies(X0,X1)=necessarily(implies(X0,X1)))),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f336])).
% 0.07/0.28  fof(f343,plain,(
% 0.07/0.28    axiom_M),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f80])).
% 0.07/0.28  fof(f344,plain,(
% 0.07/0.28    axiom_4),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f81])).
% 0.07/0.28  fof(f345,plain,(
% 0.07/0.28    axiom_B),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f82])).
% 0.07/0.28  fof(f349,plain,(
% 0.07/0.28    op_strict_implies),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f86])).
% 0.07/0.28  fof(f352,plain,(
% 0.07/0.28    ~modus_ponens_strict_implies),
% 0.07/0.28    inference(cnf_transformation,[status(esa)],[f90])).
% 0.07/0.28  fof(f353,plain,(
% 0.07/0.28    spl0_0 <=> modus_ponens),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f355,plain,(
% 0.07/0.28    ~modus_ponens|spl0_0),
% 0.07/0.28    inference(component_clause,[status(thm)],[f353])).
% 0.07/0.28  fof(f356,plain,(
% 0.07/0.28    spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f357,plain,(
% 0.07/0.28    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 0.07/0.28    inference(component_clause,[status(thm)],[f356])).
% 0.07/0.28  fof(f359,plain,(
% 0.07/0.28    ~spl0_0|spl0_1),
% 0.07/0.28    inference(split_clause,[status(thm)],[f95,f353,f356])).
% 0.07/0.28  fof(f398,plain,(
% 0.07/0.28    spl0_12 <=> implies_1),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f400,plain,(
% 0.07/0.28    ~implies_1|spl0_12),
% 0.07/0.28    inference(component_clause,[status(thm)],[f398])).
% 0.07/0.28  fof(f420,plain,(
% 0.07/0.28    spl0_18 <=> implies_3),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f422,plain,(
% 0.07/0.28    ~implies_3|spl0_18),
% 0.07/0.28    inference(component_clause,[status(thm)],[f420])).
% 0.07/0.28  fof(f431,plain,(
% 0.07/0.28    spl0_21 <=> and_1),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f433,plain,(
% 0.07/0.28    ~and_1|spl0_21),
% 0.07/0.28    inference(component_clause,[status(thm)],[f431])).
% 0.07/0.28  fof(f442,plain,(
% 0.07/0.28    spl0_24 <=> and_2),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f444,plain,(
% 0.07/0.28    ~and_2|spl0_24),
% 0.07/0.28    inference(component_clause,[status(thm)],[f442])).
% 0.07/0.28  fof(f464,plain,(
% 0.07/0.28    spl0_30 <=> or_1),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f466,plain,(
% 0.07/0.28    ~or_1|spl0_30),
% 0.07/0.28    inference(component_clause,[status(thm)],[f464])).
% 0.07/0.28  fof(f475,plain,(
% 0.07/0.28    spl0_33 <=> or_2),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f477,plain,(
% 0.07/0.28    ~or_2|spl0_33),
% 0.07/0.28    inference(component_clause,[status(thm)],[f475])).
% 0.07/0.28  fof(f692,plain,(
% 0.07/0.28    spl0_92 <=> modus_ponens_strict_implies),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f693,plain,(
% 0.07/0.28    modus_ponens_strict_implies|~spl0_92),
% 0.07/0.28    inference(component_clause,[status(thm)],[f692])).
% 0.07/0.28  fof(f699,plain,(
% 0.07/0.28    spl0_94 <=> is_a_theorem(sk0_57)),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f702,plain,(
% 0.07/0.28    spl0_92|spl0_94),
% 0.07/0.28    inference(split_clause,[status(thm)],[f240,f692,f699])).
% 0.07/0.28  fof(f703,plain,(
% 0.07/0.28    spl0_95 <=> is_a_theorem(strict_implies(sk0_57,sk0_56))),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f704,plain,(
% 0.07/0.28    is_a_theorem(strict_implies(sk0_57,sk0_56))|~spl0_95),
% 0.07/0.28    inference(component_clause,[status(thm)],[f703])).
% 0.07/0.28  fof(f706,plain,(
% 0.07/0.28    spl0_92|spl0_95),
% 0.07/0.28    inference(split_clause,[status(thm)],[f241,f692,f703])).
% 0.07/0.28  fof(f707,plain,(
% 0.07/0.28    spl0_96 <=> is_a_theorem(sk0_56)),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f710,plain,(
% 0.07/0.28    spl0_92|~spl0_96),
% 0.07/0.28    inference(split_clause,[status(thm)],[f242,f692,f707])).
% 0.07/0.28  fof(f756,plain,(
% 0.07/0.28    spl0_109 <=> axiom_M),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f758,plain,(
% 0.07/0.28    ~axiom_M|spl0_109),
% 0.07/0.28    inference(component_clause,[status(thm)],[f756])).
% 0.07/0.28  fof(f759,plain,(
% 0.07/0.28    spl0_110 <=> is_a_theorem(implies(necessarily(X0),X0))),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f760,plain,(
% 0.07/0.28    ![X0]: (is_a_theorem(implies(necessarily(X0),X0))|~spl0_110)),
% 0.07/0.28    inference(component_clause,[status(thm)],[f759])).
% 0.07/0.28  fof(f762,plain,(
% 0.07/0.28    ~spl0_109|spl0_110),
% 0.07/0.28    inference(split_clause,[status(thm)],[f262,f756,f759])).
% 0.07/0.28  fof(f767,plain,(
% 0.07/0.28    spl0_112 <=> axiom_4),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f769,plain,(
% 0.07/0.28    ~axiom_4|spl0_112),
% 0.07/0.28    inference(component_clause,[status(thm)],[f767])).
% 0.07/0.28  fof(f778,plain,(
% 0.07/0.28    spl0_115 <=> axiom_B),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f780,plain,(
% 0.07/0.28    ~axiom_B|spl0_115),
% 0.07/0.28    inference(component_clause,[status(thm)],[f778])).
% 0.07/0.28  fof(f968,plain,(
% 0.07/0.28    spl0_167 <=> op_strict_implies),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f970,plain,(
% 0.07/0.28    ~op_strict_implies|spl0_167),
% 0.07/0.28    inference(component_clause,[status(thm)],[f968])).
% 0.07/0.28  fof(f971,plain,(
% 0.07/0.28    spl0_168 <=> strict_implies(X0,X1)=necessarily(implies(X0,X1))),
% 0.07/0.28    introduced(split_symbol_definition)).
% 0.07/0.28  fof(f972,plain,(
% 0.07/0.28    ![X0,X1]: (strict_implies(X0,X1)=necessarily(implies(X0,X1))|~spl0_168)),
% 0.07/0.28    inference(component_clause,[status(thm)],[f971])).
% 0.07/0.28  fof(f974,plain,(
% 0.07/0.28    ~spl0_167|spl0_168),
% 0.07/0.28    inference(split_clause,[status(thm)],[f337,f968,f971])).
% 0.07/0.28  fof(f982,plain,(
% 0.07/0.28    $false|~spl0_92),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f693,f352])).
% 0.07/0.28  fof(f983,plain,(
% 0.07/0.28    ~spl0_92),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f982])).
% 0.07/0.28  fof(f984,plain,(
% 0.07/0.28    $false|spl0_0),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f355,f214])).
% 0.07/0.28  fof(f985,plain,(
% 0.07/0.28    spl0_0),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f984])).
% 0.07/0.28  fof(f992,plain,(
% 0.07/0.28    $false|spl0_167),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f970,f349])).
% 0.07/0.28  fof(f993,plain,(
% 0.07/0.28    spl0_167),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f992])).
% 0.07/0.28  fof(f1008,plain,(
% 0.07/0.28    $false|spl0_109),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f758,f343])).
% 0.07/0.28  fof(f1009,plain,(
% 0.07/0.28    spl0_109),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1008])).
% 0.07/0.28  fof(f1021,plain,(
% 0.07/0.28    $false|spl0_115),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f780,f345])).
% 0.07/0.28  fof(f1022,plain,(
% 0.07/0.28    spl0_115),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1021])).
% 0.07/0.28  fof(f1025,plain,(
% 0.07/0.28    $false|spl0_33),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f477,f223])).
% 0.07/0.28  fof(f1026,plain,(
% 0.07/0.28    spl0_33),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1025])).
% 0.07/0.28  fof(f1031,plain,(
% 0.07/0.28    $false|spl0_21),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f433,f219])).
% 0.07/0.28  fof(f1032,plain,(
% 0.07/0.28    spl0_21),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1031])).
% 0.07/0.28  fof(f1037,plain,(
% 0.07/0.28    $false|spl0_30),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f466,f222])).
% 0.07/0.28  fof(f1038,plain,(
% 0.07/0.28    spl0_30),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1037])).
% 0.07/0.28  fof(f1041,plain,(
% 0.07/0.28    $false|spl0_24),
% 0.07/0.28    inference(forward_subsumption_resolution,[status(thm)],[f444,f220])).
% 0.07/0.28  fof(f1042,plain,(
% 0.07/0.28    spl0_24),
% 0.07/0.28    inference(contradiction_clause,[status(thm)],[f1041])).
% 0.07/0.28  fof(f1048,plain,(
% 0.07/0.29    $false|spl0_12),
% 0.07/0.29    inference(forward_subsumption_resolution,[status(thm)],[f400,f216])).
% 0.07/0.29  fof(f1049,plain,(
% 0.07/0.29    spl0_12),
% 0.07/0.29    inference(contradiction_clause,[status(thm)],[f1048])).
% 0.07/0.29  fof(f1066,plain,(
% 0.07/0.29    $false|spl0_112),
% 0.07/0.29    inference(forward_subsumption_resolution,[status(thm)],[f769,f344])).
% 0.07/0.29  fof(f1067,plain,(
% 0.07/0.29    spl0_112),
% 0.07/0.29    inference(contradiction_clause,[status(thm)],[f1066])).
% 0.07/0.29  fof(f1073,plain,(
% 0.07/0.29    ![X0]: (~is_a_theorem(necessarily(X0))|is_a_theorem(X0)|~spl0_1|~spl0_110)),
% 0.07/0.29    inference(resolution,[status(thm)],[f357,f760])).
% 0.07/0.29  fof(f1082,plain,(
% 0.07/0.29    ![X0,X1]: (~is_a_theorem(strict_implies(X0,X1))|is_a_theorem(implies(X0,X1))|~spl0_1|~spl0_110|~spl0_168)),
% 0.07/0.29    inference(paramodulation,[status(thm)],[f972,f1073])).
% 0.07/0.29  fof(f1157,plain,(
% 0.07/0.29    $false|spl0_18),
% 0.07/0.29    inference(forward_subsumption_resolution,[status(thm)],[f422,f218])).
% 0.07/0.29  fof(f1158,plain,(
% 0.07/0.29    spl0_18),
% 0.07/0.29    inference(contradiction_clause,[status(thm)],[f1157])).
% 0.07/0.29  fof(f1166,plain,(
% 0.07/0.29    is_a_theorem(implies(sk0_57,sk0_56))|~spl0_1|~spl0_110|~spl0_168|~spl0_95),
% 0.07/0.29    inference(resolution,[status(thm)],[f1082,f704])).
% 0.07/0.29  fof(f1171,plain,(
% 0.07/0.29    ~is_a_theorem(sk0_57)|is_a_theorem(sk0_56)|~spl0_1|~spl0_110|~spl0_168|~spl0_95),
% 0.07/0.29    inference(resolution,[status(thm)],[f357,f1166])).
% 0.07/0.29  fof(f1172,plain,(
% 0.07/0.29    ~spl0_94|spl0_96|~spl0_1|~spl0_110|~spl0_168|~spl0_95),
% 0.07/0.29    inference(split_clause,[status(thm)],[f1171,f699,f707,f356,f759,f971,f703])).
% 0.07/0.29  fof(f1184,plain,(
% 0.07/0.29    $false),
% 0.07/0.29    inference(sat_refutation,[status(thm)],[f359,f702,f706,f710,f762,f974,f983,f985,f993,f1009,f1022,f1026,f1032,f1038,f1042,f1049,f1067,f1158,f1172])).
% 0.07/0.29  % SZS output end CNFRefutation for theBenchmark.p
% 0.07/0.29  % Elapsed time: 0.021683 seconds
% 0.07/0.29  % CPU time: 0.054737 seconds
% 0.07/0.29  % Memory used: 15.496 MB
%------------------------------------------------------------------------------