%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:47 PM UTC 2026
% Result : Theorem 82.46s 15.91s
% Output : CNFRefutation 73.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 61
% Syntax : Number of formulae : 267 ( 38 unt; 34 def)
% Number of atoms : 1058 ( 49 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 1481 ( 690 ~; 702 |; 36 &)
% ( 49 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 52 ( 50 usr; 50 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 25 con; 0-2 aty)
% Number of variables : 300 ( 273 !; 27 ?)
% 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/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
( substitution_of_equivalents
<=> ! [X,Y] :
( is_a_theorem(equiv(X,Y))
=> X = Y ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
( implies_3
<=> ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
( and_1
<=> ! [X,Y] : is_a_theorem(implies(and(X,Y),X)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
( and_3
<=> ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
( or_1
<=> ! [X,Y] : is_a_theorem(implies(X,or(X,Y))) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
( kn1
<=> ! [P] : is_a_theorem(implies(P,and(P,P))) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f21,axiom,
( cn3
<=> ! [P] : is_a_theorem(implies(implies(not(P),P),P)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
( r1
<=> ! [P] : is_a_theorem(implies(or(P,P),P)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,axiom,
( op_or
=> ! [X,Y] : or(X,Y) = not(and(not(X),not(Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,axiom,
( op_implies_and
=> ! [X,Y] : implies(X,Y) = not(and(X,not(Y))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f35,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f36,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f39,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f40,axiom,
and_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f42,axiom,
and_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f43,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f48,axiom,
equivalence_3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f49,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f50,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
kn3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ kn3,
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f55,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(f56,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)],[f55]) ).
fof(f57,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)],[f56]) ).
fof(f58,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)],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X0,X1))
| ~ is_a_theorem(X0)
| ~ modus_ponens ),
inference(cnf_transformation,[status(thm)],[f58]) ).
fof(f63,plain,
( substitution_of_equivalents
<=> ! [X,Y] :
( X = Y
| ~ is_a_theorem(equiv(X,Y)) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f64,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)],[f63]) ).
fof(f65,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)],[f64]) ).
fof(f66,plain,
! [X0,X1] :
( X0 = X1
| ~ is_a_theorem(equiv(X0,X1))
| ~ substitution_of_equivalents ),
inference(cnf_transformation,[status(thm)],[f65]) ).
fof(f69,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(f70,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)],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0)))
| ~ modus_tollens ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f77,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(f78,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)],[f77]) ).
fof(f79,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
| ~ implies_2 ),
inference(cnf_transformation,[status(thm)],[f78]) ).
fof(f81,plain,
( ( ? [X,Y,Z] : ~ is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| implies_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| ~ implies_3 ) ),
inference(NNF_transformation,[status(thm)],[f6]) ).
fof(f82,plain,
( ( ~ is_a_theorem(implies(implies(sK10_skl,sK11_skl),implies(implies(sK11_skl,sK12_skl),implies(sK10_skl,sK12_skl))))
| implies_3 )
& ( ! [X,Y,Z] : is_a_theorem(implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))))
| ~ implies_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10_skl,sK11_skl,sK12_skl]),skolemize(X,sK10_skl),skolemize(Y,sK11_skl),skolemize(Z,sK12_skl)],[f81]) ).
fof(f83,plain,
! [X0,X1,X2] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2))))
| ~ implies_3 ),
inference(cnf_transformation,[status(thm)],[f82]) ).
fof(f85,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(and(X,Y),X))
| and_1 )
& ( ! [X,Y] : is_a_theorem(implies(and(X,Y),X))
| ~ and_1 ) ),
inference(NNF_transformation,[status(thm)],[f7]) ).
fof(f86,plain,
( ( ~ is_a_theorem(implies(and(sK13_skl,sK14_skl),sK13_skl))
| and_1 )
& ( ! [X,Y] : is_a_theorem(implies(and(X,Y),X))
| ~ and_1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl]),skolemize(X,sK13_skl),skolemize(Y,sK14_skl)],[f85]) ).
fof(f87,plain,
! [X0,X1] :
( is_a_theorem(implies(and(X0,X1),X0))
| ~ and_1 ),
inference(cnf_transformation,[status(thm)],[f86]) ).
fof(f93,plain,
( ( ? [X,Y] : ~ is_a_theorem(implies(X,implies(Y,and(X,Y))))
| and_3 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y))))
| ~ and_3 ) ),
inference(NNF_transformation,[status(thm)],[f9]) ).
fof(f94,plain,
( ( ~ is_a_theorem(implies(sK17_skl,implies(sK18_skl,and(sK17_skl,sK18_skl))))
| and_3 )
& ( ! [X,Y] : is_a_theorem(implies(X,implies(Y,and(X,Y))))
| ~ and_3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK17_skl,sK18_skl]),skolemize(X,sK17_skl),skolemize(Y,sK18_skl)],[f93]) ).
fof(f95,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
| ~ and_3 ),
inference(cnf_transformation,[status(thm)],[f94]) ).
fof(f97,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(f98,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)],[f97]) ).
fof(f99,plain,
! [X0,X1] :
( is_a_theorem(implies(X0,or(X0,X1)))
| ~ or_1 ),
inference(cnf_transformation,[status(thm)],[f98]) ).
fof(f117,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(f118,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)],[f117]) ).
fof(f119,plain,
! [X0,X1] :
( is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1))))
| ~ equivalence_3 ),
inference(cnf_transformation,[status(thm)],[f118]) ).
fof(f121,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(f122,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)],[f121]) ).
fof(f123,plain,
! [X0] :
( is_a_theorem(implies(X0,and(X0,X0)))
| ~ kn1 ),
inference(cnf_transformation,[status(thm)],[f122]) ).
fof(f124,plain,
( ~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl)))
| kn1 ),
inference(cnf_transformation,[status(thm)],[f122]) ).
fof(f129,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(f130,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)],[f129]) ).
fof(f132,plain,
( ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(not(and(sK36_skl,sK37_skl)),not(and(sK37_skl,sK35_skl)))))
| kn3 ),
inference(cnf_transformation,[status(thm)],[f130]) ).
fof(f141,plain,
( ( ? [P] : ~ is_a_theorem(implies(implies(not(P),P),P))
| cn3 )
& ( ! [P] : is_a_theorem(implies(implies(not(P),P),P))
| ~ cn3 ) ),
inference(NNF_transformation,[status(thm)],[f21]) ).
fof(f142,plain,
( ( ~ is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl))
| cn3 )
& ( ! [P] : is_a_theorem(implies(implies(not(P),P),P))
| ~ cn3 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK43_skl]),skolemize(P,sK43_skl)],[f141]) ).
fof(f143,plain,
! [X0] :
( is_a_theorem(implies(implies(not(X0),X0),X0))
| ~ cn3 ),
inference(cnf_transformation,[status(thm)],[f142]) ).
fof(f144,plain,
( ~ is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl))
| cn3 ),
inference(cnf_transformation,[status(thm)],[f142]) ).
fof(f145,plain,
( ( ? [P] : ~ is_a_theorem(implies(or(P,P),P))
| r1 )
& ( ! [P] : is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(NNF_transformation,[status(thm)],[f22]) ).
fof(f146,plain,
( ( ~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl))
| r1 )
& ( ! [P] : is_a_theorem(implies(or(P,P),P))
| ~ r1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK44_skl]),skolemize(P,sK44_skl)],[f145]) ).
fof(f147,plain,
! [X0] :
( is_a_theorem(implies(or(X0,X0),X0))
| ~ r1 ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f148,plain,
( ~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl))
| r1 ),
inference(cnf_transformation,[status(thm)],[f146]) ).
fof(f165,plain,
( ! [X,Y] : or(X,Y) = not(and(not(X),not(Y)))
| ~ op_or ),
inference(pre_NNF_transformation,[status(thm)],[f27]) ).
fof(f166,plain,
! [X0,X1] :
( or(X0,X1) = not(and(not(X0),not(X1)))
| ~ op_or ),
inference(cnf_transformation,[status(thm)],[f165]) ).
fof(f169,plain,
( ! [X,Y] : implies(X,Y) = not(and(X,not(Y)))
| ~ op_implies_and ),
inference(pre_NNF_transformation,[status(thm)],[f29]) ).
fof(f170,plain,
! [X0,X1] :
( implies(X0,X1) = not(and(X0,not(X1)))
| ~ op_implies_and ),
inference(cnf_transformation,[status(thm)],[f169]) ).
fof(f176,plain,
op_implies_and,
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f178,plain,
modus_ponens,
inference(cnf_transformation,[status(thm)],[f35]) ).
fof(f179,plain,
modus_tollens,
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f181,plain,
implies_2,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f182,plain,
implies_3,
inference(cnf_transformation,[status(thm)],[f39]) ).
fof(f183,plain,
and_1,
inference(cnf_transformation,[status(thm)],[f40]) ).
fof(f185,plain,
and_3,
inference(cnf_transformation,[status(thm)],[f42]) ).
fof(f186,plain,
or_1,
inference(cnf_transformation,[status(thm)],[f43]) ).
fof(f191,plain,
equivalence_3,
inference(cnf_transformation,[status(thm)],[f48]) ).
fof(f192,plain,
substitution_of_equivalents,
inference(cnf_transformation,[status(thm)],[f49]) ).
fof(f193,plain,
op_or,
inference(cnf_transformation,[status(thm)],[f50]) ).
fof(f196,plain,
~ kn3,
inference(cnf_transformation,[status(thm)],[f54]) ).
fof(f197,definition,
( sQ0_spl
<=> modus_ponens ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f199,plain,
( sQ0_spl
| ~ modus_ponens ),
inference(component_clause,[status(thm)],[f197]) ).
fof(f200,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(f201,plain,
! [X0,X1] :
( ~ sQ1_spl
| ~ is_a_theorem(implies(X1,X0))
| ~ is_a_theorem(X1)
| is_a_theorem(X0) ),
inference(component_clause,[status(thm)],[f200]) ).
fof(f203,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f59,f197,f200]) ).
fof(f216,definition,
( sQ5_spl
<=> substitution_of_equivalents ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f218,plain,
( sQ5_spl
| ~ substitution_of_equivalents ),
inference(component_clause,[status(thm)],[f216]) ).
fof(f219,definition,
! [X0,X1] :
( sQ6_spl
<=> ( X0 = X1
| ~ is_a_theorem(equiv(X0,X1)) ) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f220,plain,
! [X0,X1] :
( ~ sQ6_spl
| X1 = X0
| ~ is_a_theorem(equiv(X0,X1)) ),
inference(component_clause,[status(thm)],[f219]) ).
fof(f222,plain,
( sQ6_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f66,f216,f219]) ).
fof(f231,definition,
( sQ9_spl
<=> modus_tollens ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f233,plain,
( sQ9_spl
| ~ modus_tollens ),
inference(component_clause,[status(thm)],[f231]) ).
fof(f234,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(f235,plain,
! [X0,X1] :
( ~ sQ10_spl
| is_a_theorem(implies(implies(not(X0),not(X1)),implies(X1,X0))) ),
inference(component_clause,[status(thm)],[f234]) ).
fof(f237,plain,
( sQ10_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f71,f231,f234]) ).
fof(f253,definition,
( sQ15_spl
<=> implies_2 ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f255,plain,
( sQ15_spl
| ~ implies_2 ),
inference(component_clause,[status(thm)],[f253]) ).
fof(f256,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(f257,plain,
! [X0,X1] :
( ~ sQ16_spl
| is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
inference(component_clause,[status(thm)],[f256]) ).
fof(f259,plain,
( sQ16_spl
| ~ sQ15_spl ),
inference(split_clause,[status(thm)],[f79,f253,f256]) ).
fof(f264,definition,
( sQ18_spl
<=> implies_3 ),
introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition]) ).
fof(f266,plain,
( sQ18_spl
| ~ implies_3 ),
inference(component_clause,[status(thm)],[f264]) ).
fof(f267,definition,
! [X0,X1,X2] :
( sQ19_spl
<=> is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition]) ).
fof(f268,plain,
! [X0,X1,X2] :
( ~ sQ19_spl
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))) ),
inference(component_clause,[status(thm)],[f267]) ).
fof(f270,plain,
( sQ19_spl
| ~ sQ18_spl ),
inference(split_clause,[status(thm)],[f83,f264,f267]) ).
fof(f275,definition,
( sQ21_spl
<=> and_1 ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f277,plain,
( sQ21_spl
| ~ and_1 ),
inference(component_clause,[status(thm)],[f275]) ).
fof(f278,definition,
! [X0,X1] :
( sQ22_spl
<=> is_a_theorem(implies(and(X0,X1),X0)) ),
introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).
fof(f279,plain,
! [X0,X1] :
( ~ sQ22_spl
| is_a_theorem(implies(and(X0,X1),X0)) ),
inference(component_clause,[status(thm)],[f278]) ).
fof(f281,plain,
( sQ22_spl
| ~ sQ21_spl ),
inference(split_clause,[status(thm)],[f87,f275,f278]) ).
fof(f297,definition,
( sQ27_spl
<=> and_3 ),
introduced(definition,[new_symbols(definition,[sQ27_spl])],[split_symbol_definition]) ).
fof(f299,plain,
( sQ27_spl
| ~ and_3 ),
inference(component_clause,[status(thm)],[f297]) ).
fof(f300,definition,
! [X0,X1] :
( sQ28_spl
<=> is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
introduced(definition,[new_symbols(definition,[sQ28_spl])],[split_symbol_definition]) ).
fof(f301,plain,
! [X0,X1] :
( ~ sQ28_spl
| is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
inference(component_clause,[status(thm)],[f300]) ).
fof(f303,plain,
( sQ28_spl
| ~ sQ27_spl ),
inference(split_clause,[status(thm)],[f95,f297,f300]) ).
fof(f308,definition,
( sQ30_spl
<=> or_1 ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f310,plain,
( sQ30_spl
| ~ or_1 ),
inference(component_clause,[status(thm)],[f308]) ).
fof(f311,definition,
! [X0,X1] :
( sQ31_spl
<=> is_a_theorem(implies(X0,or(X0,X1))) ),
introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition]) ).
fof(f312,plain,
! [X0,X1] :
( ~ sQ31_spl
| is_a_theorem(implies(X0,or(X0,X1))) ),
inference(component_clause,[status(thm)],[f311]) ).
fof(f314,plain,
( sQ31_spl
| ~ sQ30_spl ),
inference(split_clause,[status(thm)],[f99,f308,f311]) ).
fof(f363,definition,
( sQ45_spl
<=> equivalence_3 ),
introduced(definition,[new_symbols(definition,[sQ45_spl])],[split_symbol_definition]) ).
fof(f365,plain,
( sQ45_spl
| ~ equivalence_3 ),
inference(component_clause,[status(thm)],[f363]) ).
fof(f366,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(f367,plain,
! [X0,X1] :
( ~ sQ46_spl
| is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X0),equiv(X0,X1)))) ),
inference(component_clause,[status(thm)],[f366]) ).
fof(f369,plain,
( sQ46_spl
| ~ sQ45_spl ),
inference(split_clause,[status(thm)],[f119,f363,f366]) ).
fof(f374,definition,
( sQ48_spl
<=> kn1 ),
introduced(definition,[new_symbols(definition,[sQ48_spl])],[split_symbol_definition]) ).
fof(f377,definition,
! [X0] :
( sQ49_spl
<=> is_a_theorem(implies(X0,and(X0,X0))) ),
introduced(definition,[new_symbols(definition,[sQ49_spl])],[split_symbol_definition]) ).
fof(f378,plain,
! [X0] :
( ~ sQ49_spl
| is_a_theorem(implies(X0,and(X0,X0))) ),
inference(component_clause,[status(thm)],[f377]) ).
fof(f380,plain,
( sQ49_spl
| ~ sQ48_spl ),
inference(split_clause,[status(thm)],[f123,f374,f377]) ).
fof(f381,definition,
( sQ50_spl
<=> is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl))) ),
introduced(definition,[new_symbols(definition,[sQ50_spl])],[split_symbol_definition]) ).
fof(f383,plain,
( sQ50_spl
| ~ is_a_theorem(implies(sK32_skl,and(sK32_skl,sK32_skl))) ),
inference(component_clause,[status(thm)],[f381]) ).
fof(f384,plain,
( ~ sQ50_spl
| sQ48_spl ),
inference(split_clause,[status(thm)],[f124,f374,f381]) ).
fof(f393,definition,
( sQ53_spl
<=> kn3 ),
introduced(definition,[new_symbols(definition,[sQ53_spl])],[split_symbol_definition]) ).
fof(f394,plain,
( ~ sQ53_spl
| kn3 ),
inference(component_clause,[status(thm)],[f393]) ).
fof(f400,definition,
( sQ55_spl
<=> is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(not(and(sK36_skl,sK37_skl)),not(and(sK37_skl,sK35_skl))))) ),
introduced(definition,[new_symbols(definition,[sQ55_spl])],[split_symbol_definition]) ).
fof(f402,plain,
( sQ55_spl
| ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(not(and(sK36_skl,sK37_skl)),not(and(sK37_skl,sK35_skl))))) ),
inference(component_clause,[status(thm)],[f400]) ).
fof(f403,plain,
( ~ sQ55_spl
| sQ53_spl ),
inference(split_clause,[status(thm)],[f132,f393,f400]) ).
fof(f423,definition,
( sQ61_spl
<=> cn3 ),
introduced(definition,[new_symbols(definition,[sQ61_spl])],[split_symbol_definition]) ).
fof(f426,definition,
! [X0] :
( sQ62_spl
<=> is_a_theorem(implies(implies(not(X0),X0),X0)) ),
introduced(definition,[new_symbols(definition,[sQ62_spl])],[split_symbol_definition]) ).
fof(f427,plain,
! [X0] :
( ~ sQ62_spl
| is_a_theorem(implies(implies(not(X0),X0),X0)) ),
inference(component_clause,[status(thm)],[f426]) ).
fof(f429,plain,
( sQ62_spl
| ~ sQ61_spl ),
inference(split_clause,[status(thm)],[f143,f423,f426]) ).
fof(f430,definition,
( sQ63_spl
<=> is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl)) ),
introduced(definition,[new_symbols(definition,[sQ63_spl])],[split_symbol_definition]) ).
fof(f432,plain,
( sQ63_spl
| ~ is_a_theorem(implies(implies(not(sK43_skl),sK43_skl),sK43_skl)) ),
inference(component_clause,[status(thm)],[f430]) ).
fof(f433,plain,
( ~ sQ63_spl
| sQ61_spl ),
inference(split_clause,[status(thm)],[f144,f423,f430]) ).
fof(f434,definition,
( sQ64_spl
<=> r1 ),
introduced(definition,[new_symbols(definition,[sQ64_spl])],[split_symbol_definition]) ).
fof(f437,definition,
! [X0] :
( sQ65_spl
<=> is_a_theorem(implies(or(X0,X0),X0)) ),
introduced(definition,[new_symbols(definition,[sQ65_spl])],[split_symbol_definition]) ).
fof(f438,plain,
! [X0] :
( ~ sQ65_spl
| is_a_theorem(implies(or(X0,X0),X0)) ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f440,plain,
( sQ65_spl
| ~ sQ64_spl ),
inference(split_clause,[status(thm)],[f147,f434,f437]) ).
fof(f441,definition,
( sQ66_spl
<=> is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl)) ),
introduced(definition,[new_symbols(definition,[sQ66_spl])],[split_symbol_definition]) ).
fof(f443,plain,
( sQ66_spl
| ~ is_a_theorem(implies(or(sK44_skl,sK44_skl),sK44_skl)) ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( ~ sQ66_spl
| sQ64_spl ),
inference(split_clause,[status(thm)],[f148,f434,f441]) ).
fof(f456,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(f457,plain,
! [X0,X1] :
( ~ sQ70_spl
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(component_clause,[status(thm)],[f456]) ).
fof(f486,definition,
( sQ78_spl
<=> op_or ),
introduced(definition,[new_symbols(definition,[sQ78_spl])],[split_symbol_definition]) ).
fof(f488,plain,
( sQ78_spl
| ~ op_or ),
inference(component_clause,[status(thm)],[f486]) ).
fof(f489,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(f490,plain,
! [X0,X1] :
( ~ sQ79_spl
| or(X0,X1) = not(and(not(X0),not(X1))) ),
inference(component_clause,[status(thm)],[f489]) ).
fof(f492,plain,
( sQ79_spl
| ~ sQ78_spl ),
inference(split_clause,[status(thm)],[f166,f486,f489]) ).
fof(f500,definition,
( sQ82_spl
<=> op_implies_and ),
introduced(definition,[new_symbols(definition,[sQ82_spl])],[split_symbol_definition]) ).
fof(f502,plain,
( sQ82_spl
| ~ op_implies_and ),
inference(component_clause,[status(thm)],[f500]) ).
fof(f503,definition,
! [X0,X1] :
( sQ83_spl
<=> implies(X0,X1) = not(and(X0,not(X1))) ),
introduced(definition,[new_symbols(definition,[sQ83_spl])],[split_symbol_definition]) ).
fof(f504,plain,
! [X0,X1] :
( ~ sQ83_spl
| not(and(X0,not(X1))) = implies(X0,X1) ),
inference(component_clause,[status(thm)],[f503]) ).
fof(f506,plain,
( sQ83_spl
| ~ sQ82_spl ),
inference(split_clause,[status(thm)],[f170,f500,f503]) ).
fof(f536,plain,
( sQ82_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f176,f502]) ).
fof(f537,plain,
sQ82_spl,
inference(contradiction_clause,[status(thm)],[f536]) ).
fof(f541,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f179,f233]) ).
fof(f542,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f541]) ).
fof(f545,plain,
( sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f218,f192]) ).
fof(f546,plain,
sQ5_spl,
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f560,plain,
( sQ15_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f255,f181]) ).
fof(f561,plain,
sQ15_spl,
inference(contradiction_clause,[status(thm)],[f560]) ).
fof(f564,plain,
( sQ78_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f488,f193]) ).
fof(f565,plain,
sQ78_spl,
inference(contradiction_clause,[status(thm)],[f564]) ).
fof(f566,plain,
( sQ27_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f299,f185]) ).
fof(f567,plain,
sQ27_spl,
inference(contradiction_clause,[status(thm)],[f566]) ).
fof(f569,plain,
( sQ45_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f365,f191]) ).
fof(f570,plain,
sQ45_spl,
inference(contradiction_clause,[status(thm)],[f569]) ).
fof(f585,plain,
( sQ30_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f310,f186]) ).
fof(f586,plain,
sQ30_spl,
inference(contradiction_clause,[status(thm)],[f585]) ).
fof(f594,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| or(X0,X1) = implies(not(X0),X1) ),
inference(backward_demodulation,[status(thm)],[f504,f490]) ).
fof(f595,plain,
( sQ18_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f266,f182]) ).
fof(f596,plain,
sQ18_spl,
inference(contradiction_clause,[status(thm)],[f595]) ).
fof(f597,plain,
( sQ55_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),or(and(sK36_skl,sK37_skl),not(and(sK37_skl,sK35_skl))))) ),
inference(backward_demodulation,[status(thm)],[f594,f402]) ).
fof(f598,plain,
( sQ63_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ is_a_theorem(implies(or(sK43_skl,sK43_skl),sK43_skl)) ),
inference(backward_demodulation,[status(thm)],[f594,f432]) ).
fof(f599,plain,
! [X0,X1] :
( ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(implies(or(X0,not(X1)),implies(X1,X0))) ),
inference(backward_demodulation,[status(thm)],[f594,f235]) ).
fof(f600,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f199,f178]) ).
fof(f601,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f600]) ).
fof(f605,plain,
( sQ21_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f277,f183]) ).
fof(f606,plain,
sQ21_spl,
inference(contradiction_clause,[status(thm)],[f605]) ).
fof(f629,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| not(and(X0,implies(X1,X2))) = implies(X0,and(X1,not(X2))) ),
inference(paramodulation,[status(thm)],[f504,f504]) ).
fof(f630,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ79_spl
| or(and(X0,not(X1)),X2) = implies(implies(X0,X1),X2) ),
inference(paramodulation,[status(thm)],[f504,f594]) ).
fof(f640,plain,
! [X0,X1,X2] :
( ~ sQ6_spl
| ~ sQ1_spl
| ~ is_a_theorem(X0)
| X2 = X1
| ~ is_a_theorem(implies(X0,equiv(X1,X2))) ),
inference(resolution,[status(thm)],[f201,f220]) ).
fof(f645,plain,
! [X0] :
( sQ50_spl
| ~ sQ1_spl
| ~ is_a_theorem(X0)
| ~ is_a_theorem(implies(X0,implies(sK32_skl,and(sK32_skl,sK32_skl)))) ),
inference(resolution,[status(thm)],[f201,f383]) ).
fof(f646,plain,
! [X0] :
( ~ sQ1_spl
| sQ63_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ is_a_theorem(implies(X0,implies(or(sK43_skl,sK43_skl),sK43_skl)))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f598,f201]) ).
fof(f657,plain,
! [X0,X1,X2] :
( ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| is_a_theorem(implies(or(X0,implies(X1,X2)),implies(and(X1,not(X2)),X0))) ),
inference(paramodulation,[status(thm)],[f504,f599]) ).
fof(f658,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ10_spl
| is_a_theorem(implies(or(X0,not(not(X1))),or(X1,X0))) ),
inference(paramodulation,[status(thm)],[f594,f599]) ).
fof(f676,plain,
! [X0,X1,X2,X3] :
( ~ sQ1_spl
| ~ sQ6_spl
| X3 = X2
| ~ is_a_theorem(implies(X0,implies(X1,equiv(X2,X3))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[f640,f201]) ).
fof(f814,plain,
( ~ sQ16_spl
| sQ50_spl
| ~ sQ1_spl
| ~ is_a_theorem(implies(sK32_skl,implies(sK32_skl,and(sK32_skl,sK32_skl)))) ),
inference(resolution,[status(thm)],[f645,f257]) ).
fof(f821,plain,
( ~ sQ16_spl
| sQ50_spl
| ~ sQ1_spl
| ~ sQ28_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f814,f301]) ).
fof(f822,plain,
( ~ sQ16_spl
| sQ50_spl
| ~ sQ1_spl
| ~ sQ28_spl ),
inference(contradiction_clause,[status(thm)],[f821]) ).
fof(f847,plain,
( ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| sQ63_spl
| ~ is_a_theorem(or(sK43_skl,not(or(sK43_skl,sK43_skl)))) ),
inference(resolution,[status(thm)],[f646,f599]) ).
fof(f1053,plain,
! [X0,X1] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ is_a_theorem(implies(X1,X0))
| X0 = X1
| ~ is_a_theorem(implies(X0,X1)) ),
inference(resolution,[status(thm)],[f676,f367]) ).
fof(f1557,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| or(X0,X1) = or(X1,not(not(X0)))
| ~ is_a_theorem(implies(or(X0,X1),or(X1,not(not(X0))))) ),
inference(resolution,[status(thm)],[f1053,f658]) ).
fof(f1585,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| and(X0,X0) = X0
| ~ is_a_theorem(implies(and(X0,X0),X0)) ),
inference(resolution,[status(thm)],[f1053,f378]) ).
fof(f1620,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| X0 = and(X0,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f1585,f279]) ).
fof(f1722,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| is_a_theorem(implies(or(X0,implies(not(X1),X1)),implies(not(X1),X0))) ),
inference(paramodulation,[status(thm)],[f1620,f657]) ).
fof(f1723,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| not(and(X0,implies(not(X1),X1))) = implies(X0,not(X1)) ),
inference(paramodulation,[status(thm)],[f1620,f629]) ).
fof(f1724,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| or(not(X0),X1) = implies(implies(not(X0),X0),X1) ),
inference(paramodulation,[status(thm)],[f1620,f630]) ).
fof(f1726,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| not(not(X0)) = implies(not(X0),X0) ),
inference(paramodulation,[status(thm)],[f1620,f504]) ).
fof(f1738,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| or(X0,X0) = not(not(X0)) ),
inference(forward_demodulation,[status(thm)],[f594,f1726]) ).
fof(f1756,plain,
( sQ66_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ is_a_theorem(or(not(sK44_skl),sK44_skl)) ),
inference(backward_demodulation,[status(thm)],[f1765,f443]) ).
fof(f1765,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| or(not(X0),X1) = implies(or(X0,X0),X1) ),
inference(forward_demodulation,[status(thm)],[f594,f1724]) ).
fof(f1783,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| not(and(X0,or(X1,X1))) = implies(X0,not(X1)) ),
inference(forward_demodulation,[status(thm)],[f594,f1723]) ).
fof(f1789,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| is_a_theorem(implies(or(X0,or(X1,X1)),implies(not(X1),X0))) ),
inference(forward_demodulation,[status(thm)],[f594,f1722]) ).
fof(f1790,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| is_a_theorem(implies(or(X0,or(X1,X1)),or(X1,X0))) ),
inference(forward_demodulation,[status(thm)],[f594,f1789]) ).
fof(f2027,plain,
! [X0] :
( ~ sQ65_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| is_a_theorem(or(not(X0),X0)) ),
inference(forward_demodulation,[status(thm)],[f1765,f438]) ).
fof(f2032,plain,
! [X0] :
( ~ sQ62_spl
| ~ sQ79_spl
| ~ sQ83_spl
| is_a_theorem(implies(or(X0,X0),X0)) ),
inference(forward_demodulation,[status(thm)],[f594,f427]) ).
fof(f2033,plain,
! [X0] :
( ~ sQ62_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| is_a_theorem(or(not(X0),X0)) ),
inference(forward_demodulation,[status(thm)],[f1765,f2032]) ).
fof(f2088,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| is_a_theorem(implies(X0,not(not(X0)))) ),
inference(paramodulation,[status(thm)],[f1738,f312]) ).
fof(f2173,plain,
! [X0] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| not(not(X0)) = X0
| ~ is_a_theorem(implies(not(not(X0)),X0)) ),
inference(resolution,[status(thm)],[f2088,f1053]) ).
fof(f2176,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| is_a_theorem(implies(not(X0),not(or(X0,X0)))) ),
inference(paramodulation,[status(thm)],[f1738,f2088]) ).
fof(f2179,plain,
! [X0] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| not(not(X0)) = X0
| ~ is_a_theorem(or(not(X0),X0)) ),
inference(forward_demodulation,[status(thm)],[f594,f2173]) ).
fof(f2184,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| or(X0,X0) = X0 ),
inference(backward_demodulation,[status(thm)],[f2221,f1738]) ).
fof(f2212,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ31_spl
| ~ sQ65_spl
| or(X0,X1) = or(X1,X0)
| ~ is_a_theorem(implies(or(X0,X1),or(X1,not(not(X0))))) ),
inference(backward_demodulation,[status(thm)],[f2221,f1557]) ).
fof(f2221,plain,
! [X0] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| X0 = not(not(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f2179,f2027]) ).
fof(f2257,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(backward_demodulation,[status(thm)],[f2184,f1790]) ).
fof(f2258,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| implies(X0,not(X1)) = not(and(X0,X1)) ),
inference(backward_demodulation,[status(thm)],[f2184,f1783]) ).
fof(f2259,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| or(not(X0),X1) = implies(X0,X1) ),
inference(backward_demodulation,[status(thm)],[f2184,f1765]) ).
fof(f2260,plain,
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| sQ70_spl ),
inference(split_clause,[status(thm)],[f2257,f456,f437,f311,f489,f234,f503,f278,f219,f200,f366,f377]) ).
fof(f2427,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ31_spl
| ~ sQ65_spl
| or(X1,X0) = or(X0,X1)
| ~ is_a_theorem(implies(or(X0,X1),or(X1,X0))) ),
inference(forward_demodulation,[status(thm)],[f2221,f2212]) ).
fof(f2462,plain,
! [X0] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| is_a_theorem(or(X0,not(or(X0,X0)))) ),
inference(forward_demodulation,[status(thm)],[f594,f2176]) ).
fof(f2489,plain,
! [X0,X1] :
( ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ10_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ70_spl
| or(X0,X1) = or(X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[f2427,f457]) ).
fof(f3097,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| is_a_theorem(implies(implies(X0,not(X1)),implies(X1,not(X0)))) ),
inference(paramodulation,[status(thm)],[f2259,f599]) ).
fof(f3104,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| implies(X0,X1) = or(X1,not(X0)) ),
inference(paramodulation,[status(thm)],[f2259,f2489]) ).
fof(f3122,plain,
( sQ55_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(and(sK37_skl,sK35_skl),and(sK36_skl,sK37_skl)))) ),
inference(backward_demodulation,[status(thm)],[f3104,f597]) ).
fof(f3327,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| is_a_theorem(implies(not(and(X0,X1)),implies(X1,not(X0)))) ),
inference(forward_demodulation,[status(thm)],[f2258,f3097]) ).
fof(f3328,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| is_a_theorem(or(and(X0,X1),implies(X1,not(X0)))) ),
inference(forward_demodulation,[status(thm)],[f594,f3327]) ).
fof(f3329,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| is_a_theorem(or(and(X0,X1),not(and(X1,X0)))) ),
inference(forward_demodulation,[status(thm)],[f2258,f3328]) ).
fof(f3330,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| is_a_theorem(implies(and(X0,X1),and(X1,X0))) ),
inference(forward_demodulation,[status(thm)],[f3104,f3329]) ).
fof(f3417,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| implies(X0,not(X1)) = implies(X1,not(X0)) ),
inference(paramodulation,[status(thm)],[f2259,f3104]) ).
fof(f3422,plain,
! [X0,X1] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| implies(not(X0),X1) = or(X1,X0) ),
inference(paramodulation,[status(thm)],[f2221,f3104]) ).
fof(f3460,plain,
! [X0,X1] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| implies(X0,not(X1)) = not(and(X1,X0)) ),
inference(forward_demodulation,[status(thm)],[f2258,f3417]) ).
fof(f5193,plain,
! [X0,X1] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| and(X0,X1) = and(X1,X0)
| ~ is_a_theorem(implies(and(X0,X1),and(X1,X0))) ),
inference(resolution,[status(thm)],[f3330,f1053]) ).
fof(f5215,plain,
! [X0,X1] :
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| and(X0,X1) = and(X1,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f5193,f3330]) ).
fof(f5273,plain,
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| sQ55_spl
| ~ is_a_theorem(implies(implies(sK35_skl,sK36_skl),implies(and(sK37_skl,sK35_skl),and(sK37_skl,sK36_skl)))) ),
inference(paramodulation,[status(thm)],[f5215,f3122]) ).
fof(f5780,plain,
! [X0,X1,X2] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| ~ sQ19_spl
| is_a_theorem(implies(implies(X0,X1),implies(not(and(X2,X1)),implies(X0,not(X2))))) ),
inference(paramodulation,[status(thm)],[f3460,f268]) ).
fof(f5846,plain,
! [X0,X1,X2] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| ~ sQ19_spl
| is_a_theorem(implies(implies(X0,X1),or(implies(X0,not(X2)),and(X2,X1)))) ),
inference(forward_demodulation,[status(thm)],[f3422,f5780]) ).
fof(f5847,plain,
! [X0,X1,X2] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| ~ sQ19_spl
| is_a_theorem(implies(implies(X0,X1),or(not(and(X2,X0)),and(X2,X1)))) ),
inference(forward_demodulation,[status(thm)],[f3460,f5846]) ).
fof(f5848,plain,
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| sQ55_spl
| ~ sQ19_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f5273,f5849]) ).
fof(f5849,plain,
! [X0,X1,X2] :
( ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| ~ sQ19_spl
| is_a_theorem(implies(implies(X0,X1),implies(and(X2,X0),and(X2,X1)))) ),
inference(forward_demodulation,[status(thm)],[f2259,f5847]) ).
fof(f5872,plain,
( ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ49_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ31_spl
| ~ sQ65_spl
| ~ sQ10_spl
| ~ sQ70_spl
| sQ55_spl
| ~ sQ19_spl ),
inference(contradiction_clause,[status(thm)],[f5848]) ).
fof(f5873,plain,
( ~ sQ53_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f394,f196]) ).
fof(f5874,plain,
~ sQ53_spl,
inference(contradiction_clause,[status(thm)],[f5873]) ).
fof(f5891,plain,
( ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| sQ63_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ31_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f847,f2462]) ).
fof(f5892,plain,
( ~ sQ10_spl
| ~ sQ79_spl
| ~ sQ83_spl
| ~ sQ1_spl
| sQ63_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ31_spl ),
inference(contradiction_clause,[status(thm)],[f5891]) ).
fof(f5898,plain,
( sQ66_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ62_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f1756,f2033]) ).
fof(f5899,plain,
( sQ66_spl
| ~ sQ49_spl
| ~ sQ46_spl
| ~ sQ1_spl
| ~ sQ6_spl
| ~ sQ22_spl
| ~ sQ83_spl
| ~ sQ79_spl
| ~ sQ62_spl ),
inference(contradiction_clause,[status(thm)],[f5898]) ).
fof(f5900,plain,
$false,
inference(sat_refutation,[status(thm)],[f203,f222,f237,f259,f270,f281,f303,f314,f369,f380,f384,f403,f429,f433,f440,f444,f492,f506,f537,f542,f546,f561,f565,f567,f570,f586,f596,f601,f606,f822,f2260,f5872,f5874,f5892,f5899]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL461+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/5.40 % Computer : n003.cluster.edu
% 0.12/5.40 % Model : x86_64 x86_64
% 0.12/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.40 % Memory : 8046.5625MB
% 0.12/5.40 % OS : Linux 6.8.0-71-generic
% 0.12/5.40 % CPULimit : 300
% 0.12/5.40 % WCLimit : 300
% 0.12/5.40 % DateTime : Mon Sep 21 00:35:20 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.14/5.41 % Drodi V4.1.1
% 82.46/15.91 % Refutation found
% 82.46/15.91 % SZS status Theorem for theBenchmark: Theorem is valid
% 82.46/15.91 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 51.92/17.20 % Elapsed time: 11.577299 seconds
% 51.92/17.20 % CPU time: 80.789848 seconds
% 51.92/17.20 % Total memory used: 852.571 MB
% 51.92/17.20 % Net memory used: 807.794 MB
%------------------------------------------------------------------------------