TSTP Solution File: SEU216+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU216+3 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:30:57 EDT 2023
% Result : Theorem 0.18s 0.66s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 8
% Syntax : Number of formulae : 68 ( 19 unt; 0 def)
% Number of atoms : 252 ( 110 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 287 ( 103 ~; 135 |; 28 &)
% ( 9 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 102 ( 4 sgn; 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',commutativity_k2_tarski) ).
fof(t8_funct_1,axiom,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(ordered_pair(X1,X2),X3)
<=> ( in(X1,relation_dom(X3))
& X2 = apply(X3,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',t8_funct_1) ).
fof(d10_relat_1,axiom,
! [X1,X2] :
( relation(X2)
=> ( X2 = identity_relation(X1)
<=> ! [X3,X4] :
( in(ordered_pair(X3,X4),X2)
<=> ( in(X3,X1)
& X3 = X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',d10_relat_1) ).
fof(t34_funct_1,conjecture,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',t34_funct_1) ).
fof(t71_relat_1,axiom,
! [X1] :
( relation_dom(identity_relation(X1)) = X1
& relation_rng(identity_relation(X1)) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',t71_relat_1) ).
fof(d4_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',d4_funct_1) ).
fof(dt_k6_relat_1,axiom,
! [X1] : relation(identity_relation(X1)),
file('/export/starexec/sandbox2/tmp/tmp.3nP8xDjAj7/E---3.1_25901.p',dt_k6_relat_1) ).
fof(c_0_8,plain,
! [X48,X49] : ordered_pair(X48,X49) = unordered_pair(unordered_pair(X48,X49),singleton(X48)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X68,X69] : unordered_pair(X68,X69) = unordered_pair(X69,X68),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_10,plain,
! [X12,X13,X14] :
( ( in(X12,relation_dom(X14))
| ~ in(ordered_pair(X12,X13),X14)
| ~ relation(X14)
| ~ function(X14) )
& ( X13 = apply(X14,X12)
| ~ in(ordered_pair(X12,X13),X14)
| ~ relation(X14)
| ~ function(X14) )
& ( ~ in(X12,relation_dom(X14))
| X13 != apply(X14,X12)
| in(ordered_pair(X12,X13),X14)
| ~ relation(X14)
| ~ function(X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_funct_1])])]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( in(X19,X17)
| ~ in(ordered_pair(X19,X20),X18)
| X18 != identity_relation(X17)
| ~ relation(X18) )
& ( X19 = X20
| ~ in(ordered_pair(X19,X20),X18)
| X18 != identity_relation(X17)
| ~ relation(X18) )
& ( ~ in(X21,X17)
| X21 != X22
| in(ordered_pair(X21,X22),X18)
| X18 != identity_relation(X17)
| ~ relation(X18) )
& ( ~ in(ordered_pair(esk4_2(X17,X18),esk5_2(X17,X18)),X18)
| ~ in(esk4_2(X17,X18),X17)
| esk4_2(X17,X18) != esk5_2(X17,X18)
| X18 = identity_relation(X17)
| ~ relation(X18) )
& ( in(esk4_2(X17,X18),X17)
| in(ordered_pair(esk4_2(X17,X18),esk5_2(X17,X18)),X18)
| X18 = identity_relation(X17)
| ~ relation(X18) )
& ( esk4_2(X17,X18) = esk5_2(X17,X18)
| in(ordered_pair(esk4_2(X17,X18),esk5_2(X17,X18)),X18)
| X18 = identity_relation(X17)
| ~ relation(X18) ) ),
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)],[d10_relat_1])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( X2 = identity_relation(X1)
<=> ( relation_dom(X2) = X1
& ! [X3] :
( in(X3,X1)
=> apply(X2,X3) = X3 ) ) ) ),
inference(assume_negation,[status(cth)],[t34_funct_1]) ).
cnf(c_0_15,plain,
( in(X1,relation_dom(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
ordered_pair(X1,X2) = unordered_pair(singleton(X1),unordered_pair(X1,X2)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( in(esk4_2(X1,X2),X1)
| in(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X2)
| X2 = identity_relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,negated_conjecture,
! [X8] :
( relation(esk2_0)
& function(esk2_0)
& ( in(esk3_0,esk1_0)
| relation_dom(esk2_0) != esk1_0
| esk2_0 != identity_relation(esk1_0) )
& ( apply(esk2_0,esk3_0) != esk3_0
| relation_dom(esk2_0) != esk1_0
| esk2_0 != identity_relation(esk1_0) )
& ( relation_dom(esk2_0) = esk1_0
| esk2_0 = identity_relation(esk1_0) )
& ( ~ in(X8,esk1_0)
| apply(esk2_0,X8) = X8
| esk2_0 = identity_relation(esk1_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_14])])])])]) ).
fof(c_0_19,plain,
! [X39] :
( relation_dom(identity_relation(X39)) = X39
& relation_rng(identity_relation(X39)) = X39 ),
inference(variable_rename,[status(thm)],[t71_relat_1]) ).
cnf(c_0_20,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( X1 = identity_relation(X2)
| in(unordered_pair(singleton(esk4_2(X2,X1)),unordered_pair(esk5_2(X2,X1),esk4_2(X2,X1))),X1)
| in(esk4_2(X2,X1),X2)
| ~ relation(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_12]) ).
cnf(c_0_22,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
relation_dom(identity_relation(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( relation_dom(esk2_0) = esk1_0
| esk2_0 = identity_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ! [X2,X3] :
( ( in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> in(ordered_pair(X2,X3),X1) ) )
& ( ~ in(X2,relation_dom(X1))
=> ( X3 = apply(X1,X2)
<=> X3 = empty_set ) ) ) ),
inference(fof_simplification,[status(thm)],[d4_funct_1]) ).
cnf(c_0_26,plain,
( in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X3,X1)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( identity_relation(X1) = esk2_0
| in(unordered_pair(singleton(esk4_2(X1,esk2_0)),unordered_pair(esk5_2(X1,esk2_0),esk4_2(X1,esk2_0))),esk2_0)
| in(esk4_2(X1,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,negated_conjecture,
relation_dom(esk2_0) = esk1_0,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( X1 = apply(X2,X3)
| ~ in(ordered_pair(X3,X1),X2)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( esk4_2(X1,X2) = esk5_2(X1,X2)
| in(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X2)
| X2 = identity_relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_32,plain,
! [X9,X10,X11] :
( ( X11 != apply(X9,X10)
| in(ordered_pair(X10,X11),X9)
| ~ in(X10,relation_dom(X9))
| ~ relation(X9)
| ~ function(X9) )
& ( ~ in(ordered_pair(X10,X11),X9)
| X11 = apply(X9,X10)
| ~ in(X10,relation_dom(X9))
| ~ relation(X9)
| ~ function(X9) )
& ( X11 != apply(X9,X10)
| X11 = empty_set
| in(X10,relation_dom(X9))
| ~ relation(X9)
| ~ function(X9) )
& ( X11 != empty_set
| X11 = apply(X9,X10)
| in(X10,relation_dom(X9))
| ~ relation(X9)
| ~ function(X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_33,negated_conjecture,
( identity_relation(X1) = esk2_0
| in(esk4_2(X1,esk2_0),esk1_0)
| in(esk4_2(X1,esk2_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_22]),c_0_29])]) ).
cnf(c_0_34,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2) ),
inference(rw,[status(thm)],[c_0_30,c_0_16]) ).
cnf(c_0_35,plain,
( esk4_2(X1,X2) = esk5_2(X1,X2)
| X2 = identity_relation(X1)
| in(unordered_pair(singleton(esk4_2(X1,X2)),unordered_pair(esk5_2(X1,X2),esk4_2(X1,X2))),X2)
| ~ relation(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_16]),c_0_12]) ).
cnf(c_0_36,plain,
( in(ordered_pair(X3,X1),X2)
| X1 != apply(X2,X3)
| ~ in(X3,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( apply(esk2_0,X1) = X1
| esk2_0 = identity_relation(esk1_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_38,negated_conjecture,
( identity_relation(esk1_0) = esk2_0
| in(esk4_2(esk1_0,esk2_0),esk1_0) ),
inference(ef,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( X1 = apply(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X1,X3)),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
( esk4_2(X1,esk2_0) = esk5_2(X1,esk2_0)
| identity_relation(X1) = esk2_0
| in(unordered_pair(singleton(esk4_2(X1,esk2_0)),unordered_pair(esk5_2(X1,esk2_0),esk4_2(X1,esk2_0))),esk2_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_41,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,apply(X2,X1))),X2)
| ~ relation(X2)
| ~ function(X2)
| ~ in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_16])]) ).
cnf(c_0_42,negated_conjecture,
( apply(esk2_0,esk4_2(esk1_0,esk2_0)) = esk4_2(esk1_0,esk2_0)
| identity_relation(esk1_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( apply(esk2_0,esk4_2(X1,esk2_0)) = esk5_2(X1,esk2_0)
| esk4_2(X1,esk2_0) = esk5_2(X1,esk2_0)
| identity_relation(X1) = esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_22]),c_0_29])]) ).
cnf(c_0_44,negated_conjecture,
( in(unordered_pair(singleton(X1),unordered_pair(X1,apply(esk2_0,X1))),esk2_0)
| ~ in(X1,esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_22]),c_0_29])]) ).
cnf(c_0_45,negated_conjecture,
( esk4_2(X1,esk2_0) = esk5_2(X1,esk2_0)
| identity_relation(X1) = esk2_0
| in(esk4_2(X1,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_28]),c_0_22]),c_0_29])]) ).
cnf(c_0_46,plain,
( X2 = identity_relation(X1)
| ~ in(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X2)
| ~ in(esk4_2(X1,X2),X1)
| esk4_2(X1,X2) != esk5_2(X1,X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,negated_conjecture,
( esk4_2(esk1_0,esk2_0) = esk5_2(esk1_0,esk2_0)
| identity_relation(esk1_0) = esk2_0 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
( identity_relation(esk1_0) = esk2_0
| in(unordered_pair(singleton(esk4_2(esk1_0,esk2_0)),unordered_pair(esk4_2(esk1_0,esk2_0),apply(esk2_0,esk4_2(esk1_0,esk2_0)))),esk2_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
( apply(esk2_0,esk4_2(X1,esk2_0)) = esk4_2(X1,esk2_0)
| esk4_2(X1,esk2_0) = esk5_2(X1,esk2_0)
| identity_relation(esk1_0) = esk2_0
| identity_relation(X1) = esk2_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_50,plain,
( X1 = identity_relation(X2)
| esk4_2(X2,X1) != esk5_2(X2,X1)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk4_2(X2,X1)),unordered_pair(esk5_2(X2,X1),esk4_2(X2,X1))),X1)
| ~ in(esk4_2(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_16]),c_0_12]) ).
cnf(c_0_51,negated_conjecture,
( identity_relation(esk1_0) = esk2_0
| in(esk5_2(esk1_0,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_47]) ).
fof(c_0_52,plain,
! [X40] : relation(identity_relation(X40)),
inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).
cnf(c_0_53,negated_conjecture,
( in(esk3_0,esk1_0)
| relation_dom(esk2_0) != esk1_0
| esk2_0 != identity_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_54,negated_conjecture,
( identity_relation(esk1_0) = esk2_0
| in(unordered_pair(singleton(esk4_2(esk1_0,esk2_0)),unordered_pair(esk4_2(esk1_0,esk2_0),esk4_2(esk1_0,esk2_0))),esk2_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_42]) ).
cnf(c_0_55,negated_conjecture,
( esk4_2(X1,esk2_0) = esk5_2(X1,esk2_0)
| identity_relation(esk1_0) = esk2_0
| identity_relation(X1) = esk2_0 ),
inference(spm,[status(thm)],[c_0_49,c_0_43]) ).
cnf(c_0_56,negated_conjecture,
( identity_relation(esk1_0) = esk2_0
| ~ in(unordered_pair(singleton(esk5_2(esk1_0,esk2_0)),unordered_pair(esk5_2(esk1_0,esk2_0),esk5_2(esk1_0,esk2_0))),esk2_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_47]),c_0_22])]),c_0_51]) ).
cnf(c_0_57,plain,
( in(ordered_pair(X1,X3),X4)
| ~ in(X1,X2)
| X1 != X3
| X4 != identity_relation(X2)
| ~ relation(X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_58,plain,
relation(identity_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( in(esk3_0,esk1_0)
| identity_relation(esk1_0) != esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_28])]) ).
cnf(c_0_60,negated_conjecture,
identity_relation(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
( apply(esk2_0,esk3_0) != esk3_0
| relation_dom(esk2_0) != esk1_0
| esk2_0 != identity_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_62,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X1)),identity_relation(X2))
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_16])])]),c_0_58])]) ).
cnf(c_0_63,negated_conjecture,
in(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_64,negated_conjecture,
( apply(esk2_0,esk3_0) != esk3_0
| identity_relation(esk1_0) != esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_28])]) ).
cnf(c_0_65,negated_conjecture,
in(unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk3_0)),esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
apply(esk2_0,esk3_0) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_60])]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_65]),c_0_22]),c_0_29])]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU216+3 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 09:06:59 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 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.3nP8xDjAj7/E---3.1_25901.p
% 0.18/0.66 # Version: 3.1pre001
% 0.18/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.66 # Starting sh5l with 300s (1) cores
% 0.18/0.66 # sh5l with pid 25981 completed with status 0
% 0.18/0.66 # Result found by sh5l
% 0.18/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.66 # Starting sh5l with 300s (1) cores
% 0.18/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.66 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.66 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.18/0.66 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 25985 completed with status 0
% 0.18/0.66 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 0.18/0.66 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.66 # Starting sh5l with 300s (1) cores
% 0.18/0.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.66 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.18/0.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.66 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.18/0.66 # Preprocessing time : 0.003 s
% 0.18/0.66
% 0.18/0.66 # Proof found!
% 0.18/0.66 # SZS status Theorem
% 0.18/0.66 # SZS output start CNFRefutation
% See solution above
% 0.18/0.66 # Parsed axioms : 41
% 0.18/0.66 # Removed by relevancy pruning/SinE : 0
% 0.18/0.66 # Initial clauses : 70
% 0.18/0.66 # Removed in clause preprocessing : 0
% 0.18/0.66 # Initial clauses in saturation : 70
% 0.18/0.66 # Processed clauses : 1712
% 0.18/0.66 # ...of these trivial : 9
% 0.18/0.66 # ...subsumed : 996
% 0.18/0.66 # ...remaining for further processing : 707
% 0.18/0.66 # Other redundant clauses eliminated : 8
% 0.18/0.66 # Clauses deleted for lack of memory : 0
% 0.18/0.66 # Backward-subsumed : 20
% 0.18/0.66 # Backward-rewritten : 107
% 0.18/0.66 # Generated clauses : 7830
% 0.18/0.66 # ...of the previous two non-redundant : 7113
% 0.18/0.66 # ...aggressively subsumed : 0
% 0.18/0.66 # Contextual simplify-reflections : 10
% 0.18/0.66 # Paramodulations : 7813
% 0.18/0.66 # Factorizations : 8
% 0.18/0.66 # NegExts : 0
% 0.18/0.66 # Equation resolutions : 8
% 0.18/0.66 # Total rewrite steps : 3397
% 0.18/0.66 # Propositional unsat checks : 0
% 0.18/0.66 # Propositional check models : 0
% 0.18/0.66 # Propositional check unsatisfiable : 0
% 0.18/0.66 # Propositional clauses : 0
% 0.18/0.66 # Propositional clauses after purity: 0
% 0.18/0.66 # Propositional unsat core size : 0
% 0.18/0.66 # Propositional preprocessing time : 0.000
% 0.18/0.66 # Propositional encoding time : 0.000
% 0.18/0.66 # Propositional solver time : 0.000
% 0.18/0.66 # Success case prop preproc time : 0.000
% 0.18/0.66 # Success case prop encoding time : 0.000
% 0.18/0.66 # Success case prop solver time : 0.000
% 0.18/0.66 # Current number of processed clauses : 571
% 0.18/0.66 # Positive orientable unit clauses : 64
% 0.18/0.66 # Positive unorientable unit clauses: 1
% 0.18/0.66 # Negative unit clauses : 20
% 0.18/0.66 # Non-unit-clauses : 486
% 0.18/0.66 # Current number of unprocessed clauses: 5394
% 0.18/0.66 # ...number of literals in the above : 16028
% 0.18/0.66 # Current number of archived formulas : 0
% 0.18/0.66 # Current number of archived clauses : 129
% 0.18/0.66 # Clause-clause subsumption calls (NU) : 33319
% 0.18/0.66 # Rec. Clause-clause subsumption calls : 19757
% 0.18/0.66 # Non-unit clause-clause subsumptions : 853
% 0.18/0.66 # Unit Clause-clause subsumption calls : 989
% 0.18/0.66 # Rewrite failures with RHS unbound : 0
% 0.18/0.66 # BW rewrite match attempts : 90
% 0.18/0.66 # BW rewrite match successes : 15
% 0.18/0.66 # Condensation attempts : 0
% 0.18/0.66 # Condensation successes : 0
% 0.18/0.66 # Termbank termtop insertions : 188853
% 0.18/0.66
% 0.18/0.66 # -------------------------------------------------
% 0.18/0.66 # User time : 0.164 s
% 0.18/0.66 # System time : 0.007 s
% 0.18/0.66 # Total time : 0.171 s
% 0.18/0.66 # Maximum resident set size: 1876 pages
% 0.18/0.66
% 0.18/0.66 # -------------------------------------------------
% 0.18/0.66 # User time : 0.166 s
% 0.18/0.66 # System time : 0.008 s
% 0.18/0.66 # Total time : 0.174 s
% 0.18/0.66 # Maximum resident set size: 1732 pages
% 0.18/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------