TSTP Solution File: SEU265+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU265+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:31:13 EDT 2023
% Result : Theorem 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 92 ( 16 unt; 0 def)
% Number of atoms : 243 ( 62 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 260 ( 109 ~; 116 |; 16 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 5 con; 0-3 aty)
% Number of variables : 175 ( 15 sgn; 95 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t22_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
=> ( ! [X4] :
~ ( in(X4,X2)
& ! [X5] : ~ in(ordered_pair(X4,X5),X3) )
<=> relation_dom_as_subset(X2,X1,X3) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t22_relset_1) ).
fof(dt_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> element(relation_dom_as_subset(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',dt_k4_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',redefinition_k4_relset_1) ).
fof(t20_relat_1,axiom,
! [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.mW2ehIDml9/E---3.1_5003.p',t20_relat_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.mW2ehIDml9/E---3.1_5003.p',d5_tarski) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.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.mW2ehIDml9/E---3.1_5003.p',dt_m2_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.mW2ehIDml9/E---3.1_5003.p',redefinition_m2_relset_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',commutativity_k2_tarski) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t5_subset) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',existence_m1_subset_1) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t4_subset) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t2_tarski) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t6_boole) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',d4_relat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.mW2ehIDml9/E---3.1_5003.p',t7_boole) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
=> ( ! [X4] :
~ ( in(X4,X2)
& ! [X5] : ~ in(ordered_pair(X4,X5),X3) )
<=> relation_dom_as_subset(X2,X1,X3) = X2 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t22_relset_1])]) ).
fof(c_0_18,plain,
! [X25,X26,X27] :
( ~ relation_of2(X27,X25,X26)
| element(relation_dom_as_subset(X25,X26,X27),powerset(X25)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_relset_1])]) ).
fof(c_0_19,plain,
! [X43,X44,X45] :
( ~ relation_of2(X45,X43,X44)
| relation_dom_as_subset(X43,X44,X45) = relation_dom(X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])]) ).
fof(c_0_20,plain,
! [X52,X53,X54] :
( ( in(X52,relation_dom(X54))
| ~ in(ordered_pair(X52,X53),X54)
| ~ relation(X54) )
& ( in(X53,relation_rng(X54))
| ~ in(ordered_pair(X52,X53),X54)
| ~ relation(X54) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])]) ).
fof(c_0_21,plain,
! [X23,X24] : ordered_pair(X23,X24) = unordered_pair(unordered_pair(X23,X24),singleton(X23)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_22,negated_conjecture,
! [X59,X60] :
( relation_of2_as_subset(esk11_0,esk10_0,esk9_0)
& ( in(esk12_0,esk10_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 )
& ( ~ in(ordered_pair(esk12_0,X59),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 )
& ( ~ in(X60,esk10_0)
| in(ordered_pair(X60,esk13_1(X60)),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_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_17])])])])]) ).
fof(c_0_23,plain,
! [X8,X9,X10] :
( ~ element(X10,powerset(cartesian_product2(X8,X9)))
| relation(X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])]) ).
fof(c_0_24,plain,
! [X28,X29,X30] :
( ~ relation_of2_as_subset(X30,X28,X29)
| element(X30,powerset(cartesian_product2(X28,X29))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])]) ).
cnf(c_0_25,plain,
( element(relation_dom_as_subset(X2,X3,X1),powerset(X2))
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( relation_dom_as_subset(X2,X3,X1) = relation_dom(X1)
| ~ relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X46,X47,X48] :
( ( ~ relation_of2_as_subset(X48,X46,X47)
| relation_of2(X48,X46,X47) )
& ( ~ relation_of2(X48,X46,X47)
| relation_of2_as_subset(X48,X46,X47) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])]) ).
cnf(c_0_28,plain,
( in(X1,relation_dom(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X11,X12] : unordered_pair(X11,X12) = unordered_pair(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_31,negated_conjecture,
( in(ordered_pair(X1,esk13_1(X1)),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| ~ in(X1,esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( relation(X1)
| ~ element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( element(X1,powerset(cartesian_product2(X2,X3)))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( element(relation_dom(X1),powerset(X2))
| ~ relation_of2(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| in(unordered_pair(unordered_pair(X1,esk13_1(X1)),singleton(X1)),esk11_0)
| ~ in(X1,esk10_0) ),
inference(rw,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_39,plain,
( relation(X1)
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
relation_of2_as_subset(esk11_0,esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_41,plain,
! [X72,X73,X74] :
( ~ in(X72,X73)
| ~ element(X73,powerset(X74))
| ~ empty(X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_42,plain,
( element(relation_dom(X1),powerset(X2))
| ~ relation_of2_as_subset(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_43,plain,
! [X62,X63] :
( ~ element(X62,X63)
| empty(X63)
| in(X62,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_44,plain,
! [X34] : element(esk5_1(X34),X34),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_45,plain,
! [X69,X70,X71] :
( ~ in(X69,X70)
| ~ element(X70,powerset(X71))
| element(X69,X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
cnf(c_0_46,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk13_1(X1))),esk11_0)
| ~ in(X1,esk10_0) ),
inference(rw,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_48,negated_conjecture,
relation(esk11_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_49,plain,
! [X64,X65] :
( ( ~ in(esk14_2(X64,X65),X64)
| ~ in(esk14_2(X64,X65),X65)
| X64 = X65 )
& ( in(esk14_2(X64,X65),X64)
| in(esk14_2(X64,X65),X65)
| X64 = X65 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])]) ).
cnf(c_0_50,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,negated_conjecture,
element(relation_dom(esk11_0),powerset(esk10_0)),
inference(spm,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_52,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_53,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_54,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| in(X1,relation_dom(esk11_0))
| ~ in(X1,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_56,plain,
( in(esk14_2(X1,X2),X1)
| in(esk14_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_57,negated_conjecture,
( in(esk12_0,esk10_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_58,plain,
! [X75] :
( ~ empty(X75)
| X75 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
cnf(c_0_59,negated_conjecture,
( ~ empty(esk10_0)
| ~ in(X1,relation_dom(esk11_0)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,plain,
( empty(X1)
| in(esk5_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
fof(c_0_61,plain,
! [X13,X14,X15,X17,X18,X19,X21] :
( ( ~ in(X15,X14)
| in(ordered_pair(X15,esk1_3(X13,X14,X15)),X13)
| X14 != relation_dom(X13)
| ~ relation(X13) )
& ( ~ in(ordered_pair(X17,X18),X13)
| in(X17,X14)
| X14 != relation_dom(X13)
| ~ relation(X13) )
& ( ~ in(esk2_2(X13,X19),X19)
| ~ in(ordered_pair(esk2_2(X13,X19),X21),X13)
| X19 = relation_dom(X13)
| ~ relation(X13) )
& ( in(esk2_2(X13,X19),X19)
| in(ordered_pair(esk2_2(X13,X19),esk3_2(X13,X19)),X13)
| X19 = relation_dom(X13)
| ~ relation(X13) ) ),
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)],[d4_relat_1])])])])])]) ).
cnf(c_0_62,negated_conjecture,
( element(X1,esk10_0)
| ~ in(X1,relation_dom(esk11_0)) ),
inference(spm,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_63,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| esk10_0 = X1
| in(esk14_2(esk10_0,X1),relation_dom(esk11_0))
| in(esk14_2(esk10_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( in(esk12_0,esk10_0)
| relation_dom(esk11_0) != esk10_0
| ~ relation_of2(esk11_0,esk10_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_57,c_0_26]) ).
cnf(c_0_65,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_66,negated_conjecture,
( empty(relation_dom(esk11_0))
| ~ empty(esk10_0) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_67,plain,
! [X76,X77] :
( ~ in(X76,X77)
| ~ empty(X77) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
cnf(c_0_68,negated_conjecture,
( ~ in(ordered_pair(esk12_0,X1),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_69,plain,
( in(ordered_pair(X1,esk1_3(X3,X2,X1)),X3)
| ~ in(X1,X2)
| X2 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
cnf(c_0_70,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| esk10_0 = X1
| element(esk14_2(esk10_0,X1),esk10_0)
| in(esk14_2(esk10_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( in(esk12_0,esk10_0)
| relation_dom(esk11_0) != esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_35]),c_0_40])]) ).
cnf(c_0_72,negated_conjecture,
( relation_dom(esk11_0) = empty_set
| ~ empty(esk10_0) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_74,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| ~ in(unordered_pair(unordered_pair(esk12_0,X1),singleton(esk12_0)),esk11_0) ),
inference(rw,[status(thm)],[c_0_68,c_0_29]) ).
cnf(c_0_75,plain,
( in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3)
| X2 != relation_dom(X3)
| ~ relation(X3)
| ~ in(X1,X2) ),
inference(rw,[status(thm)],[c_0_69,c_0_29]) ).
cnf(c_0_76,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| relation_dom(esk11_0) = esk10_0
| element(esk14_2(esk10_0,relation_dom(esk11_0)),esk10_0) ),
inference(spm,[status(thm)],[c_0_62,c_0_70]) ).
cnf(c_0_77,negated_conjecture,
~ empty(esk10_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_65]),c_0_73]) ).
cnf(c_0_78,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| ~ in(unordered_pair(singleton(esk12_0),unordered_pair(esk12_0,X1)),esk11_0) ),
inference(spm,[status(thm)],[c_0_74,c_0_37]) ).
cnf(c_0_79,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2)
| X3 != relation_dom(X2)
| ~ relation(X2)
| ~ in(X1,X3) ),
inference(rw,[status(thm)],[c_0_75,c_0_37]) ).
cnf(c_0_80,plain,
( X1 = X2
| ~ in(esk14_2(X1,X2),X1)
| ~ in(esk14_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_81,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| relation_dom(esk11_0) = esk10_0
| in(esk14_2(esk10_0,relation_dom(esk11_0)),relation_dom(esk11_0)) ),
inference(ef,[status(thm)],[c_0_63]) ).
cnf(c_0_82,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| relation_dom(esk11_0) = esk10_0
| in(esk14_2(esk10_0,relation_dom(esk11_0)),esk10_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_76]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| X1 != relation_dom(esk11_0)
| ~ in(esk12_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_48])]) ).
cnf(c_0_84,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| relation_dom(esk11_0) = esk10_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
( relation_dom(esk11_0) != esk10_0
| X1 != relation_dom(esk11_0)
| ~ relation_of2(esk11_0,esk10_0,esk9_0)
| ~ in(esk12_0,X1) ),
inference(spm,[status(thm)],[c_0_83,c_0_26]) ).
cnf(c_0_86,negated_conjecture,
( relation_dom(esk11_0) = esk10_0
| ~ relation_of2(esk11_0,esk10_0,esk9_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_84]) ).
cnf(c_0_87,negated_conjecture,
( relation_dom(esk11_0) != esk10_0
| X1 != relation_dom(esk11_0)
| ~ in(esk12_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_35]),c_0_40])]) ).
cnf(c_0_88,negated_conjecture,
relation_dom(esk11_0) = esk10_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_35]),c_0_40])]) ).
cnf(c_0_89,negated_conjecture,
( X1 != esk10_0
| ~ in(esk12_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88]),c_0_88])]) ).
cnf(c_0_90,negated_conjecture,
in(esk12_0,esk10_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_88])]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_89,c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SEU265+1 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 09:07:16 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 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.mW2ehIDml9/E---3.1_5003.p
% 0.17/0.55 # Version: 3.1pre001
% 0.17/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.55 # Starting sh5l with 300s (1) cores
% 0.17/0.55 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5080 completed with status 0
% 0.17/0.55 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.17/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.17/0.55 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.17/0.55 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.17/0.55 # G-E--_301_C18_F1_URBAN_S0Y with pid 5091 completed with status 0
% 0.17/0.55 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.17/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.55 # No SInE strategy applied
% 0.17/0.55 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.17/0.55 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.55 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 647s (1) cores
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.55 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.17/0.55 # Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.17/0.55 # Starting G-E--_301_C18_F1_URBAN_S0Y with 136s (1) cores
% 0.17/0.55 # Preprocessing time : 0.002 s
% 0.17/0.55
% 0.17/0.55 # Proof found!
% 0.17/0.55 # SZS status Theorem
% 0.17/0.55 # SZS output start CNFRefutation
% See solution above
% 0.17/0.55 # Parsed axioms : 38
% 0.17/0.55 # Removed by relevancy pruning/SinE : 0
% 0.17/0.55 # Initial clauses : 48
% 0.17/0.55 # Removed in clause preprocessing : 11
% 0.17/0.55 # Initial clauses in saturation : 37
% 0.17/0.55 # Processed clauses : 658
% 0.17/0.55 # ...of these trivial : 5
% 0.17/0.55 # ...subsumed : 278
% 0.17/0.55 # ...remaining for further processing : 375
% 0.17/0.55 # Other redundant clauses eliminated : 0
% 0.17/0.55 # Clauses deleted for lack of memory : 0
% 0.17/0.55 # Backward-subsumed : 47
% 0.17/0.55 # Backward-rewritten : 59
% 0.17/0.55 # Generated clauses : 3151
% 0.17/0.55 # ...of the previous two non-redundant : 3081
% 0.17/0.55 # ...aggressively subsumed : 0
% 0.17/0.55 # Contextual simplify-reflections : 18
% 0.17/0.55 # Paramodulations : 3108
% 0.17/0.55 # Factorizations : 16
% 0.17/0.55 # NegExts : 0
% 0.17/0.55 # Equation resolutions : 24
% 0.17/0.55 # Total rewrite steps : 204
% 0.17/0.55 # Propositional unsat checks : 0
% 0.17/0.55 # Propositional check models : 0
% 0.17/0.55 # Propositional check unsatisfiable : 0
% 0.17/0.55 # Propositional clauses : 0
% 0.17/0.55 # Propositional clauses after purity: 0
% 0.17/0.55 # Propositional unsat core size : 0
% 0.17/0.55 # Propositional preprocessing time : 0.000
% 0.17/0.55 # Propositional encoding time : 0.000
% 0.17/0.55 # Propositional solver time : 0.000
% 0.17/0.55 # Success case prop preproc time : 0.000
% 0.17/0.55 # Success case prop encoding time : 0.000
% 0.17/0.55 # Success case prop solver time : 0.000
% 0.17/0.55 # Current number of processed clauses : 266
% 0.17/0.55 # Positive orientable unit clauses : 21
% 0.17/0.55 # Positive unorientable unit clauses: 1
% 0.17/0.55 # Negative unit clauses : 9
% 0.17/0.55 # Non-unit-clauses : 235
% 0.17/0.55 # Current number of unprocessed clauses: 2389
% 0.17/0.55 # ...number of literals in the above : 11171
% 0.17/0.55 # Current number of archived formulas : 0
% 0.17/0.55 # Current number of archived clauses : 110
% 0.17/0.55 # Clause-clause subsumption calls (NU) : 14304
% 0.17/0.55 # Rec. Clause-clause subsumption calls : 6464
% 0.17/0.55 # Non-unit clause-clause subsumptions : 296
% 0.17/0.55 # Unit Clause-clause subsumption calls : 418
% 0.17/0.55 # Rewrite failures with RHS unbound : 0
% 0.17/0.55 # BW rewrite match attempts : 12
% 0.17/0.55 # BW rewrite match successes : 7
% 0.17/0.55 # Condensation attempts : 0
% 0.17/0.55 # Condensation successes : 0
% 0.17/0.55 # Termbank termtop insertions : 55451
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.104 s
% 0.17/0.55 # System time : 0.004 s
% 0.17/0.55 # Total time : 0.108 s
% 0.17/0.55 # Maximum resident set size: 1856 pages
% 0.17/0.55
% 0.17/0.55 # -------------------------------------------------
% 0.17/0.55 # User time : 0.516 s
% 0.17/0.55 # System time : 0.020 s
% 0.17/0.55 # Total time : 0.536 s
% 0.17/0.55 # Maximum resident set size: 1732 pages
% 0.17/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------