%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL533+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 : n015.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:56 PM UTC 2026
% Result : Theorem 1.23s 0.90s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 71
% Syntax : Number of formulae : 260 ( 50 unt; 38 def)
% Number of atoms : 685 ( 39 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 736 ( 311 ~; 326 |; 38 &)
% ( 54 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 58 ( 56 usr; 56 prp; 0-2 aty)
% Number of functors : 32 ( 32 usr; 24 con; 0-2 aty)
% Number of variables : 249 ( 223 !; 26 ?)
% 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(f2,axiom,
( substitution_of_equivalents
<=> ! [X,Y] :
( is_a_theorem(equiv(X,Y))
=> X = Y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
( modus_tollens
<=> ! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
( implies_1
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
( implies_2
<=> ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
( or_2
<=> ! [X,Y] : is_a_theorem(implies(Y,or(X,Y))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
( or_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
( equivalence_3
<=> ! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f24,axiom,
( r3
<=> ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P))) ),
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,
modus_tollens,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,axiom,
implies_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,axiom,
or_2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,axiom,
or_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f50,axiom,
( necessitation
<=> ! [X] :
( is_a_theorem(X)
=> is_a_theorem(necessarily(X)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f55,axiom,
( axiom_M
<=> ! [X] : is_a_theorem(implies(necessarily(X),X)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f68,axiom,
( axiom_m6
<=> ! [X] : is_a_theorem(strict_implies(X,possibly(X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f73,axiom,
( op_possibly
=> ! [X] : possibly(X) = not(necessarily(not(X))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f75,axiom,
( op_strict_implies
=> ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f77,axiom,
op_possibly,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f78,axiom,
necessitation,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f80,axiom,
axiom_M,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f85,axiom,
op_strict_implies,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f88,conjecture,
axiom_m6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f89,negated_conjecture,
~ axiom_m6,
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,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(f91,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)],[f90]) ).
fof(f92,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)],[f91]) ).
fof(f93,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)],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f93]) ).
fof(f98,plain,
( substitution_of_equivalents
<=> ! [X,Y] :
( X = Y
| ~ is_a_theorem(equiv(X,Y)) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f99,plain,
( ( ? [X,Y] :
( X != Y
& is_a_theorem(equiv(X,Y)) )
| substitution_of_equivalents )
& ( ! [X,Y] :
( X = Y
| ~ is_a_theorem(equiv(X,Y)) )
| ~ substitution_of_equivalents ) ),
inference(NNF_transformation,[status(thm)],[f98]) ).
fof(f100,plain,
( ( ( sK2_skl != sK3_skl
& is_a_theorem(equiv(sK2_skl,sK3_skl)) )
| substitution_of_equivalents )
& ( ! [X,Y] :
( X = Y
| ~ is_a_theorem(equiv(X,Y)) )
| ~ substitution_of_equivalents ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(X,sK2_skl),skolemize(Y,sK3_skl)],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[status(thm)],[f100]) ).
fof(f104,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))
| modus_tollens )
& ( ! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))
| ~ modus_tollens ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f105,plain,
( ( ~ is_a_theorem(implies(implies(not(sK5_skl),not(sK4_skl)),implies(sK4_skl,sK5_skl)))
| modus_tollens )
& ( ! [X,Y] : is_a_theorem(implies(implies(not(Y),not(X)),implies(X,Y)))
| ~ modus_tollens ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl,sK5_skl]),skolemize(X,sK4_skl),skolemize(Y,sK5_skl)],[f104]) ).
fof(f106,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))
| ~ modus_tollens ),
inference(cnf_transformation,[status(thm)],[f105]) ).
fof(f108,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,implies(Y,X)))
| implies_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f109,plain,
( ( ~ is_a_theorem(implies(sK6_skl,implies(sK7_skl,sK6_skl)))
| implies_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,X)))
| ~ implies_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6_skl,sK7_skl]),skolemize(X,sK6_skl),skolemize(Y,sK7_skl)],[f108]) ).
fof(f110,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,X0)))
| ~ implies_1 ),
inference(cnf_transformation,[status(thm)],[f109]) ).
fof(f112,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| implies_2 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| ~ implies_2 ) ),
inference(NNF_transformation,[status(thm)],[f5]) ).
fof(f113,plain,
( ( ~ is_a_theorem(implies(implies(sK8_skl,implies(sK8_skl,sK9_skl)),implies(sK8_skl,sK9_skl)))
| implies_2 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,implies(X,Y)),implies(X,Y)))
| ~ implies_2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl,sK9_skl]),skolemize(X,sK8_skl),skolemize(Y,sK9_skl)],[f112]) ).
fof(f114,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[status(thm)],[f113]) ).
fof(f132,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,or(X,Y)))
| or_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
| ~ or_1 ) ),
inference(NNF_transformation,[status(thm)],[f10]) ).
fof(f133,plain,
( ( ~ is_a_theorem(implies(sK19_skl,or(sK19_skl,sK20_skl)))
| or_1 )
& ( ! [X,Y] : is_a_theorem(implies(X,or(X,Y)))
| ~ or_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19_skl,sK20_skl]),skolemize(X,sK19_skl),skolemize(Y,sK20_skl)],[f132]) ).
fof(f134,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[status(thm)],[f133]) ).
fof(f136,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(Y,or(X,Y)))
| or_2 )
& ( ! [X,Y] : is_a_theorem(implies(Y,or(X,Y)))
| ~ or_2 ) ),
inference(NNF_transformation,[status(thm)],[f11]) ).
fof(f137,plain,
( ( ~ is_a_theorem(implies(sK22_skl,or(sK21_skl,sK22_skl)))
| or_2 )
& ( ! [X,Y] : is_a_theorem(implies(Y,or(X,Y)))
| ~ or_2 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK21_skl,sK22_skl]),skolemize(X,sK21_skl),skolemize(Y,sK22_skl)],[f136]) ).
fof(f138,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X1,X0)))
| ~ or_2 ),
inference(cnf_transformation,[status(thm)],[f137]) ).
fof(f140,plain,
( ( ? [X,Y,Z] : ~ is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| or_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| ~ or_3 ) ),
inference(NNF_transformation,[status(thm)],[f12]) ).
fof(f141,plain,
( ( ~ is_a_theorem(implies(implies(sK23_skl,sK25_skl),implies(implies(sK24_skl,sK25_skl),implies(or(sK23_skl,sK24_skl),sK25_skl))))
| or_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Z),implies(implies(Y,Z),implies(or(X,Y),Z))))
| ~ or_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl,sK25_skl]),skolemize(X,sK23_skl),skolemize(Y,sK24_skl),skolemize(Z,sK25_skl)],[f140]) ).
fof(f142,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1))))
| ~ or_3 ),
inference(cnf_transformation,[status(thm)],[f141]) ).
fof(f152,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))
| equivalence_3 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))
| ~ equivalence_3 ) ),
inference(NNF_transformation,[status(thm)],[f15]) ).
fof(f153,plain,
( ( ~ is_a_theorem(implies(implies(sK30_skl,sK31_skl),implies(implies(sK31_skl,sK30_skl),equiv(sK30_skl,sK31_skl))))
| equivalence_3 )
& ( ! [X,Y] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,X),equiv(X,Y))))
| ~ equivalence_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK30_skl,sK31_skl]),skolemize(X,sK30_skl),skolemize(Y,sK31_skl)],[f152]) ).
fof(f154,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[status(thm)],[f153]) ).
fof(f188,plain,
( ( ? [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)))
| ~ r3 ) ),
inference(NNF_transformation,[status(thm)],[f24]) ).
fof(f189,plain,
( ( ~ is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl)))
| r3 )
& ( ! [P,Q] : is_a_theorem(implies(or(P,Q),or(Q,P)))
| ~ r3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl]),skolemize(P,sK47_skl),skolemize(Q,sK48_skl)],[f188]) ).
fof(f190,plain,
! [X0,X1] :
( is_a_theorem(implies(or(X0,X1),or(X1,X0)))
| ~ r3 ),
inference(cnf_transformation,[status(thm)],[f189]) ).
fof(f191,plain,
( ~ is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl)))
| r3 ),
inference(cnf_transformation,[status(thm)],[f189]) ).
fof(f200,plain,
( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(pre_NNF_transformation,[status(thm)],[f27]) ).
fof(f201,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[status(thm)],[f200]) ).
fof(f204,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f205,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(thm)],[f204]) ).
fof(f210,plain,
op_or,
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f211,plain,
op_implies_and,
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f213,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f214,plain,
modus_tollens,
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f215,plain,
implies_1,
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f216,plain,
implies_2,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f221,plain,
or_1,
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f222,plain,
or_2,
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f223,plain,
or_3,
inference(cnf_transformation,[status(thm)],[f45]) ).
fof(f226,plain,
equivalence_3,
inference(cnf_transformation,[status(thm)],[f48]) ).
fof(f227,plain,
substitution_of_equivalents,
inference(cnf_transformation,[status(thm)],[f49]) ).
fof(f228,plain,
( necessitation
<=> ! [X] :
( is_a_theorem(necessarily(X))
| ~ is_a_theorem(X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f50]) ).
fof(f229,plain,
( ( ? [X] :
( ~ is_a_theorem(necessarily(X))
& is_a_theorem(X) )
| necessitation )
& ( ! [X] :
( is_a_theorem(necessarily(X))
| ~ is_a_theorem(X) )
| ~ necessitation ) ),
inference(NNF_transformation,[status(thm)],[f228]) ).
fof(f230,plain,
( ( ( ~ is_a_theorem(necessarily(sK55_skl))
& is_a_theorem(sK55_skl) )
| necessitation )
& ( ! [X] :
( is_a_theorem(necessarily(X))
| ~ is_a_theorem(X) )
| ~ necessitation ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK55_skl]),skolemize(X,sK55_skl)],[f229]) ).
fof(f231,plain,
! [X0] :
( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0)
| ~ necessitation ),
inference(cnf_transformation,[status(thm)],[f230]) ).
fof(f259,plain,
( ( ? [X] : ~ is_a_theorem(implies(necessarily(X),X))
| axiom_M )
& ( ! [X] : is_a_theorem(implies(necessarily(X),X))
| ~ axiom_M ) ),
inference(NNF_transformation,[status(thm)],[f55]) ).
fof(f260,plain,
( ( ~ is_a_theorem(implies(necessarily(sK64_skl),sK64_skl))
| axiom_M )
& ( ! [X] : is_a_theorem(implies(necessarily(X),X))
| ~ axiom_M ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK64_skl]),skolemize(X,sK64_skl)],[f259]) ).
fof(f261,plain,
! [X0] :
( is_a_theorem(implies(necessarily(X0),X0))
| ~ axiom_M ),
inference(cnf_transformation,[status(thm)],[f260]) ).
fof(f311,plain,
( ( ? [X] : ~ is_a_theorem(strict_implies(X,possibly(X)))
| axiom_m6 )
& ( ! [X] : is_a_theorem(strict_implies(X,possibly(X)))
| ~ axiom_m6 ) ),
inference(NNF_transformation,[status(thm)],[f68]) ).
fof(f312,plain,
( ( ~ is_a_theorem(strict_implies(sK87_skl,possibly(sK87_skl)))
| axiom_m6 )
& ( ! [X] : is_a_theorem(strict_implies(X,possibly(X)))
| ~ axiom_m6 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK87_skl]),skolemize(X,sK87_skl)],[f311]) ).
fof(f314,plain,
( ~ is_a_theorem(strict_implies(sK87_skl,possibly(sK87_skl)))
| axiom_m6 ),
inference(cnf_transformation,[status(thm)],[f312]) ).
fof(f331,plain,
( ! [X] : possibly(X) = not(necessarily(not(X)))
| ~ op_possibly ),
inference(pre_NNF_transformation,[status(thm)],[f73]) ).
fof(f332,plain,
! [X0] :
( possibly(X0) = not(necessarily(not(X0)))
| ~ op_possibly ),
inference(cnf_transformation,[status(thm)],[f331]) ).
fof(f335,plain,
( ! [X,Y] : strict_implies(X,Y) = necessarily(implies(X,Y))
| ~ op_strict_implies ),
inference(pre_NNF_transformation,[status(thm)],[f75]) ).
fof(f336,plain,
! [X0,X1] :
( strict_implies(X0,X1) = necessarily(implies(X0,X1))
| ~ op_strict_implies ),
inference(cnf_transformation,[status(thm)],[f335]) ).
fof(f339,plain,
op_possibly,
inference(cnf_transformation,[status(thm)],[f77]) ).
fof(f340,plain,
necessitation,
inference(cnf_transformation,[status(thm)],[f78]) ).
fof(f342,plain,
axiom_M,
inference(cnf_transformation,[status(thm)],[f80]) ).
fof(f347,plain,
op_strict_implies,
inference(cnf_transformation,[status(thm)],[f85]) ).
fof(f350,plain,
~ axiom_m6,
inference(cnf_transformation,[status(thm)],[f89]) ).
fof(f351,definition,
( sQ0_spl
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f353,plain,
( sQ0_spl
| ~ modus_ponens ),
inference(component_clause,[status(thm)],[f351]) ).
fof(f354,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(f355,plain,
! [X0,X1] :
( ~ sQ1_spl
| is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f354]) ).
fof(f357,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f94,f351,f354]) ).
fof(f370,definition,
( sQ5_spl
<=> substitution_of_equivalents ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f372,plain,
( sQ5_spl
| ~ substitution_of_equivalents ),
inference(component_clause,[status(thm)],[f370]) ).
fof(f373,definition,
! [X0,X1] :
( sQ6_spl
<=> ( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f374,plain,
! [X0,X1] :
( ~ sQ6_spl
| X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) ),
inference(component_clause,[status(thm)],[f373]) ).
fof(f376,plain,
( sQ6_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f101,f370,f373]) ).
fof(f385,definition,
( sQ9_spl
<=> modus_tollens ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f387,plain,
( sQ9_spl
| ~ modus_tollens ),
inference(component_clause,[status(thm)],[f385]) ).
fof(f388,definition,
! [X0,X1] :
( sQ10_spl
<=> is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f389,plain,
! [X0,X1] :
( ~ sQ10_spl
| is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f388]) ).
fof(f391,plain,
( sQ10_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f106,f385,f388]) ).
fof(f396,definition,
( sQ12_spl
<=> implies_1 ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f398,plain,
( sQ12_spl
| ~ implies_1 ),
inference(component_clause,[status(thm)],[f396]) ).
fof(f399,definition,
! [X0,X1] :
( sQ13_spl
<=> is_a_theorem(implies(X0,implies(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f400,plain,
! [X0,X1] :
( ~ sQ13_spl
| is_a_theorem(implies(X0,implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f399]) ).
fof(f402,plain,
( sQ13_spl
| ~ sQ12_spl ),
inference(split_clause,[status(thm)],[f110,f396,f399]) ).
fof(f407,definition,
( sQ15_spl
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f409,plain,
( sQ15_spl
| ~ implies_2 ),
inference(component_clause,[status(thm)],[f407]) ).
fof(f410,definition,
! [X0,X1] :
( sQ16_spl
<=> is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
introduced(definition,[new_symbols(definition,[sQ16_spl])],[split_symbol_definition]) ).
fof(f411,plain,
! [X0,X1] :
( ~ sQ16_spl
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(component_clause,[status(thm)],[f410]) ).
fof(f413,plain,
( sQ16_spl
| ~ sQ15_spl ),
inference(split_clause,[status(thm)],[f114,f407,f410]) ).
fof(f462,definition,
( sQ30_spl
<=> or_1 ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f464,plain,
( sQ30_spl
| ~ or_1 ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,definition,
! [X0,X1] :
( sQ31_spl
<=> is_a_theorem(implies(X0,or(X0,X1))) ),
introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition]) ).
fof(f466,plain,
! [X0,X1] :
( ~ sQ31_spl
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f468,plain,
( sQ31_spl
| ~ sQ30_spl ),
inference(split_clause,[status(thm)],[f134,f462,f465]) ).
fof(f473,definition,
( sQ33_spl
<=> or_2 ),
introduced(definition,[new_symbols(definition,[sQ33_spl])],[split_symbol_definition]) ).
fof(f475,plain,
( sQ33_spl
| ~ or_2 ),
inference(component_clause,[status(thm)],[f473]) ).
fof(f476,definition,
! [X0,X1] :
( sQ34_spl
<=> is_a_theorem(implies(X0,or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ34_spl])],[split_symbol_definition]) ).
fof(f477,plain,
! [X0,X1] :
( ~ sQ34_spl
| is_a_theorem(implies(X0,or(X1,X0))) ),
inference(component_clause,[status(thm)],[f476]) ).
fof(f479,plain,
( sQ34_spl
| ~ sQ33_spl ),
inference(split_clause,[status(thm)],[f138,f473,f476]) ).
fof(f484,definition,
( sQ36_spl
<=> or_3 ),
introduced(definition,[new_symbols(definition,[sQ36_spl])],[split_symbol_definition]) ).
fof(f486,plain,
( sQ36_spl
| ~ or_3 ),
inference(component_clause,[status(thm)],[f484]) ).
fof(f487,definition,
! [X0,X1,X2] :
( sQ37_spl
<=> is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))) ),
introduced(definition,[new_symbols(definition,[sQ37_spl])],[split_symbol_definition]) ).
fof(f488,plain,
! [X0,X1,X2] :
( ~ sQ37_spl
| is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X1),implies(or(X0,X2),X1)))) ),
inference(component_clause,[status(thm)],[f487]) ).
fof(f490,plain,
( sQ37_spl
| ~ sQ36_spl ),
inference(split_clause,[status(thm)],[f142,f484,f487]) ).
fof(f517,definition,
( sQ45_spl
<=> equivalence_3 ),
introduced(definition,[new_symbols(definition,[sQ45_spl])],[split_symbol_definition]) ).
fof(f519,plain,
( sQ45_spl
| ~ equivalence_3 ),
inference(component_clause,[status(thm)],[f517]) ).
fof(f520,definition,
! [X0,X1] :
( sQ46_spl
<=> is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[sQ46_spl])],[split_symbol_definition]) ).
fof(f521,plain,
! [X0,X1] :
( ~ sQ46_spl
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(component_clause,[status(thm)],[f520]) ).
fof(f523,plain,
( sQ46_spl
| ~ sQ45_spl ),
inference(split_clause,[status(thm)],[f154,f517,f520]) ).
fof(f607,definition,
( sQ69_spl
<=> r3 ),
introduced(definition,[new_symbols(definition,[sQ69_spl])],[split_symbol_definition]) ).
fof(f610,definition,
! [X0,X1] :
( sQ70_spl
<=> is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
introduced(definition,[new_symbols(definition,[sQ70_spl])],[split_symbol_definition]) ).
fof(f611,plain,
! [X0,X1] :
( ~ sQ70_spl
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(component_clause,[status(thm)],[f610]) ).
fof(f613,plain,
( sQ70_spl
| ~ sQ69_spl ),
inference(split_clause,[status(thm)],[f190,f607,f610]) ).
fof(f614,definition,
( sQ71_spl
<=> is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl))) ),
introduced(definition,[new_symbols(definition,[sQ71_spl])],[split_symbol_definition]) ).
fof(f616,plain,
( sQ71_spl
| ~ is_a_theorem(implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl))) ),
inference(component_clause,[status(thm)],[f614]) ).
fof(f617,plain,
( ~ sQ71_spl
| sQ69_spl ),
inference(split_clause,[status(thm)],[f191,f607,f614]) ).
fof(f640,definition,
( sQ78_spl
<=> op_or ),
introduced(definition,[new_symbols(definition,[sQ78_spl])],[split_symbol_definition]) ).
fof(f642,plain,
( sQ78_spl
| ~ op_or ),
inference(component_clause,[status(thm)],[f640]) ).
fof(f643,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(f644,plain,
! [X0,X1] :
( ~ sQ79_spl
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(component_clause,[status(thm)],[f643]) ).
fof(f646,plain,
( sQ79_spl
| ~ sQ78_spl ),
inference(split_clause,[status(thm)],[f201,f640,f643]) ).
fof(f654,definition,
( sQ82_spl
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition]) ).
fof(f656,plain,
( sQ82_spl
| ~ op_implies_and ),
inference(component_clause,[status(thm)],[f654]) ).
fof(f657,definition,
! [X0,X1] :
( sQ83_spl
<=> implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ83_spl])],[split_symbol_definition]) ).
fof(f658,plain,
! [X0,X1] :
( ~ sQ83_spl
| implies(X0,X1) = not(and(X0,not(X1))) ),
inference(component_clause,[status(thm)],[f657]) ).
fof(f660,plain,
( sQ83_spl
| ~ sQ82_spl ),
inference(split_clause,[status(thm)],[f205,f654,f657]) ).
fof(f664,definition,
! [X0,X1] :
( sQ85_spl
<=> implies(X0,X1) = or(not(X0),X1) ),
introduced(definition,[new_symbols(definition,[sQ85_spl])],[split_symbol_definition]) ).
fof(f665,plain,
! [X0,X1] :
( ~ sQ85_spl
| implies(X0,X1) = or(not(X0),X1) ),
inference(component_clause,[status(thm)],[f664]) ).
fof(f675,definition,
( sQ88_spl
<=> necessitation ),
introduced(definition,[new_symbols(definition,[sQ88_spl])],[split_symbol_definition]) ).
fof(f677,plain,
( sQ88_spl
| ~ necessitation ),
inference(component_clause,[status(thm)],[f675]) ).
fof(f678,definition,
! [X0] :
( sQ89_spl
<=> ( is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ89_spl])],[split_symbol_definition]) ).
fof(f679,plain,
! [X0] :
( ~ sQ89_spl
| is_a_theorem(necessarily(X0))
| ~ is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f678]) ).
fof(f681,plain,
( sQ89_spl
| ~ sQ88_spl ),
inference(split_clause,[status(thm)],[f231,f675,f678]) ).
fof(f754,definition,
( sQ109_spl
<=> axiom_M ),
introduced(definition,[new_symbols(definition,[sQ109_spl])],[split_symbol_definition]) ).
fof(f756,plain,
( sQ109_spl
| ~ axiom_M ),
inference(component_clause,[status(thm)],[f754]) ).
fof(f757,definition,
! [X0] :
( sQ110_spl
<=> is_a_theorem(implies(necessarily(X0),X0)) ),
introduced(definition,[new_symbols(definition,[sQ110_spl])],[split_symbol_definition]) ).
fof(f758,plain,
! [X0] :
( ~ sQ110_spl
| is_a_theorem(implies(necessarily(X0),X0)) ),
inference(component_clause,[status(thm)],[f757]) ).
fof(f760,plain,
( sQ110_spl
| ~ sQ109_spl ),
inference(split_clause,[status(thm)],[f261,f754,f757]) ).
fof(f897,definition,
( sQ148_spl
<=> axiom_m6 ),
introduced(definition,[new_symbols(definition,[sQ148_spl])],[split_symbol_definition]) ).
fof(f898,plain,
( ~ sQ148_spl
| axiom_m6 ),
inference(component_clause,[status(thm)],[f897]) ).
fof(f904,definition,
( sQ150_spl
<=> is_a_theorem(strict_implies(sK87_skl,possibly(sK87_skl))) ),
introduced(definition,[new_symbols(definition,[sQ150_spl])],[split_symbol_definition]) ).
fof(f906,plain,
( sQ150_spl
| ~ is_a_theorem(strict_implies(sK87_skl,possibly(sK87_skl))) ),
inference(component_clause,[status(thm)],[f904]) ).
fof(f907,plain,
( ~ sQ150_spl
| sQ148_spl ),
inference(split_clause,[status(thm)],[f314,f897,f904]) ).
fof(f952,definition,
( sQ163_spl
<=> op_possibly ),
introduced(definition,[new_symbols(definition,[sQ163_spl])],[split_symbol_definition]) ).
fof(f954,plain,
( sQ163_spl
| ~ op_possibly ),
inference(component_clause,[status(thm)],[f952]) ).
fof(f955,definition,
! [X0] :
( sQ164_spl
<=> possibly(X0) = not(necessarily(not(X0))) ),
introduced(definition,[new_symbols(definition,[sQ164_spl])],[split_symbol_definition]) ).
fof(f956,plain,
! [X0] :
( ~ sQ164_spl
| possibly(X0) = not(necessarily(not(X0))) ),
inference(component_clause,[status(thm)],[f955]) ).
fof(f958,plain,
( sQ164_spl
| ~ sQ163_spl ),
inference(split_clause,[status(thm)],[f332,f952,f955]) ).
fof(f966,definition,
( sQ167_spl
<=> op_strict_implies ),
introduced(definition,[new_symbols(definition,[sQ167_spl])],[split_symbol_definition]) ).
fof(f968,plain,
( sQ167_spl
| ~ op_strict_implies ),
inference(component_clause,[status(thm)],[f966]) ).
fof(f969,definition,
! [X0,X1] :
( sQ168_spl
<=> strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
introduced(definition,[new_symbols(definition,[sQ168_spl])],[split_symbol_definition]) ).
fof(f970,plain,
! [X0,X1] :
( ~ sQ168_spl
| strict_implies(X0,X1) = necessarily(implies(X0,X1)) ),
inference(component_clause,[status(thm)],[f969]) ).
fof(f972,plain,
( sQ168_spl
| ~ sQ167_spl ),
inference(split_clause,[status(thm)],[f336,f966,f969]) ).
fof(f982,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f353,f213]) ).
fof(f983,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f982]) ).
fof(f984,plain,
( sQ88_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f677,f340]) ).
fof(f985,plain,
sQ88_spl,
inference(contradiction_clause,[status(thm)],[f984]) ).
fof(f986,plain,
( sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f372,f227]) ).
fof(f987,plain,
sQ5_spl,
inference(contradiction_clause,[status(thm)],[f986]) ).
fof(f988,plain,
( sQ167_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f968,f347]) ).
fof(f989,plain,
sQ167_spl,
inference(contradiction_clause,[status(thm)],[f988]) ).
fof(f990,plain,
( sQ163_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f954,f339]) ).
fof(f991,plain,
sQ163_spl,
inference(contradiction_clause,[status(thm)],[f990]) ).
fof(f994,plain,
( sQ82_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f656,f211]) ).
fof(f995,plain,
sQ82_spl,
inference(contradiction_clause,[status(thm)],[f994]) ).
fof(f996,plain,
( sQ78_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f642,f210]) ).
fof(f997,plain,
sQ78_spl,
inference(contradiction_clause,[status(thm)],[f996]) ).
fof(f1006,plain,
( sQ109_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f756,f342]) ).
fof(f1007,plain,
sQ109_spl,
inference(contradiction_clause,[status(thm)],[f1006]) ).
fof(f1011,plain,
! [X0,X1] :
( ~ sQ168_spl
| ~ sQ89_spl
| is_a_theorem(strict_implies(X0,X1))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(paramodulation,[status(thm)],[f970,f679]) ).
fof(f1035,plain,
( sQ33_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f475,f222]) ).
fof(f1036,plain,
sQ33_spl,
inference(contradiction_clause,[status(thm)],[f1035]) ).
fof(f1055,plain,
( sQ30_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f464,f221]) ).
fof(f1056,plain,
sQ30_spl,
inference(contradiction_clause,[status(thm)],[f1055]) ).
fof(f1063,plain,
( sQ12_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f398,f215]) ).
fof(f1064,plain,
sQ12_spl,
inference(contradiction_clause,[status(thm)],[f1063]) ).
fof(f1067,plain,
! [X0,X1,X2] :
( ~ sQ6_spl
| ~ sQ1_spl
| X1 = X2
| ~ is_a_theorem(implies(X0,equiv(X1,X2)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f355,f374]) ).
fof(f1092,plain,
( sQ150_spl
| ~ sQ168_spl
| ~ sQ89_spl
| ~ is_a_theorem(implies(sK87_skl,possibly(sK87_skl))) ),
inference(resolution,[status(thm)],[f1011,f906]) ).
fof(f1178,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| or(X0,X1) = implies(not(X0),X1) ),
inference(forward_demodulation,[status(thm)],[f658,f644]) ).
fof(f1226,plain,
( sQ45_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f519,f226]) ).
fof(f1227,plain,
sQ45_spl,
inference(contradiction_clause,[status(thm)],[f1226]) ).
fof(f1309,plain,
( sQ36_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f486,f223]) ).
fof(f1310,plain,
sQ36_spl,
inference(contradiction_clause,[status(thm)],[f1309]) ).
fof(f1346,plain,
( sQ15_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f409,f216]) ).
fof(f1347,plain,
sQ15_spl,
inference(contradiction_clause,[status(thm)],[f1346]) ).
fof(f1381,plain,
! [X0,X1] :
( ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))) ),
inference(forward_demodulation,[status(thm)],[f1178,f389]) ).
fof(f1388,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f387,f214]) ).
fof(f1389,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f1388]) ).
fof(f1553,plain,
! [X0] :
( ~ sQ1_spl
| sQ71_spl
| ~ is_a_theorem(implies(X0,implies(or(sK47_skl,sK48_skl),or(sK48_skl,sK47_skl))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f616,f355]) ).
fof(f1599,plain,
! [X0,X1] :
( ~ sQ164_spl
| ~ sQ85_spl
| implies(necessarily(not(X0)),X1) = or(possibly(X0),X1) ),
inference(paramodulation,[status(thm)],[f956,f665]) ).
fof(f1995,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(or(X0,not(X1))) ),
inference(resolution,[status(thm)],[f1381,f355]) ).
fof(f2004,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ16_spl
| is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(implies(X0,implies(X0,X1))) ),
inference(resolution,[status(thm)],[f411,f355]) ).
fof(f2014,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ46_spl
| is_a_theorem(implies(implies(X1,X0),equiv(X0,X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f521,f355]) ).
fof(f2028,plain,
! [X0,X1,X2] :
( ~ sQ1_spl
| ~ sQ37_spl
| is_a_theorem(implies(implies(X2,X1),implies(or(X0,X2),X1)))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f488,f355]) ).
fof(f4122,plain,
! [X0] :
( ~ sQ13_spl
| ~ sQ1_spl
| ~ sQ16_spl
| is_a_theorem(implies(X0,X0)) ),
inference(resolution,[status(thm)],[f2004,f400]) ).
fof(f4172,plain,
! [X0] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ1_spl
| ~ sQ16_spl
| is_a_theorem(or(X0,not(X0))) ),
inference(paramodulation,[status(thm)],[f1178,f4122]) ).
fof(f4777,plain,
! [X0,X1] :
( ~ sQ6_spl
| ~ sQ1_spl
| ~ sQ46_spl
| X0 = X1
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f2014,f1067]) ).
fof(f4884,plain,
! [X0] :
( ~ sQ164_spl
| ~ sQ85_spl
| ~ sQ110_spl
| is_a_theorem(or(possibly(X0),not(X0))) ),
inference(paramodulation,[status(thm)],[f1599,f758]) ).
fof(f5030,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ164_spl
| ~ sQ85_spl
| ~ sQ110_spl
| is_a_theorem(implies(X0,possibly(X0))) ),
inference(resolution,[status(thm)],[f4884,f1995]) ).
fof(f5046,plain,
( sQ150_spl
| ~ sQ168_spl
| ~ sQ89_spl
| ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ164_spl
| ~ sQ85_spl
| ~ sQ110_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f1092,f5030]) ).
fof(f5052,plain,
( sQ150_spl
| ~ sQ168_spl
| ~ sQ89_spl
| ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ164_spl
| ~ sQ85_spl
| ~ sQ110_spl ),
inference(contradiction_clause,[status(thm)],[f5046]) ).
fof(f5237,plain,
( ~ sQ1_spl
| sQ71_spl
| ~ sQ37_spl
| ~ is_a_theorem(implies(sK48_skl,or(sK48_skl,sK47_skl)))
| ~ is_a_theorem(implies(sK47_skl,or(sK48_skl,sK47_skl))) ),
inference(resolution,[status(thm)],[f2028,f1553]) ).
fof(f5250,definition,
( sQ217_spl
<=> is_a_theorem(implies(sK47_skl,or(sK48_skl,sK47_skl))) ),
introduced(definition,[new_symbols(definition,[sQ217_spl])],[split_symbol_definition]) ).
fof(f5252,plain,
( sQ217_spl
| ~ is_a_theorem(implies(sK47_skl,or(sK48_skl,sK47_skl))) ),
inference(component_clause,[status(thm)],[f5250]) ).
fof(f5253,definition,
( sQ218_spl
<=> is_a_theorem(implies(sK48_skl,or(sK48_skl,sK47_skl))) ),
introduced(definition,[new_symbols(definition,[sQ218_spl])],[split_symbol_definition]) ).
fof(f5255,plain,
( sQ218_spl
| ~ is_a_theorem(implies(sK48_skl,or(sK48_skl,sK47_skl))) ),
inference(component_clause,[status(thm)],[f5253]) ).
fof(f5256,plain,
( ~ sQ1_spl
| sQ71_spl
| ~ sQ37_spl
| ~ sQ218_spl
| ~ sQ217_spl ),
inference(split_clause,[status(thm)],[f5237,f5250,f5253,f487,f614,f354]) ).
fof(f5286,plain,
( sQ217_spl
| ~ sQ34_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f5252,f477]) ).
fof(f5287,plain,
( sQ217_spl
| ~ sQ34_spl ),
inference(contradiction_clause,[status(thm)],[f5286]) ).
fof(f5290,plain,
( sQ218_spl
| ~ sQ31_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f5255,f466]) ).
fof(f5291,plain,
( sQ218_spl
| ~ sQ31_spl ),
inference(contradiction_clause,[status(thm)],[f5290]) ).
fof(f5386,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ70_spl
| is_a_theorem(or(X1,X0))
| ~ is_a_theorem(or(X0,X1)) ),
inference(resolution,[status(thm)],[f611,f355]) ).
fof(f5428,plain,
! [X0] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ1_spl
| ~ sQ16_spl
| ~ sQ70_spl
| is_a_theorem(or(not(X0),X0)) ),
inference(resolution,[status(thm)],[f5386,f4172]) ).
fof(f5450,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| is_a_theorem(implies(X0,not(not(X0)))) ),
inference(resolution,[status(thm)],[f5428,f1995]) ).
fof(f6418,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| ~ sQ6_spl
| ~ sQ46_spl
| not(not(X0)) = X0
| ~ is_a_theorem(implies(not(not(X0)),X0)) ),
inference(resolution,[status(thm)],[f4777,f5450]) ).
fof(f6482,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| ~ sQ6_spl
| ~ sQ46_spl
| not(not(X0)) = X0
| ~ is_a_theorem(or(not(X0),X0)) ),
inference(forward_demodulation,[status(thm)],[f1178,f6418]) ).
fof(f6483,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| ~ sQ6_spl
| ~ sQ46_spl
| not(not(X0)) = X0 ),
inference(forward_subsumption_resolution,[status(thm)],[f6482,f5428]) ).
fof(f6822,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| ~ sQ6_spl
| ~ sQ46_spl
| or(not(X0),X1) = implies(X0,X1) ),
inference(paramodulation,[status(thm)],[f6483,f1178]) ).
fof(f6842,plain,
( ~ sQ1_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ13_spl
| ~ sQ16_spl
| ~ sQ70_spl
| ~ sQ6_spl
| ~ sQ46_spl
| sQ85_spl ),
inference(split_clause,[status(thm)],[f6822,f664,f520,f373,f610,f410,f399,f657,f643,f388,f354]) ).
fof(f7014,plain,
( ~ sQ148_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f898,f350]) ).
fof(f7015,plain,
~ sQ148_spl,
inference(contradiction_clause,[status(thm)],[f7014]) ).
fof(f7016,plain,
$false,
inference(sat_refutation,[status(thm)],[f357,f376,f391,f402,f413,f468,f479,f490,f523,f613,f617,f646,f660,f681,f760,f907,f958,f972,f983,f985,f987,f989,f991,f995,f997,f1007,f1036,f1056,f1064,f1227,f1310,f1347,f1389,f5052,f5256,f5287,f5291,f6842,f7015]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL533+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 00:40:51 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.40 % Drodi V4.1.1
% 1.23/0.90 % Refutation found
% 1.23/0.90 % SZS status Theorem for theBenchmark: Theorem is valid
% 1.23/0.90 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.68/0.94 % Elapsed time: 0.545911 seconds
% 0.68/0.94 % CPU time: 3.928803 seconds
% 0.68/0.94 % Total memory used: 155.548 MB
% 0.68/0.94 % Net memory used: 151.982 MB
%------------------------------------------------------------------------------