%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL516+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:07:54 PM UTC 2026
% Result : Theorem 7.27s 1.35s
% Output : CNFRefutation 7.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 28
% Syntax : Number of formulae : 152 ( 23 unt; 14 def)
% Number of atoms : 589 ( 13 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 829 ( 392 ~; 396 |; 18 &)
% ( 20 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 24 ( 22 usr; 22 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 212 ( 200 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( modus_ponens
<=> ! [X,Y] :
( ( is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
=> is_a_theorem(Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
( kn2
<=> ! [P,Q] : is_a_theorem(implies(and(P,Q),P)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,axiom,
( kn3
<=> ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P))))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,axiom,
( cn2
<=> ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f27,axiom,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f36,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,conjecture,
cn2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,negated_conjecture,
~ cn2,
inference(negated_conjecture,[status(cth)],[f43]) ).
fof(f45,plain,
( modus_ponens
<=> ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f46,plain,
( ( ? [X,Y] :
( ~ is_a_theorem(Y)
& is_a_theorem(implies(X,Y))
& is_a_theorem(X) )
| modus_ponens )
& ( ! [X,Y] :
( is_a_theorem(Y)
| ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) )
| ~ modus_ponens ) ),
inference(NNF_transformation,[status(thm)],[f45]) ).
fof(f47,plain,
( ( ? [Y] :
( ~ is_a_theorem(Y)
& ? [X] :
( is_a_theorem(implies(X,Y))
& is_a_theorem(X) ) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(miniscoping,[status(thm)],[f46]) ).
fof(f48,plain,
( ( ( ~ is_a_theorem(sK0_skl)
& is_a_theorem(implies(sK1_skl,sK0_skl))
& is_a_theorem(sK1_skl) )
| modus_ponens )
& ( ! [Y] :
( is_a_theorem(Y)
| ! [X] :
( ~ is_a_theorem(implies(X,Y))
| ~ is_a_theorem(X) ) )
| ~ modus_ponens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(Y,sK0_skl),skolemize(X,sK1_skl)],[f47]) ).
fof(f49,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f48]) ).
fof(f111,plain,
( ( ? [P] : ~ is_a_theorem(implies(P,and(P,P)))
| kn1 )
& ( ! [P] : is_a_theorem(implies(P,and(P,P)))
| ~ kn1 ) ),
inference(NNF_transformation,[status(thm)],[f16]) ).
fof(f112,plain,
( ( ~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl)))
| kn1 )
& ( ! [P] : is_a_theorem(implies(P,and(P,P)))
| ~ kn1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK32_skl]),skolemize(P,sK32_skl)],[f111]) ).
fof(f113,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[status(thm)],[f112]) ).
fof(f115,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(and(P,Q),P))
| kn2 )
& ( ! [P,Q] : is_a_theorem(implies(and(P,Q),P))
| ~ kn2 ) ),
inference(NNF_transformation,[status(thm)],[f17]) ).
fof(f116,plain,
( ( ~ is_a_theorem(implies(and(sK33_skl,sK34_skl),sK33_skl))
| kn2 )
& ( ! [P,Q] : is_a_theorem(implies(and(P,Q),P))
| ~ kn2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK33_skl,sK34_skl]),skolemize(P,sK33_skl),skolemize(Q,sK34_skl)],[f115]) ).
fof(f117,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ kn2 ),
inference(cnf_transformation,[status(thm)],[f116]) ).
fof(f119,plain,
( ( ? [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)))))
| ~ kn3 ) ),
inference(NNF_transformation,[status(thm)],[f18]) ).
fof(f120,plain,
( ( ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(not(and(sK36_skl,sK37_skl)),not(and(sK37_skl,sK35_skl)))))
| kn3 )
& ( ! [P,Q,R] : is_a_theorem(implies(implies(P,Q),implies(not(and(Q,R)),not(and(R,P)))))
| ~ kn3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK35_skl,sK36_skl,sK37_skl]),skolemize(P,sK35_skl),skolemize(Q,sK36_skl),skolemize(R,sK37_skl)],[f119]) ).
fof(f121,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0)))))
| ~ kn3 ),
inference(cnf_transformation,[status(thm)],[f120]) ).
fof(f127,plain,
( ( ? [P,Q] : ~ is_a_theorem(implies(P,implies(not(P),Q)))
| cn2 )
& ( ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q)))
| ~ cn2 ) ),
inference(NNF_transformation,[status(thm)],[f20]) ).
fof(f128,plain,
( ( ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl)))
| cn2 )
& ( ! [P,Q] : is_a_theorem(implies(P,implies(not(P),Q)))
| ~ cn2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK41_skl,sK42_skl]),skolemize(P,sK41_skl),skolemize(Q,sK42_skl)],[f127]) ).
fof(f130,plain,
( ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl)))
| cn2 ),
inference(cnf_transformation,[status(thm)],[f128]) ).
fof(f155,plain,
( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(pre_NNF_transformation,[status(thm)],[f27]) ).
fof(f156,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[status(thm)],[f155]) ).
fof(f159,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f160,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(thm)],[f159]) ).
fof(f165,plain,
op_or,
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f166,plain,
op_implies_and,
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f168,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f169,plain,
kn1,
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f170,plain,
kn2,
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f171,plain,
kn3,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f176,plain,
~ cn2,
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f177,definition,
( sQ0_spl
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f179,plain,
( sQ0_spl
| ~ modus_ponens ),
inference(component_clause,[status(thm)],[f177]) ).
fof(f180,definition,
! [X0,X1] :
( sQ1_spl
<=> ( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f181,plain,
! [X0,X1] :
( ~ sQ1_spl
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f180]) ).
fof(f183,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f49,f177,f180]) ).
fof(f258,definition,
! [X0,X1] :
( sQ22_spl
<=> is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).
fof(f259,plain,
! [X0,X1] :
( ~ sQ22_spl
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(component_clause,[status(thm)],[f258]) ).
fof(f354,definition,
( sQ48_spl
<=> kn1 ),
introduced(definition,[new_symbols(definition,[sQ48_spl])],[split_symbol_definition]) ).
fof(f356,plain,
( sQ48_spl
| ~ kn1 ),
inference(component_clause,[status(thm)],[f354]) ).
fof(f357,definition,
! [X0] :
( sQ49_spl
<=> is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[sQ49_spl])],[split_symbol_definition]) ).
fof(f358,plain,
! [X0] :
( ~ sQ49_spl
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(component_clause,[status(thm)],[f357]) ).
fof(f360,plain,
( sQ49_spl
| ~ sQ48_spl ),
inference(split_clause,[status(thm)],[f113,f354,f357]) ).
fof(f365,definition,
( sQ51_spl
<=> kn2 ),
introduced(definition,[new_symbols(definition,[sQ51_spl])],[split_symbol_definition]) ).
fof(f367,plain,
( sQ51_spl
| ~ kn2 ),
inference(component_clause,[status(thm)],[f365]) ).
fof(f368,plain,
( sQ22_spl
| ~ sQ51_spl ),
inference(split_clause,[status(thm)],[f117,f365,f258]) ).
fof(f373,definition,
( sQ53_spl
<=> kn3 ),
introduced(definition,[new_symbols(definition,[sQ53_spl])],[split_symbol_definition]) ).
fof(f375,plain,
( sQ53_spl
| ~ kn3 ),
inference(component_clause,[status(thm)],[f373]) ).
fof(f376,definition,
! [X0,X1,X2] :
( sQ54_spl
<=> is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
introduced(definition,[new_symbols(definition,[sQ54_spl])],[split_symbol_definition]) ).
fof(f377,plain,
! [X0,X1,X2] :
( ~ sQ54_spl
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X1,X2)),not(and(X2,X0))))) ),
inference(component_clause,[status(thm)],[f376]) ).
fof(f379,plain,
( sQ54_spl
| ~ sQ53_spl ),
inference(split_clause,[status(thm)],[f121,f373,f376]) ).
fof(f392,definition,
( sQ58_spl
<=> cn2 ),
introduced(definition,[new_symbols(definition,[sQ58_spl])],[split_symbol_definition]) ).
fof(f393,plain,
( ~ sQ58_spl
| cn2 ),
inference(component_clause,[status(thm)],[f392]) ).
fof(f399,definition,
( sQ60_spl
<=> is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl))) ),
introduced(definition,[new_symbols(definition,[sQ60_spl])],[split_symbol_definition]) ).
fof(f401,plain,
( sQ60_spl
| ~ is_a_theorem(implies(sK41_skl,implies(not(sK41_skl),sK42_skl))) ),
inference(component_clause,[status(thm)],[f399]) ).
fof(f402,plain,
( ~ sQ60_spl
| sQ58_spl ),
inference(split_clause,[status(thm)],[f130,f392,f399]) ).
fof(f466,definition,
( sQ78_spl
<=> op_or ),
introduced(definition,[new_symbols(definition,[sQ78_spl])],[split_symbol_definition]) ).
fof(f468,plain,
( sQ78_spl
| ~ op_or ),
inference(component_clause,[status(thm)],[f466]) ).
fof(f469,definition,
! [X0,X1] :
( sQ79_spl
<=> or(X0,X1) = not(and(not(X0),not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ79_spl])],[split_symbol_definition]) ).
fof(f470,plain,
! [X0,X1] :
( ~ sQ79_spl
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(component_clause,[status(thm)],[f469]) ).
fof(f472,plain,
( sQ79_spl
| ~ sQ78_spl ),
inference(split_clause,[status(thm)],[f156,f466,f469]) ).
fof(f480,definition,
( sQ82_spl
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition]) ).
fof(f482,plain,
( sQ82_spl
| ~ op_implies_and ),
inference(component_clause,[status(thm)],[f480]) ).
fof(f483,definition,
! [X0,X1] :
( sQ83_spl
<=> implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ83_spl])],[split_symbol_definition]) ).
fof(f484,plain,
! [X0,X1] :
( ~ sQ83_spl
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(component_clause,[status(thm)],[f483]) ).
fof(f486,plain,
( sQ83_spl
| ~ sQ82_spl ),
inference(split_clause,[status(thm)],[f160,f480,f483]) ).
fof(f503,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f179,f168]) ).
fof(f504,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f503]) ).
fof(f507,plain,
( sQ82_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f166]) ).
fof(f508,plain,
sQ82_spl,
inference(contradiction_clause,[status(thm)],[f507]) ).
fof(f509,plain,
( sQ78_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f468,f165]) ).
fof(f510,plain,
sQ78_spl,
inference(contradiction_clause,[status(thm)],[f509]) ).
fof(f519,plain,
( sQ51_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f367,f170]) ).
fof(f520,plain,
sQ51_spl,
inference(contradiction_clause,[status(thm)],[f519]) ).
fof(f525,plain,
( sQ48_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f356,f169]) ).
fof(f526,plain,
sQ48_spl,
inference(contradiction_clause,[status(thm)],[f525]) ).
fof(f560,plain,
( ~ sQ58_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f393,f176]) ).
fof(f561,plain,
~ sQ58_spl,
inference(contradiction_clause,[status(thm)],[f560]) ).
fof(f566,plain,
( sQ53_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f375,f171]) ).
fof(f567,plain,
sQ53_spl,
inference(contradiction_clause,[status(thm)],[f566]) ).
fof(f569,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| implies(X0,and(X1,not(X2))) = not(and(X0,implies(X1,X2))) ),
inference(paramodulation,[status(thm)],[f484,f484]) ).
fof(f613,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| or(X0,X1) = implies(not(X0),X1) ),
inference(forward_demodulation,[status(thm)],[f484,f470]) ).
fof(f614,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2) ),
inference(paramodulation,[status(thm)],[f484,f613]) ).
fof(f615,plain,
! [X0] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| is_a_theorem(or(X0,and(not(X0),not(X0)))) ),
inference(paramodulation,[status(thm)],[f613,f358]) ).
fof(f621,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(X0,X1))
| ~ is_a_theorem(not(X0)) ),
inference(paramodulation,[status(thm)],[f613,f181]) ).
fof(f629,plain,
( sQ60_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ is_a_theorem(implies(sK41_skl,or(sK41_skl,sK42_skl))) ),
inference(forward_demodulation,[status(thm)],[f613,f401]) ).
fof(f826,plain,
! [X0] :
( ~ sQ83_spl
| ~ sQ49_spl
| is_a_theorem(not(and(not(X0),implies(not(X0),X0)))) ),
inference(paramodulation,[status(thm)],[f569,f358]) ).
fof(f846,plain,
! [X0] :
( ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ79_spl
| is_a_theorem(not(and(not(X0),or(X0,X0)))) ),
inference(forward_demodulation,[status(thm)],[f613,f826]) ).
fof(f848,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ49_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X0),or(X0,X0)),X1)) ),
inference(resolution,[status(thm)],[f846,f621]) ).
fof(f948,plain,
! [X0,X1,X2] :
( ~ sQ54_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(implies(implies(X0,X1),or(and(X1,X2),not(and(X2,X0))))) ),
inference(forward_demodulation,[status(thm)],[f613,f377]) ).
fof(f949,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(or(and(X1,X2),not(and(X2,X0))))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f948,f181]) ).
fof(f951,plain,
! [X0,X1,X2] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(X0,X1),or(and(X1,X2),not(and(X2,not(X0)))))) ),
inference(paramodulation,[status(thm)],[f613,f948]) ).
fof(f953,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),not(and(not(X2),X0))))) ),
inference(paramodulation,[status(thm)],[f614,f948]) ).
fof(f961,plain,
! [X0,X1,X2] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(X0,X1),or(and(X1,X2),implies(X2,X0)))) ),
inference(forward_demodulation,[status(thm)],[f484,f951]) ).
fof(f1090,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| is_a_theorem(or(and(X1,X2),implies(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f961,f181]) ).
fof(f1093,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),implies(not(X2),X0)))) ),
inference(paramodulation,[status(thm)],[f614,f961]) ).
fof(f1100,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(X0,X1),implies(implies(X1,X2),or(X2,X0)))) ),
inference(forward_demodulation,[status(thm)],[f613,f1093]) ).
fof(f1106,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| is_a_theorem(implies(implies(X1,X2),or(X2,X0)))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f1100,f181]) ).
fof(f1116,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ1_spl
| ~ sQ54_spl
| is_a_theorem(implies(implies(and(not(X0),not(X0)),X1),or(X1,X0))) ),
inference(resolution,[status(thm)],[f1106,f615]) ).
fof(f1134,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(or(X1,X0))
| ~ is_a_theorem(implies(and(not(X0),not(X0)),X1)) ),
inference(resolution,[status(thm)],[f1116,f181]) ).
fof(f1146,plain,
! [X0] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(or(not(X0),X0)) ),
inference(resolution,[status(thm)],[f1134,f259]) ).
fof(f1154,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(X0,X1),or(X1,not(X0)))) ),
inference(resolution,[status(thm)],[f1146,f1106]) ).
fof(f1158,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(X1,not(X0)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f1154,f181]) ).
fof(f1160,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(or(X0,X1),or(X1,not(not(X0))))) ),
inference(paramodulation,[status(thm)],[f613,f1154]) ).
fof(f1450,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(not(X0),X2),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f1158,f1106]) ).
fof(f1455,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(or(X0,X2),or(X2,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(forward_demodulation,[status(thm)],[f613,f1450]) ).
fof(f1463,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(X1,not(not(X0))))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f1160,f181]) ).
fof(f1498,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(X2,X1))
| ~ is_a_theorem(or(X0,X2))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f1455,f181]) ).
fof(f1537,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(not(and(or(X1,X1),X0)))
| ~ is_a_theorem(implies(X0,not(X1))) ),
inference(resolution,[status(thm)],[f949,f848]) ).
fof(f1807,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(not(and(or(X1,X1),not(X0))))
| ~ is_a_theorem(or(X0,not(X1))) ),
inference(paramodulation,[status(thm)],[f613,f1537]) ).
fof(f1809,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(X1,X1),X0))
| ~ is_a_theorem(or(X0,not(X1))) ),
inference(forward_demodulation,[status(thm)],[f484,f1807]) ).
fof(f1829,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| ~ is_a_theorem(or(X0,X1))
| is_a_theorem(implies(or(not(X0),not(X0)),X1)) ),
inference(resolution,[status(thm)],[f1809,f1463]) ).
fof(f2195,plain,
! [X0] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(implies(or(not(not(X0)),not(not(X0))),X0)) ),
inference(resolution,[status(thm)],[f1829,f1146]) ).
fof(f2213,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ22_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ54_spl
| is_a_theorem(X0)
| ~ is_a_theorem(or(not(not(X0)),not(not(X0)))) ),
inference(resolution,[status(thm)],[f2195,f181]) ).
fof(f2224,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| ~ is_a_theorem(or(X0,not(not(X0))))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2213,f1463]) ).
fof(f2232,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| ~ is_a_theorem(or(X0,X0))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2224,f1463]) ).
fof(f2242,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| ~ is_a_theorem(or(X1,X0))
| ~ is_a_theorem(implies(X1,X0))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2232,f1498]) ).
fof(f3174,plain,
! [X0,X1] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ49_spl
| is_a_theorem(or(X0,not(and(X0,X1)))) ),
inference(resolution,[status(thm)],[f1158,f259]) ).
fof(f3183,plain,
! [X0,X1] :
( ~ sQ83_spl
| ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ49_spl
| is_a_theorem(or(X0,implies(X0,X1))) ),
inference(paramodulation,[status(thm)],[f484,f3174]) ).
fof(f3188,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(and(implies(X0,X1),X2),implies(X2,X0))) ),
inference(resolution,[status(thm)],[f3183,f1090]) ).
fof(f3389,plain,
! [X0,X1] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ49_spl
| ~ is_a_theorem(or(and(X0,X1),X0))
| is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f2242,f259]) ).
fof(f3572,plain,
! [X0] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ49_spl
| is_a_theorem(implies(X0,X0)) ),
inference(resolution,[status(thm)],[f3188,f3389]) ).
fof(f3575,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(implies(X0,X1),X2),implies(not(X2),X0))) ),
inference(paramodulation,[status(thm)],[f614,f3188]) ).
fof(f3582,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(implies(X0,X1),X2),or(X2,X0))) ),
inference(forward_demodulation,[status(thm)],[f613,f3575]) ).
fof(f4154,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(X2,X0))
| ~ is_a_theorem(implies(implies(X0,X1),X2)) ),
inference(resolution,[status(thm)],[f3582,f181]) ).
fof(f4244,plain,
! [X0,X1] :
( ~ sQ22_spl
| ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ49_spl
| is_a_theorem(or(implies(X0,X1),X0)) ),
inference(resolution,[status(thm)],[f4154,f3572]) ).
fof(f4251,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(and(X0,X1),implies(X1,implies(X0,X2)))) ),
inference(resolution,[status(thm)],[f4244,f1090]) ).
fof(f4822,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(X0,X1),implies(not(X1),implies(X0,X2)))) ),
inference(paramodulation,[status(thm)],[f614,f4251]) ).
fof(f4830,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(X0,X1),or(X1,implies(X0,X2)))) ),
inference(forward_demodulation,[status(thm)],[f613,f4822]) ).
fof(f7170,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(or(X1,implies(X0,X2)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f4830,f181]) ).
fof(f8113,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[f7170,f2232]) ).
fof(f8525,plain,
! [X0] :
( ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ1_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(implies(X0,X0),not(and(not(X0),X0)))) ),
inference(resolution,[status(thm)],[f8113,f953]) ).
fof(f10912,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(not(and(not(X0),X0)))
| ~ is_a_theorem(implies(X0,X0)) ),
inference(resolution,[status(thm)],[f8525,f181]) ).
fof(f10920,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(not(and(not(X0),X0))) ),
inference(forward_subsumption_resolution,[status(thm)],[f10912,f3572]) ).
fof(f10931,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X0),X0),X1)) ),
inference(resolution,[status(thm)],[f10920,f621]) ).
fof(f11426,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(X0,implies(not(X0),X1))) ),
inference(resolution,[status(thm)],[f10931,f4251]) ).
fof(f11458,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(forward_demodulation,[status(thm)],[f613,f11426]) ).
fof(f11461,plain,
( sQ60_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f629,f11458]) ).
fof(f11471,plain,
( sQ60_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| ~ sQ54_spl
| ~ sQ22_spl
| ~ sQ49_spl ),
inference(contradiction_clause,[status(thm)],[f11461]) ).
fof(f11472,plain,
$false,
inference(sat_refutation,[status(thm)],[f183,f360,f368,f379,f402,f472,f486,f504,f508,f510,f520,f526,f561,f567,f11471]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL516+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 00:36:49 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.15/0.38 % Drodi V4.1.1
% 7.27/1.35 % Refutation found
% 7.27/1.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 7.27/1.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 7.27/1.39 % Elapsed time: 1.005555 seconds
% 7.27/1.39 % CPU time: 7.693391 seconds
% 7.27/1.39 % Total memory used: 245.128 MB
% 7.27/1.39 % Net memory used: 236.142 MB
%------------------------------------------------------------------------------