TSTP Solution File: LCL510+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : LCL510+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 : Tue Apr 30 20:27:21 EDT 2024

% Result   : Theorem 7.64s 1.34s
% Output   : CNFRefutation 7.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL510+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Apr 29 20:18:04 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  % Drodi V3.6.0
% 7.64/1.34  % Refutation found
% 7.64/1.34  % SZS status Theorem for theBenchmark: Theorem is valid
% 7.64/1.34  % SZS output start CNFRefutation for theBenchmark
% 7.64/1.34  fof(f1,axiom,(
% 7.64/1.34    ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f11,axiom,(
% 7.64/1.34    ( or_2<=> (! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f16,axiom,(
% 7.64/1.34    ( kn1<=> (! [P] : is_a_theorem(implies(P,and(P,P))) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f17,axiom,(
% 7.64/1.34    ( kn2<=> (! [P,Q] : is_a_theorem(implies(and(P,Q),P)) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f18,axiom,(
% 7.64/1.34    ( kn3<=> (! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P))))) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f27,axiom,(
% 7.64/1.34    ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f29,axiom,(
% 7.64/1.34    ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f32,axiom,(
% 7.64/1.34    op_or ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f33,axiom,(
% 7.64/1.34    op_implies_and ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f35,axiom,(
% 7.64/1.34    modus_ponens ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f36,axiom,(
% 7.64/1.34    kn1 ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f37,axiom,(
% 7.64/1.34    kn2 ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f38,axiom,(
% 7.64/1.34    kn3 ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f43,conjecture,(
% 7.64/1.34    or_2 ),
% 7.64/1.34    file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 7.64/1.34  fof(f44,negated_conjecture,(
% 7.64/1.34    ~(or_2 )),
% 7.64/1.34    inference(negated_conjecture,[status(cth)],[f43])).
% 7.64/1.34  fof(f45,plain,(
% 7.64/1.34    modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 7.64/1.34    inference(pre_NNF_transformation,[status(esa)],[f1])).
% 7.64/1.34  fof(f46,plain,(
% 7.64/1.34    (~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))))),
% 7.64/1.34    inference(NNF_transformation,[status(esa)],[f45])).
% 7.64/1.34  fof(f47,plain,(
% 7.64/1.34    (~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))))),
% 7.64/1.34    inference(miniscoping,[status(esa)],[f46])).
% 7.64/1.34  fof(f48,plain,(
% 7.64/1.34    (~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)))),
% 7.64/1.34    inference(skolemization,[status(esa)],[f47])).
% 7.64/1.34  fof(f49,plain,(
% 7.64/1.34    ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 7.64/1.34    inference(cnf_transformation,[status(esa)],[f48])).
% 7.64/1.34  fof(f91,plain,(
% 7.64/1.34    (~or_2|(![X,Y]: is_a_theorem(implies(Y,or(X,Y)))))&(or_2|(?[X,Y]: ~is_a_theorem(implies(Y,or(X,Y)))))),
% 7.64/1.34    inference(NNF_transformation,[status(esa)],[f11])).
% 7.64/1.34  fof(f92,plain,(
% 7.64/1.34    (~or_2|(![X,Y]: is_a_theorem(implies(Y,or(X,Y)))))&(or_2|~is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22))))),
% 7.64/1.34    inference(skolemization,[status(esa)],[f91])).
% 7.64/1.34  fof(f94,plain,(
% 7.64/1.34    or_2|~is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22)))),
% 7.64/1.34    inference(cnf_transformation,[status(esa)],[f92])).
% 7.64/1.34  fof(f111,plain,(
% 7.64/1.34    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|(?[P]: ~is_a_theorem(implies(P,and(P,P)))))),
% 7.64/1.34    inference(NNF_transformation,[status(esa)],[f16])).
% 7.64/1.34  fof(f112,plain,(
% 7.64/1.34    (~kn1|(![P]: is_a_theorem(implies(P,and(P,P)))))&(kn1|~is_a_theorem(implies(sk0_32,and(sk0_32,sk0_32))))),
% 7.64/1.34    inference(skolemization,[status(esa)],[f111])).
% 7.64/1.34  fof(f113,plain,(
% 7.64/1.34    ![X0]: (~kn1|is_a_theorem(implies(X0,and(X0,X0))))),
% 7.64/1.34    inference(cnf_transformation,[status(esa)],[f112])).
% 7.64/1.34  fof(f115,plain,(
% 7.64/1.34    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|(?[P,Q]: ~is_a_theorem(implies(and(P,Q),P))))),
% 7.64/1.35    inference(NNF_transformation,[status(esa)],[f17])).
% 7.64/1.35  fof(f116,plain,(
% 7.64/1.35    (~kn2|(![P,Q]: is_a_theorem(implies(and(P,Q),P))))&(kn2|~is_a_theorem(implies(and(sk0_33,sk0_34),sk0_33)))),
% 7.64/1.35    inference(skolemization,[status(esa)],[f115])).
% 7.64/1.35  fof(f117,plain,(
% 7.64/1.35    ![X0,X1]: (~kn2|is_a_theorem(implies(and(X0,X1),X0)))),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f116])).
% 7.64/1.35  fof(f119,plain,(
% 7.64/1.35    (~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)))))))),
% 7.64/1.35    inference(NNF_transformation,[status(esa)],[f18])).
% 7.64/1.35  fof(f120,plain,(
% 7.64/1.35    (~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(sk0_35,sk0_36),implies(not(and(sk0_36,sk0_37)),not(and(sk0_37,sk0_35))))))),
% 7.64/1.35    inference(skolemization,[status(esa)],[f119])).
% 7.64/1.35  fof(f121,plain,(
% 7.64/1.35    ![X0,X1,X2]: (~kn3|is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))))),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f120])).
% 7.64/1.35  fof(f155,plain,(
% 7.64/1.35    ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 7.64/1.35    inference(pre_NNF_transformation,[status(esa)],[f27])).
% 7.64/1.35  fof(f156,plain,(
% 7.64/1.35    ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f155])).
% 7.64/1.35  fof(f159,plain,(
% 7.64/1.35    ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 7.64/1.35    inference(pre_NNF_transformation,[status(esa)],[f29])).
% 7.64/1.35  fof(f160,plain,(
% 7.64/1.35    ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f159])).
% 7.64/1.35  fof(f165,plain,(
% 7.64/1.35    op_or),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f32])).
% 7.64/1.35  fof(f166,plain,(
% 7.64/1.35    op_implies_and),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f33])).
% 7.64/1.35  fof(f168,plain,(
% 7.64/1.35    modus_ponens),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f35])).
% 7.64/1.35  fof(f169,plain,(
% 7.64/1.35    kn1),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f36])).
% 7.64/1.35  fof(f170,plain,(
% 7.64/1.35    kn2),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f37])).
% 7.64/1.35  fof(f171,plain,(
% 7.64/1.35    kn3),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f38])).
% 7.64/1.35  fof(f176,plain,(
% 7.64/1.35    ~or_2),
% 7.64/1.35    inference(cnf_transformation,[status(esa)],[f44])).
% 7.64/1.35  fof(f177,plain,(
% 7.64/1.35    spl0_0 <=> modus_ponens),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f179,plain,(
% 7.64/1.35    ~modus_ponens|spl0_0),
% 7.64/1.35    inference(component_clause,[status(thm)],[f177])).
% 7.64/1.35  fof(f180,plain,(
% 7.64/1.35    spl0_1 <=> ~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f181,plain,(
% 7.64/1.35    ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~spl0_1)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f180])).
% 7.64/1.35  fof(f183,plain,(
% 7.64/1.35    ~spl0_0|spl0_1),
% 7.64/1.35    inference(split_clause,[status(thm)],[f49,f177,f180])).
% 7.64/1.35  fof(f258,plain,(
% 7.64/1.35    spl0_22 <=> is_a_theorem(implies(and(X0,X1),X0))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f259,plain,(
% 7.64/1.35    ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0))|~spl0_22)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f258])).
% 7.64/1.35  fof(f299,plain,(
% 7.64/1.35    spl0_33 <=> or_2),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f300,plain,(
% 7.64/1.35    or_2|~spl0_33),
% 7.64/1.35    inference(component_clause,[status(thm)],[f299])).
% 7.64/1.35  fof(f302,plain,(
% 7.64/1.35    spl0_34 <=> is_a_theorem(implies(X0,or(X1,X0)))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f303,plain,(
% 7.64/1.35    ![X0,X1]: (is_a_theorem(implies(X0,or(X1,X0)))|~spl0_34)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f302])).
% 7.64/1.35  fof(f306,plain,(
% 7.64/1.35    spl0_35 <=> is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22)))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f308,plain,(
% 7.64/1.35    ~is_a_theorem(implies(sk0_22,or(sk0_21,sk0_22)))|spl0_35),
% 7.64/1.35    inference(component_clause,[status(thm)],[f306])).
% 7.64/1.35  fof(f309,plain,(
% 7.64/1.35    spl0_33|~spl0_35),
% 7.64/1.35    inference(split_clause,[status(thm)],[f94,f299,f306])).
% 7.64/1.35  fof(f354,plain,(
% 7.64/1.35    spl0_48 <=> kn1),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f356,plain,(
% 7.64/1.35    ~kn1|spl0_48),
% 7.64/1.35    inference(component_clause,[status(thm)],[f354])).
% 7.64/1.35  fof(f357,plain,(
% 7.64/1.35    spl0_49 <=> is_a_theorem(implies(X0,and(X0,X0)))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f358,plain,(
% 7.64/1.35    ![X0]: (is_a_theorem(implies(X0,and(X0,X0)))|~spl0_49)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f357])).
% 7.64/1.35  fof(f360,plain,(
% 7.64/1.35    ~spl0_48|spl0_49),
% 7.64/1.35    inference(split_clause,[status(thm)],[f113,f354,f357])).
% 7.64/1.35  fof(f365,plain,(
% 7.64/1.35    spl0_51 <=> kn2),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f367,plain,(
% 7.64/1.35    ~kn2|spl0_51),
% 7.64/1.35    inference(component_clause,[status(thm)],[f365])).
% 7.64/1.35  fof(f368,plain,(
% 7.64/1.35    ~spl0_51|spl0_22),
% 7.64/1.35    inference(split_clause,[status(thm)],[f117,f365,f258])).
% 7.64/1.35  fof(f373,plain,(
% 7.64/1.35    spl0_53 <=> kn3),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f375,plain,(
% 7.64/1.35    ~kn3|spl0_53),
% 7.64/1.35    inference(component_clause,[status(thm)],[f373])).
% 7.64/1.35  fof(f376,plain,(
% 7.64/1.35    spl0_54 <=> is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f377,plain,(
% 7.64/1.35    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))|~spl0_54)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f376])).
% 7.64/1.35  fof(f379,plain,(
% 7.64/1.35    ~spl0_53|spl0_54),
% 7.64/1.35    inference(split_clause,[status(thm)],[f121,f373,f376])).
% 7.64/1.35  fof(f466,plain,(
% 7.64/1.35    spl0_78 <=> op_or),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f468,plain,(
% 7.64/1.35    ~op_or|spl0_78),
% 7.64/1.35    inference(component_clause,[status(thm)],[f466])).
% 7.64/1.35  fof(f469,plain,(
% 7.64/1.35    spl0_79 <=> or(X0,X1)=not(and(not(X0),not(X1)))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f470,plain,(
% 7.64/1.35    ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~spl0_79)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f469])).
% 7.64/1.35  fof(f472,plain,(
% 7.64/1.35    ~spl0_78|spl0_79),
% 7.64/1.35    inference(split_clause,[status(thm)],[f156,f466,f469])).
% 7.64/1.35  fof(f480,plain,(
% 7.64/1.35    spl0_82 <=> op_implies_and),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f482,plain,(
% 7.64/1.35    ~op_implies_and|spl0_82),
% 7.64/1.35    inference(component_clause,[status(thm)],[f480])).
% 7.64/1.35  fof(f483,plain,(
% 7.64/1.35    spl0_83 <=> implies(X0,X1)=not(and(X0,not(X1)))),
% 7.64/1.35    introduced(split_symbol_definition)).
% 7.64/1.35  fof(f484,plain,(
% 7.64/1.35    ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~spl0_83)),
% 7.64/1.35    inference(component_clause,[status(thm)],[f483])).
% 7.64/1.35  fof(f486,plain,(
% 7.64/1.35    ~spl0_82|spl0_83),
% 7.64/1.35    inference(split_clause,[status(thm)],[f160,f480,f483])).
% 7.64/1.35  fof(f503,plain,(
% 7.64/1.35    $false|spl0_0),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f179,f168])).
% 7.64/1.35  fof(f504,plain,(
% 7.64/1.35    spl0_0),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f503])).
% 7.64/1.35  fof(f507,plain,(
% 7.64/1.35    $false|spl0_82),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f482,f166])).
% 7.64/1.35  fof(f508,plain,(
% 7.64/1.35    spl0_82),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f507])).
% 7.64/1.35  fof(f509,plain,(
% 7.64/1.35    $false|spl0_78),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f468,f165])).
% 7.64/1.35  fof(f510,plain,(
% 7.64/1.35    spl0_78),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f509])).
% 7.64/1.35  fof(f517,plain,(
% 7.64/1.35    $false|spl0_51),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f367,f170])).
% 7.64/1.35  fof(f518,plain,(
% 7.64/1.35    spl0_51),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f517])).
% 7.64/1.35  fof(f521,plain,(
% 7.64/1.35    $false|spl0_48),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f356,f169])).
% 7.64/1.35  fof(f522,plain,(
% 7.64/1.35    spl0_48),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f521])).
% 7.64/1.35  fof(f523,plain,(
% 7.64/1.35    $false|~spl0_34|spl0_35),
% 7.64/1.35    inference(forward_subsumption_resolution,[status(thm)],[f308,f303])).
% 7.64/1.35  fof(f524,plain,(
% 7.64/1.35    ~spl0_34|spl0_35),
% 7.64/1.35    inference(contradiction_clause,[status(thm)],[f523])).
% 7.64/1.35  fof(f544,plain,(
% 7.64/1.35    ![X0,X1,X2]: (implies(X0,and(X1,not(X2)))=not(and(X0,implies(X1,X2)))|~spl0_83)),
% 7.64/1.35    inference(paramodulation,[status(thm)],[f484,f484])).
% 7.64/1.35  fof(f568,plain,(
% 7.64/1.35    ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~spl0_83|~spl0_79)),
% 7.64/1.35    inference(forward_demodulation,[status(thm)],[f484,f470])).
% 7.64/1.35  fof(f570,plain,(
% 7.64/1.35    ![X0,X1,X2]: (or(and(X0,not(X1)),X2)=implies(implies(X0,X1),X2)|~spl0_79|~spl0_83)),
% 7.64/1.35    inference(paramodulation,[status(thm)],[f484,f568])).
% 7.64/1.35  fof(f571,plain,(
% 7.64/1.35    ![X0]: (is_a_theorem(or(X0,and(not(X0),not(X0))))|~spl0_49|~spl0_83|~spl0_79)),
% 7.64/1.35    inference(paramodulation,[status(thm)],[f568,f358])).
% 7.64/1.35  fof(f577,plain,(
% 7.64/1.35    ![X0,X1]: (~is_a_theorem(not(X0))|~is_a_theorem(or(X0,X1))|is_a_theorem(X1)|~spl0_1|~spl0_83|~spl0_79)),
% 7.64/1.35    inference(paramodulation,[status(thm)],[f568,f181])).
% 7.64/1.35  fof(f640,plain,(
% 7.64/1.35    ![X0,X1,X2]: (implies(X0,and(not(X1),not(X2)))=not(and(X0,or(X1,X2)))|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f568,f544])).
% 7.64/1.36  fof(f726,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0)))))|~spl0_83|~spl0_79|~spl0_54)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f568,f377])).
% 7.64/1.36  fof(f727,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(or(and(X1,X2),not(and(X2,X0))))|~spl0_83|~spl0_79|~spl0_54|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f726,f181])).
% 7.64/1.36  fof(f728,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),or(and(X1,X2),not(and(X2,not(X0))))))|~spl0_54|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f568,f726])).
% 7.64/1.36  fof(f729,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),or(and(X1,X2),implies(X2,X0))))|~spl0_54|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f484,f728])).
% 7.64/1.36  fof(f819,plain,(
% 7.64/1.36    $false|spl0_53),
% 7.64/1.36    inference(forward_subsumption_resolution,[status(thm)],[f375,f171])).
% 7.64/1.36  fof(f820,plain,(
% 7.64/1.36    spl0_53),
% 7.64/1.36    inference(contradiction_clause,[status(thm)],[f819])).
% 7.64/1.36  fof(f831,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(or(X0,X1))|is_a_theorem(or(and(X1,X2),implies(X2,X0)))|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f729,f181])).
% 7.64/1.36  fof(f833,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),implies(not(X2),X0))))|~spl0_54|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f570,f729])).
% 7.64/1.36  fof(f834,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X2,X0))))|~spl0_54|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f568,f833])).
% 7.64/1.36  fof(f845,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(or(X0,X1))|is_a_theorem(implies(implies(X1,X2),or(X2,X0)))|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f834,f181])).
% 7.64/1.36  fof(f852,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(implies(implies(and(not(X0),not(X0)),X1),or(X1,X0)))|~spl0_54|~spl0_1|~spl0_49|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(resolution,[status(thm)],[f845,f571])).
% 7.64/1.36  fof(f872,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(implies(and(not(X0),not(X0)),X1))|is_a_theorem(or(X1,X0))|~spl0_54|~spl0_49|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f852,f181])).
% 7.64/1.36  fof(f884,plain,(
% 7.64/1.36    ![X0]: (is_a_theorem(or(not(X0),X0))|~spl0_54|~spl0_49|~spl0_83|~spl0_79|~spl0_1|~spl0_22)),
% 7.64/1.36    inference(resolution,[status(thm)],[f872,f259])).
% 7.64/1.36  fof(f894,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(implies(implies(X0,X1),or(X1,not(X0))))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f884,f845])).
% 7.64/1.36  fof(f898,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(or(X1,not(X0)))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f894,f181])).
% 7.64/1.36  fof(f902,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,not(not(X0)))))|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f568,f894])).
% 7.64/1.36  fof(f926,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(not(X0),X2),or(X2,X1)))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f898,f845])).
% 7.64/1.36  fof(f927,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(X0,X2),or(X2,X1)))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f568,f926])).
% 7.64/1.36  fof(f932,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(or(X0,X1))|is_a_theorem(or(X1,not(not(X0))))|~spl0_49|~spl0_22|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f902,f181])).
% 7.64/1.36  fof(f960,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(or(X0,X2))|is_a_theorem(or(X2,X1))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f927,f181])).
% 7.64/1.36  fof(f1006,plain,(
% 7.64/1.36    ![X0]: (is_a_theorem(not(and(not(X0),or(X0,X0))))|~spl0_49|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f640,f358])).
% 7.64/1.36  fof(f1052,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(or(and(not(X0),or(X0,X0)),X1))|is_a_theorem(X1)|~spl0_49|~spl0_1|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1006,f577])).
% 7.64/1.36  fof(f1150,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(implies(X0,not(X1)))|is_a_theorem(not(and(or(X1,X1),X0)))|~spl0_54|~spl0_49|~spl0_1|~spl0_83|~spl0_79)),
% 7.64/1.36    inference(resolution,[status(thm)],[f727,f1052])).
% 7.64/1.36  fof(f1169,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(implies(not(X0),not(X1)))|is_a_theorem(implies(or(X1,X1),X0))|~spl0_54|~spl0_49|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f484,f1150])).
% 7.64/1.36  fof(f1170,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(or(X0,not(X1)))|is_a_theorem(implies(or(X1,X1),X0))|~spl0_54|~spl0_49|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f568,f1169])).
% 7.64/1.36  fof(f1176,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(implies(or(not(X0),not(X0)),X1))|~is_a_theorem(or(X0,X1))|~spl0_49|~spl0_22|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1170,f932])).
% 7.64/1.36  fof(f1208,plain,(
% 7.64/1.36    ![X0]: (is_a_theorem(implies(or(not(not(X0)),not(not(X0))),X0))|~spl0_54|~spl0_49|~spl0_83|~spl0_79|~spl0_1|~spl0_22)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1176,f884])).
% 7.64/1.36  fof(f1221,plain,(
% 7.64/1.36    ![X0]: (~is_a_theorem(or(not(not(X0)),not(not(X0))))|is_a_theorem(X0)|~spl0_54|~spl0_49|~spl0_83|~spl0_79|~spl0_22|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1208,f181])).
% 7.64/1.36  fof(f1235,plain,(
% 7.64/1.36    ![X0]: (is_a_theorem(X0)|~is_a_theorem(or(X0,not(not(X0))))|~spl0_49|~spl0_22|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1221,f932])).
% 7.64/1.36  fof(f1280,plain,(
% 7.64/1.36    ![X0]: (is_a_theorem(X0)|~is_a_theorem(or(X0,X0))|~spl0_49|~spl0_22|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1235,f932])).
% 7.64/1.36  fof(f1291,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(X0)|~is_a_theorem(implies(X1,X0))|~is_a_theorem(or(X1,X0))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1280,f960])).
% 7.64/1.36  fof(f1618,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(or(X0,not(and(X0,X1))))|~spl0_49|~spl0_54|~spl0_79|~spl0_83|~spl0_1|~spl0_22)),
% 7.64/1.36    inference(resolution,[status(thm)],[f898,f259])).
% 7.64/1.36  fof(f1631,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(or(X0,implies(X0,X1)))|~spl0_49|~spl0_54|~spl0_79|~spl0_1|~spl0_22|~spl0_83)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f484,f1618])).
% 7.64/1.36  fof(f1636,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(or(and(implies(X0,X1),X2),implies(X2,X0)))|~spl0_49|~spl0_22|~spl0_54|~spl0_83|~spl0_79|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1631,f831])).
% 7.64/1.36  fof(f1708,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(X0)|~is_a_theorem(or(and(X0,X1),X0))|~spl0_49|~spl0_54|~spl0_79|~spl0_83|~spl0_1|~spl0_22)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1291,f259])).
% 7.64/1.36  fof(f1753,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X2),X0)))|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(paramodulation,[status(thm)],[f570,f1636])).
% 7.64/1.36  fof(f1754,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(implies(implies(implies(X0,X1),X2),or(X2,X0)))|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(forward_demodulation,[status(thm)],[f568,f1753])).
% 7.64/1.36  fof(f1932,plain,(
% 7.64/1.36    ![X0,X1,X2]: (~is_a_theorem(implies(implies(X0,X1),X2))|is_a_theorem(or(X2,X0))|~spl0_49|~spl0_22|~spl0_54|~spl0_79|~spl0_83|~spl0_1)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1754,f181])).
% 7.64/1.36  fof(f1973,plain,(
% 7.64/1.36    ![X0,X1,X2]: (is_a_theorem(or(or(X0,X1),implies(X1,X2)))|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(resolution,[status(thm)],[f1932,f1754])).
% 7.64/1.36  fof(f8677,plain,(
% 7.64/1.36    $false|~spl0_33),
% 7.64/1.36    inference(forward_subsumption_resolution,[status(thm)],[f300,f176])).
% 7.64/1.36  fof(f8678,plain,(
% 7.64/1.36    ~spl0_33),
% 7.64/1.36    inference(contradiction_clause,[status(thm)],[f8677])).
% 7.64/1.36  fof(f10729,plain,(
% 7.64/1.36    ![X0,X1]: (~is_a_theorem(or(X0,implies(X1,X0)))|is_a_theorem(implies(X1,X0))|~spl0_49|~spl0_54|~spl0_79|~spl0_83|~spl0_1|~spl0_22)),
% 7.64/1.36    inference(resolution,[status(thm)],[f831,f1708])).
% 7.64/1.36  fof(f13836,plain,(
% 7.64/1.36    ![X0,X1]: (is_a_theorem(implies(X0,or(X1,X0)))|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_79|~spl0_83)),
% 7.64/1.36    inference(resolution,[status(thm)],[f10729,f1973])).
% 7.64/1.36  fof(f13837,plain,(
% 7.64/1.36    spl0_34|~spl0_49|~spl0_22|~spl0_54|~spl0_1|~spl0_79|~spl0_83),
% 7.64/1.38    inference(split_clause,[status(thm)],[f13836,f302,f357,f258,f376,f180,f469,f483])).
% 7.64/1.38  fof(f13889,plain,(
% 7.64/1.38    $false),
% 7.64/1.38    inference(sat_refutation,[status(thm)],[f183,f309,f360,f368,f379,f472,f486,f504,f508,f510,f518,f522,f524,f820,f8678,f13837])).
% 7.64/1.38  % SZS output end CNFRefutation for theBenchmark.p
% 8.15/1.39  % Elapsed time: 1.026933 seconds
% 8.15/1.39  % CPU time: 7.956446 seconds
% 8.15/1.39  % Total memory used: 229.381 MB
% 8.15/1.39  % Net memory used: 223.785 MB
%------------------------------------------------------------------------------