TSTP Solution File: SEU028+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU028+1 : 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:14 EDT 2023
% Result : Theorem 8.51s 1.60s
% Output : CNFRefutation 8.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 60 ( 13 unt; 0 def)
% Number of atoms : 239 ( 63 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 304 ( 125 ~; 126 |; 35 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 1 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn; 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t61_funct_1,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1))
& relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',t61_funct_1) ).
fof(t34_funct_1,axiom,
! [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.MMWuCJpryc/E---3.1_2560.p',t34_funct_1) ).
fof(t58_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(relation_composition(X1,function_inverse(X1))) = relation_dom(X1)
& relation_rng(relation_composition(X1,function_inverse(X1))) = relation_dom(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',t58_funct_1) ).
fof(fc1_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1)
& relation(X2)
& function(X2) )
=> ( relation(relation_composition(X1,X2))
& function(relation_composition(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',fc1_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( relation(function_inverse(X1))
& function(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',dt_k2_funct_1) ).
fof(dt_k5_relat_1,axiom,
! [X1,X2] :
( ( relation(X1)
& relation(X2) )
=> relation(relation_composition(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',dt_k5_relat_1) ).
fof(t56_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X2)
& in(X1,relation_dom(X2)) )
=> ( X1 = apply(function_inverse(X2),apply(X2,X1))
& X1 = apply(relation_composition(X2,function_inverse(X2)),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',t56_funct_1) ).
fof(t59_funct_1,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(relation_composition(function_inverse(X1),X1)) = relation_rng(X1)
& relation_rng(relation_composition(function_inverse(X1),X1)) = relation_rng(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',t59_funct_1) ).
fof(t57_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ( ( one_to_one(X2)
& in(X1,relation_rng(X2)) )
=> ( X1 = apply(X2,apply(function_inverse(X2),X1))
& X1 = apply(relation_composition(function_inverse(X2),X2),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MMWuCJpryc/E---3.1_2560.p',t57_funct_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( one_to_one(X1)
=> ( relation_composition(X1,function_inverse(X1)) = identity_relation(relation_dom(X1))
& relation_composition(function_inverse(X1),X1) = identity_relation(relation_rng(X1)) ) ) ),
inference(assume_negation,[status(cth)],[t61_funct_1]) ).
fof(c_0_10,plain,
! [X7,X8,X9] :
( ( relation_dom(X8) = X7
| X8 != identity_relation(X7)
| ~ relation(X8)
| ~ function(X8) )
& ( ~ in(X9,X7)
| apply(X8,X9) = X9
| X8 != identity_relation(X7)
| ~ relation(X8)
| ~ function(X8) )
& ( in(esk2_2(X7,X8),X7)
| relation_dom(X8) != X7
| X8 = identity_relation(X7)
| ~ relation(X8)
| ~ function(X8) )
& ( apply(X8,esk2_2(X7,X8)) != esk2_2(X7,X8)
| relation_dom(X8) != X7
| X8 = identity_relation(X7)
| ~ relation(X8)
| ~ function(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_funct_1])])])])]) ).
fof(c_0_11,plain,
! [X15] :
( ( relation_dom(relation_composition(X15,function_inverse(X15))) = relation_dom(X15)
| ~ one_to_one(X15)
| ~ relation(X15)
| ~ function(X15) )
& ( relation_rng(relation_composition(X15,function_inverse(X15))) = relation_dom(X15)
| ~ one_to_one(X15)
| ~ relation(X15)
| ~ function(X15) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t58_funct_1])])]) ).
fof(c_0_12,negated_conjecture,
( relation(esk1_0)
& function(esk1_0)
& one_to_one(esk1_0)
& ( relation_composition(esk1_0,function_inverse(esk1_0)) != identity_relation(relation_dom(esk1_0))
| relation_composition(function_inverse(esk1_0),esk1_0) != identity_relation(relation_rng(esk1_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,plain,
! [X21,X22] :
( ( relation(relation_composition(X21,X22))
| ~ relation(X21)
| ~ function(X21)
| ~ relation(X22)
| ~ function(X22) )
& ( function(relation_composition(X21,X22))
| ~ relation(X21)
| ~ function(X21)
| ~ relation(X22)
| ~ function(X22) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_funct_1])])]) ).
fof(c_0_14,plain,
! [X27] :
( ( relation(function_inverse(X27))
| ~ relation(X27)
| ~ function(X27) )
& ( function(function_inverse(X27))
| ~ relation(X27)
| ~ function(X27) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])]) ).
cnf(c_0_15,plain,
( in(esk2_2(X1,X2),X1)
| X2 = identity_relation(X1)
| relation_dom(X2) != X1
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( relation_dom(relation_composition(X1,function_inverse(X1))) = relation_dom(X1)
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
one_to_one(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
function(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( function(relation_composition(X1,X2))
| ~ relation(X1)
| ~ function(X1)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( relation(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( function(function_inverse(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( identity_relation(relation_dom(X1)) = X1
| in(esk2_2(relation_dom(X1),X1),relation_dom(X1))
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
relation_dom(relation_composition(esk1_0,function_inverse(esk1_0))) = relation_dom(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
fof(c_0_25,plain,
! [X17,X18] :
( ~ relation(X17)
| ~ relation(X18)
| relation(relation_composition(X17,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_relat_1])]) ).
cnf(c_0_26,plain,
( function(relation_composition(X1,function_inverse(X2)))
| ~ relation(X1)
| ~ relation(X2)
| ~ function(X1)
| ~ function(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| in(esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0))),relation_dom(esk1_0))
| ~ relation(relation_composition(esk1_0,function_inverse(esk1_0)))
| ~ function(relation_composition(esk1_0,function_inverse(esk1_0))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( relation(relation_composition(X1,X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( X1 = identity_relation(X2)
| apply(X1,esk2_2(X2,X1)) != esk2_2(X2,X1)
| relation_dom(X1) != X2
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,negated_conjecture,
( function(relation_composition(esk1_0,function_inverse(X1)))
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| in(esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0))),relation_dom(esk1_0))
| ~ relation(function_inverse(esk1_0))
| ~ function(relation_composition(esk1_0,function_inverse(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18])]) ).
cnf(c_0_32,plain,
( identity_relation(relation_dom(X1)) = X1
| apply(X1,esk2_2(relation_dom(X1),X1)) != esk2_2(relation_dom(X1),X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
function(relation_composition(esk1_0,function_inverse(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_19])]) ).
fof(c_0_34,plain,
! [X25,X26] :
( ( X25 = apply(function_inverse(X26),apply(X26,X25))
| ~ one_to_one(X26)
| ~ in(X25,relation_dom(X26))
| ~ relation(X26)
| ~ function(X26) )
& ( X25 = apply(relation_composition(X26,function_inverse(X26)),X25)
| ~ one_to_one(X26)
| ~ in(X25,relation_dom(X26))
| ~ relation(X26)
| ~ function(X26) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t56_funct_1])])]) ).
cnf(c_0_35,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| in(esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0))),relation_dom(esk1_0))
| ~ function(relation_composition(esk1_0,function_inverse(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_18]),c_0_19])]) ).
cnf(c_0_36,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| apply(relation_composition(esk1_0,function_inverse(esk1_0)),esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0)))) != esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0)))
| ~ relation(relation_composition(esk1_0,function_inverse(esk1_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_33])]) ).
cnf(c_0_37,plain,
( X1 = apply(relation_composition(X2,function_inverse(X2)),X1)
| ~ one_to_one(X2)
| ~ in(X1,relation_dom(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| in(esk2_2(relation_dom(esk1_0),relation_composition(esk1_0,function_inverse(esk1_0))),relation_dom(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| ~ relation(relation_composition(esk1_0,function_inverse(esk1_0))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_17]),c_0_18]),c_0_19])]),c_0_38]) ).
fof(c_0_40,plain,
! [X16] :
( ( relation_dom(relation_composition(function_inverse(X16),X16)) = relation_rng(X16)
| ~ one_to_one(X16)
| ~ relation(X16)
| ~ function(X16) )
& ( relation_rng(relation_composition(function_inverse(X16),X16)) = relation_rng(X16)
| ~ one_to_one(X16)
| ~ relation(X16)
| ~ function(X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t59_funct_1])])]) ).
cnf(c_0_41,negated_conjecture,
( function(relation_composition(X1,esk1_0))
| ~ relation(X1)
| ~ function(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19])]) ).
cnf(c_0_42,negated_conjecture,
( identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0))
| ~ relation(function_inverse(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_28]),c_0_18])]) ).
cnf(c_0_43,plain,
( relation_dom(relation_composition(function_inverse(X1),X1)) = relation_rng(X1)
| ~ one_to_one(X1)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( function(relation_composition(function_inverse(X1),esk1_0))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_21]),c_0_22]) ).
cnf(c_0_45,negated_conjecture,
( relation_composition(esk1_0,function_inverse(esk1_0)) != identity_relation(relation_dom(esk1_0))
| relation_composition(function_inverse(esk1_0),esk1_0) != identity_relation(relation_rng(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_46,negated_conjecture,
identity_relation(relation_dom(esk1_0)) = relation_composition(esk1_0,function_inverse(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_21]),c_0_18]),c_0_19])]) ).
cnf(c_0_47,negated_conjecture,
relation_dom(relation_composition(function_inverse(esk1_0),esk1_0)) = relation_rng(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_48,negated_conjecture,
function(relation_composition(function_inverse(esk1_0),esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_18]),c_0_19])]) ).
cnf(c_0_49,negated_conjecture,
identity_relation(relation_rng(esk1_0)) != relation_composition(function_inverse(esk1_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
fof(c_0_50,plain,
! [X13,X14] :
( ( X13 = apply(X14,apply(function_inverse(X14),X13))
| ~ one_to_one(X14)
| ~ in(X13,relation_rng(X14))
| ~ relation(X14)
| ~ function(X14) )
& ( X13 = apply(relation_composition(function_inverse(X14),X14),X13)
| ~ one_to_one(X14)
| ~ in(X13,relation_rng(X14))
| ~ relation(X14)
| ~ function(X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t57_funct_1])])]) ).
cnf(c_0_51,negated_conjecture,
( identity_relation(relation_rng(esk1_0)) = relation_composition(function_inverse(esk1_0),esk1_0)
| in(esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0)),relation_rng(esk1_0))
| ~ relation(relation_composition(function_inverse(esk1_0),esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_47]),c_0_48])]) ).
cnf(c_0_52,negated_conjecture,
( apply(relation_composition(function_inverse(esk1_0),esk1_0),esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0))) != esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0))
| ~ relation(relation_composition(function_inverse(esk1_0),esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_48])]),c_0_49]) ).
cnf(c_0_53,plain,
( X1 = apply(relation_composition(function_inverse(X2),X2),X1)
| ~ one_to_one(X2)
| ~ in(X1,relation_rng(X2))
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( identity_relation(relation_rng(esk1_0)) = relation_composition(function_inverse(esk1_0),esk1_0)
| in(esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0)),relation_rng(esk1_0))
| ~ relation(function_inverse(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_28]),c_0_18])]) ).
cnf(c_0_55,negated_conjecture,
( ~ relation(relation_composition(function_inverse(esk1_0),esk1_0))
| ~ in(esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0)),relation_rng(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_56,negated_conjecture,
in(esk2_2(relation_rng(esk1_0),relation_composition(function_inverse(esk1_0),esk1_0)),relation_rng(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_21]),c_0_18]),c_0_19])]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
~ relation(relation_composition(function_inverse(esk1_0),esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_58,negated_conjecture,
~ relation(function_inverse(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_28]),c_0_18])]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_21]),c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU028+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.20/0.34 % WCLimit : 300
% 0.20/0.34 % DateTime : Mon Oct 2 09:38:59 EDT 2023
% 0.20/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.MMWuCJpryc/E---3.1_2560.p
% 8.51/1.60 # Version: 3.1pre001
% 8.51/1.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.51/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.51/1.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.51/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.51/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.51/1.60 # Starting sh5l with 300s (1) cores
% 8.51/1.60 # sh5l with pid 2676 completed with status 0
% 8.51/1.60 # Result found by sh5l
% 8.51/1.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.51/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.51/1.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.51/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.51/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.51/1.60 # Starting sh5l with 300s (1) cores
% 8.51/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.51/1.60 # Search class: FGHSM-FFMM21-MFFFFFNN
% 8.51/1.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 8.51/1.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 163s (1) cores
% 8.51/1.60 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 2679 completed with status 0
% 8.51/1.60 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 8.51/1.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 8.51/1.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.51/1.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.51/1.60 # Starting new_bool_3 with 300s (1) cores
% 8.51/1.60 # Starting new_bool_1 with 300s (1) cores
% 8.51/1.60 # Starting sh5l with 300s (1) cores
% 8.51/1.60 # SinE strategy is gf500_gu_R04_F100_L20000
% 8.51/1.60 # Search class: FGHSM-FFMM21-MFFFFFNN
% 8.51/1.60 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 8.51/1.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 163s (1) cores
% 8.51/1.60 # Preprocessing time : 0.002 s
% 8.51/1.60 # Presaturation interreduction done
% 8.51/1.60
% 8.51/1.60 # Proof found!
% 8.51/1.60 # SZS status Theorem
% 8.51/1.60 # SZS output start CNFRefutation
% See solution above
% 8.51/1.60 # Parsed axioms : 45
% 8.51/1.60 # Removed by relevancy pruning/SinE : 5
% 8.51/1.60 # Initial clauses : 69
% 8.51/1.60 # Removed in clause preprocessing : 2
% 8.51/1.60 # Initial clauses in saturation : 67
% 8.51/1.60 # Processed clauses : 7360
% 8.51/1.60 # ...of these trivial : 359
% 8.51/1.60 # ...subsumed : 4154
% 8.51/1.60 # ...remaining for further processing : 2847
% 8.51/1.60 # Other redundant clauses eliminated : 4
% 8.51/1.60 # Clauses deleted for lack of memory : 0
% 8.51/1.60 # Backward-subsumed : 636
% 8.51/1.60 # Backward-rewritten : 247
% 8.51/1.60 # Generated clauses : 96227
% 8.51/1.60 # ...of the previous two non-redundant : 81543
% 8.51/1.60 # ...aggressively subsumed : 0
% 8.51/1.60 # Contextual simplify-reflections : 290
% 8.51/1.60 # Paramodulations : 96223
% 8.51/1.60 # Factorizations : 0
% 8.51/1.60 # NegExts : 0
% 8.51/1.60 # Equation resolutions : 4
% 8.51/1.60 # Total rewrite steps : 42720
% 8.51/1.60 # Propositional unsat checks : 0
% 8.51/1.60 # Propositional check models : 0
% 8.51/1.60 # Propositional check unsatisfiable : 0
% 8.51/1.60 # Propositional clauses : 0
% 8.51/1.60 # Propositional clauses after purity: 0
% 8.51/1.60 # Propositional unsat core size : 0
% 8.51/1.60 # Propositional preprocessing time : 0.000
% 8.51/1.60 # Propositional encoding time : 0.000
% 8.51/1.60 # Propositional solver time : 0.000
% 8.51/1.60 # Success case prop preproc time : 0.000
% 8.51/1.60 # Success case prop encoding time : 0.000
% 8.51/1.60 # Success case prop solver time : 0.000
% 8.51/1.60 # Current number of processed clauses : 1895
% 8.51/1.60 # Positive orientable unit clauses : 492
% 8.51/1.60 # Positive unorientable unit clauses: 0
% 8.51/1.60 # Negative unit clauses : 18
% 8.51/1.60 # Non-unit-clauses : 1385
% 8.51/1.60 # Current number of unprocessed clauses: 73266
% 8.51/1.60 # ...number of literals in the above : 328552
% 8.51/1.60 # Current number of archived formulas : 0
% 8.51/1.60 # Current number of archived clauses : 948
% 8.51/1.60 # Clause-clause subsumption calls (NU) : 564863
% 8.51/1.60 # Rec. Clause-clause subsumption calls : 419101
% 8.51/1.60 # Non-unit clause-clause subsumptions : 3420
% 8.51/1.60 # Unit Clause-clause subsumption calls : 67861
% 8.51/1.60 # Rewrite failures with RHS unbound : 0
% 8.51/1.60 # BW rewrite match attempts : 35888
% 8.51/1.60 # BW rewrite match successes : 225
% 8.51/1.60 # Condensation attempts : 0
% 8.51/1.60 # Condensation successes : 0
% 8.51/1.60 # Termbank termtop insertions : 1541260
% 8.51/1.60
% 8.51/1.60 # -------------------------------------------------
% 8.51/1.60 # User time : 0.963 s
% 8.51/1.60 # System time : 0.038 s
% 8.51/1.60 # Total time : 1.002 s
% 8.51/1.60 # Maximum resident set size: 1864 pages
% 8.51/1.60
% 8.51/1.60 # -------------------------------------------------
% 8.51/1.60 # User time : 0.966 s
% 8.51/1.60 # System time : 0.040 s
% 8.51/1.60 # Total time : 1.005 s
% 8.51/1.60 # Maximum resident set size: 1732 pages
% 8.51/1.60 % E---3.1 exiting
%------------------------------------------------------------------------------