%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL461+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 10:11:21 EDT 2022
% Result : Theorem 0.66s 60.85s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 25
% Syntax : Number of formulae : 103 ( 50 unt; 0 def)
% Number of atoms : 198 ( 19 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 163 ( 68 ~; 65 |; 15 &)
% ( 11 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 16 ( 14 usr; 14 prp; 0-2 aty)
% Number of functors : 30 ( 30 usr; 25 con; 0-2 aty)
% Number of variables : 147 ( 4 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(hilbert_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_implies_and) ).
fof(modus_ponens,axiom,
( modus_ponens
<=> ! [X1,X2] :
( ( is_a_theorem(X1)
& is_a_theorem(implies(X1,X2)) )
=> is_a_theorem(X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_ponens) ).
fof(or_3,axiom,
( or_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X3),implies(implies(X2,X3),implies(or(X1,X2),X3)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_3) ).
fof(hilbert_op_or,axiom,
op_or,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_op_or) ).
fof(hilbert_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_ponens) ).
fof(hilbert_or_3,axiom,
or_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_3) ).
fof(r3,axiom,
( r3
<=> ! [X4,X5] : is_a_theorem(implies(or(X4,X5),or(X5,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',r3) ).
fof(or_1,axiom,
( or_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,or(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',or_1) ).
fof(implies_1,axiom,
( implies_1
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_1) ).
fof(implies_2,axiom,
( implies_2
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_2) ).
fof(equivalence_3,axiom,
( equivalence_3
<=> ! [X1,X2] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',equivalence_3) ).
fof(hilbert_or_1,axiom,
or_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_or_1) ).
fof(hilbert_implies_1,axiom,
implies_1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_1) ).
fof(hilbert_implies_2,axiom,
implies_2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_2) ).
fof(hilbert_equivalence_3,axiom,
equivalence_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_equivalence_3) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',modus_tollens) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(hilbert_modus_tollens,axiom,
modus_tollens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_modus_tollens) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',substitution_of_equivalents) ).
fof(rosser_kn3,conjecture,
kn3,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rosser_kn3) ).
fof(kn3,axiom,
( kn3
<=> ! [X4,X5,X6] : is_a_theorem(implies(implies(X4,X5),implies(not(and(X5,X6)),not(and(X6,X4))))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(implies_3,axiom,
( implies_3
<=> ! [X1,X2,X3] : is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',implies_3) ).
fof(hilbert_implies_3,axiom,
implies_3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_implies_3) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ op_implies_and
| implies(X3,X4) = not(and(X3,not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])])])]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ op_or
| or(X3,X4) = not(and(not(X3),not(X4))) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])])])]) ).
cnf(c_0_27,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[hilbert_op_implies_and]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ( ~ modus_ponens
| ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X4))
| is_a_theorem(X4) )
& ( is_a_theorem(esk1_0)
| modus_ponens )
& ( is_a_theorem(implies(esk1_0,esk2_0))
| modus_ponens )
& ( ~ is_a_theorem(esk2_0)
| modus_ponens ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])])]) ).
fof(c_0_30,plain,
! [X4,X5,X6] :
( ( ~ or_3
| is_a_theorem(implies(implies(X4,X6),implies(implies(X5,X6),implies(or(X4,X5),X6)))) )
& ( ~ is_a_theorem(implies(implies(esk24_0,esk26_0),implies(implies(esk25_0,esk26_0),implies(or(esk24_0,esk25_0),esk26_0))))
| or_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_3])])])])])]) ).
cnf(c_0_31,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_33,plain,
op_or,
inference(split_conjunct,[status(thm)],[hilbert_op_or]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[hilbert_modus_ponens]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(or(X1,X3),X2))))
| ~ or_3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
or(X1,X2) = implies(not(X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_38,plain,
or_3,
inference(split_conjunct,[status(thm)],[hilbert_or_3]) ).
fof(c_0_39,plain,
! [X6,X7] :
( ( ~ r3
| is_a_theorem(implies(or(X6,X7),or(X7,X6))) )
& ( ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0)))
| r3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])])]) ).
cnf(c_0_40,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X2),implies(implies(not(X1),X3),X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
fof(c_0_42,plain,
! [X3,X4] :
( ( ~ or_1
| is_a_theorem(implies(X3,or(X3,X4))) )
& ( ~ is_a_theorem(implies(esk20_0,or(esk20_0,esk21_0)))
| or_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[or_1])])])])])]) ).
fof(c_0_43,plain,
! [X3,X4] :
( ( ~ implies_1
| is_a_theorem(implies(X3,implies(X4,X3))) )
& ( ~ is_a_theorem(implies(esk7_0,implies(esk8_0,esk7_0)))
| implies_1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_1])])])])])]) ).
fof(c_0_44,plain,
! [X3,X4] :
( ( ~ implies_2
| is_a_theorem(implies(implies(X3,implies(X3,X4)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(esk9_0,implies(esk9_0,esk10_0)),implies(esk9_0,esk10_0)))
| implies_2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_2])])])])])]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ( ~ equivalence_3
| is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X3),equiv(X3,X4)))) )
& ( ~ is_a_theorem(implies(implies(esk31_0,esk32_0),implies(implies(esk32_0,esk31_0),equiv(esk31_0,esk32_0))))
| equivalence_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equivalence_3])])])])])]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(or(X1,X2),or(X2,X1)))
| ~ r3 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( r3
| ~ is_a_theorem(implies(or(esk48_0,esk49_0),or(esk49_0,esk48_0))) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(not(X3),X1),X2)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(pm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(X1,or(X1,X2)))
| ~ or_1 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
or_1,
inference(split_conjunct,[status(thm)],[hilbert_or_1]) ).
cnf(c_0_51,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ implies_1 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_52,plain,
implies_1,
inference(split_conjunct,[status(thm)],[hilbert_implies_1]) ).
cnf(c_0_53,plain,
( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
| ~ implies_2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,plain,
implies_2,
inference(split_conjunct,[status(thm)],[hilbert_implies_2]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2))))
| ~ equivalence_3 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,plain,
equivalence_3,
inference(split_conjunct,[status(thm)],[hilbert_equivalence_3]) ).
fof(c_0_57,plain,
! [X3,X4] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X4),not(X3)),implies(X3,X4))) )
& ( ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0)))
| modus_tollens ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])])])]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1)))
| ~ r3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_37]),c_0_37]) ).
cnf(c_0_59,plain,
( r3
| ~ is_a_theorem(implies(implies(not(esk48_0),esk49_0),implies(not(esk49_0),esk48_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_37]),c_0_37]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(pm,[status(thm)],[c_0_40,c_0_48]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_37]),c_0_50])]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
fof(c_0_64,plain,
! [X3,X4] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X3,X4))
| X3 = X4 )
& ( is_a_theorem(equiv(esk3_0,esk4_0))
| substitution_of_equivalents )
& ( esk3_0 != esk4_0
| substitution_of_equivalents ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])])])]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X1),equiv(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))
| ~ modus_tollens ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_67,plain,
modus_tollens,
inference(split_conjunct,[status(thm)],[hilbert_modus_tollens]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ r3
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(pm,[status(thm)],[c_0_40,c_0_58]) ).
cnf(c_0_69,plain,
r3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_62])]) ).
cnf(c_0_70,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(pm,[status(thm)],[c_0_40,c_0_63]) ).
cnf(c_0_71,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_72,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_73,plain,
( is_a_theorem(implies(implies(X1,X2),equiv(X2,X1)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(pm,[status(thm)],[c_0_40,c_0_65]) ).
cnf(c_0_74,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_75,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_76,plain,
is_a_theorem(implies(X1,X1)),
inference(pm,[status(thm)],[c_0_70,c_0_62]) ).
fof(c_0_77,negated_conjecture,
~ kn3,
inference(assume_negation,[status(cth)],[rosser_kn3]) ).
cnf(c_0_78,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72])]) ).
cnf(c_0_79,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_40,c_0_73]) ).
cnf(c_0_80,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(pm,[status(thm)],[c_0_40,c_0_74]) ).
cnf(c_0_81,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(pm,[status(thm)],[c_0_75,c_0_76]) ).
fof(c_0_82,plain,
! [X7,X8,X9] :
( ( ~ kn3
| is_a_theorem(implies(implies(X7,X8),implies(not(and(X8,X9)),not(and(X9,X7))))) )
& ( ~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0)))))
| kn3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])])])]) ).
fof(c_0_83,negated_conjecture,
~ kn3,
inference(fof_simplification,[status(thm)],[c_0_77]) ).
cnf(c_0_84,plain,
( X1 = X2
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(pm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_85,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(pm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(X2),X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_69])]) ).
cnf(c_0_87,plain,
( kn3
| ~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0))))) ),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_88,negated_conjecture,
~ kn3,
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_89,plain,
not(not(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_84,c_0_81]),c_0_85])]) ).
cnf(c_0_90,plain,
implies(not(X1),X2) = implies(not(X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_84,c_0_86]),c_0_86])]) ).
fof(c_0_91,plain,
! [X4,X5,X6] :
( ( ~ implies_3
| is_a_theorem(implies(implies(X4,X5),implies(implies(X5,X6),implies(X4,X6)))) )
& ( ~ is_a_theorem(implies(implies(esk11_0,esk12_0),implies(implies(esk12_0,esk13_0),implies(esk11_0,esk13_0))))
| implies_3 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[implies_3])])])])])]) ).
cnf(c_0_92,plain,
~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(and(esk37_0,esk38_0)),not(and(esk38_0,esk36_0))))),
inference(sr,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_93,plain,
not(and(X1,X2)) = implies(X1,not(X2)),
inference(pm,[status(thm)],[c_0_32,c_0_89]) ).
cnf(c_0_94,plain,
implies(X1,X2) = implies(not(X2),not(X1)),
inference(pm,[status(thm)],[c_0_90,c_0_89]) ).
cnf(c_0_95,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3))))
| ~ implies_3 ),
inference(split_conjunct,[status(thm)],[c_0_91]) ).
cnf(c_0_96,plain,
implies_3,
inference(split_conjunct,[status(thm)],[hilbert_implies_3]) ).
cnf(c_0_97,plain,
~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(implies(esk37_0,not(esk38_0)),implies(esk38_0,not(esk36_0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_92,c_0_93]),c_0_93]) ).
cnf(c_0_98,plain,
implies(X1,not(X2)) = implies(X2,not(X1)),
inference(pm,[status(thm)],[c_0_94,c_0_89]) ).
cnf(c_0_99,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_100,plain,
~ is_a_theorem(implies(implies(esk36_0,esk37_0),implies(not(implies(esk36_0,not(esk38_0))),not(implies(esk37_0,not(esk38_0)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_97,c_0_98]),c_0_94]) ).
cnf(c_0_101,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(implies(X1,X3)),not(implies(X2,X3))))),
inference(pm,[status(thm)],[c_0_99,c_0_94]) ).
cnf(c_0_102,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL461+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 4 01:25:08 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.40/23.44 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.40/23.44
% 0.40/23.46 eprover: CPU time limit exceeded, terminating
% 0.40/23.50 eprover: CPU time limit exceeded, terminating
% 0.57/46.47 eprover: CPU time limit exceeded, terminating
% 0.57/46.48 eprover: CPU time limit exceeded, terminating
% 0.57/46.48 eprover: CPU time limit exceeded, terminating
% 0.57/46.53 eprover: CPU time limit exceeded, terminating
% 0.66/60.85 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.66/60.85
% 0.66/60.85 # Failure: Resource limit exceeded (time)
% 0.66/60.85 # OLD status Res
% 0.66/60.85 # Preprocessing time : 0.019 s
% 0.66/60.85 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.66/60.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.66/60.85 # Preprocessing time : 0.015 s
% 0.66/60.85
% 0.66/60.85 # Failure: Out of unprocessed clauses!
% 0.66/60.85 # OLD status GaveUp
% 0.66/60.85 # Parsed axioms : 53
% 0.66/60.85 # Removed by relevancy pruning/SinE : 51
% 0.66/60.85 # Initial clauses : 3
% 0.66/60.85 # Removed in clause preprocessing : 0
% 0.66/60.85 # Initial clauses in saturation : 3
% 0.66/60.85 # Processed clauses : 3
% 0.66/60.85 # ...of these trivial : 0
% 0.66/60.85 # ...subsumed : 1
% 0.66/60.85 # ...remaining for further processing : 2
% 0.66/60.85 # Other redundant clauses eliminated : 0
% 0.66/60.85 # Clauses deleted for lack of memory : 0
% 0.66/60.85 # Backward-subsumed : 0
% 0.66/60.85 # Backward-rewritten : 0
% 0.66/60.85 # Generated clauses : 0
% 0.66/60.85 # ...of the previous two non-trivial : 0
% 0.66/60.85 # Contextual simplify-reflections : 0
% 0.66/60.85 # Paramodulations : 0
% 0.66/60.85 # Factorizations : 0
% 0.66/60.85 # Equation resolutions : 0
% 0.66/60.85 # Current number of processed clauses : 2
% 0.66/60.85 # Positive orientable unit clauses : 0
% 0.66/60.85 # Positive unorientable unit clauses: 0
% 0.66/60.85 # Negative unit clauses : 2
% 0.66/60.85 # Non-unit-clauses : 0
% 0.66/60.85 # Current number of unprocessed clauses: 0
% 0.66/60.85 # ...number of literals in the above : 0
% 0.66/60.85 # Current number of archived formulas : 0
% 0.66/60.85 # Current number of archived clauses : 0
% 0.66/60.85 # Clause-clause subsumption calls (NU) : 0
% 0.66/60.85 # Rec. Clause-clause subsumption calls : 0
% 0.66/60.85 # Non-unit clause-clause subsumptions : 0
% 0.66/60.85 # Unit Clause-clause subsumption calls : 0
% 0.66/60.85 # Rewrite failures with RHS unbound : 0
% 0.66/60.85 # BW rewrite match attempts : 0
% 0.66/60.85 # BW rewrite match successes : 0
% 0.66/60.85 # Condensation attempts : 0
% 0.66/60.85 # Condensation successes : 0
% 0.66/60.85 # Termbank termtop insertions : 567
% 0.66/60.85
% 0.66/60.85 # -------------------------------------------------
% 0.66/60.85 # User time : 0.011 s
% 0.66/60.85 # System time : 0.005 s
% 0.66/60.85 # Total time : 0.016 s
% 0.66/60.85 # Maximum resident set size: 2736 pages
% 0.66/60.85 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.66/60.85
% 0.66/60.85 # Failure: Resource limit exceeded (time)
% 0.66/60.85 # OLD status Res
% 0.66/60.85 # Preprocessing time : 0.010 s
% 0.66/60.85 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.66/60.85 # Preprocessing time : 0.011 s
% 0.66/60.85
% 0.66/60.85 # Proof found!
% 0.66/60.85 # SZS status Theorem
% 0.66/60.85 # SZS output start CNFRefutation
% See solution above
% 0.66/60.85 # Proof object total steps : 103
% 0.66/60.85 # Proof object clause steps : 63
% 0.66/60.85 # Proof object formula steps : 40
% 0.66/60.85 # Proof object conjectures : 4
% 0.66/60.85 # Proof object clause conjectures : 1
% 0.66/60.85 # Proof object formula conjectures : 3
% 0.66/60.85 # Proof object initial clauses used : 26
% 0.66/60.85 # Proof object initial formulas used : 25
% 0.66/60.85 # Proof object generating inferences : 18
% 0.66/60.85 # Proof object simplifying inferences : 47
% 0.66/60.85 # Training examples: 0 positive, 0 negative
% 0.66/60.85 # Parsed axioms : 53
% 0.66/60.85 # Removed by relevancy pruning/SinE : 0
% 0.66/60.85 # Initial clauses : 82
% 0.66/60.85 # Removed in clause preprocessing : 0
% 0.66/60.85 # Initial clauses in saturation : 82
% 0.66/60.85 # Processed clauses : 6465
% 0.66/60.85 # ...of these trivial : 688
% 0.66/60.85 # ...subsumed : 2939
% 0.66/60.85 # ...remaining for further processing : 2838
% 0.66/60.85 # Other redundant clauses eliminated : 0
% 0.66/60.85 # Clauses deleted for lack of memory : 498549
% 0.66/60.85 # Backward-subsumed : 163
% 0.66/60.85 # Backward-rewritten : 2282
% 0.66/60.85 # Generated clauses : 785031
% 0.66/60.85 # ...of the previous two non-trivial : 761505
% 0.66/60.85 # Contextual simplify-reflections : 1272
% 0.66/60.85 # Paramodulations : 785028
% 0.66/60.85 # Factorizations : 0
% 0.66/60.85 # Equation resolutions : 0
% 0.66/60.85 # Current number of processed clauses : 392
% 0.66/60.85 # Positive orientable unit clauses : 131
% 0.66/60.85 # Positive unorientable unit clauses: 5
% 0.66/60.85 # Negative unit clauses : 20
% 0.66/60.85 # Non-unit-clauses : 236
% 0.66/60.85 # Current number of unprocessed clauses: 27947
% 0.66/60.85 # ...number of literals in the above : 67109
% 0.66/60.85 # Current number of archived formulas : 0
% 0.66/60.85 # Current number of archived clauses : 2445
% 0.66/60.85 # Clause-clause subsumption calls (NU) : 322978
% 0.66/60.85 # Rec. Clause-clause subsumption calls : 244180
% 0.66/60.85 # Non-unit clause-clause subsumptions : 3732
% 0.66/60.85 # Unit Clause-clause subsumption calls : 35906
% 0.66/60.85 # Rewrite failures with RHS unbound : 28
% 0.66/60.85 # BW rewrite match attempts : 115085
% 0.66/60.85 # BW rewrite match successes : 3448
% 0.66/60.85 # Condensation attempts : 0
% 0.66/60.85 # Condensation successes : 0
% 0.66/60.85 # Termbank termtop insertions : 20913532
% 0.66/60.85
% 0.66/60.85 # -------------------------------------------------
% 0.66/60.85 # User time : 14.085 s
% 0.66/60.85 # System time : 0.160 s
% 0.66/60.85 # Total time : 14.245 s
% 0.66/60.85 # Maximum resident set size: 161208 pages
% 0.73/69.49 eprover: CPU time limit exceeded, terminating
% 0.73/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.51 eprover: No such file or directory
% 0.73/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.51 eprover: No such file or directory
% 0.73/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.52 eprover: No such file or directory
% 0.73/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.52 eprover: No such file or directory
% 0.73/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.52 eprover: No such file or directory
% 0.73/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.53 eprover: No such file or directory
% 0.73/69.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.53 eprover: No such file or directory
% 0.73/69.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.54 eprover: No such file or directory
% 0.73/69.59 eprover: CPU time limit exceeded, terminating
% 0.73/69.60 eprover: CPU time limit exceeded, terminating
% 0.73/69.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.60 eprover: No such file or directory
% 0.73/69.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.61 eprover: No such file or directory
% 0.73/69.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.73/69.62 eprover: No such file or directory
% 0.73/69.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.73/69.62 eprover: No such file or directory
% 0.73/69.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.73/69.62 eprover: No such file or directory
% 0.73/69.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.73/69.62 eprover: No such file or directory
% 0.73/69.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.73/69.63 eprover: No such file or directory
%------------------------------------------------------------------------------