TSTP Solution File: LCL502+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL502+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:25:05 EDT 2023
% Result : Theorem 36.48s 5.08s
% Output : CNFRefutation 36.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 18
% Syntax : Number of formulae : 95 ( 40 unt; 0 def)
% Number of atoms : 189 ( 20 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 168 ( 74 ~; 73 |; 10 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 12 ( 10 usr; 10 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 143 ( 13 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(op_implies_and,axiom,
( op_implies_and
=> ! [X1,X2] : implies(X1,X2) = not(and(X1,not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_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/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',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/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',kn3) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_op_or) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_modus_ponens) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_kn3) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',kn2) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_kn2) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',kn1) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',rosser_kn1) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',op_equiv) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',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/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',substitution_of_equivalents) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',substitution_of_equivalents) ).
fof(modus_tollens,axiom,
( modus_tollens
<=> ! [X1,X2] : is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))) ),
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',modus_tollens) ).
fof(hilbert_modus_tollens,conjecture,
modus_tollens,
file('/export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p',hilbert_modus_tollens) ).
fof(c_0_18,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_and])])]) ).
fof(c_0_19,plain,
! [X117,X118] :
( ~ op_or
| or(X117,X118) = not(and(not(X117),not(X118))) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_or])])]) ).
cnf(c_0_20,plain,
( implies(X1,X2) = not(and(X1,not(X2)))
| ~ op_implies_and ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
op_implies_and,
inference(split_conjunct,[status(thm)],[rosser_op_implies_and]) ).
fof(c_0_22,plain,
! [X7,X8] :
( ( ~ modus_ponens
| ~ is_a_theorem(X7)
| ~ is_a_theorem(implies(X7,X8))
| is_a_theorem(X8) )
& ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])]) ).
fof(c_0_23,plain,
! [X77,X78,X79] :
( ( ~ kn3
| is_a_theorem(implies(implies(X77,X78),implies(not(and(X78,X79)),not(and(X79,X77))))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])]) ).
cnf(c_0_24,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
not(and(X1,not(X2))) = implies(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_26,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
cnf(c_0_27,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_29,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_23]) ).
cnf(c_0_30,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
cnf(c_0_32,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_27,c_0_28])]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(X1,X2),or(and(X2,X3),not(and(X3,X1))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_35,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_36,plain,
! [X73,X74] :
( ( ~ kn2
| is_a_theorem(implies(and(X73,X74),X73)) )
& ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
| kn2 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])]) ).
cnf(c_0_37,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
fof(c_0_40,plain,
! [X71] :
( ( ~ kn1
| is_a_theorem(implies(X71,and(X71,X71))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])]) ).
cnf(c_0_41,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_45,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(implies(X2,and(X1,X3))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_47,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,and(X1,X3))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_30]),c_0_25]),c_0_30]) ).
cnf(c_0_49,plain,
is_a_theorem(or(not(X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_25]),c_0_30]) ).
cnf(c_0_50,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
( is_a_theorem(not(and(X1,X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_37,c_0_47]) ).
cnf(c_0_52,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_53,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(or(X2,not(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_30]),c_0_25]) ).
cnf(c_0_54,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_52]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_53,c_0_49]) ).
cnf(c_0_56,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_30]) ).
cnf(c_0_57,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_54,c_0_30]) ).
cnf(c_0_58,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_55]) ).
cnf(c_0_59,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(and(X3,X1)))
| ~ is_a_theorem(or(X2,X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_56]) ).
cnf(c_0_60,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(or(X2,X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_25]),c_0_30]) ).
cnf(c_0_62,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_60]) ).
cnf(c_0_63,plain,
( is_a_theorem(or(and(X1,X1),X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_61,c_0_46]) ).
cnf(c_0_64,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(and(X1,X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_62]) ).
cnf(c_0_65,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_66,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(and(X2,X2)))
| ~ is_a_theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_63]) ).
cnf(c_0_67,plain,
( is_a_theorem(not(and(not(X1),X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_69,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(and(X2,X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_68,c_0_35]) ).
fof(c_0_70,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])]) ).
cnf(c_0_71,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_65]) ).
cnf(c_0_72,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_73,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
fof(c_0_74,plain,
! [X11,X12] :
( ( ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X11,X12))
| X11 = X12 )
& ( 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution_of_equivalents])])])])]) ).
cnf(c_0_75,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_62]) ).
cnf(c_0_76,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73])]) ).
cnf(c_0_77,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_74]) ).
cnf(c_0_78,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_79,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X2,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
fof(c_0_80,plain,
! [X15,X16] :
( ( ~ modus_tollens
| is_a_theorem(implies(implies(not(X16),not(X15)),implies(X15,X16))) )
& ( ~ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])]) ).
fof(c_0_81,negated_conjecture,
~ modus_tollens,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_modus_tollens])]) ).
cnf(c_0_82,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_83,plain,
is_a_theorem(equiv(not(not(X1)),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_55]),c_0_30]),c_0_49])]) ).
cnf(c_0_84,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_80]) ).
cnf(c_0_85,negated_conjecture,
~ modus_tollens,
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_86,plain,
not(not(X1)) = X1,
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,plain,
is_a_theorem(equiv(and(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_46]),c_0_42])]) ).
cnf(c_0_88,plain,
~ is_a_theorem(implies(implies(not(esk6_0),not(esk5_0)),implies(esk5_0,esk6_0))),
inference(sr,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_89,plain,
implies(X1,not(X2)) = not(and(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_86]) ).
cnf(c_0_90,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_46,c_0_30]) ).
cnf(c_0_91,plain,
and(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_82,c_0_87]) ).
cnf(c_0_92,plain,
~ is_a_theorem(or(and(not(esk6_0),esk5_0),implies(esk5_0,esk6_0))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_30]) ).
cnf(c_0_93,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_94,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_56]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL502+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n023.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon Oct 2 13:17:07 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.19/0.49 Running first-order model finding
% 0.19/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rstEFjGkEh/E---3.1_2390.p
% 36.48/5.08 # Version: 3.1pre001
% 36.48/5.08 # Preprocessing class: FSMSSLSSSSSNFFN.
% 36.48/5.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.48/5.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 36.48/5.08 # Starting new_bool_3 with 300s (1) cores
% 36.48/5.08 # Starting new_bool_1 with 300s (1) cores
% 36.48/5.08 # Starting sh5l with 300s (1) cores
% 36.48/5.08 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 2467 completed with status 0
% 36.48/5.08 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 36.48/5.08 # Preprocessing class: FSMSSLSSSSSNFFN.
% 36.48/5.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.48/5.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 36.48/5.08 # No SInE strategy applied
% 36.48/5.08 # Search class: FGUSF-FFMM21-MFFFFFNN
% 36.48/5.08 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.48/5.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 36.48/5.08 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 36.48/5.08 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 36.48/5.08 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.48/5.08 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 36.48/5.08 # G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with pid 2482 completed with status 0
% 36.48/5.08 # Result found by G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN
% 36.48/5.08 # Preprocessing class: FSMSSLSSSSSNFFN.
% 36.48/5.08 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.48/5.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 36.48/5.08 # No SInE strategy applied
% 36.48/5.08 # Search class: FGUSF-FFMM21-MFFFFFNN
% 36.48/5.08 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 36.48/5.08 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 36.48/5.08 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 36.48/5.08 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 36.48/5.08 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.48/5.08 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 36.48/5.08 # Preprocessing time : 0.002 s
% 36.48/5.08 # Presaturation interreduction done
% 36.48/5.08
% 36.48/5.08 # Proof found!
% 36.48/5.08 # SZS status Theorem
% 36.48/5.08 # SZS output start CNFRefutation
% See solution above
% 36.48/5.08 # Parsed axioms : 43
% 36.48/5.08 # Removed by relevancy pruning/SinE : 0
% 36.48/5.08 # Initial clauses : 72
% 36.48/5.08 # Removed in clause preprocessing : 0
% 36.48/5.08 # Initial clauses in saturation : 72
% 36.48/5.08 # Processed clauses : 12262
% 36.48/5.08 # ...of these trivial : 110
% 36.48/5.08 # ...subsumed : 7273
% 36.48/5.08 # ...remaining for further processing : 4879
% 36.48/5.08 # Other redundant clauses eliminated : 0
% 36.48/5.08 # Clauses deleted for lack of memory : 0
% 36.48/5.08 # Backward-subsumed : 2358
% 36.48/5.08 # Backward-rewritten : 875
% 36.48/5.08 # Generated clauses : 213962
% 36.48/5.08 # ...of the previous two non-redundant : 211196
% 36.48/5.08 # ...aggressively subsumed : 0
% 36.48/5.08 # Contextual simplify-reflections : 25
% 36.48/5.08 # Paramodulations : 213962
% 36.48/5.08 # Factorizations : 0
% 36.48/5.08 # NegExts : 0
% 36.48/5.08 # Equation resolutions : 0
% 36.48/5.08 # Total rewrite steps : 33427
% 36.48/5.08 # Propositional unsat checks : 0
% 36.48/5.08 # Propositional check models : 0
% 36.48/5.08 # Propositional check unsatisfiable : 0
% 36.48/5.08 # Propositional clauses : 0
% 36.48/5.08 # Propositional clauses after purity: 0
% 36.48/5.08 # Propositional unsat core size : 0
% 36.48/5.08 # Propositional preprocessing time : 0.000
% 36.48/5.08 # Propositional encoding time : 0.000
% 36.48/5.08 # Propositional solver time : 0.000
% 36.48/5.08 # Success case prop preproc time : 0.000
% 36.48/5.08 # Success case prop encoding time : 0.000
% 36.48/5.08 # Success case prop solver time : 0.000
% 36.48/5.08 # Current number of processed clauses : 1587
% 36.48/5.08 # Positive orientable unit clauses : 77
% 36.48/5.08 # Positive unorientable unit clauses: 0
% 36.48/5.08 # Negative unit clauses : 15
% 36.48/5.08 # Non-unit-clauses : 1495
% 36.48/5.08 # Current number of unprocessed clauses: 197821
% 36.48/5.08 # ...number of literals in the above : 670745
% 36.48/5.08 # Current number of archived formulas : 0
% 36.48/5.08 # Current number of archived clauses : 3292
% 36.48/5.08 # Clause-clause subsumption calls (NU) : 1168875
% 36.48/5.08 # Rec. Clause-clause subsumption calls : 596436
% 36.48/5.08 # Non-unit clause-clause subsumptions : 9403
% 36.48/5.08 # Unit Clause-clause subsumption calls : 24428
% 36.48/5.08 # Rewrite failures with RHS unbound : 0
% 36.48/5.08 # BW rewrite match attempts : 2880
% 36.48/5.08 # BW rewrite match successes : 243
% 36.48/5.08 # Condensation attempts : 0
% 36.48/5.08 # Condensation successes : 0
% 36.48/5.08 # Termbank termtop insertions : 4197861
% 36.48/5.08
% 36.48/5.08 # -------------------------------------------------
% 36.48/5.08 # User time : 4.343 s
% 36.48/5.08 # System time : 0.140 s
% 36.48/5.08 # Total time : 4.482 s
% 36.48/5.08 # Maximum resident set size: 1996 pages
% 36.48/5.08
% 36.48/5.08 # -------------------------------------------------
% 36.48/5.08 # User time : 21.722 s
% 36.48/5.08 # System time : 0.884 s
% 36.48/5.08 # Total time : 22.606 s
% 36.48/5.08 # Maximum resident set size: 1724 pages
% 36.48/5.08 % E---3.1 exiting
%------------------------------------------------------------------------------