TSTP Solution File: LCL508+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL508+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 300s
% DateTime : Sat May 4 08:27:44 EDT 2024
% Result : Theorem 110.33s 14.41s
% Output : CNFRefutation 110.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 46
% Number of leaves : 18
% Syntax : Number of formulae : 194 ( 120 unt; 0 def)
% Number of atoms : 307 ( 56 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 207 ( 94 ~; 92 |; 10 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 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 : 352 ( 54 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/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',op_implies_and) ).
fof(op_or,axiom,
( op_or
=> ! [X1,X2] : or(X1,X2) = not(and(not(X1),not(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',op_or) ).
fof(rosser_op_implies_and,axiom,
op_implies_and,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_op_implies_and) ).
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/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',kn3) ).
fof(rosser_op_or,axiom,
op_or,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_op_or) ).
fof(rosser_kn3,axiom,
kn3,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_kn3) ).
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/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',modus_ponens) ).
fof(kn1,axiom,
( kn1
<=> ! [X4] : is_a_theorem(implies(X4,and(X4,X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',kn1) ).
fof(rosser_modus_ponens,axiom,
modus_ponens,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_modus_ponens) ).
fof(rosser_kn1,axiom,
kn1,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_kn1) ).
fof(kn2,axiom,
( kn2
<=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',kn2) ).
fof(rosser_kn2,axiom,
kn2,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',rosser_kn2) ).
fof(op_equiv,axiom,
( op_equiv
=> ! [X1,X2] : equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',op_equiv) ).
fof(rosser_op_equiv,axiom,
op_equiv,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.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/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',substitution_of_equivalents) ).
fof(substitution_of_equivalents_001,axiom,
substitution_of_equivalents,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',substitution_of_equivalents) ).
fof(hilbert_and_3,conjecture,
and_3,
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',hilbert_and_3) ).
fof(and_3,axiom,
( and_3
<=> ! [X1,X2] : is_a_theorem(implies(X1,implies(X2,and(X1,X2)))) ),
file('/export/starexec/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p',and_3) ).
fof(c_0_18,plain,
! [X121,X122] :
( ~ op_implies_and
| implies(X121,X122) = not(and(X121,not(X122))) ),
inference(fof_nnf,[status(thm)],[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(fof_nnf,[status(thm)],[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,
! [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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn3])])])])]) ).
cnf(c_0_23,plain,
( or(X1,X2) = not(and(not(X1),not(X2)))
| ~ op_or ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,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_25,plain,
op_or,
inference(split_conjunct,[status(thm)],[rosser_op_or]) ).
cnf(c_0_26,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_22]) ).
cnf(c_0_27,plain,
implies(not(X1),X2) = or(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_28,plain,
kn3,
inference(split_conjunct,[status(thm)],[rosser_kn3]) ).
fof(c_0_29,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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_ponens])])])])])]) ).
cnf(c_0_30,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_26,c_0_27]),c_0_28])]) ).
fof(c_0_31,plain,
! [X71] :
( ( ~ kn1
| is_a_theorem(implies(X71,and(X71,X71))) )
& ( ~ is_a_theorem(implies(esk33_0,and(esk33_0,esk33_0)))
| kn1 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn1])])])])]) ).
cnf(c_0_32,plain,
( is_a_theorem(X2)
| ~ modus_ponens
| ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_33,plain,
modus_ponens,
inference(split_conjunct,[status(thm)],[rosser_modus_ponens]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(or(X1,X2),or(and(X2,X3),implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_27]) ).
cnf(c_0_35,plain,
or(and(X1,not(X2)),X3) = implies(implies(X1,X2),X3),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(X1,and(X1,X1)))
| ~ kn1 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
kn1,
inference(split_conjunct,[status(thm)],[rosser_kn1]) ).
cnf(c_0_38,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_32,c_0_33])]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(or(X1,X2),implies(implies(X2,X3),or(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_27]),c_0_35]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,and(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(implies(X1,X2),or(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
is_a_theorem(or(X1,and(not(X1),not(X1)))),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
fof(c_0_43,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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kn2])])])])]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(and(not(X1),not(X1)),X2),or(X2,X1))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(and(X1,X2),X1))
| ~ kn2 ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_46,plain,
kn2,
inference(split_conjunct,[status(thm)],[rosser_kn2]) ).
cnf(c_0_47,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(and(not(X2),not(X2)),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_44]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(and(X1,X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_49,plain,
is_a_theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(X1,X2),or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_41,c_0_49]) ).
cnf(c_0_51,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X2,X1))
| ~ is_a_theorem(not(X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_27]) ).
cnf(c_0_52,plain,
not(and(X1,implies(X2,X3))) = implies(X1,and(X2,not(X3))),
inference(spm,[status(thm)],[c_0_24,c_0_24]) ).
cnf(c_0_53,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_50]) ).
cnf(c_0_54,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(X2,implies(X3,X4)),X1))
| ~ is_a_theorem(implies(X2,and(X3,not(X4)))) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_34]) ).
cnf(c_0_56,plain,
is_a_theorem(or(X1,not(and(X1,X2)))),
inference(spm,[status(thm)],[c_0_53,c_0_48]) ).
cnf(c_0_57,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X2),or(X2,X2)),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_40]),c_0_27]) ).
cnf(c_0_58,plain,
is_a_theorem(or(and(X1,X2),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_55,c_0_49]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(or(and(X1,X2),X3),or(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_56]),c_0_27]) ).
cnf(c_0_60,plain,
is_a_theorem(or(X1,implies(X1,X2))),
inference(spm,[status(thm)],[c_0_56,c_0_24]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(or(X1,X1),not(not(X1)))),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(and(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_59]) ).
cnf(c_0_63,plain,
is_a_theorem(or(and(implies(X1,X2),X3),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_55,c_0_60]) ).
cnf(c_0_64,plain,
( is_a_theorem(or(and(X1,X2),not(and(X2,X3))))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_65,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_61]) ).
cnf(c_0_66,plain,
is_a_theorem(or(implies(X1,X2),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
is_a_theorem(or(and(X1,X2),not(and(X2,and(X1,X3))))),
inference(spm,[status(thm)],[c_0_64,c_0_48]) ).
cnf(c_0_68,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(implies(X1,X2),not(and(not(X2),and(X1,X3))))),
inference(spm,[status(thm)],[c_0_67,c_0_35]) ).
cnf(c_0_70,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(not(implies(X2,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_68]) ).
cnf(c_0_71,plain,
( is_a_theorem(not(and(not(X1),and(X2,X3))))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_69]) ).
cnf(c_0_72,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_70,c_0_49]) ).
cnf(c_0_73,plain,
is_a_theorem(not(and(not(X1),and(X1,X2)))),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X2),and(X2,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_73]) ).
cnf(c_0_75,plain,
is_a_theorem(implies(and(X1,X2),not(not(X1)))),
inference(spm,[status(thm)],[c_0_74,c_0_58]) ).
cnf(c_0_76,plain,
is_a_theorem(not(not(or(X1,not(X1))))),
inference(spm,[status(thm)],[c_0_68,c_0_27]) ).
cnf(c_0_77,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(and(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_75]) ).
cnf(c_0_78,plain,
( is_a_theorem(and(X1,X1))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_79,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(not(or(X2,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_76]) ).
cnf(c_0_80,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),or(X3,X1))),
inference(spm,[status(thm)],[c_0_41,c_0_60]) ).
cnf(c_0_81,plain,
is_a_theorem(not(and(not(implies(X1,X1)),X2))),
inference(spm,[status(thm)],[c_0_70,c_0_56]) ).
cnf(c_0_82,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,plain,
is_a_theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_79,c_0_49]) ).
cnf(c_0_84,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_80]) ).
cnf(c_0_85,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(implies(X2,X2)),X3),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_81]) ).
cnf(c_0_86,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(not(X2),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_82]) ).
cnf(c_0_87,plain,
is_a_theorem(implies(or(X1,X2),or(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_83]),c_0_27]) ).
cnf(c_0_88,plain,
( is_a_theorem(or(X1,not(X2)))
| ~ is_a_theorem(implies(or(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_84,c_0_27]) ).
cnf(c_0_89,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(or(implies(X2,X2),X3),X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_35]),c_0_27]) ).
cnf(c_0_90,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(implies(X2,X3),X1))
| ~ is_a_theorem(and(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_86,c_0_24]) ).
cnf(c_0_91,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(or(X2,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_87]) ).
cnf(c_0_92,plain,
is_a_theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_88,c_0_87]) ).
cnf(c_0_93,plain,
is_a_theorem(or(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_89,c_0_87]) ).
cnf(c_0_94,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(or(X2,X2),X1))
| ~ is_a_theorem(not(X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_78]),c_0_27]) ).
cnf(c_0_95,plain,
is_a_theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),or(X2,X3))),
inference(spm,[status(thm)],[c_0_41,c_0_93]) ).
cnf(c_0_97,plain,
is_a_theorem(or(and(X1,X2),not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_64,c_0_72]) ).
cnf(c_0_98,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(or(not(X2),not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_94,c_0_82]) ).
cnf(c_0_99,plain,
is_a_theorem(or(or(X1,not(X2)),not(implies(X2,X1)))),
inference(spm,[status(thm)],[c_0_53,c_0_50]) ).
cnf(c_0_100,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_86,c_0_95]) ).
cnf(c_0_101,plain,
is_a_theorem(implies(or(X1,X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_72]),c_0_35]),c_0_27]) ).
cnf(c_0_102,plain,
( is_a_theorem(or(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X3),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_96]) ).
cnf(c_0_103,plain,
is_a_theorem(implies(implies(X1,X2),not(and(not(X2),X1)))),
inference(spm,[status(thm)],[c_0_97,c_0_35]) ).
cnf(c_0_104,plain,
( is_a_theorem(not(implies(X1,not(X1))))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_105,plain,
( is_a_theorem(or(and(X1,X2),implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_100]) ).
fof(c_0_106,plain,
! [X125,X126] :
( ~ op_equiv
| equiv(X125,X126) = and(implies(X125,X126),implies(X126,X125)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_equiv])])])]) ).
cnf(c_0_107,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(X1,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_101]) ).
cnf(c_0_108,plain,
is_a_theorem(or(not(and(not(X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_109,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(implies(X2,not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_104]) ).
cnf(c_0_110,plain,
( is_a_theorem(or(implies(X1,X2),and(X3,X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_91,c_0_105]) ).
cnf(c_0_111,plain,
( equiv(X1,X2) = and(implies(X1,X2),implies(X2,X1))
| ~ op_equiv ),
inference(split_conjunct,[status(thm)],[c_0_106]) ).
cnf(c_0_112,plain,
op_equiv,
inference(split_conjunct,[status(thm)],[rosser_op_equiv]) ).
cnf(c_0_113,plain,
is_a_theorem(not(and(not(X1),X1))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_114,plain,
is_a_theorem(or(implies(X1,X2),X1)),
inference(spm,[status(thm)],[c_0_84,c_0_72]) ).
fof(c_0_115,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(fof_nnf,[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_116,plain,
( is_a_theorem(and(X1,X2))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_117,plain,
and(implies(X1,X2),implies(X2,X1)) = equiv(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112])]) ).
cnf(c_0_118,plain,
is_a_theorem(or(not(and(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_62,c_0_97]) ).
cnf(c_0_119,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(or(and(not(X2),X2),X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_113]) ).
cnf(c_0_120,plain,
is_a_theorem(or(and(X1,X2),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_55,c_0_114]) ).
cnf(c_0_121,plain,
( X1 = X2
| ~ substitution_of_equivalents
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_115]) ).
cnf(c_0_122,plain,
substitution_of_equivalents,
inference(split_conjunct,[status(thm)],[substitution_of_equivalents]) ).
cnf(c_0_123,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_116,c_0_117]) ).
cnf(c_0_124,plain,
is_a_theorem(or(implies(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_118,c_0_24]) ).
cnf(c_0_125,plain,
is_a_theorem(implies(X1,or(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_27]) ).
cnf(c_0_126,plain,
( X1 = X2
| ~ is_a_theorem(equiv(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_121,c_0_122])]) ).
cnf(c_0_127,plain,
is_a_theorem(equiv(and(X1,X1),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_40]),c_0_48])]) ).
cnf(c_0_128,plain,
is_a_theorem(implies(or(X1,X2),or(X2,implies(X3,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_124]),c_0_27]) ).
cnf(c_0_129,plain,
is_a_theorem(equiv(X1,or(X1,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_101]),c_0_125])]) ).
cnf(c_0_130,plain,
and(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
cnf(c_0_131,plain,
( is_a_theorem(or(X1,implies(X2,X3)))
| ~ is_a_theorem(or(X3,X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_128]) ).
cnf(c_0_132,plain,
is_a_theorem(or(X1,not(and(X2,X1)))),
inference(spm,[status(thm)],[c_0_91,c_0_118]) ).
cnf(c_0_133,plain,
or(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_126,c_0_129]) ).
cnf(c_0_134,plain,
implies(X1,X1) = equiv(X1,X1),
inference(spm,[status(thm)],[c_0_117,c_0_130]) ).
cnf(c_0_135,plain,
is_a_theorem(or(implies(X1,X2),implies(X3,implies(X4,X1)))),
inference(spm,[status(thm)],[c_0_131,c_0_66]) ).
cnf(c_0_136,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_132]),c_0_24]) ).
cnf(c_0_137,plain,
is_a_theorem(equiv(or(X1,X2),or(X2,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_87]),c_0_87])]) ).
cnf(c_0_138,plain,
is_a_theorem(implies(implies(equiv(X1,X1),X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_133]),c_0_134]) ).
cnf(c_0_139,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_107,c_0_135]) ).
cnf(c_0_140,plain,
( is_a_theorem(equiv(X1,X2))
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_136]) ).
cnf(c_0_141,plain,
implies(X1,and(not(X2),not(X3))) = not(and(X1,or(X2,X3))),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_142,plain,
or(X1,X2) = or(X2,X1),
inference(spm,[status(thm)],[c_0_126,c_0_137]) ).
cnf(c_0_143,plain,
is_a_theorem(equiv(X1,implies(equiv(X2,X2),X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_138]),c_0_139])]) ).
cnf(c_0_144,plain,
( is_a_theorem(equiv(X1,or(X1,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_140,c_0_125]) ).
cnf(c_0_145,plain,
implies(implies(X1,X2),and(X2,not(X1))) = not(equiv(X1,X2)),
inference(spm,[status(thm)],[c_0_52,c_0_117]) ).
cnf(c_0_146,plain,
not(not(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_130]),c_0_27]),c_0_133]) ).
cnf(c_0_147,plain,
implies(X1,not(X2)) = not(and(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_130]),c_0_133]) ).
cnf(c_0_148,plain,
or(not(X1),X2) = implies(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_130]),c_0_27]),c_0_133]) ).
cnf(c_0_149,plain,
is_a_theorem(implies(or(X1,and(X1,X2)),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_133]),c_0_142]) ).
cnf(c_0_150,plain,
implies(equiv(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_126,c_0_143]) ).
cnf(c_0_151,plain,
( or(X1,X2) = X1
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_126,c_0_144]) ).
cnf(c_0_152,plain,
implies(or(X1,X2),and(X2,not(not(X1)))) = not(equiv(not(X1),X2)),
inference(spm,[status(thm)],[c_0_145,c_0_27]) ).
cnf(c_0_153,plain,
not(implies(X1,X2)) = and(X1,not(X2)),
inference(spm,[status(thm)],[c_0_146,c_0_24]) ).
cnf(c_0_154,plain,
not(and(not(X1),X2)) = or(X1,not(X2)),
inference(spm,[status(thm)],[c_0_27,c_0_147]) ).
cnf(c_0_155,plain,
or(X1,not(X2)) = implies(X2,X1),
inference(spm,[status(thm)],[c_0_148,c_0_142]) ).
cnf(c_0_156,plain,
is_a_theorem(equiv(X1,or(X1,and(X1,X2)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_149]),c_0_125])]) ).
cnf(c_0_157,plain,
not(and(equiv(X1,X1),X2)) = not(X2),
inference(spm,[status(thm)],[c_0_147,c_0_150]) ).
cnf(c_0_158,plain,
( or(X1,X2) = X2
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_142,c_0_151]) ).
cnf(c_0_159,plain,
( is_a_theorem(equiv(X1,X1))
| ~ is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_117]) ).
cnf(c_0_160,plain,
is_a_theorem(or(and(X1,X1),not(X1))),
inference(spm,[status(thm)],[c_0_53,c_0_40]) ).
cnf(c_0_161,plain,
and(implies(X1,not(X2)),or(X2,X1)) = equiv(X1,not(X2)),
inference(spm,[status(thm)],[c_0_117,c_0_27]) ).
cnf(c_0_162,plain,
implies(or(X1,X2),and(X1,X2)) = not(equiv(not(X2),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_142]),c_0_146]) ).
cnf(c_0_163,plain,
and(not(X1),not(X2)) = not(or(X1,X2)),
inference(spm,[status(thm)],[c_0_153,c_0_27]) ).
cnf(c_0_164,plain,
not(and(not(X1),X2)) = implies(X2,X1),
inference(rw,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_165,plain,
or(X1,and(X2,not(X3))) = implies(implies(X2,X3),X1),
inference(spm,[status(thm)],[c_0_35,c_0_142]) ).
cnf(c_0_166,plain,
or(X1,and(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_126,c_0_156]) ).
fof(c_0_167,negated_conjecture,
~ and_3,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[hilbert_and_3])]) ).
cnf(c_0_168,plain,
and(equiv(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_157]),c_0_146]) ).
cnf(c_0_169,plain,
( X1 = X2
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_151,c_0_158]) ).
cnf(c_0_170,plain,
is_a_theorem(equiv(X1,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_159,c_0_72])]) ).
cnf(c_0_171,plain,
is_a_theorem(or(not(X1),and(X1,X1))),
inference(spm,[status(thm)],[c_0_91,c_0_160]) ).
cnf(c_0_172,plain,
and(or(X1,not(X2)),or(X2,not(X1))) = equiv(not(X1),not(X2)),
inference(spm,[status(thm)],[c_0_161,c_0_27]) ).
cnf(c_0_173,plain,
not(equiv(not(X1),X2)) = not(equiv(X1,not(X2))),
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(spm,[status(thm)],[c_0_162,c_0_163]),c_0_148]),c_0_147]),c_0_147]),c_0_164]),c_0_162]),c_0_146]) ).
cnf(c_0_174,plain,
implies(implies(X1,X2),X1) = X1,
inference(spm,[status(thm)],[c_0_165,c_0_166]) ).
fof(c_0_175,plain,
! [X41,X42] :
( ( ~ and_3
| is_a_theorem(implies(X41,implies(X42,and(X41,X42)))) )
& ( ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0))))
| and_3 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[and_3])])])])]) ).
fof(c_0_176,negated_conjecture,
~ and_3,
inference(fof_nnf,[status(thm)],[c_0_167]) ).
cnf(c_0_177,plain,
( and(X1,X2) = X2
| ~ is_a_theorem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_170])]) ).
cnf(c_0_178,plain,
is_a_theorem(or(and(X1,X1),implies(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_131,c_0_171]) ).
cnf(c_0_179,plain,
equiv(not(X1),not(X2)) = equiv(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_155]),c_0_155]),c_0_117]) ).
cnf(c_0_180,plain,
equiv(not(X1),X2) = equiv(X1,not(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_173]),c_0_146]) ).
cnf(c_0_181,plain,
implies(X1,equiv(X2,X2)) = equiv(X2,X2),
inference(spm,[status(thm)],[c_0_174,c_0_150]) ).
cnf(c_0_182,plain,
( and_3
| ~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))) ),
inference(split_conjunct,[status(thm)],[c_0_175]) ).
cnf(c_0_183,negated_conjecture,
~ and_3,
inference(split_conjunct,[status(thm)],[c_0_176]) ).
cnf(c_0_184,plain,
and(implies(and(X1,X2),X2),X3) = X3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_177,c_0_178]),c_0_130]),c_0_147]),c_0_155]) ).
cnf(c_0_185,plain,
equiv(X1,X2) = equiv(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_180]),c_0_146]) ).
cnf(c_0_186,plain,
equiv(X1,equiv(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_181]),c_0_150]),c_0_168]) ).
cnf(c_0_187,plain,
~ is_a_theorem(implies(esk18_0,implies(esk19_0,and(esk18_0,esk19_0)))),
inference(sr,[status(thm)],[c_0_182,c_0_183]) ).
cnf(c_0_188,plain,
implies(X1,and(X2,X1)) = equiv(X1,and(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_184]),c_0_185]) ).
cnf(c_0_189,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),or(and(X3,implies(X2,X1)),not(equiv(X2,X1))))),
inference(spm,[status(thm)],[c_0_30,c_0_117]) ).
cnf(c_0_190,plain,
equiv(equiv(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_185,c_0_186]) ).
cnf(c_0_191,plain,
~ is_a_theorem(implies(esk18_0,equiv(esk19_0,and(esk18_0,esk19_0)))),
inference(spm,[status(thm)],[c_0_187,c_0_188]) ).
cnf(c_0_192,plain,
is_a_theorem(implies(X1,equiv(X2,and(X1,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_181]),c_0_150]),c_0_150]),c_0_155]),c_0_188]) ).
cnf(c_0_193,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_192])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LCL508+1 : TPTP v8.1.2. Released v3.3.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 08:57:10 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.Wib9dHk6Bu/E---3.1_7945.p
% 110.33/14.41 # Version: 3.1.0
% 110.33/14.41 # Preprocessing class: FSMSSLSSSSSNFFN.
% 110.33/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.33/14.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 110.33/14.41 # Starting new_bool_3 with 300s (1) cores
% 110.33/14.41 # Starting new_bool_1 with 300s (1) cores
% 110.33/14.41 # Starting sh5l with 300s (1) cores
% 110.33/14.41 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 8023 completed with status 0
% 110.33/14.41 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 110.33/14.41 # Preprocessing class: FSMSSLSSSSSNFFN.
% 110.33/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.33/14.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 110.33/14.41 # No SInE strategy applied
% 110.33/14.41 # Search class: FGUSF-FFMM21-MFFFFFNN
% 110.33/14.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 110.33/14.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 110.33/14.41 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 110.33/14.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 110.33/14.41 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 110.33/14.41 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 151s (1) cores
% 110.33/14.41 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 8035 completed with status 0
% 110.33/14.41 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 110.33/14.41 # Preprocessing class: FSMSSLSSSSSNFFN.
% 110.33/14.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.33/14.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 1500s (5) cores
% 110.33/14.41 # No SInE strategy applied
% 110.33/14.41 # Search class: FGUSF-FFMM21-MFFFFFNN
% 110.33/14.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 110.33/14.41 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 750s (1) cores
% 110.33/14.41 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 151s (1) cores
% 110.33/14.41 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 151s (1) cores
% 110.33/14.41 # Preprocessing time : 0.003 s
% 110.33/14.41 # Presaturation interreduction done
% 110.33/14.41
% 110.33/14.41 # Proof found!
% 110.33/14.41 # SZS status Theorem
% 110.33/14.41 # SZS output start CNFRefutation
% See solution above
% 110.33/14.41 # Parsed axioms : 43
% 110.33/14.41 # Removed by relevancy pruning/SinE : 0
% 110.33/14.41 # Initial clauses : 72
% 110.33/14.41 # Removed in clause preprocessing : 0
% 110.33/14.41 # Initial clauses in saturation : 72
% 110.33/14.41 # Processed clauses : 20021
% 110.33/14.41 # ...of these trivial : 3255
% 110.33/14.41 # ...subsumed : 12532
% 110.33/14.41 # ...remaining for further processing : 4234
% 110.33/14.41 # Other redundant clauses eliminated : 0
% 110.33/14.41 # Clauses deleted for lack of memory : 0
% 110.33/14.41 # Backward-subsumed : 156
% 110.33/14.41 # Backward-rewritten : 1889
% 110.33/14.41 # Generated clauses : 777017
% 110.33/14.41 # ...of the previous two non-redundant : 658734
% 110.33/14.41 # ...aggressively subsumed : 0
% 110.33/14.41 # Contextual simplify-reflections : 1
% 110.33/14.41 # Paramodulations : 777017
% 110.33/14.41 # Factorizations : 0
% 110.33/14.41 # NegExts : 0
% 110.33/14.41 # Equation resolutions : 0
% 110.33/14.41 # Disequality decompositions : 0
% 110.33/14.41 # Total rewrite steps : 744006
% 110.33/14.41 # ...of those cached : 620885
% 110.33/14.41 # Propositional unsat checks : 0
% 110.33/14.41 # Propositional check models : 0
% 110.33/14.41 # Propositional check unsatisfiable : 0
% 110.33/14.41 # Propositional clauses : 0
% 110.33/14.41 # Propositional clauses after purity: 0
% 110.33/14.41 # Propositional unsat core size : 0
% 110.33/14.41 # Propositional preprocessing time : 0.000
% 110.33/14.41 # Propositional encoding time : 0.000
% 110.33/14.41 # Propositional solver time : 0.000
% 110.33/14.41 # Success case prop preproc time : 0.000
% 110.33/14.41 # Success case prop encoding time : 0.000
% 110.33/14.41 # Success case prop solver time : 0.000
% 110.33/14.41 # Current number of processed clauses : 2130
% 110.33/14.41 # Positive orientable unit clauses : 919
% 110.33/14.41 # Positive unorientable unit clauses: 5
% 110.33/14.41 # Negative unit clauses : 4
% 110.33/14.41 # Non-unit-clauses : 1202
% 110.33/14.41 # Current number of unprocessed clauses: 637260
% 110.33/14.41 # ...number of literals in the above : 1226043
% 110.33/14.41 # Current number of archived formulas : 0
% 110.33/14.41 # Current number of archived clauses : 2104
% 110.33/14.41 # Clause-clause subsumption calls (NU) : 605987
% 110.33/14.41 # Rec. Clause-clause subsumption calls : 593502
% 110.33/14.41 # Non-unit clause-clause subsumptions : 12625
% 110.33/14.41 # Unit Clause-clause subsumption calls : 27801
% 110.33/14.41 # Rewrite failures with RHS unbound : 28
% 110.33/14.41 # BW rewrite match attempts : 107249
% 110.33/14.41 # BW rewrite match successes : 5226
% 110.33/14.41 # Condensation attempts : 0
% 110.33/14.41 # Condensation successes : 0
% 110.33/14.41 # Termbank termtop insertions : 14515666
% 110.33/14.41 # Search garbage collected termcells : 1095
% 110.33/14.41
% 110.33/14.41 # -------------------------------------------------
% 110.33/14.41 # User time : 13.150 s
% 110.33/14.41 # System time : 0.560 s
% 110.33/14.41 # Total time : 13.710 s
% 110.33/14.41 # Maximum resident set size: 1944 pages
% 110.33/14.41
% 110.33/14.41 # -------------------------------------------------
% 110.33/14.41 # User time : 66.497 s
% 110.33/14.41 # System time : 2.554 s
% 110.33/14.41 # Total time : 69.051 s
% 110.33/14.41 # Maximum resident set size: 1736 pages
% 110.33/14.41 % E---3.1 exiting
%------------------------------------------------------------------------------