TSTP Solution File: LCL519+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : LCL519+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:39 EDT 2022
% Result : Theorem 0.36s 23.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of formulae : 111 ( 64 unt; 0 def)
% Number of atoms : 188 ( 36 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 133 ( 56 ~; 54 |; 10 &)
% ( 6 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 14 ( 12 usr; 12 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 175 ( 14 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_and,axiom,
( op_and
=> ! [X1,X2] : and(X1,X2) = not(or(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_and) ).
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_and) ).
fof(principia_op_and,axiom,
op_and,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',principia_op_and) ).
fof(op_implies_or,axiom,
( op_implies_or
=> ! [X1,X2] : implies(X1,X2) = or(not(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_implies_or) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_implies_and) ).
fof(principia_op_implies_or,axiom,
op_implies_or,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',principia_op_implies_or) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_or) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn1) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn1) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',kn2) ).
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/sandbox2/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/sandbox2/benchmark/Axioms/LCL006+0.ax',kn3) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn2) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_modus_ponens) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_kn3) ).
fof(substitution_of_equivalents,axiom,
( substitution_of_equivalents
<=> ! [X1,X2] :
( is_a_theorem(equiv(X1,X2))
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',substitution_of_equivalents) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+1.ax',op_equiv) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',substitution_of_equivalents) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+5.ax',rosser_op_equiv) ).
fof(principia_r2,conjecture,
r2,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',principia_r2) ).
fof(r2,axiom,
( r2
<=> ! [X4,X5] : is_a_theorem(implies(X5,or(X4,X5))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL006+0.ax',r2) ).
fof(c_0_22,plain,
! [X3,X4] :
( ~ op_and
| and(X3,X4) = not(or(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_and])])])])]) ).
fof(c_0_23,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_24,plain,
( and(X1,X2) = not(or(not(X1),not(X2)))
| ~ op_and ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,plain,
op_and,
inference(split_conjunct,[status(thm)],[principia_op_and]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ op_implies_or
| implies(X3,X4) = or(not(X3),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_or])])])])]) ).
fof(c_0_27,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_28,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
cnf(c_0_30,plain,
and(X1,X2) = not(or(not(X1),not(X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_31,plain,
( implies(X1,X2) = or(not(X1),X2)
| ~ op_implies_or ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
op_implies_or,
inference(split_conjunct,[status(thm)],[principia_op_implies_or]) ).
cnf(c_0_33,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
cnf(c_0_35,plain,
not(not(or(not(X1),not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),c_0_30]) ).
cnf(c_0_36,plain,
or(not(X1),X2) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
fof(c_0_37,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_38,plain,
not(and(not(X1),not(X2))) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_39,plain,
not(not(implies(X1,not(not(X2))))) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_42,plain,
or(X1,X2) = implies(not(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_30]),c_0_36]),c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]) ).
cnf(c_0_44,plain,
implies(not(not(X1)),X2) = implies(X1,X2),
inference(rw,[status(thm)],[c_0_36,c_0_42]) ).
fof(c_0_45,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])])])])])]) ).
fof(c_0_46,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])])])])])])]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,not(implies(X1,not(X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_30]),c_0_42]),c_0_44]) ).
cnf(c_0_48,plain,
implies(X1,not(implies(X2,not(not(X3))))) = not(not(implies(X1,not(implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_39,c_0_39]) ).
fof(c_0_49,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_50,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_52,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2)
| ~ modus_ponens ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_54,plain,
is_a_theorem(not(not(implies(X1,not(implies(X1,not(X1))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_44]),c_0_48]) ).
cnf(c_0_55,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_49]) ).
cnf(c_0_56,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_58,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_52,c_0_53])]) ).
cnf(c_0_59,plain,
is_a_theorem(not(not(not(not(implies(X1,not(implies(X1,not(X1))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_44]),c_0_44]),c_0_48]) ).
cnf(c_0_60,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_55,c_0_56])]) ).
cnf(c_0_61,plain,
implies(X1,implies(X2,not(not(X3)))) = not(not(implies(X1,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_39,c_0_39]) ).
cnf(c_0_62,plain,
implies(implies(X1,not(not(X2))),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_63,plain,
is_a_theorem(implies(not(implies(X1,not(X2))),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_30]),c_0_36]) ).
cnf(c_0_64,plain,
implies(not(implies(X1,not(not(X2)))),X3) = implies(not(implies(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
fof(c_0_65,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])])])])])])]) ).
fof(c_0_66,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_67,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_44]) ).
cnf(c_0_68,plain,
is_a_theorem(not(not(not(not(not(not(implies(not(X1),not(implies(not(X1),X1)))))))))),
inference(spm,[status(thm)],[c_0_59,c_0_48]) ).
cnf(c_0_69,plain,
is_a_theorem(not(not(implies(implies(X1,X2),implies(implies(X2,not(X3)),implies(X3,not(X1))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_30]),c_0_30]),c_0_42]),c_0_44]),c_0_42]),c_0_44]),c_0_44]),c_0_61]) ).
cnf(c_0_70,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,not(not(X3))))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_62]) ).
cnf(c_0_71,plain,
is_a_theorem(implies(not(implies(X1,X2)),X1)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_72,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2))
| ~ substitution_of_equivalents ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_73,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_74,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_75,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_76,plain,
and(X1,X2) = not(implies(X1,not(X2))),
inference(rw,[status(thm)],[c_0_30,c_0_36]) ).
cnf(c_0_77,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(not(X2),not(implies(not(X2),X2))),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_44]),c_0_44]) ).
cnf(c_0_78,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,not(X3)),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_61]),c_0_39]) ).
cnf(c_0_79,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(not(implies(X2,X3)),X2),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_44]) ).
cnf(c_0_80,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_81,plain,
equiv(X1,X2) = not(implies(implies(X1,X2),not(implies(X2,X1)))),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),c_0_76]) ).
cnf(c_0_82,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,plain,
is_a_theorem(implies(implies(X1,not(X2)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_79,c_0_78]) ).
cnf(c_0_84,plain,
( X1 = X2
| ~ is_a_theorem(not(implies(implies(X1,X2),not(implies(X2,X1))))) ),
inference(rw,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
( is_a_theorem(not(implies(X1,not(X1))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_86,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_79,c_0_82]) ).
cnf(c_0_87,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_58,c_0_83]) ).
cnf(c_0_88,plain,
( X1 = not(not(X2))
| ~ is_a_theorem(not(implies(implies(X1,X2),not(implies(X2,X1))))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_44]),c_0_62]) ).
cnf(c_0_89,plain,
is_a_theorem(not(implies(implies(X1,X1),not(implies(X1,X1))))),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_90,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_78]) ).
cnf(c_0_91,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_87,c_0_86]) ).
cnf(c_0_92,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,plain,
is_a_theorem(implies(implies(implies(X1,X2),not(X3)),implies(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92]) ).
fof(c_0_94,negated_conjecture,
~ r2,
inference(assume_negation,[status(cth)],[principia_r2]) ).
cnf(c_0_95,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X3),X1))),
inference(spm,[status(thm)],[c_0_93,c_0_92]) ).
cnf(c_0_96,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_86]),c_0_44]) ).
fof(c_0_97,plain,
! [X6,X7] :
( ( ~ r2
| is_a_theorem(implies(X7,or(X6,X7))) )
& ( ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0)))
| r2 ) ),
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)],[r2])])])])])]) ).
fof(c_0_98,negated_conjecture,
~ r2,
inference(fof_simplification,[status(thm)],[c_0_94]) ).
cnf(c_0_99,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,not(X3)),implies(X3,not(X1))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_44]),c_0_61]),c_0_39]) ).
cnf(c_0_100,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_95]) ).
cnf(c_0_101,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_96,c_0_78]) ).
cnf(c_0_102,plain,
( r2
| ~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))) ),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_103,negated_conjecture,
~ r2,
inference(split_conjunct,[status(thm)],[c_0_98]) ).
cnf(c_0_104,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,not(X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_58,c_0_99]) ).
cnf(c_0_105,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_106,plain,
~ is_a_theorem(implies(esk47_0,or(esk46_0,esk47_0))),
inference(sr,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_107,plain,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_92]) ).
cnf(c_0_108,plain,
~ is_a_theorem(implies(esk47_0,implies(not(esk46_0),esk47_0))),
inference(rw,[status(thm)],[c_0_106,c_0_42]) ).
cnf(c_0_109,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_96,c_0_107]) ).
cnf(c_0_110,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_108,c_0_109])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL519+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 23:23:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.46 eprover: CPU time limit exceeded, terminating
% 0.36/23.54 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.36/23.54
% 0.36/23.54 # Failure: Resource limit exceeded (time)
% 0.36/23.54 # OLD status Res
% 0.36/23.54 # Preprocessing time : 0.019 s
% 0.36/23.54 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.36/23.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.36/23.54 # Preprocessing time : 0.007 s
% 0.36/23.54
% 0.36/23.54 # Failure: Out of unprocessed clauses!
% 0.36/23.54 # OLD status GaveUp
% 0.36/23.54 # Parsed axioms : 43
% 0.36/23.54 # Removed by relevancy pruning/SinE : 41
% 0.36/23.54 # Initial clauses : 3
% 0.36/23.54 # Removed in clause preprocessing : 0
% 0.36/23.54 # Initial clauses in saturation : 3
% 0.36/23.54 # Processed clauses : 3
% 0.36/23.54 # ...of these trivial : 0
% 0.36/23.54 # ...subsumed : 1
% 0.36/23.54 # ...remaining for further processing : 2
% 0.36/23.54 # Other redundant clauses eliminated : 0
% 0.36/23.54 # Clauses deleted for lack of memory : 0
% 0.36/23.54 # Backward-subsumed : 0
% 0.36/23.54 # Backward-rewritten : 0
% 0.36/23.54 # Generated clauses : 0
% 0.36/23.54 # ...of the previous two non-trivial : 0
% 0.36/23.54 # Contextual simplify-reflections : 0
% 0.36/23.54 # Paramodulations : 0
% 0.36/23.54 # Factorizations : 0
% 0.36/23.54 # Equation resolutions : 0
% 0.36/23.54 # Current number of processed clauses : 2
% 0.36/23.54 # Positive orientable unit clauses : 0
% 0.36/23.54 # Positive unorientable unit clauses: 0
% 0.36/23.54 # Negative unit clauses : 2
% 0.36/23.54 # Non-unit-clauses : 0
% 0.36/23.54 # Current number of unprocessed clauses: 0
% 0.36/23.54 # ...number of literals in the above : 0
% 0.36/23.54 # Current number of archived formulas : 0
% 0.36/23.54 # Current number of archived clauses : 0
% 0.36/23.54 # Clause-clause subsumption calls (NU) : 0
% 0.36/23.54 # Rec. Clause-clause subsumption calls : 0
% 0.36/23.54 # Non-unit clause-clause subsumptions : 0
% 0.36/23.54 # Unit Clause-clause subsumption calls : 0
% 0.36/23.54 # Rewrite failures with RHS unbound : 0
% 0.36/23.54 # BW rewrite match attempts : 0
% 0.36/23.54 # BW rewrite match successes : 0
% 0.36/23.54 # Condensation attempts : 0
% 0.36/23.54 # Condensation successes : 0
% 0.36/23.54 # Termbank termtop insertions : 481
% 0.36/23.54
% 0.36/23.54 # -------------------------------------------------
% 0.36/23.54 # User time : 0.006 s
% 0.36/23.54 # System time : 0.001 s
% 0.36/23.54 # Total time : 0.008 s
% 0.36/23.54 # Maximum resident set size: 2792 pages
% 0.36/23.54 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.36/23.54 # Preprocessing time : 0.010 s
% 0.36/23.54
% 0.36/23.54 # Proof found!
% 0.36/23.54 # SZS status Theorem
% 0.36/23.54 # SZS output start CNFRefutation
% See solution above
% 0.36/23.54 # Proof object total steps : 111
% 0.36/23.54 # Proof object clause steps : 76
% 0.36/23.54 # Proof object formula steps : 35
% 0.36/23.54 # Proof object conjectures : 4
% 0.36/23.54 # Proof object clause conjectures : 1
% 0.36/23.54 # Proof object formula conjectures : 3
% 0.36/23.54 # Proof object initial clauses used : 22
% 0.36/23.54 # Proof object initial formulas used : 22
% 0.36/23.54 # Proof object generating inferences : 33
% 0.36/23.54 # Proof object simplifying inferences : 60
% 0.36/23.54 # Training examples: 0 positive, 0 negative
% 0.36/23.54 # Parsed axioms : 43
% 0.36/23.54 # Removed by relevancy pruning/SinE : 0
% 0.36/23.54 # Initial clauses : 72
% 0.36/23.54 # Removed in clause preprocessing : 0
% 0.36/23.54 # Initial clauses in saturation : 72
% 0.36/23.54 # Processed clauses : 638
% 0.36/23.54 # ...of these trivial : 160
% 0.36/23.54 # ...subsumed : 60
% 0.36/23.54 # ...remaining for further processing : 418
% 0.36/23.54 # Other redundant clauses eliminated : 0
% 0.36/23.54 # Clauses deleted for lack of memory : 0
% 0.36/23.54 # Backward-subsumed : 0
% 0.36/23.54 # Backward-rewritten : 200
% 0.36/23.54 # Generated clauses : 4905
% 0.36/23.54 # ...of the previous two non-trivial : 3132
% 0.36/23.54 # Contextual simplify-reflections : 0
% 0.36/23.54 # Paramodulations : 4905
% 0.36/23.54 # Factorizations : 0
% 0.36/23.54 # Equation resolutions : 0
% 0.36/23.54 # Current number of processed clauses : 218
% 0.36/23.54 # Positive orientable unit clauses : 166
% 0.36/23.54 # Positive unorientable unit clauses: 0
% 0.36/23.54 # Negative unit clauses : 1
% 0.36/23.54 # Non-unit-clauses : 51
% 0.36/23.54 # Current number of unprocessed clauses: 1462
% 0.36/23.54 # ...number of literals in the above : 1554
% 0.36/23.54 # Current number of archived formulas : 0
% 0.36/23.54 # Current number of archived clauses : 200
% 0.36/23.54 # Clause-clause subsumption calls (NU) : 1015
% 0.36/23.54 # Rec. Clause-clause subsumption calls : 992
% 0.36/23.54 # Non-unit clause-clause subsumptions : 59
% 0.36/23.54 # Unit Clause-clause subsumption calls : 985
% 0.36/23.54 # Rewrite failures with RHS unbound : 0
% 0.36/23.54 # BW rewrite match attempts : 7956
% 0.36/23.54 # BW rewrite match successes : 215
% 0.36/23.54 # Condensation attempts : 0
% 0.36/23.54 # Condensation successes : 0
% 0.36/23.54 # Termbank termtop insertions : 103944
% 0.36/23.54
% 0.36/23.54 # -------------------------------------------------
% 0.36/23.54 # User time : 0.048 s
% 0.36/23.54 # System time : 0.007 s
% 0.36/23.54 # Total time : 0.055 s
% 0.36/23.54 # Maximum resident set size: 7004 pages
% 0.36/46.44 eprover: CPU time limit exceeded, terminating
% 0.36/46.45 eprover: CPU time limit exceeded, terminating
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
% 0.36/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.51 eprover: No such file or directory
% 0.36/46.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.51 eprover: No such file or directory
%------------------------------------------------------------------------------