%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU210+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:24:15 PM UTC 2026
% Result : Theorem 133.66s 20.39s
% Output : CNFRefutation 133.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 17 unt; 0 def)
% Number of atoms : 241 ( 75 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 287 ( 116 ~; 106 |; 38 &)
% ( 14 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 3 con; 0-3 aty)
% Number of variables : 170 ( 15 sgn 102 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( ! [X3,X4] : X2 != ordered_pair(X3,X4)
& in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_1) ).
fof(t56_relat_1,lemma,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_relat_1) ).
fof(l1_zfmisc_1,lemma,
! [X1] : singleton(X1) != empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l1_zfmisc_1) ).
fof(t174_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t174_relat_1) ).
fof(t166_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_inverse_image(X3,X2))
<=> ? [X4] :
( in(X4,X2)
& in(ordered_pair(X1,X4),X3)
& in(X4,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t166_relat_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X2,relation_rng(X3))
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_relat_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t33_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(t4_boole,axiom,
! [X1] : set_difference(empty_set,X1) = empty_set,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_boole) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(c_0_13,plain,
! [X105,X106,X107,X108,X109,X110] :
( ( X110 = singleton(X109)
| esk21_2(X109,X110) = X109
| in(esk21_2(X109,X110),X110) )
& ( X110 = singleton(X109)
| esk21_2(X109,X110) != X109
| ~ in(esk21_2(X109,X110),X110) )
& ( X106 != singleton(X105)
| in(X108,X106)
| X108 != X105 )
& ( X106 != singleton(X105)
| X107 = X105
| ~ in(X107,X106) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).
fof(c_0_14,plain,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( ! [X3,X4] : X2 != ordered_pair(X3,X4)
& in(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[d1_relat_1]) ).
cnf(c_0_15,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X145,X146,X149,X151,X152] :
( ( relation(X149)
| esk26_1(X149) != ordered_pair(X151,X152) )
& ( relation(X149)
| in(esk26_1(X149),X149) )
& ( X146 = ordered_pair(esk24_2(X145,X146),esk25_2(X145,X146))
| ~ in(X146,X145)
| ~ relation(X145) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])])])]) ).
fof(c_0_17,lemma,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[t56_relat_1]) ).
fof(c_0_18,lemma,
! [X1] : singleton(X1) != empty_set,
inference(fof_simplification,[status(thm)],[l1_zfmisc_1]) ).
cnf(c_0_19,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( relation(X1)
| in(esk26_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
inference(assume_negation,[status(cth)],[t174_relat_1]) ).
fof(c_0_22,lemma,
! [X38,X39,X40,X42] :
( ( ~ relation(X40)
| in(X38,relation_inverse_image(X40,X39))
| ~ in(X42,X39)
| ~ in(ordered_pair(X38,X42),X40)
| ~ in(X42,relation_rng(X40)) )
& ( ~ relation(X40)
| ~ in(X38,relation_inverse_image(X40,X39))
| in(esk9_3(X38,X39,X40),X39) )
& ( ~ relation(X40)
| ~ in(X38,relation_inverse_image(X40,X39))
| in(ordered_pair(X38,esk9_3(X38,X39,X40)),X40) )
& ( ~ relation(X40)
| ~ in(X38,relation_inverse_image(X40,X39))
| in(esk9_3(X38,X39,X40),relation_rng(X40)) ) ),
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)],[t166_relat_1])])])])])]) ).
fof(c_0_23,lemma,
! [X69,X70,X71] :
( ( ~ relation(X71)
| ~ in(ordered_pair(X69,X70),X71)
| in(X70,relation_rng(X71)) )
& ( ~ relation(X71)
| ~ in(ordered_pair(X69,X70),X71)
| in(X69,relation_dom(X71)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])])]) ).
fof(c_0_24,lemma,
! [X20] :
( X20 = empty_set
| in(ordered_pair(esk4_1(X20),esk5_1(X20)),X20)
| ~ relation(X20) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
fof(c_0_25,lemma,
! [X13] : singleton(X13) != empty_set,
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_18])]) ).
cnf(c_0_26,plain,
( esk26_1(X1) != ordered_pair(X2,X3)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( relation(singleton(X1))
| esk26_1(singleton(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_28,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_29,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ~ ( relation_inverse_image(X2,X1) = empty_set
& subset(X1,relation_rng(X2))
& X1 != empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_21]) ).
cnf(c_0_30,lemma,
( ~ relation(X2)
| ~ in(X1,X4)
| ~ in(ordered_pair(X3,X1),X2)
| ~ in(X1,relation_rng(X2))
| in(X3,relation_inverse_image(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,lemma,
( ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2)
| in(X1,relation_rng(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,lemma,
( ~ relation(X1)
| X1 = empty_set
| in(ordered_pair(esk4_1(X1),esk5_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
relation(singleton(ordered_pair(X1,X2))),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27])]) ).
cnf(c_0_35,plain,
( ~ in(X2,X1)
| ~ relation(X1)
| X2 = ordered_pair(esk24_2(X1,X2),esk25_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_36,plain,
! [X9,X10,X11] :
( ( X11 = empty_set
| in(esk3_1(X11),X11) )
& ( ~ in(X10,X9)
| X9 != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])]) ).
fof(c_0_37,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( ~ in(X4,X2)
& in(X4,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_38,plain,
! [X47,X48,X49,X50,X51] :
( ( subset(X50,X51)
| ~ in(esk10_2(X50,X51),X51) )
& ( subset(X50,X51)
| in(esk10_2(X50,X51),X50) )
& ( in(X49,X48)
| ~ in(X49,X47)
| ~ subset(X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
fof(c_0_39,negated_conjecture,
( relation_inverse_image(esk2_0,esk1_0) = empty_set
& subset(esk1_0,relation_rng(esk2_0))
& esk1_0 != empty_set
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
cnf(c_0_40,lemma,
( ~ in(X4,X3)
| ~ in(ordered_pair(X1,X4),X2)
| ~ relation(X2)
| in(X1,relation_inverse_image(X2,X3)) ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,lemma,
( ~ relation(singleton(X1))
| ordered_pair(esk4_1(singleton(X1)),esk5_1(singleton(X1))) = X1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_33]) ).
cnf(c_0_42,plain,
( ~ in(X1,X2)
| ~ relation(X2)
| relation(singleton(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,plain,
( ~ in(X2,X1)
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_44,lemma,
! [X177,X178,X179,X180] :
( ( ordered_pair(X177,X178) != ordered_pair(X179,X180)
| X178 = X180 )
& ( ordered_pair(X177,X178) != ordered_pair(X179,X180)
| X177 = X179 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])])]) ).
fof(c_0_45,plain,
! [X217,X218,X219,X220,X221,X222,X223,X224] :
( ( X224 = set_difference(X222,X223)
| in(esk36_3(X222,X223,X224),X224)
| ~ in(esk36_3(X222,X223,X224),X223) )
& ( X224 = set_difference(X222,X223)
| in(esk36_3(X222,X223,X224),X224)
| in(esk36_3(X222,X223,X224),X222) )
& ( X224 = set_difference(X222,X223)
| in(esk36_3(X222,X223,X224),X223)
| ~ in(esk36_3(X222,X223,X224),X222)
| ~ in(esk36_3(X222,X223,X224),X224) )
& ( X219 != set_difference(X217,X218)
| in(X221,X219)
| in(X221,X218)
| ~ in(X221,X217) )
& ( X219 != set_difference(X217,X218)
| ~ in(X220,X219)
| ~ in(X220,X218) )
& ( X219 != set_difference(X217,X218)
| ~ in(X220,X219)
| in(X220,X217) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])])])]) ).
cnf(c_0_46,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,negated_conjecture,
subset(esk1_0,relation_rng(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_48,plain,
! [X238] : set_difference(empty_set,X238) = empty_set,
inference(variable_rename,[status(thm)],[t4_boole]) ).
cnf(c_0_49,lemma,
( ~ in(X1,X2)
| ~ in(esk5_1(singleton(X1)),X3)
| ~ relation(X2)
| in(esk4_1(singleton(X1)),relation_inverse_image(X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
relation_inverse_image(esk2_0,esk1_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_51,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_52,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_53,lemma,
( ordered_pair(X3,X1) != ordered_pair(X4,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_54,plain,
! [X57,X58,X59,X61,X62,X63,X65] :
( ( ~ relation(X57)
| X63 = relation_rng(X57)
| in(ordered_pair(esk13_2(X57,X63),esk12_2(X57,X63)),X57)
| in(esk12_2(X57,X63),X63) )
& ( ~ relation(X57)
| X63 = relation_rng(X57)
| ~ in(ordered_pair(X65,esk12_2(X57,X63)),X57)
| ~ in(esk12_2(X57,X63),X63) )
& ( ~ relation(X57)
| X58 != relation_rng(X57)
| in(X61,X58)
| ~ in(ordered_pair(X62,X61),X57) )
& ( ~ relation(X57)
| X58 != relation_rng(X57)
| in(ordered_pair(esk11_3(X57,X58,X59),X59),X57)
| ~ in(X59,X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_relat_1])])])])])])]) ).
cnf(c_0_55,plain,
( ~ in(esk36_3(X1,X2,X3),X2)
| X3 = set_difference(X1,X2)
| in(esk36_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(X1,esk1_0)
| in(X1,relation_rng(esk2_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( X3 = set_difference(X1,X2)
| in(esk36_3(X1,X2,X3),X3)
| in(esk36_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_58,plain,
set_difference(empty_set,X1) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( ~ in(X1,esk2_0)
| ~ in(esk5_1(singleton(X1)),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]),c_0_52]) ).
cnf(c_0_60,lemma,
esk5_1(singleton(ordered_pair(X1,X2))) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_41])]),c_0_34])]) ).
cnf(c_0_61,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk11_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,negated_conjecture,
( ~ in(esk36_3(X2,relation_rng(esk2_0),X1),esk1_0)
| in(esk36_3(X2,relation_rng(esk2_0),X1),X1)
| X1 = set_difference(X2,relation_rng(esk2_0)) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( in(esk36_3(empty_set,X2,X1),X1)
| X1 = empty_set ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_57]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_65,lemma,
( ~ in(X2,esk1_0)
| ~ in(ordered_pair(X1,X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( ~ in(X2,relation_rng(X1))
| ~ relation(X1)
| in(ordered_pair(esk11_3(X1,relation_rng(X1),X2),X2),X1) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_67,negated_conjecture,
in(esk36_3(empty_set,relation_rng(esk2_0),esk1_0),esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_58])]),c_0_64]) ).
cnf(c_0_68,lemma,
~ in(X1,esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_51])]),c_0_56]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_67,c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU210+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:58:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 133.66/20.39 % Version: 3.5.1
% 133.66/20.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 133.66/20.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 133.66/20.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 133.66/20.39 % Starting new_bool_3 with 300s (1) cores
% 133.66/20.39 % Starting new_bool_1 with 300s (1) cores
% 133.66/20.39 % Starting sh5l with 300s (1) cores
% 133.66/20.39 % new_bool_1 with pid 3290430 completed with status 0
% 133.66/20.39 % Result found by new_bool_1
% 133.66/20.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 133.66/20.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 133.66/20.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 133.66/20.39 % Starting new_bool_3 with 300s (1) cores
% 133.66/20.39 % Starting new_bool_1 with 300s (1) cores
% 133.66/20.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 133.66/20.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 133.66/20.39 % Search class: FGHSM-FFMM31-SFFFFFNN
% 133.66/20.39 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 133.66/20.39 % Starting SubtermCWHack with 28s (1) cores
% 133.66/20.39 % SubtermCWHack with pid 3290432 completed with status 0
% 133.66/20.39 % Result found by SubtermCWHack
% 133.66/20.39 % Preprocessing class: FSLSSMSSSSSNFFN.
% 133.66/20.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 133.66/20.39 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 133.66/20.39 % Starting new_bool_3 with 300s (1) cores
% 133.66/20.39 % Starting new_bool_1 with 300s (1) cores
% 133.66/20.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 133.66/20.39 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 133.66/20.39 % Search class: FGHSM-FFMM31-SFFFFFNN
% 133.66/20.39 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 133.66/20.39 % Starting SubtermCWHack with 28s (1) cores
% 133.66/20.39 % Preprocessing time : 0.005 s
% 133.66/20.39
% 133.66/20.39 % Proof found!
% 133.66/20.39 % SZS status Theorem
% 133.66/20.39 % SZS output start CNFRefutation
% See solution above
% 133.66/20.39 % Parsed axioms : 207
% 133.66/20.39 % Removed by relevancy pruning/SinE : 120
% 133.66/20.39 % Initial clauses : 160
% 133.66/20.39 % Removed in clause preprocessing : 2
% 133.66/20.39 % Initial clauses in saturation : 158
% 133.66/20.39 % Processed clauses : 70771
% 133.66/20.39 % ...of these trivial : 594
% 133.66/20.39 % ...subsumed : 63246
% 133.66/20.39 % ...remaining for further processing : 6931
% 133.66/20.39 % Other redundant clauses eliminated : 1197
% 133.66/20.39 % Clauses deleted for lack of memory : 0
% 133.66/20.39 % Backward-subsumed : 325
% 133.66/20.39 % Backward-rewritten : 124
% 133.66/20.39 % Generated clauses : 1145973
% 133.66/20.39 % ...of the previous two non-redundant : 1068638
% 133.66/20.39 % ...aggressively subsumed : 0
% 133.66/20.39 % Contextual simplify-reflections : 362
% 133.66/20.39 % Paramodulations : 1144476
% 133.66/20.39 % Factorizations : 276
% 133.66/20.39 % NegExts : 0
% 133.66/20.39 % Equation resolutions : 1200
% 133.66/20.39 % Disequality decompositions : 0
% 133.66/20.39 % Total rewrite steps : 292914
% 133.66/20.39 % ...of those cached : 285814
% 133.66/20.39 % Propositional unsat checks : 0
% 133.66/20.39 % Propositional check models : 0
% 133.66/20.39 % Propositional check unsatisfiable : 0
% 133.66/20.39 % Propositional clauses : 0
% 133.66/20.39 % Propositional clauses after purity: 0
% 133.66/20.39 % Propositional unsat core size : 0
% 133.66/20.39 % Propositional preprocessing time : 0.000
% 133.66/20.39 % Propositional encoding time : 0.000
% 133.66/20.39 % Propositional solver time : 0.000
% 133.66/20.39 % Success case prop preproc time : 0.000
% 133.66/20.39 % Success case prop encoding time : 0.000
% 133.66/20.39 % Success case prop solver time : 0.000
% 133.66/20.39 % Current number of processed clauses : 6436
% 133.66/20.39 % Positive orientable unit clauses : 611
% 133.66/20.39 % Positive unorientable unit clauses: 4
% 133.66/20.39 % Negative unit clauses : 840
% 133.66/20.39 % Non-unit-clauses : 4981
% 133.66/20.39 % Current number of unprocessed clauses: 995139
% 133.66/20.39 % ...number of literals in the above : 3583140
% 133.66/20.39 % Current number of archived formulas : 0
% 133.66/20.39 % Current number of archived clauses : 471
% 133.66/20.39 % Clause-clause subsumption calls (NU) : 2407017
% 133.66/20.39 % Rec. Clause-clause subsumption calls : 1490711
% 133.66/20.39 % Non-unit clause-clause subsumptions : 30159
% 133.66/20.39 % Unit Clause-clause subsumption calls : 413556
% 133.66/20.39 % Rewrite failures with RHS unbound : 0
% 133.66/20.39 % BW rewrite match attempts : 2008
% 133.66/20.39 % BW rewrite match successes : 70
% 133.66/20.39 % Condensation attempts : 0
% 133.66/20.39 % Condensation successes : 0
% 133.66/20.39 % Termbank termtop insertions : 15084483
% 133.66/20.39 % Search garbage collected termcells : 3318
% 133.66/20.39
% 133.66/20.39 % -------------------------------------------------
% 133.66/20.39 % User time : 18.432 s
% 133.66/20.39 % System time : 0.779 s
% 133.66/20.39 % Total time : 19.211 s
% 133.66/20.39 % Maximum resident set size: 4096 pages
% 133.66/20.39
% 133.66/20.39 % -------------------------------------------------
% 133.66/20.39 % User time : 18.438 s
% 133.66/20.39 % System time : 0.791 s
% 133.66/20.39 % Total time : 19.229 s
% 133.66/20.39 % Maximum resident set size: 5120 pages
% 133.66/20.39 % E exiting
%------------------------------------------------------------------------------