TSTP Solution File: LCL502+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL502+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:34 EDT 2022
% Result : Theorem 0.41s 29.59s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 16
% Syntax : Number of formulae : 106 ( 49 unt; 0 def)
% Number of atoms : 194 ( 15 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 157 ( 69 ~; 68 |; 10 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 11 ( 9 usr; 9 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 176 ( 27 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
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(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
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(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/benchmark/Axioms/LCL006+5.ax',substitution_of_equivalents) ).
fof(hilbert_modus_tollens,conjecture,
modus_tollens,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',hilbert_modus_tollens) ).
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(c_0_16,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_17,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])])])])])]) ).
cnf(c_0_18,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1)))))
| ~ kn3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
fof(c_0_22,plain,
! [X5] :
( ( ~ kn1
| is_a_theorem(implies(X5,and(X5,X5))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
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)],[kn1])])])])])]) ).
cnf(c_0_23,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_18,c_0_19])]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,X2),implies(not(and(X2,X3)),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(not(and(X1,X2)),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
fof(c_0_29,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])])])])]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(not(and(and(X1,X1),X2)),not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
fof(c_0_33,plain,
! [X6,X7] :
( ( ~ kn2
| is_a_theorem(implies(and(X6,X7),X6)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
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)],[kn2])])])])])]) ).
cnf(c_0_34,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(and(X2,X2),X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_35,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_38,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(and(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(not(and(X1,X2)),not(and(X2,and(X1,X3))))),
inference(spm,[status(thm)],[c_0_27,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(not(and(X1,X2)),implies(X2,not(X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_41]),c_0_35]) ).
cnf(c_0_44,plain,
( is_a_theorem(not(and(X1,and(X2,X3))))
| ~ is_a_theorem(not(and(X2,X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(not(and(X2,X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_43]) ).
cnf(c_0_46,plain,
( is_a_theorem(not(and(not(X1),and(X2,X3))))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_47,plain,
( is_a_theorem(implies(not(X1),not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_48,plain,
is_a_theorem(not(and(not(and(X1,X1)),and(X1,X2)))),
inference(spm,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(not(X1),not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_47,c_0_39]) ).
cnf(c_0_50,plain,
is_a_theorem(not(and(implies(not(X1),X1),and(not(X1),X2)))),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_49,c_0_35]) ).
cnf(c_0_52,plain,
is_a_theorem(not(and(and(not(X1),X2),and(implies(not(X1),X1),X3)))),
inference(spm,[status(thm)],[c_0_44,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(not(and(implies(X1,X2),X3)),implies(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_51]),c_0_35]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),not(and(not(X3),X1))))),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(and(implies(not(X1),X1),X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_52]),c_0_35]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(and(implies(X2,X3),X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_53]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_54]) ).
cnf(c_0_58,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(and(implies(not(X1),X1),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_55]) ).
cnf(c_0_59,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_56,c_0_35]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X3),X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_51]),c_0_35]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_63,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(not(implies(not(X1),X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_66,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_62]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(not(X1),not(X1))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(not(and(not(X1),X2)),implies(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_67]),c_0_35]) ).
cnf(c_0_70,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(and(X2,X3)),implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_71,plain,
( is_a_theorem(not(and(and(not(X1),X2),X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_68]) ).
cnf(c_0_72,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(and(not(X2),X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_69]) ).
cnf(c_0_73,plain,
( is_a_theorem(implies(not(and(X1,X2)),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_70]) ).
cnf(c_0_74,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_71]),c_0_35]) ).
cnf(c_0_75,plain,
( is_a_theorem(not(implies(X1,X2)))
| ~ is_a_theorem(and(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_66,c_0_35]) ).
cnf(c_0_76,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_72,c_0_35]) ).
cnf(c_0_77,plain,
( is_a_theorem(implies(not(and(X1,X2)),implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(not(implies(X1,not(X2))),not(not(and(X2,X1))))),
inference(spm,[status(thm)],[c_0_47,c_0_43]) ).
cnf(c_0_79,plain,
( is_a_theorem(not(implies(not(X1),X1)))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_75,c_0_59]) ).
cnf(c_0_80,plain,
( is_a_theorem(implies(not(implies(X1,X2)),and(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( is_a_theorem(not(not(and(X1,X2))))
| ~ is_a_theorem(not(implies(X2,not(X1)))) ),
inference(spm,[status(thm)],[c_0_23,c_0_78]) ).
cnf(c_0_82,plain,
( is_a_theorem(not(implies(not(not(X1)),not(X1))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_66]) ).
fof(c_0_83,plain,
! [X3,X4] :
( ~ op_equiv
| equiv(X3,X4) = and(implies(X3,X4),implies(X4,X3)) ),
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_equiv])])])])]) ).
cnf(c_0_84,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(not(implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_80]) ).
cnf(c_0_85,plain,
( is_a_theorem(not(implies(X1,not(X1))))
| ~ is_a_theorem(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_35]) ).
cnf(c_0_86,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_87,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
fof(c_0_88,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_89,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_90,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).
cnf(c_0_91,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_92,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_93,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
fof(c_0_94,negated_conjecture,
~ modus_tollens,
inference(assume_negation,[status(cth)],[hilbert_modus_tollens]) ).
cnf(c_0_95,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_91,c_0_92])]) ).
cnf(c_0_96,plain,
is_a_theorem(equiv(not(not(X1)),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_41]),c_0_62])]) ).
fof(c_0_97,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])])])])])]) ).
fof(c_0_98,negated_conjecture,
~ modus_tollens,
inference(fof_simplification,[status(thm)],[c_0_94]) ).
cnf(c_0_99,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_100,plain,
( modus_tollens
| ~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_101,negated_conjecture,
~ modus_tollens,
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_102,plain,
not(and(X1,X2)) = implies(X1,not(X2)),
inference(spm,[status(thm)],[c_0_35,c_0_99]) ).
cnf(c_0_103,plain,
~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))),
inference(sr,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_104,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(rw,[status(thm)],[c_0_69,c_0_102]) ).
cnf(c_0_105,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL502+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 17:11:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.38/23.41 eprover: CPU time limit exceeded, terminating
% 0.38/23.42 eprover: CPU time limit exceeded, terminating
% 0.38/23.44 eprover: CPU time limit exceeded, terminating
% 0.38/23.47 eprover: CPU time limit exceeded, terminating
% 0.41/29.59 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.41/29.59 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.41/29.59 # Preprocessing time : 0.015 s
% 0.41/29.59
% 0.41/29.59 # Failure: Out of unprocessed clauses!
% 0.41/29.59 # OLD status GaveUp
% 0.41/29.59 # Parsed axioms : 43
% 0.41/29.59 # Removed by relevancy pruning/SinE : 41
% 0.41/29.59 # Initial clauses : 3
% 0.41/29.59 # Removed in clause preprocessing : 0
% 0.41/29.59 # Initial clauses in saturation : 3
% 0.41/29.59 # Processed clauses : 3
% 0.41/29.59 # ...of these trivial : 0
% 0.41/29.59 # ...subsumed : 1
% 0.41/29.59 # ...remaining for further processing : 2
% 0.41/29.59 # Other redundant clauses eliminated : 0
% 0.41/29.59 # Clauses deleted for lack of memory : 0
% 0.41/29.59 # Backward-subsumed : 0
% 0.41/29.59 # Backward-rewritten : 0
% 0.41/29.59 # Generated clauses : 0
% 0.41/29.59 # ...of the previous two non-trivial : 0
% 0.41/29.59 # Contextual simplify-reflections : 0
% 0.41/29.59 # Paramodulations : 0
% 0.41/29.59 # Factorizations : 0
% 0.41/29.59 # Equation resolutions : 0
% 0.41/29.59 # Current number of processed clauses : 2
% 0.41/29.59 # Positive orientable unit clauses : 0
% 0.41/29.59 # Positive unorientable unit clauses: 0
% 0.41/29.59 # Negative unit clauses : 2
% 0.41/29.59 # Non-unit-clauses : 0
% 0.41/29.59 # Current number of unprocessed clauses: 0
% 0.41/29.59 # ...number of literals in the above : 0
% 0.41/29.59 # Current number of archived formulas : 0
% 0.41/29.59 # Current number of archived clauses : 0
% 0.41/29.59 # Clause-clause subsumption calls (NU) : 0
% 0.41/29.59 # Rec. Clause-clause subsumption calls : 0
% 0.41/29.59 # Non-unit clause-clause subsumptions : 0
% 0.41/29.59 # Unit Clause-clause subsumption calls : 0
% 0.41/29.59 # Rewrite failures with RHS unbound : 0
% 0.41/29.59 # BW rewrite match attempts : 0
% 0.41/29.59 # BW rewrite match successes : 0
% 0.41/29.59 # Condensation attempts : 0
% 0.41/29.59 # Condensation successes : 0
% 0.41/29.59 # Termbank termtop insertions : 508
% 0.41/29.59
% 0.41/29.59 # -------------------------------------------------
% 0.41/29.59 # User time : 0.013 s
% 0.41/29.59 # System time : 0.002 s
% 0.41/29.59 # Total time : 0.015 s
% 0.41/29.59 # Maximum resident set size: 2736 pages
% 0.41/29.59 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.41/29.59 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.41/29.59 # Preprocessing time : 0.014 s
% 0.41/29.59
% 0.41/29.59 # Failure: Out of unprocessed clauses!
% 0.41/29.59 # OLD status GaveUp
% 0.41/29.59 # Parsed axioms : 43
% 0.41/29.59 # Removed by relevancy pruning/SinE : 41
% 0.41/29.59 # Initial clauses : 3
% 0.41/29.59 # Removed in clause preprocessing : 0
% 0.41/29.59 # Initial clauses in saturation : 3
% 0.41/29.59 # Processed clauses : 3
% 0.41/29.59 # ...of these trivial : 0
% 0.41/29.59 # ...subsumed : 1
% 0.41/29.59 # ...remaining for further processing : 2
% 0.41/29.59 # Other redundant clauses eliminated : 0
% 0.41/29.59 # Clauses deleted for lack of memory : 0
% 0.41/29.59 # Backward-subsumed : 0
% 0.41/29.59 # Backward-rewritten : 0
% 0.41/29.59 # Generated clauses : 0
% 0.41/29.59 # ...of the previous two non-trivial : 0
% 0.41/29.59 # Contextual simplify-reflections : 0
% 0.41/29.59 # Paramodulations : 0
% 0.41/29.59 # Factorizations : 0
% 0.41/29.59 # Equation resolutions : 0
% 0.41/29.59 # Current number of processed clauses : 2
% 0.41/29.59 # Positive orientable unit clauses : 0
% 0.41/29.59 # Positive unorientable unit clauses: 0
% 0.41/29.59 # Negative unit clauses : 1
% 0.41/29.59 # Non-unit-clauses : 1
% 0.41/29.59 # Current number of unprocessed clauses: 0
% 0.41/29.59 # ...number of literals in the above : 0
% 0.41/29.59 # Current number of archived formulas : 0
% 0.41/29.59 # Current number of archived clauses : 0
% 0.41/29.59 # Clause-clause subsumption calls (NU) : 0
% 0.41/29.59 # Rec. Clause-clause subsumption calls : 0
% 0.41/29.59 # Non-unit clause-clause subsumptions : 0
% 0.41/29.59 # Unit Clause-clause subsumption calls : 0
% 0.41/29.59 # Rewrite failures with RHS unbound : 0
% 0.41/29.59 # BW rewrite match attempts : 0
% 0.41/29.59 # BW rewrite match successes : 0
% 0.41/29.59 # Condensation attempts : 0
% 0.41/29.59 # Condensation successes : 0
% 0.41/29.59 # Termbank termtop insertions : 508
% 0.41/29.59
% 0.41/29.59 # -------------------------------------------------
% 0.41/29.59 # User time : 0.011 s
% 0.41/29.59 # System time : 0.003 s
% 0.41/29.59 # Total time : 0.014 s
% 0.41/29.59 # Maximum resident set size: 2740 pages
% 0.41/29.59 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.41/29.59 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.41/29.59 # Preprocessing time : 0.015 s
% 0.41/29.59
% 0.41/29.59 # Failure: Out of unprocessed clauses!
% 0.41/29.59 # OLD status GaveUp
% 0.41/29.59 # Parsed axioms : 43
% 0.41/29.59 # Removed by relevancy pruning/SinE : 41
% 0.41/29.59 # Initial clauses : 3
% 0.41/29.59 # Removed in clause preprocessing : 0
% 0.41/29.59 # Initial clauses in saturation : 3
% 0.41/29.59 # Processed clauses : 3
% 0.41/29.59 # ...of these trivial : 0
% 0.41/29.59 # ...subsumed : 1
% 0.41/29.59 # ...remaining for further processing : 2
% 0.41/29.59 # Other redundant clauses eliminated : 0
% 0.41/29.59 # Clauses deleted for lack of memory : 0
% 0.41/29.59 # Backward-subsumed : 0
% 0.41/29.59 # Backward-rewritten : 0
% 0.41/29.59 # Generated clauses : 0
% 0.41/29.59 # ...of the previous two non-trivial : 0
% 0.41/29.59 # Contextual simplify-reflections : 0
% 0.41/29.59 # Paramodulations : 0
% 0.41/29.59 # Factorizations : 0
% 0.41/29.59 # Equation resolutions : 0
% 0.41/29.59 # Current number of processed clauses : 2
% 0.41/29.59 # Positive orientable unit clauses : 0
% 0.41/29.59 # Positive unorientable unit clauses: 0
% 0.41/29.59 # Negative unit clauses : 2
% 0.41/29.59 # Non-unit-clauses : 0
% 0.41/29.59 # Current number of unprocessed clauses: 0
% 0.41/29.59 # ...number of literals in the above : 0
% 0.41/29.59 # Current number of archived formulas : 0
% 0.41/29.59 # Current number of archived clauses : 0
% 0.41/29.59 # Clause-clause subsumption calls (NU) : 0
% 0.41/29.59 # Rec. Clause-clause subsumption calls : 0
% 0.41/29.59 # Non-unit clause-clause subsumptions : 0
% 0.41/29.59 # Unit Clause-clause subsumption calls : 0
% 0.41/29.59 # Rewrite failures with RHS unbound : 0
% 0.41/29.59 # BW rewrite match attempts : 0
% 0.41/29.59 # BW rewrite match successes : 0
% 0.41/29.59 # Condensation attempts : 0
% 0.41/29.59 # Condensation successes : 0
% 0.41/29.59 # Termbank termtop insertions : 508
% 0.41/29.59
% 0.41/29.59 # -------------------------------------------------
% 0.41/29.59 # User time : 0.010 s
% 0.41/29.59 # System time : 0.005 s
% 0.41/29.59 # Total time : 0.015 s
% 0.41/29.59 # Maximum resident set size: 2788 pages
% 0.41/29.59 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.41/29.59
% 0.41/29.59 # Failure: Resource limit exceeded (time)
% 0.41/29.59 # OLD status Res
% 0.41/29.59 # Preprocessing time : 0.019 s
% 0.41/29.59 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.41/29.59 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.41/29.59 # Preprocessing time : 0.008 s
% 0.41/29.59
% 0.41/29.59 # Failure: Out of unprocessed clauses!
% 0.41/29.59 # OLD status GaveUp
% 0.41/29.59 # Parsed axioms : 43
% 0.41/29.59 # Removed by relevancy pruning/SinE : 41
% 0.41/29.59 # Initial clauses : 3
% 0.41/29.59 # Removed in clause preprocessing : 0
% 0.41/29.59 # Initial clauses in saturation : 3
% 0.41/29.59 # Processed clauses : 3
% 0.41/29.59 # ...of these trivial : 0
% 0.41/29.59 # ...subsumed : 1
% 0.41/29.59 # ...remaining for further processing : 2
% 0.41/29.59 # Other redundant clauses eliminated : 0
% 0.41/29.59 # Clauses deleted for lack of memory : 0
% 0.41/29.59 # Backward-subsumed : 0
% 0.41/29.59 # Backward-rewritten : 0
% 0.41/29.59 # Generated clauses : 0
% 0.41/29.59 # ...of the previous two non-trivial : 0
% 0.41/29.59 # Contextual simplify-reflections : 0
% 0.41/29.59 # Paramodulations : 0
% 0.41/29.59 # Factorizations : 0
% 0.41/29.59 # Equation resolutions : 0
% 0.41/29.59 # Current number of processed clauses : 2
% 0.41/29.59 # Positive orientable unit clauses : 0
% 0.41/29.59 # Positive unorientable unit clauses: 0
% 0.41/29.59 # Negative unit clauses : 2
% 0.41/29.59 # Non-unit-clauses : 0
% 0.41/29.59 # Current number of unprocessed clauses: 0
% 0.41/29.59 # ...number of literals in the above : 0
% 0.41/29.59 # Current number of archived formulas : 0
% 0.41/29.59 # Current number of archived clauses : 0
% 0.41/29.59 # Clause-clause subsumption calls (NU) : 0
% 0.41/29.59 # Rec. Clause-clause subsumption calls : 0
% 0.41/29.59 # Non-unit clause-clause subsumptions : 0
% 0.41/29.59 # Unit Clause-clause subsumption calls : 0
% 0.41/29.59 # Rewrite failures with RHS unbound : 0
% 0.41/29.59 # BW rewrite match attempts : 0
% 0.41/29.59 # BW rewrite match successes : 0
% 0.41/29.59 # Condensation attempts : 0
% 0.41/29.59 # Condensation successes : 0
% 0.41/29.59 # Termbank termtop insertions : 508
% 0.41/29.59
% 0.41/29.59 # -------------------------------------------------
% 0.41/29.59 # User time : 0.008 s
% 0.41/29.59 # System time : 0.000 s
% 0.41/29.59 # Total time : 0.008 s
% 0.41/29.59 # Maximum resident set size: 2736 pages
% 0.41/29.59 # Running protocol protocol_eprover_9a428cb4e1feff5dec19b8494e78e7f0e8ede446 for 23 seconds:
% 0.41/29.59 # Preprocessing time : 0.011 s
% 0.41/29.59
% 0.41/29.59 # Proof found!
% 0.41/29.59 # SZS status Theorem
% 0.41/29.59 # SZS output start CNFRefutation
% See solution above
% 0.41/29.59 # Proof object total steps : 106
% 0.41/29.59 # Proof object clause steps : 80
% 0.41/29.59 # Proof object formula steps : 26
% 0.41/29.59 # Proof object conjectures : 4
% 0.41/29.59 # Proof object clause conjectures : 1
% 0.41/29.59 # Proof object formula conjectures : 3
% 0.41/29.59 # Proof object initial clauses used : 16
% 0.41/29.59 # Proof object initial formulas used : 16
% 0.41/29.59 # Proof object generating inferences : 54
% 0.41/29.59 # Proof object simplifying inferences : 27
% 0.41/29.59 # Training examples: 0 positive, 0 negative
% 0.41/29.59 # Parsed axioms : 43
% 0.41/29.59 # Removed by relevancy pruning/SinE : 0
% 0.41/29.59 # Initial clauses : 72
% 0.41/29.59 # Removed in clause preprocessing : 0
% 0.41/29.59 # Initial clauses in saturation : 72
% 0.41/29.59 # Processed clauses : 5725
% 0.41/29.59 # ...of these trivial : 471
% 0.41/29.59 # ...subsumed : 2933
% 0.41/29.59 # ...remaining for further processing : 2321
% 0.41/29.59 # Other redundant clauses eliminated : 0
% 0.41/29.59 # Clauses deleted for lack of memory : 184657
% 0.41/29.59 # Backward-subsumed : 175
% 0.41/29.59 # Backward-rewritten : 1843
% 0.41/29.59 # Generated clauses : 341388
% 0.41/29.59 # ...of the previous two non-trivial : 310875
% 0.41/29.59 # Contextual simplify-reflections : 0
% 0.41/29.59 # Paramodulations : 341388
% 0.41/29.59 # Factorizations : 0
% 0.41/29.59 # Equation resolutions : 0
% 0.41/29.59 # Current number of processed clauses : 303
% 0.41/29.59 # Positive orientable unit clauses : 103
% 0.41/29.59 # Positive unorientable unit clauses: 0
% 0.41/29.59 # Negative unit clauses : 5
% 0.41/29.59 # Non-unit-clauses : 195
% 0.41/29.59 # Current number of unprocessed clauses: 4913
% 0.41/29.59 # ...number of literals in the above : 9483
% 0.41/29.59 # Current number of archived formulas : 0
% 0.41/29.59 # Current number of archived clauses : 2018
% 0.41/29.59 # Clause-clause subsumption calls (NU) : 181702
% 0.41/29.59 # Rec. Clause-clause subsumption calls : 181226
% 0.41/29.59 # Non-unit clause-clause subsumptions : 3023
% 0.41/29.59 # Unit Clause-clause subsumption calls : 32090
% 0.41/29.59 # Rewrite failures with RHS unbound : 0
% 0.41/29.59 # BW rewrite match attempts : 57234
% 0.41/29.59 # BW rewrite match successes : 1022
% 0.41/29.59 # Condensation attempts : 0
% 0.41/29.59 # Condensation successes : 0
% 0.41/29.59 # Termbank termtop insertions : 10843697
% 0.41/29.59
% 0.41/29.59 # -------------------------------------------------
% 0.41/29.59 # User time : 5.580 s
% 0.41/29.59 # System time : 0.113 s
% 0.41/29.59 # Total time : 5.693 s
% 0.41/29.59 # Maximum resident set size: 137828 pages
% 0.41/46.45 eprover: CPU time limit exceeded, terminating
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: CPU time limit exceeded, terminating
% 0.41/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.47 eprover: No such file or directory
% 0.41/46.47 eprover: CPU time limit exceeded, terminating
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.48 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.49 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.50 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.51 eprover: No such file or directory
% 0.41/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.52 eprover: No such file or directory
% 0.41/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.52 eprover: No such file or directory
% 0.41/46.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.52 eprover: No such file or directory
% 0.41/46.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.53 eprover: No such file or directory
% 0.41/46.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.41/46.53 eprover: No such file or directory
%------------------------------------------------------------------------------