TSTP Solution File: SEU266+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU266+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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 19:25:34 EDT 2023
% Result : Theorem 224.87s 29.19s
% Output : CNFRefutation 224.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 70 ( 17 unt; 0 def)
% Number of atoms : 186 ( 50 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 197 ( 81 ~; 81 |; 18 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-3 aty)
% Number of variables : 138 ( 7 sgn; 80 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ! [X4] :
~ ( in(X4,X2)
& ! [X5] : ~ in(ordered_pair(X5,X4),X3) )
<=> relation_rng_as_subset(X1,X2,X3) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',t23_relset_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',t69_enumset1) ).
fof(t12_relset_1,lemma,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_dom(X3),X1)
& subset(relation_rng(X3),X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',t12_relset_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',d10_xboole_0) ).
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/tmp/tmp.sp6W4isUce/E---3.1_17627.p',d5_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',commutativity_k2_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',d3_tarski) ).
fof(redefinition_k5_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_rng_as_subset(X1,X2,X3) = relation_rng(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',redefinition_k5_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',redefinition_m2_relset_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',dt_m2_relset_1) ).
fof(t20_relat_1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.sp6W4isUce/E---3.1_17627.p',t20_relat_1) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ! [X4] :
~ ( in(X4,X2)
& ! [X5] : ~ in(ordered_pair(X5,X4),X3) )
<=> relation_rng_as_subset(X1,X2,X3) = X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t23_relset_1])]) ).
fof(c_0_14,plain,
! [X323,X324] : ordered_pair(X323,X324) = unordered_pair(unordered_pair(X323,X324),singleton(X323)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_15,lemma,
! [X881] : unordered_pair(X881,X881) = singleton(X881),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_16,lemma,
! [X600,X601,X602] :
( ( subset(relation_dom(X602),X600)
| ~ relation_of2_as_subset(X602,X600,X601) )
& ( subset(relation_rng(X602),X601)
| ~ relation_of2_as_subset(X602,X600,X601) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])]) ).
fof(c_0_17,negated_conjecture,
! [X708,X709] :
( relation_of2_as_subset(esk113_0,esk111_0,esk112_0)
& ( in(esk114_0,esk112_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 )
& ( ~ in(ordered_pair(X708,esk114_0),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 )
& ( ~ in(X709,esk112_0)
| in(ordered_pair(esk115_1(X709),X709),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
cnf(c_0_18,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X36,X37] :
( ( subset(X36,X37)
| X36 != X37 )
& ( subset(X37,X36)
| X36 != X37 )
& ( ~ subset(X36,X37)
| ~ subset(X37,X36)
| X36 = X37 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
cnf(c_0_21,lemma,
( subset(relation_rng(X1),X2)
| ~ relation_of2_as_subset(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
relation_of2_as_subset(esk113_0,esk111_0,esk112_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X311,X312,X313,X315,X316,X317,X319] :
( ( ~ in(X313,X312)
| in(ordered_pair(esk61_3(X311,X312,X313),X313),X311)
| X312 != relation_rng(X311)
| ~ relation(X311) )
& ( ~ in(ordered_pair(X316,X315),X311)
| in(X315,X312)
| X312 != relation_rng(X311)
| ~ relation(X311) )
& ( ~ in(esk62_2(X311,X317),X317)
| ~ in(ordered_pair(X319,esk62_2(X311,X317)),X311)
| X317 = relation_rng(X311)
| ~ relation(X311) )
& ( in(esk62_2(X311,X317),X317)
| in(ordered_pair(esk63_2(X311,X317),esk62_2(X311,X317)),X311)
| X317 = relation_rng(X311)
| ~ relation(X311) ) ),
inference(distribute,[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_24,negated_conjecture,
( in(ordered_pair(esk115_1(X1),X1),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| ~ in(X1,esk112_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_26,plain,
! [X20,X21] : unordered_pair(X20,X21) = unordered_pair(X21,X20),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
subset(relation_rng(esk113_0),esk112_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_29,plain,
! [X236,X237,X238,X239,X240] :
( ( ~ subset(X236,X237)
| ~ in(X238,X236)
| in(X238,X237) )
& ( in(esk45_2(X239,X240),X239)
| subset(X239,X240) )
& ( ~ in(esk45_2(X239,X240),X240)
| subset(X239,X240) ) ),
inference(distribute,[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_30,plain,
! [X553,X554,X555] :
( ~ relation_of2(X555,X553,X554)
| relation_rng_as_subset(X553,X554,X555) = relation_rng(X555) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_relset_1])]) ).
fof(c_0_31,plain,
! [X563,X564,X565] :
( ( ~ relation_of2_as_subset(X565,X563,X564)
| relation_of2(X565,X563,X564) )
& ( ~ relation_of2(X565,X563,X564)
| relation_of2_as_subset(X565,X563,X564) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_32,negated_conjecture,
( ~ in(ordered_pair(X1,esk114_0),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,plain,
( in(ordered_pair(esk61_3(X3,X2,X1),X1),X3)
| ~ in(X1,X2)
| X2 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_34,plain,
! [X14,X15,X16] :
( ~ element(X16,powerset(cartesian_product2(X14,X15)))
| relation(X16) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_35,plain,
! [X422,X423,X424] :
( ~ relation_of2_as_subset(X424,X422,X423)
| element(X424,powerset(cartesian_product2(X422,X423))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
fof(c_0_36,lemma,
! [X673,X674,X675] :
( ( in(X673,relation_dom(X675))
| ~ in(ordered_pair(X673,X674),X675)
| ~ relation(X675) )
& ( in(X674,relation_rng(X675))
| ~ in(ordered_pair(X673,X674),X675)
| ~ relation(X675) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])]) ).
cnf(c_0_37,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(unordered_pair(unordered_pair(esk115_1(X1),X1),unordered_pair(esk115_1(X1),esk115_1(X1))),esk113_0)
| ~ in(X1,esk112_0) ),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_38,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_39,negated_conjecture,
( relation_rng(esk113_0) = esk112_0
| ~ subset(esk112_0,relation_rng(esk113_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_40,plain,
( in(esk45_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_41,plain,
( relation_rng_as_subset(X2,X3,X1) = relation_rng(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(unordered_pair(unordered_pair(X1,esk114_0),unordered_pair(X1,X1)),esk113_0) ),
inference(rw,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_44,plain,
( in(unordered_pair(unordered_pair(esk61_3(X3,X2,X1),X1),unordered_pair(esk61_3(X3,X2,X1),esk61_3(X3,X2,X1))),X3)
| X2 != relation_rng(X3)
| ~ relation(X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_45,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,lemma,
( in(X1,relation_rng(X2))
| ~ in(ordered_pair(X3,X1),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(unordered_pair(unordered_pair(X1,esk115_1(X1)),unordered_pair(esk115_1(X1),esk115_1(X1))),esk113_0)
| ~ in(X1,esk112_0) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
( relation_rng(esk113_0) = esk112_0
| in(esk45_2(esk112_0,relation_rng(esk113_0)),esk112_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,plain,
( relation_rng_as_subset(X1,X2,X3) = relation_rng(X3)
| ~ relation_of2_as_subset(X3,X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(unordered_pair(unordered_pair(esk114_0,X1),unordered_pair(X1,X1)),esk113_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_52,plain,
( in(unordered_pair(unordered_pair(X1,esk61_3(X2,relation_rng(X2),X1)),unordered_pair(esk61_3(X2,relation_rng(X2),X1),esk61_3(X2,relation_rng(X2),X1))),X2)
| ~ relation(X2)
| ~ in(X1,relation_rng(X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_38])]) ).
cnf(c_0_53,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,lemma,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2) ),
inference(rw,[status(thm)],[c_0_47,c_0_25]) ).
cnf(c_0_55,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| relation_rng(esk113_0) = esk112_0
| in(unordered_pair(unordered_pair(esk45_2(esk112_0,relation_rng(esk113_0)),esk115_1(esk45_2(esk112_0,relation_rng(esk113_0)))),unordered_pair(esk115_1(esk45_2(esk112_0,relation_rng(esk113_0))),esk115_1(esk45_2(esk112_0,relation_rng(esk113_0))))),esk113_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
relation_rng(esk113_0) = relation_rng_as_subset(esk111_0,esk112_0,esk113_0),
inference(spm,[status(thm)],[c_0_50,c_0_22]) ).
cnf(c_0_57,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ relation(esk113_0)
| ~ in(esk114_0,relation_rng(esk113_0)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
relation(esk113_0),
inference(spm,[status(thm)],[c_0_53,c_0_22]) ).
cnf(c_0_59,lemma,
( in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X3,X3)),X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_60,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(unordered_pair(unordered_pair(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)),esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)))),unordered_pair(esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))),esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))))),esk113_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_56]),c_0_56]),c_0_56]),c_0_56])]) ).
cnf(c_0_61,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(esk114_0,relation_rng(esk113_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58])]) ).
cnf(c_0_62,plain,
( subset(X1,X2)
| ~ in(esk45_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_63,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)),relation_rng_as_subset(esk111_0,esk112_0,esk113_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_56]),c_0_58])]) ).
cnf(c_0_64,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| ~ subset(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_56]),c_0_56]) ).
cnf(c_0_65,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(esk114_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)) ),
inference(rw,[status(thm)],[c_0_61,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( in(esk114_0,esk112_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_68,negated_conjecture,
~ in(esk114_0,esk112_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_66])]),c_0_68]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : SEU266+2 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n028.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 09:16:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.53 Running first-order theorem proving
% 0.22/0.53 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/tmp/tmp.sp6W4isUce/E---3.1_17627.p
% 224.87/29.19 # Version: 3.1pre001
% 224.87/29.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 224.87/29.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 224.87/29.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 224.87/29.19 # Starting new_bool_3 with 300s (1) cores
% 224.87/29.19 # Starting new_bool_1 with 300s (1) cores
% 224.87/29.19 # Starting sh5l with 300s (1) cores
% 224.87/29.19 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 17771 completed with status 0
% 224.87/29.19 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 224.87/29.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 224.87/29.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 224.87/29.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 224.87/29.19 # No SInE strategy applied
% 224.87/29.19 # Search class: FGHSM-FSLM32-MFFFFFNN
% 224.87/29.19 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 224.87/29.19 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 224.87/29.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 224.87/29.19 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 224.87/29.19 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 224.87/29.19 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0i with 123s (1) cores
% 224.87/29.19 # U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 17795 completed with status 0
% 224.87/29.19 # Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 224.87/29.19 # Preprocessing class: FSLSSMSSSSSNFFN.
% 224.87/29.19 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 224.87/29.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 224.87/29.19 # No SInE strategy applied
% 224.87/29.19 # Search class: FGHSM-FSLM32-MFFFFFNN
% 224.87/29.19 # Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 224.87/29.19 # Starting G-E--_303_C18_F1_URBAN_S0Y with 123s (1) cores
% 224.87/29.19 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 224.87/29.19 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 224.87/29.19 # Preprocessing time : 0.013 s
% 224.87/29.19 # Presaturation interreduction done
% 224.87/29.19
% 224.87/29.19 # Proof found!
% 224.87/29.19 # SZS status Theorem
% 224.87/29.19 # SZS output start CNFRefutation
% See solution above
% 224.87/29.19 # Parsed axioms : 337
% 224.87/29.19 # Removed by relevancy pruning/SinE : 0
% 224.87/29.19 # Initial clauses : 716
% 224.87/29.19 # Removed in clause preprocessing : 31
% 224.87/29.19 # Initial clauses in saturation : 685
% 224.87/29.19 # Processed clauses : 74948
% 224.87/29.19 # ...of these trivial : 637
% 224.87/29.19 # ...subsumed : 54646
% 224.87/29.19 # ...remaining for further processing : 19664
% 224.87/29.19 # Other redundant clauses eliminated : 2867
% 224.87/29.19 # Clauses deleted for lack of memory : 0
% 224.87/29.19 # Backward-subsumed : 6213
% 224.87/29.19 # Backward-rewritten : 3278
% 224.87/29.19 # Generated clauses : 1102311
% 224.87/29.19 # ...of the previous two non-redundant : 958120
% 224.87/29.19 # ...aggressively subsumed : 0
% 224.87/29.19 # Contextual simplify-reflections : 514
% 224.87/29.19 # Paramodulations : 1099393
% 224.87/29.19 # Factorizations : 31
% 224.87/29.19 # NegExts : 0
% 224.87/29.19 # Equation resolutions : 2898
% 224.87/29.19 # Total rewrite steps : 466556
% 224.87/29.19 # Propositional unsat checks : 3
% 224.87/29.19 # Propositional check models : 0
% 224.87/29.19 # Propositional check unsatisfiable : 0
% 224.87/29.19 # Propositional clauses : 0
% 224.87/29.19 # Propositional clauses after purity: 0
% 224.87/29.19 # Propositional unsat core size : 0
% 224.87/29.19 # Propositional preprocessing time : 0.000
% 224.87/29.19 # Propositional encoding time : 1.173
% 224.87/29.19 # Propositional solver time : 0.882
% 224.87/29.19 # Success case prop preproc time : 0.000
% 224.87/29.19 # Success case prop encoding time : 0.000
% 224.87/29.19 # Success case prop solver time : 0.000
% 224.87/29.19 # Current number of processed clauses : 9452
% 224.87/29.19 # Positive orientable unit clauses : 420
% 224.87/29.19 # Positive unorientable unit clauses: 11
% 224.87/29.19 # Negative unit clauses : 562
% 224.87/29.19 # Non-unit-clauses : 8459
% 224.87/29.19 # Current number of unprocessed clauses: 871513
% 224.87/29.19 # ...number of literals in the above : 3550242
% 224.87/29.19 # Current number of archived formulas : 0
% 224.87/29.19 # Current number of archived clauses : 10121
% 224.87/29.19 # Clause-clause subsumption calls (NU) : 30754870
% 224.87/29.19 # Rec. Clause-clause subsumption calls : 20659472
% 224.87/29.19 # Non-unit clause-clause subsumptions : 45804
% 224.87/29.19 # Unit Clause-clause subsumption calls : 555143
% 224.87/29.19 # Rewrite failures with RHS unbound : 0
% 224.87/29.19 # BW rewrite match attempts : 319
% 224.87/29.19 # BW rewrite match successes : 181
% 224.87/29.19 # Condensation attempts : 0
% 224.87/29.19 # Condensation successes : 0
% 224.87/29.19 # Termbank termtop insertions : 21247829
% 224.87/29.19
% 224.87/29.19 # -------------------------------------------------
% 224.87/29.19 # User time : 27.131 s
% 224.87/29.19 # System time : 0.658 s
% 224.87/29.19 # Total time : 27.789 s
% 224.87/29.19 # Maximum resident set size: 4204 pages
% 224.87/29.19
% 224.87/29.19 # -------------------------------------------------
% 224.87/29.19 # User time : 135.437 s
% 224.87/29.19 # System time : 4.108 s
% 224.87/29.19 # Total time : 139.545 s
% 224.87/29.19 # Maximum resident set size: 2048 pages
% 224.87/29.19 % E---3.1 exiting
% 224.87/29.20 % E---3.1 exiting
%------------------------------------------------------------------------------