%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : LCL487+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 : n018.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:10 PM UTC 2026
% Result : Theorem 11.57s 2.10s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL487+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.05 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 % Computer : n018.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Mon Sep 21 00:37:43 UTC 2026
% 0.14/0.41 % CPUTime :
% 0.19/0.43 % Drodi V4.1.1
% 11.57/2.10 % Refutation found
% 11.57/2.10 % SZS status Theorem for theBenchmark: Theorem is valid
% 11.57/2.10 % SZS output start CNFRefutation for theBenchmark
% 11.57/2.10 fof(f1,axiom,(
% 11.57/2.10 ( modus_ponens<=> (! [X,Y] :( ( is_a_theorem(X)& is_a_theorem(implies(X,Y)) )=> is_a_theorem(Y) ) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f7,axiom,(
% 11.57/2.10 ( and_1<=> (! [X,Y] : is_a_theorem(implies(and(X,Y),X)) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f22,axiom,(
% 11.57/2.10 ( r1<=> (! [P] : is_a_theorem(implies(or(P,P),P)) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f23,axiom,(
% 11.57/2.10 ( r2<=> (! [P,Q] : is_a_theorem(implies(Q,or(P,Q))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f24,axiom,(
% 11.57/2.10 ( r3<=> (! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f26,axiom,(
% 11.57/2.10 ( r5<=> (! [P,Q,R] : is_a_theorem(implies(implies(Q,R),implies(or(P,Q),or(P,R)))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f27,axiom,(
% 11.57/2.10 ( op_or=> (! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f28,axiom,(
% 11.57/2.10 ( op_and=> (! [X,Y] : and(X,Y) = not(or(not(X),not(Y))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f29,axiom,(
% 11.57/2.10 ( op_implies_and=> (! [X,Y] : implies(X,Y) = not(and(X,not(Y))) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f30,axiom,(
% 11.57/2.10 ( op_implies_or=> (! [X,Y] : implies(X,Y) = or(not(X),Y) )) ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f32,axiom,(
% 11.57/2.10 op_implies_or ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f33,axiom,(
% 11.57/2.10 op_and ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f35,axiom,(
% 11.57/2.10 modus_ponens ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f36,axiom,(
% 11.57/2.10 r1 ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f37,axiom,(
% 11.57/2.10 r2 ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f38,axiom,(
% 11.57/2.10 r3 ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f40,axiom,(
% 11.57/2.10 r5 ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f42,axiom,(
% 11.57/2.10 op_or ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f43,axiom,(
% 11.57/2.10 op_implies_and ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f45,conjecture,(
% 11.57/2.10 and_1 ),
% 11.57/2.10 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 11.57/2.10 fof(f46,negated_conjecture,(
% 11.57/2.10 ~(and_1 )),
% 11.57/2.10 inference(negated_conjecture,[status(cth)],[f45])).
% 11.57/2.10 fof(f47,plain,(
% 11.57/2.10 modus_ponens<=>(![X,Y]: ((~is_a_theorem(X)|~is_a_theorem(implies(X,Y)))|is_a_theorem(Y)))),
% 11.57/2.10 inference(pre_NNF_transformation,[status(thm)],[f1])).
% 11.57/2.10 fof(f48,plain,(
% 11.57/2.10 (~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))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f47])).
% 11.57/2.10 fof(f49,plain,(
% 11.57/2.10 (~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))))),
% 11.57/2.10 inference(miniscoping,[status(thm)],[f48])).
% 11.57/2.10 fof(f50,plain,(
% 11.57/2.10 (~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)))),
% 11.57/2.10 inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f49])).
% 11.57/2.10 fof(f51,plain,(
% 11.57/2.10 ![X0,X1]: (~modus_ponens|~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f50])).
% 11.57/2.10 fof(f77,plain,(
% 11.57/2.10 (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|(?[X,Y]: ~is_a_theorem(implies(and(X,Y),X))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f7])).
% 11.57/2.10 fof(f78,plain,(
% 11.57/2.10 (~and_1|(![X,Y]: is_a_theorem(implies(and(X,Y),X))))&(and_1|~is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl)))),
% 11.57/2.10 inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl]),skolemize(X,sK13_skl),skolemize(Y,sK14_skl)],[f77])).
% 11.57/2.10 fof(f80,plain,(
% 11.57/2.10 and_1|~is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f78])).
% 11.57/2.10 fof(f137,plain,(
% 11.57/2.10 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|(?[P]: ~is_a_theorem(implies(or(P,P),P))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f22])).
% 11.57/2.10 fof(f138,plain,(
% 11.57/2.10 (~r1|(![P]: is_a_theorem(implies(or(P,P),P))))&(r1|~is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl)))),
% 11.57/2.10 inference(skolemize,[status(esa),new_symbols(skolem,[sK44_skl]),skolemize(P,sK44_skl)],[f137])).
% 11.57/2.10 fof(f139,plain,(
% 11.57/2.10 ![X0]: (~r1|is_a_theorem(implies(or(X0,X0),X0)))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f138])).
% 11.57/2.10 fof(f141,plain,(
% 11.57/2.10 (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|(?[P,Q]: ~is_a_theorem(implies(Q,or(P,Q)))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f23])).
% 11.57/2.10 fof(f142,plain,(
% 11.57/2.10 (~r2|(![P,Q]: is_a_theorem(implies(Q,or(P,Q)))))&(r2|~is_a_theorem(implies(sK46_skl,or(sK45_skl,sK46_skl))))),
% 11.57/2.10 inference(skolemize,[status(esa),new_symbols(skolem,[sK45_skl,sK46_skl]),skolemize(P,sK45_skl),skolemize(Q,sK46_skl)],[f141])).
% 11.57/2.10 fof(f143,plain,(
% 11.57/2.10 ![X0,X1]: (~r2|is_a_theorem(implies(X0,or(X1,X0))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f142])).
% 11.57/2.10 fof(f145,plain,(
% 11.57/2.10 (~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)))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f24])).
% 11.57/2.10 fof(f146,plain,(
% 11.57/2.10 (~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))))),
% 11.57/2.10 inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl]),skolemize(P,sK47_skl),skolemize(Q,sK48_skl)],[f145])).
% 11.57/2.10 fof(f147,plain,(
% 11.57/2.10 ![X0,X1]: (~r3|is_a_theorem(implies(or(X0,X1),or(X1,X0))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f146])).
% 11.57/2.10 fof(f153,plain,(
% 11.57/2.10 (~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))))))),
% 11.57/2.10 inference(NNF_transformation,[status(thm)],[f26])).
% 11.57/2.10 fof(f154,plain,(
% 11.57/2.10 (~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)))))),
% 11.57/2.10 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])).
% 11.57/2.10 fof(f155,plain,(
% 11.57/2.10 ![X0,X1,X2]: (~r5|is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f154])).
% 11.57/2.10 fof(f157,plain,(
% 11.57/2.10 ~op_or|(![X,Y]: or(X,Y)=not(and(not(X),not(Y))))),
% 11.57/2.10 inference(pre_NNF_transformation,[status(thm)],[f27])).
% 11.57/2.10 fof(f158,plain,(
% 11.57/2.10 ![X0,X1]: (~op_or|or(X0,X1)=not(and(not(X0),not(X1))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f157])).
% 11.57/2.10 fof(f159,plain,(
% 11.57/2.10 ~op_and|(![X,Y]: and(X,Y)=not(or(not(X),not(Y))))),
% 11.57/2.10 inference(pre_NNF_transformation,[status(thm)],[f28])).
% 11.57/2.10 fof(f160,plain,(
% 11.57/2.10 ![X0,X1]: (~op_and|and(X0,X1)=not(or(not(X0),not(X1))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f159])).
% 11.57/2.10 fof(f161,plain,(
% 11.57/2.10 ~op_implies_and|(![X,Y]: implies(X,Y)=not(and(X,not(Y))))),
% 11.57/2.10 inference(pre_NNF_transformation,[status(thm)],[f29])).
% 11.57/2.10 fof(f162,plain,(
% 11.57/2.10 ![X0,X1]: (~op_implies_and|implies(X0,X1)=not(and(X0,not(X1))))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f161])).
% 11.57/2.10 fof(f163,plain,(
% 11.57/2.10 ~op_implies_or|(![X,Y]: implies(X,Y)=or(not(X),Y))),
% 11.57/2.10 inference(pre_NNF_transformation,[status(thm)],[f30])).
% 11.57/2.10 fof(f164,plain,(
% 11.57/2.10 ![X0,X1]: (~op_implies_or|implies(X0,X1)=or(not(X0),X1))),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f163])).
% 11.57/2.10 fof(f167,plain,(
% 11.57/2.10 op_implies_or),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f32])).
% 11.57/2.10 fof(f168,plain,(
% 11.57/2.10 op_and),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f33])).
% 11.57/2.10 fof(f170,plain,(
% 11.57/2.10 modus_ponens),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f35])).
% 11.57/2.10 fof(f171,plain,(
% 11.57/2.10 r1),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f36])).
% 11.57/2.10 fof(f172,plain,(
% 11.57/2.10 r2),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f37])).
% 11.57/2.10 fof(f173,plain,(
% 11.57/2.10 r3),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f38])).
% 11.57/2.10 fof(f175,plain,(
% 11.57/2.10 r5),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f40])).
% 11.57/2.10 fof(f177,plain,(
% 11.57/2.10 op_or),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f42])).
% 11.57/2.10 fof(f178,plain,(
% 11.57/2.10 op_implies_and),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f43])).
% 11.57/2.10 fof(f180,plain,(
% 11.57/2.10 ~and_1),
% 11.57/2.10 inference(cnf_transformation,[status(thm)],[f46])).
% 11.57/2.10 fof(f181,definition,(
% 11.57/2.10 sQ0_spl <=> (modus_ponens)),
% 11.57/2.10 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 11.57/2.10 fof(f183,plain,(
% 11.57/2.10 ~modus_ponens|sQ0_spl),
% 11.57/2.10 inference(component_clause,[status(thm)],[f181])).
% 11.57/2.10 fof(f184,definition,(
% 11.57/2.10 ![X0,X1]: (sQ1_spl <=> (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)))),
% 11.57/2.10 introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition])).
% 11.57/2.10 fof(f185,plain,(
% 11.57/2.10 ![X0,X1]: (~is_a_theorem(X0)|~is_a_theorem(implies(X0,X1))|is_a_theorem(X1)|~sQ1_spl)),
% 11.57/2.10 inference(component_clause,[status(thm)],[f184])).
% 11.57/2.10 fof(f187,plain,(
% 11.57/2.10 ~sQ0_spl|sQ1_spl),
% 11.57/2.10 inference(split_clause,[status(thm)],[f51,f181,f184])).
% 11.57/2.10 fof(f259,definition,(
% 11.57/2.10 sQ21_spl <=> (and_1)),
% 11.57/2.10 introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition])).
% 11.57/2.10 fof(f260,plain,(
% 11.57/2.10 and_1|~sQ21_spl),
% 11.57/2.10 inference(component_clause,[status(thm)],[f259])).
% 11.57/2.10 fof(f262,definition,(
% 11.57/2.10 ![X0,X1]: (sQ22_spl <=> (is_a_theorem(implies(and(X0,X1),X0))))),
% 11.57/2.10 introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition])).
% 11.57/2.10 fof(f263,plain,(
% 11.57/2.10 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0))|~sQ22_spl)),
% 11.57/2.10 inference(component_clause,[status(thm)],[f262])).
% 11.57/2.10 fof(f266,definition,(
% 11.57/2.10 sQ23_spl <=> (is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl)))),
% 11.57/2.10 introduced(definition,[new_symbols(definition,[sQ23_spl])],[split_symbol_definition])).
% 11.57/2.10 fof(f268,plain,(
% 11.57/2.10 ~is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl))|sQ23_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f266])).
% 11.57/2.11 fof(f269,plain,(
% 11.57/2.11 sQ21_spl|~sQ23_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f80,f259,f266])).
% 11.57/2.11 fof(f295,definition,(
% 11.57/2.11 ![X0,X1]: (sQ31_spl <=> (is_a_theorem(implies(X0,or(X0,X1)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f296,plain,(
% 11.57/2.11 ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1)))|~sQ31_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f295])).
% 11.57/2.11 fof(f306,definition,(
% 11.57/2.11 ![X0,X1]: (sQ34_spl <=> (is_a_theorem(implies(X0,or(X1,X0)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ34_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f307,plain,(
% 11.57/2.11 ![X0,X1]: (is_a_theorem(implies(X0,or(X1,X0)))|~sQ34_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f306])).
% 11.57/2.11 fof(f418,definition,(
% 11.57/2.11 sQ64_spl <=> (r1)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ64_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f420,plain,(
% 11.57/2.11 ~r1|sQ64_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f418])).
% 11.57/2.11 fof(f421,definition,(
% 11.57/2.11 ![X0]: (sQ65_spl <=> (is_a_theorem(implies(or(X0,X0),X0))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ65_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f422,plain,(
% 11.57/2.11 ![X0]: (is_a_theorem(implies(or(X0,X0),X0))|~sQ65_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f421])).
% 11.57/2.11 fof(f424,plain,(
% 11.57/2.11 ~sQ64_spl|sQ65_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f139,f418,f421])).
% 11.57/2.11 fof(f429,definition,(
% 11.57/2.11 sQ67_spl <=> (r2)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ67_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f431,plain,(
% 11.57/2.11 ~r2|sQ67_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f429])).
% 11.57/2.11 fof(f432,plain,(
% 11.57/2.11 ~sQ67_spl|sQ34_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f143,f429,f306])).
% 11.57/2.11 fof(f437,definition,(
% 11.57/2.11 sQ69_spl <=> (r3)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ69_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f439,plain,(
% 11.57/2.11 ~r3|sQ69_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f437])).
% 11.57/2.11 fof(f440,definition,(
% 11.57/2.11 ![X0,X1]: (sQ70_spl <=> (is_a_theorem(implies(or(X0,X1),or(X1,X0)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ70_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f441,plain,(
% 11.57/2.11 ![X0,X1]: (is_a_theorem(implies(or(X0,X1),or(X1,X0)))|~sQ70_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f440])).
% 11.57/2.11 fof(f443,plain,(
% 11.57/2.11 ~sQ69_spl|sQ70_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f147,f437,f440])).
% 11.57/2.11 fof(f459,definition,(
% 11.57/2.11 sQ75_spl <=> (r5)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ75_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f461,plain,(
% 11.57/2.11 ~r5|sQ75_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f459])).
% 11.57/2.11 fof(f462,definition,(
% 11.57/2.11 ![X0,X1,X2]: (sQ76_spl <=> (is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ76_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f463,plain,(
% 11.57/2.11 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1))))|~sQ76_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f462])).
% 11.57/2.11 fof(f465,plain,(
% 11.57/2.11 ~sQ75_spl|sQ76_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f155,f459,f462])).
% 11.57/2.11 fof(f470,definition,(
% 11.57/2.11 sQ78_spl <=> (op_or)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ78_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f472,plain,(
% 11.57/2.11 ~op_or|sQ78_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f470])).
% 11.57/2.11 fof(f473,definition,(
% 11.57/2.11 ![X0,X1]: (sQ79_spl <=> (or(X0,X1)=not(and(not(X0),not(X1)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ79_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f474,plain,(
% 11.57/2.11 ![X0,X1]: (or(X0,X1)=not(and(not(X0),not(X1)))|~sQ79_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f473])).
% 11.57/2.11 fof(f476,plain,(
% 11.57/2.11 ~sQ78_spl|sQ79_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f158,f470,f473])).
% 11.57/2.11 fof(f477,definition,(
% 11.57/2.11 sQ80_spl <=> (op_and)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ80_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f479,plain,(
% 11.57/2.11 ~op_and|sQ80_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f477])).
% 11.57/2.11 fof(f480,definition,(
% 11.57/2.11 ![X0,X1]: (sQ81_spl <=> (and(X0,X1)=not(or(not(X0),not(X1)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ81_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f481,plain,(
% 11.57/2.11 ![X0,X1]: (and(X0,X1)=not(or(not(X0),not(X1)))|~sQ81_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f480])).
% 11.57/2.11 fof(f483,plain,(
% 11.57/2.11 ~sQ80_spl|sQ81_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f160,f477,f480])).
% 11.57/2.11 fof(f484,definition,(
% 11.57/2.11 sQ82_spl <=> (op_implies_and)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f486,plain,(
% 11.57/2.11 ~op_implies_and|sQ82_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f484])).
% 11.57/2.11 fof(f487,definition,(
% 11.57/2.11 ![X0,X1]: (sQ83_spl <=> (implies(X0,X1)=not(and(X0,not(X1)))))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ83_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f488,plain,(
% 11.57/2.11 ![X0,X1]: (implies(X0,X1)=not(and(X0,not(X1)))|~sQ83_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f487])).
% 11.57/2.11 fof(f490,plain,(
% 11.57/2.11 ~sQ82_spl|sQ83_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f162,f484,f487])).
% 11.57/2.11 fof(f491,definition,(
% 11.57/2.11 sQ84_spl <=> (op_implies_or)),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ84_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f493,plain,(
% 11.57/2.11 ~op_implies_or|sQ84_spl),
% 11.57/2.11 inference(component_clause,[status(thm)],[f491])).
% 11.57/2.11 fof(f494,definition,(
% 11.57/2.11 ![X0,X1]: (sQ85_spl <=> (implies(X0,X1)=or(not(X0),X1)))),
% 11.57/2.11 introduced(definition,[new_symbols(definition,[sQ85_spl])],[split_symbol_definition])).
% 11.57/2.11 fof(f495,plain,(
% 11.57/2.11 ![X0,X1]: (implies(X0,X1)=or(not(X0),X1)|~sQ85_spl)),
% 11.57/2.11 inference(component_clause,[status(thm)],[f494])).
% 11.57/2.11 fof(f497,plain,(
% 11.57/2.11 ~sQ84_spl|sQ85_spl),
% 11.57/2.11 inference(split_clause,[status(thm)],[f164,f491,f494])).
% 11.57/2.11 fof(f507,plain,(
% 11.57/2.11 $false|sQ0_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f183,f170])).
% 11.57/2.11 fof(f508,plain,(
% 11.57/2.11 sQ0_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f507])).
% 11.57/2.11 fof(f511,plain,(
% 11.57/2.11 $false|sQ84_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f493,f167])).
% 11.57/2.11 fof(f512,plain,(
% 11.57/2.11 sQ84_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f511])).
% 11.57/2.11 fof(f513,plain,(
% 11.57/2.11 $false|sQ82_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f486,f178])).
% 11.57/2.11 fof(f514,plain,(
% 11.57/2.11 sQ82_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f513])).
% 11.57/2.11 fof(f515,plain,(
% 11.57/2.11 $false|sQ80_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f479,f168])).
% 11.57/2.11 fof(f516,plain,(
% 11.57/2.11 sQ80_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f515])).
% 11.57/2.11 fof(f517,plain,(
% 11.57/2.11 $false|sQ78_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f472,f177])).
% 11.57/2.11 fof(f518,plain,(
% 11.57/2.11 sQ78_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f517])).
% 11.57/2.11 fof(f521,plain,(
% 11.57/2.11 $false|sQ64_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f420,f171])).
% 11.57/2.11 fof(f522,plain,(
% 11.57/2.11 sQ64_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f521])).
% 11.57/2.11 fof(f525,plain,(
% 11.57/2.11 $false|sQ75_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f461,f175])).
% 11.57/2.11 fof(f526,plain,(
% 11.57/2.11 sQ75_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f525])).
% 11.57/2.11 fof(f531,plain,(
% 11.57/2.11 $false|~sQ22_spl|sQ23_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f268,f263])).
% 11.57/2.11 fof(f532,plain,(
% 11.57/2.11 ~sQ22_spl|sQ23_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f531])).
% 11.57/2.11 fof(f554,plain,(
% 11.57/2.11 $false|sQ69_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f439,f173])).
% 11.57/2.11 fof(f555,plain,(
% 11.57/2.11 sQ69_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f554])).
% 11.57/2.11 fof(f558,plain,(
% 11.57/2.11 $false|sQ67_spl),
% 11.57/2.11 inference(forward_subsumption_resolution,[status(thm)],[f431,f172])).
% 11.57/2.11 fof(f559,plain,(
% 11.57/2.11 sQ67_spl),
% 11.57/2.11 inference(contradiction_clause,[status(thm)],[f558])).
% 11.57/2.11 fof(f562,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(X2,X0),or(X2,X1)))|~sQ76_spl|~sQ1_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f463,f185])).
% 11.57/2.11 fof(f862,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(not(X2),X0),implies(X2,X1)))|~sQ76_spl|~sQ1_spl|~sQ85_spl)),
% 11.57/2.11 inference(paramodulation,[status(thm)],[f495,f562])).
% 11.57/2.11 fof(f864,plain,(
% 11.57/2.11 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(or(not(X2),X0),implies(X2,X1))))|~sQ76_spl|~sQ85_spl)),
% 11.57/2.11 inference(paramodulation,[status(thm)],[f495,f463])).
% 11.57/2.11 fof(f870,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(implies(X2,X0),implies(X2,X1)))|~sQ76_spl|~sQ1_spl|~sQ85_spl)),
% 11.57/2.11 inference(forward_demodulation,[status(thm)],[f495,f862])).
% 11.57/2.11 fof(f872,plain,(
% 11.57/2.11 ![X0,X1,X2]: (is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1))))|~sQ76_spl|~sQ85_spl)),
% 11.57/2.11 inference(forward_demodulation,[status(thm)],[f495,f864])).
% 11.57/2.11 fof(f876,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X2,X0))|is_a_theorem(implies(X2,X1))|~sQ76_spl|~sQ85_spl|~sQ1_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f870,f185])).
% 11.57/2.11 fof(f884,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(X2,X0))|~is_a_theorem(X2)|is_a_theorem(X1)|~sQ76_spl|~sQ85_spl|~sQ1_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f876,f185])).
% 11.57/2.11 fof(f938,plain,(
% 11.57/2.11 ![X0,X1]: (and(X0,X1)=not(implies(X0,not(X1)))|~sQ85_spl|~sQ81_spl)),
% 11.57/2.11 inference(forward_demodulation,[status(thm)],[f495,f481])).
% 11.57/2.11 fof(f943,plain,(
% 11.57/2.11 ![X0,X1]: (or(X0,X1)=implies(not(X0),X1)|~sQ83_spl|~sQ79_spl)),
% 11.57/2.11 inference(forward_demodulation,[status(thm)],[f488,f474])).
% 11.57/2.11 fof(f944,plain,(
% 11.57/2.11 ![X0,X1,X2]: (or(implies(X0,not(X1)),X2)=implies(and(X0,X1),X2)|~sQ83_spl|~sQ79_spl|~sQ85_spl|~sQ81_spl)),
% 11.57/2.11 inference(paramodulation,[status(thm)],[f938,f943])).
% 11.57/2.11 fof(f954,plain,(
% 11.57/2.11 ![X0,X1]: (~is_a_theorem(implies(implies(or(X0,X0),X0),X1))|is_a_theorem(X1)|~sQ1_spl|~sQ65_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f185,f422])).
% 11.57/2.11 fof(f1042,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(or(X0,X1),X2))|is_a_theorem(implies(or(X1,X0),X2))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ70_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f876,f441])).
% 11.57/2.11 fof(f1043,plain,(
% 11.57/2.11 ![X0,X1]: (~is_a_theorem(implies(X0,X1))|is_a_theorem(implies(or(X0,X0),X1))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f876,f422])).
% 11.57/2.11 fof(f1044,plain,(
% 11.57/2.11 ![X0,X1,X2]: (~is_a_theorem(implies(or(X0,X1),X2))|is_a_theorem(implies(X1,X2))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ34_spl)),
% 11.57/2.11 inference(resolution,[status(thm)],[f876,f307])).
% 11.57/2.12 fof(f1054,plain,(
% 11.57/2.12 ![X0,X1,X2]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(implies(or(X0,X0),X1),X2))|is_a_theorem(X2)|~sQ76_spl|~sQ85_spl|~sQ65_spl|~sQ1_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f1043,f185])).
% 11.57/2.12 fof(f1065,plain,(
% 11.57/2.12 ![X0,X1]: (is_a_theorem(implies(X0,or(X0,X1)))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ34_spl|~sQ70_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f1044,f441])).
% 11.57/2.12 fof(f1073,plain,(
% 11.57/2.12 sQ31_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ34_spl|~sQ70_spl),
% 11.57/2.12 inference(split_clause,[status(thm)],[f1065,f295,f462,f494,f184,f306,f440])).
% 11.57/2.12 fof(f1094,plain,(
% 11.57/2.12 ![X0,X1,X2,X3]: (~is_a_theorem(implies(X0,X1))|~is_a_theorem(implies(implies(X2,or(X2,X3)),X0))|is_a_theorem(X1)|~sQ31_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f296,f884])).
% 11.57/2.12 fof(f1411,plain,(
% 11.57/2.12 ![X0,X1]: (is_a_theorem(implies(implies(X0,or(X1,X1)),implies(X0,X1)))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f872,f954])).
% 11.57/2.12 fof(f3419,plain,(
% 11.57/2.12 ![X0,X1]: (~is_a_theorem(implies(X0,or(X1,X1)))|is_a_theorem(implies(or(X0,X0),X1))|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f1054,f1411])).
% 11.57/2.12 fof(f5738,plain,(
% 11.57/2.12 ![X0,X1,X2,X3]: (~is_a_theorem(implies(or(implies(X0,or(X0,X1)),X2),X3))|is_a_theorem(X3)|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ31_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f1094,f296])).
% 11.57/2.12 fof(f5788,plain,(
% 11.57/2.12 ![X0,X1,X2]: (is_a_theorem(X0)|~is_a_theorem(implies(implies(X1,or(X1,X2)),or(X0,X0)))|~sQ31_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f5738,f3419])).
% 11.57/2.12 fof(f5903,plain,(
% 11.57/2.12 ![X0,X1,X2]: (is_a_theorem(X0)|~is_a_theorem(implies(or(X1,or(not(X1),X2)),or(X0,X0)))|~sQ31_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl|~sQ83_spl|~sQ79_spl)),
% 11.57/2.12 inference(paramodulation,[status(thm)],[f943,f5788])).
% 11.57/2.12 fof(f5912,plain,(
% 11.57/2.12 ![X0,X1,X2]: (is_a_theorem(X0)|~is_a_theorem(implies(or(X1,implies(X1,X2)),or(X0,X0)))|~sQ31_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ65_spl|~sQ83_spl|~sQ79_spl)),
% 11.57/2.12 inference(forward_demodulation,[status(thm)],[f495,f5903])).
% 11.57/2.12 fof(f5923,plain,(
% 11.57/2.12 ![X0,X1,X2]: (is_a_theorem(X0)|~is_a_theorem(implies(or(implies(X1,X2),X1),or(X0,X0)))|~sQ31_spl|~sQ65_spl|~sQ83_spl|~sQ79_spl|~sQ76_spl|~sQ85_spl|~sQ1_spl|~sQ70_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f5912,f1042])).
% 11.57/2.12 fof(f6148,plain,(
% 11.57/2.12 ![X0,X1,X2]: (is_a_theorem(X0)|~is_a_theorem(implies(implies(and(X1,X2),X1),or(X0,X0)))|~sQ31_spl|~sQ65_spl|~sQ76_spl|~sQ1_spl|~sQ70_spl|~sQ83_spl|~sQ79_spl|~sQ85_spl|~sQ81_spl)),
% 11.57/2.12 inference(paramodulation,[status(thm)],[f944,f5923])).
% 11.57/2.12 fof(f6241,plain,(
% 11.57/2.12 ![X0,X1]: (is_a_theorem(implies(and(X0,X1),X0))|~sQ65_spl|~sQ76_spl|~sQ1_spl|~sQ70_spl|~sQ83_spl|~sQ79_spl|~sQ85_spl|~sQ81_spl|~sQ31_spl)),
% 11.57/2.12 inference(resolution,[status(thm)],[f6148,f296])).
% 11.57/2.12 fof(f6254,plain,(
% 11.57/2.12 sQ22_spl|~sQ65_spl|~sQ76_spl|~sQ1_spl|~sQ70_spl|~sQ83_spl|~sQ79_spl|~sQ85_spl|~sQ81_spl|~sQ31_spl),
% 11.57/2.12 inference(split_clause,[status(thm)],[f6241,f262,f421,f462,f184,f440,f487,f473,f494,f480,f295])).
% 11.57/2.12 fof(f6263,plain,(
% 11.57/2.12 $false|~sQ21_spl),
% 11.57/2.12 inference(forward_subsumption_resolution,[status(thm)],[f260,f180])).
% 11.57/2.12 fof(f6264,plain,(
% 11.57/2.12 ~sQ21_spl),
% 11.57/2.12 inference(contradiction_clause,[status(thm)],[f6263])).
% 11.57/2.12 fof(f6265,plain,(
% 11.57/2.12 $false),
% 11.57/2.12 inference(sat_refutation,[status(thm)],[f187,f269,f424,f432,f443,f465,f476,f483,f490,f497,f508,f512,f514,f516,f518,f522,f526,f532,f555,f559,f1073,f6254,f6264])).
% 11.57/2.12 % SZS output end CNFRefutation for theBenchmark.p
% 11.57/2.19 % Elapsed time: 1.756668 seconds
% 11.57/2.19 % CPU time: 13.250236 seconds
% 11.57/2.19 % Total memory used: 250.854 MB
% 11.57/2.19 % Net memory used: 242.111 MB
%------------------------------------------------------------------------------