TSTP Solution File: SEU156+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU156+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 : 600s
% DateTime : Tue Jul 19 09:17:15 EDT 2022
% Result : Theorem 0.26s 1.44s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 88 ( 34 unt; 0 def)
% Number of atoms : 193 ( 142 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 170 ( 65 ~; 82 |; 14 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 148 ( 27 sgn 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t69_enumset1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(fc1_zfmisc_1,axiom,
! [X1,X2] : ~ empty(ordered_pair(X1,X2)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_zfmisc_1) ).
fof(t10_zfmisc_1,lemma,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_zfmisc_1) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tarski) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_zfmisc_1) ).
fof(t9_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_13,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_14,lemma,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_15,negated_conjecture,
( ordered_pair(esk1_0,esk2_0) = ordered_pair(esk3_0,esk4_0)
& ( esk1_0 != esk3_0
| esk2_0 != esk4_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_16,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
ordered_pair(esk1_0,esk2_0) = ordered_pair(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_20,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_21,plain,
! [X3,X4] : ~ empty(ordered_pair(X3,X4)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_zfmisc_1])]) ).
fof(c_0_22,lemma,
! [X5,X6,X7,X8] :
( unordered_pair(X5,X6) != unordered_pair(X7,X8)
| X5 = X7
| X5 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_zfmisc_1])]) ).
cnf(c_0_23,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk1_0,esk2_0),unordered_pair(esk1_0,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_24,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_25,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
cnf(c_0_26,plain,
~ empty(ordered_pair(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,lemma,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
unordered_pair(unordered_pair(esk2_0,esk1_0),unordered_pair(esk1_0,esk1_0)) = unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_29,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_31,plain,
~ empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))),
inference(rw,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_32,lemma,
( X1 = unordered_pair(esk2_0,esk1_0)
| X1 = unordered_pair(esk1_0,esk1_0)
| unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,lemma,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X1),X2) ),
inference(rw,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_34,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_35,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk5_3(X5,X6,X7) != X5
| ~ in(esk5_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk5_3(X5,X6,X7) != X6
| ~ in(esk5_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X7)
| esk5_3(X5,X6,X7) = X5
| esk5_3(X5,X6,X7) = X6
| X7 = unordered_pair(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tarski])])])])])])]) ).
cnf(c_0_36,plain,
~ empty(unordered_pair(unordered_pair(X1,X2),unordered_pair(X2,X2))),
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_37,lemma,
( unordered_pair(esk1_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,lemma,
in(X1,unordered_pair(X1,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X3 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( X4 = X3
| X4 = X2
| X1 != unordered_pair(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,lemma,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| ~ empty(unordered_pair(unordered_pair(X1,esk1_0),unordered_pair(esk4_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,lemma,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| in(esk1_0,unordered_pair(esk4_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_43,plain,
( in(X1,X2)
| X2 != unordered_pair(X3,X1) ),
inference(er,[status(thm)],[c_0_39]) ).
fof(c_0_44,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])])]) ).
cnf(c_0_45,plain,
( X1 = X2
| X3 = X2
| ~ in(X2,unordered_pair(X3,X1)) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_46,lemma,
in(esk1_0,unordered_pair(esk4_0,esk3_0)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_42]),c_0_43]) ).
cnf(c_0_47,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,lemma,
( esk1_0 = esk4_0
| esk1_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_47,c_0_17]) ).
cnf(c_0_50,negated_conjecture,
( unordered_pair(unordered_pair(esk2_0,esk3_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0))
| esk1_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_48]) ).
cnf(c_0_51,lemma,
( unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk3_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk3_0)
| esk1_0 = esk4_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_48]) ).
cnf(c_0_52,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_53,plain,
( in(X4,X1)
| X1 != unordered_pair(X2,X3)
| X4 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_54,lemma,
( unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk3_0)
| esk1_0 = esk4_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_24]),c_0_52]) ).
cnf(c_0_55,plain,
( in(X1,X2)
| X2 != unordered_pair(X1,X3) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_56,negated_conjecture,
( esk2_0 != esk4_0
| esk1_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_57,lemma,
( esk1_0 = esk4_0
| esk2_0 = X1
| esk3_0 = X1
| ~ in(X1,unordered_pair(esk4_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_45,c_0_54]) ).
cnf(c_0_58,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_59,lemma,
( esk1_0 = esk4_0
| esk3_0 != esk4_0 ),
inference(ef,[status(thm)],[c_0_48]) ).
cnf(c_0_60,negated_conjecture,
( esk1_0 = esk4_0
| esk2_0 != esk4_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_48]) ).
cnf(c_0_61,negated_conjecture,
( unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk2_0,esk1_0))
| unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_37]),c_0_24]) ).
cnf(c_0_62,lemma,
esk1_0 = esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]) ).
fof(c_0_63,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])]) ).
cnf(c_0_64,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_65,negated_conjecture,
( unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk4_0,esk2_0),unordered_pair(esk4_0,esk3_0))
| unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_24]),c_0_24]),c_0_62]),c_0_24]) ).
cnf(c_0_66,lemma,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,negated_conjecture,
unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk4_0,esk4_0),unordered_pair(esk4_0,esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_62]),c_0_24]),c_0_62]),c_0_62]),c_0_24]) ).
cnf(c_0_68,negated_conjecture,
( unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk2_0)
| in(unordered_pair(esk3_0,esk3_0),unordered_pair(unordered_pair(esk4_0,esk2_0),unordered_pair(esk4_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,lemma,
( X1 = X2
| unordered_pair(X1,X2) != unordered_pair(X3,X3) ),
inference(rw,[status(thm)],[c_0_66,c_0_17]) ).
cnf(c_0_70,lemma,
( unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk4_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_62]),c_0_62]),c_0_62]),c_0_24]) ).
cnf(c_0_71,negated_conjecture,
in(unordered_pair(esk3_0,esk3_0),unordered_pair(unordered_pair(esk4_0,esk4_0),unordered_pair(esk4_0,esk2_0))),
inference(spm,[status(thm)],[c_0_64,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_68]) ).
fof(c_0_73,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk6_2(X4,X5),X5)
| esk6_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk6_2(X4,X5),X5)
| esk6_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).
cnf(c_0_74,lemma,
( esk3_0 = esk4_0
| unordered_pair(esk4_0,esk2_0) != unordered_pair(X1,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_52]) ).
cnf(c_0_75,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk4_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk4_0,esk3_0) = unordered_pair(esk4_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_72]),c_0_52]) ).
cnf(c_0_77,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_78,negated_conjecture,
esk3_0 = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_52]) ).
cnf(c_0_79,negated_conjecture,
in(esk3_0,unordered_pair(esk4_0,esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_76]),c_0_43]) ).
cnf(c_0_80,plain,
( X2 = X3
| X1 != unordered_pair(X2,X2)
| ~ in(X3,X1) ),
inference(rw,[status(thm)],[c_0_77,c_0_17]) ).
cnf(c_0_81,negated_conjecture,
unordered_pair(esk4_0,esk2_0) = unordered_pair(esk4_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_78]),c_0_78]),c_0_78])]) ).
cnf(c_0_82,negated_conjecture,
( esk3_0 = esk4_0
| esk3_0 = esk2_0 ),
inference(spm,[status(thm)],[c_0_45,c_0_79]) ).
cnf(c_0_83,negated_conjecture,
( esk3_0 != esk4_0
| esk2_0 != esk4_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_59]) ).
cnf(c_0_84,plain,
( X1 = X2
| ~ in(X2,unordered_pair(X1,X1)) ),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_85,negated_conjecture,
in(esk2_0,unordered_pair(esk4_0,esk4_0)),
inference(spm,[status(thm)],[c_0_64,c_0_81]) ).
cnf(c_0_86,negated_conjecture,
esk2_0 != esk4_0,
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_82]),c_0_83]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU156+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 10:23:52 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.44 # Preprocessing time : 0.021 s
% 0.26/1.44
% 0.26/1.44 # Proof found!
% 0.26/1.44 # SZS status Theorem
% 0.26/1.44 # SZS output start CNFRefutation
% See solution above
% 0.26/1.44 # Proof object total steps : 88
% 0.26/1.44 # Proof object clause steps : 63
% 0.26/1.44 # Proof object formula steps : 25
% 0.26/1.44 # Proof object conjectures : 25
% 0.26/1.44 # Proof object clause conjectures : 22
% 0.26/1.44 # Proof object formula conjectures : 3
% 0.26/1.44 # Proof object initial clauses used : 15
% 0.26/1.44 # Proof object initial formulas used : 12
% 0.26/1.44 # Proof object generating inferences : 34
% 0.26/1.44 # Proof object simplifying inferences : 43
% 0.26/1.44 # Training examples: 0 positive, 0 negative
% 0.26/1.44 # Parsed axioms : 84
% 0.26/1.44 # Removed by relevancy pruning/SinE : 23
% 0.26/1.44 # Initial clauses : 98
% 0.26/1.44 # Removed in clause preprocessing : 3
% 0.26/1.44 # Initial clauses in saturation : 95
% 0.26/1.44 # Processed clauses : 2409
% 0.26/1.44 # ...of these trivial : 116
% 0.26/1.44 # ...subsumed : 1810
% 0.26/1.44 # ...remaining for further processing : 483
% 0.26/1.44 # Other redundant clauses eliminated : 121
% 0.26/1.44 # Clauses deleted for lack of memory : 0
% 0.26/1.44 # Backward-subsumed : 33
% 0.26/1.44 # Backward-rewritten : 205
% 0.26/1.44 # Generated clauses : 10171
% 0.26/1.44 # ...of the previous two non-trivial : 8274
% 0.26/1.44 # Contextual simplify-reflections : 352
% 0.26/1.44 # Paramodulations : 10006
% 0.26/1.44 # Factorizations : 23
% 0.26/1.44 # Equation resolutions : 142
% 0.26/1.44 # Current number of processed clauses : 240
% 0.26/1.44 # Positive orientable unit clauses : 59
% 0.26/1.44 # Positive unorientable unit clauses: 3
% 0.26/1.44 # Negative unit clauses : 32
% 0.26/1.44 # Non-unit-clauses : 146
% 0.26/1.44 # Current number of unprocessed clauses: 2832
% 0.26/1.44 # ...number of literals in the above : 7313
% 0.26/1.44 # Current number of archived formulas : 0
% 0.26/1.44 # Current number of archived clauses : 241
% 0.26/1.44 # Clause-clause subsumption calls (NU) : 54877
% 0.26/1.44 # Rec. Clause-clause subsumption calls : 41954
% 0.26/1.44 # Non-unit clause-clause subsumptions : 1151
% 0.26/1.44 # Unit Clause-clause subsumption calls : 1583
% 0.26/1.44 # Rewrite failures with RHS unbound : 0
% 0.26/1.44 # BW rewrite match attempts : 94
% 0.26/1.44 # BW rewrite match successes : 40
% 0.26/1.44 # Condensation attempts : 0
% 0.26/1.44 # Condensation successes : 0
% 0.26/1.44 # Termbank termtop insertions : 113829
% 0.26/1.44
% 0.26/1.44 # -------------------------------------------------
% 0.26/1.44 # User time : 0.220 s
% 0.26/1.44 # System time : 0.007 s
% 0.26/1.44 # Total time : 0.227 s
% 0.26/1.44 # Maximum resident set size: 6628 pages
%------------------------------------------------------------------------------