%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET996+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:15:55 PM UTC 2026
% Result : Theorem 0.26s 0.61s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 91 ( 24 unt; 0 def)
% Number of atoms : 261 ( 61 equ)
% Maximal formula atoms : 32 ( 2 avg)
% Number of connectives : 302 ( 132 ~; 117 |; 35 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 149 ( 12 sgn 62 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_funct_1,conjecture,
! [X1,X2] :
~ ( ! [X3] :
( ( function(X3)
& relation(X3) )
=> ~ ( subset(relation_rng(X3),X1)
& X2 = relation_dom(X3) ) )
& ~ ( X2 != empty_set
& X1 = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_funct_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_funct_1) ).
fof(s3_funct_1__e4_16_2__funct_1,axiom,
! [X1,X2,X3] :
( element(X3,X1)
=> ? [X4] :
( ! [X5] :
( in(X5,X2)
=> apply(X4,X5) = X3 )
& relation_dom(X4) = X2
& function(X4)
& relation(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s3_funct_1__e4_16_2__funct_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(rc1_relat_1,axiom,
? [X1] :
( relation(X1)
& empty(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_relat_1) ).
fof(fc5_relat_1,axiom,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc5_relat_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(fc8_relat_1,axiom,
! [X1] :
( empty(X1)
=> ( relation(relation_rng(X1))
& empty(relation_rng(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc8_relat_1) ).
fof(cc1_funct_1,axiom,
! [X1] :
( empty(X1)
=> function(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_funct_1) ).
fof(cc1_relat_1,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc1_relat_1) ).
fof(c_0_16,negated_conjecture,
~ ! [X1,X2] :
~ ( ! [X3] :
( ( function(X3)
& relation(X3) )
=> ~ ( subset(relation_rng(X3),X1)
& X2 = relation_dom(X3) ) )
& ~ ( X2 != empty_set
& X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t18_funct_1]) ).
fof(c_0_17,plain,
! [X65] :
( X65 = empty_set
| ~ empty(X65) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_18,plain,
empty(esk9_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_19,plain,
! [X16,X17,X18,X20,X21,X22,X24] :
( ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| in(esk3_2(X16,X22),X22)
| esk3_2(X16,X22) = apply(X16,esk4_2(X16,X22)) )
& ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| in(esk3_2(X16,X22),X22)
| in(esk4_2(X16,X22),relation_dom(X16)) )
& ( ~ function(X16)
| ~ relation(X16)
| X22 = relation_rng(X16)
| esk3_2(X16,X22) != apply(X16,X24)
| ~ in(X24,relation_dom(X16))
| ~ in(esk3_2(X16,X22),X22) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| in(X20,X17)
| X20 != apply(X16,X21)
| ~ in(X21,relation_dom(X16)) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| ~ in(X18,X17)
| X18 = apply(X16,esk2_3(X16,X17,X18)) )
& ( ~ function(X16)
| ~ relation(X16)
| X17 != relation_rng(X16)
| ~ in(X18,X17)
| in(esk2_3(X16,X17,X18),relation_dom(X16)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_funct_1])])])])])])]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
~ ( ! [X3] :
( ( function(X3)
& relation(X3) )
=> ~ ( subset(relation_rng(X3),X1)
& X2 = relation_dom(X3) ) )
& ~ ( X2 != empty_set
& X1 = empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_23,plain,
! [X44,X45,X46,X48] :
( ( ~ element(X46,X44)
| apply(esk14_3(X44,X45,X46),X48) = X46
| ~ in(X48,X45) )
& ( ~ element(X46,X44)
| relation_dom(esk14_3(X44,X45,X46)) = X45 )
& ( ~ element(X46,X44)
| function(esk14_3(X44,X45,X46)) )
& ( ~ element(X46,X44)
| relation(esk14_3(X44,X45,X46)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[s3_funct_1__e4_16_2__funct_1])])])])])]) ).
cnf(c_0_24,plain,
( ~ function(X2)
| ~ relation(X2)
| X3 != relation_rng(X2)
| ~ in(X1,X3)
| X1 = apply(X2,esk2_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ function(X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(X3,X2)
| in(esk2_3(X1,X2,X3),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,negated_conjecture,
! [X51] :
( ( ~ subset(relation_rng(X51),esk15_0)
| esk16_0 != relation_dom(X51)
| ~ function(X51)
| ~ relation(X51) )
& ( esk16_0 = empty_set
| esk15_0 != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).
fof(c_0_27,plain,
! [X10,X11,X12,X13,X14] :
( ( subset(X13,X14)
| ~ in(esk1_2(X13,X14),X14) )
& ( subset(X13,X14)
| in(esk1_2(X13,X14),X13) )
& ( in(X12,X11)
| ~ in(X12,X10)
| ~ subset(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])]) ).
cnf(c_0_28,plain,
empty_set = esk9_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_29,plain,
( relation(esk7_0)
& empty(esk7_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_30,plain,
! [X1] :
( ( relation(X1)
& ~ empty(X1) )
=> ~ empty(relation_dom(X1)) ),
inference(fof_simplification,[status(thm)],[fc5_relat_1]) ).
cnf(c_0_31,plain,
( ~ element(X4,X3)
| ~ in(X1,X2)
| apply(esk14_3(X3,X2,X4),X1) = X4 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( ~ in(X2,relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| apply(X1,esk2_3(X1,relation_rng(X1),X2)) = X2 ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( ~ element(X3,X1)
| function(esk14_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( ~ element(X3,X1)
| relation(esk14_3(X1,X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( ~ in(X2,relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| in(esk2_3(X1,relation_rng(X1),X2),relation_dom(X1)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( ~ element(X3,X1)
| relation_dom(esk14_3(X1,X2,X3)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_37,negated_conjecture,
( ~ subset(relation_rng(X1),esk15_0)
| esk16_0 != relation_dom(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( ~ empty(X1)
| X1 = esk9_0 ),
inference(rw,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_40,plain,
empty(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_41,plain,
! [X29] :
( ~ empty(relation_dom(X29))
| ~ relation(X29)
| empty(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
fof(c_0_42,plain,
! [X56] : subset(empty_set,X56),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_43,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_44,plain,
( ~ in(X1,relation_rng(esk14_3(X3,X4,X2)))
| ~ in(esk2_3(esk14_3(X3,X4,X2),relation_rng(esk14_3(X3,X4,X2)),X1),X4)
| ~ element(X2,X3)
| X1 = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_45,plain,
( ~ in(X4,relation_rng(esk14_3(X1,X2,X3)))
| ~ element(X3,X1)
| in(esk2_3(esk14_3(X1,X2,X3),relation_rng(esk14_3(X1,X2,X3)),X4),X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]),c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != esk16_0
| in(esk1_2(relation_rng(X1),esk15_0),relation_rng(X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,plain,
esk9_0 = esk7_0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( ~ empty(relation_dom(X1))
| ~ relation(X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
( ~ in(esk1_2(relation_rng(X1),esk15_0),esk15_0)
| ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != esk16_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
cnf(c_0_51,plain,
( ~ in(X1,relation_rng(esk14_3(X3,X4,X2)))
| ~ element(X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ element(X2,X1)
| in(esk1_2(relation_rng(esk14_3(X1,esk16_0,X2)),esk15_0),relation_rng(esk14_3(X1,esk16_0,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_36])]),c_0_33]),c_0_34]) ).
fof(c_0_53,plain,
! [X54,X55] :
( in(X54,X55)
| empty(X55)
| ~ element(X54,X55) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
fof(c_0_54,plain,
! [X26] : element(esk5_1(X26),X26),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_55,plain,
( ~ empty(X1)
| X1 = esk7_0 ),
inference(rw,[status(thm)],[c_0_39,c_0_47]) ).
cnf(c_0_56,plain,
( ~ empty(X2)
| ~ element(X3,X1)
| empty(esk14_3(X1,X2,X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_36]),c_0_34]) ).
fof(c_0_57,plain,
! [X57,X58] :
( ( element(X57,powerset(X58))
| ~ subset(X57,X58) )
& ( subset(X57,X58)
| ~ element(X57,powerset(X58)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_58,plain,
subset(esk9_0,X1),
inference(rw,[status(thm)],[c_0_49,c_0_28]) ).
cnf(c_0_59,negated_conjecture,
( ~ in(esk1_2(relation_rng(esk14_3(X2,esk16_0,X1)),esk15_0),esk15_0)
| ~ element(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36])]),c_0_33]),c_0_34]) ).
cnf(c_0_60,negated_conjecture,
( ~ element(X2,X1)
| esk1_2(relation_rng(esk14_3(X1,esk16_0,X2)),esk15_0) = X2 ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_61,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
fof(c_0_63,plain,
! [X43] : subset(X43,X43),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_64,plain,
! [X32] :
( ( ~ empty(X32)
| relation(relation_rng(X32)) )
& ( ~ empty(X32)
| empty(relation_rng(X32)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc8_relat_1])])])]) ).
cnf(c_0_65,plain,
( ~ empty(X2)
| ~ element(X3,X1)
| esk14_3(X1,X2,X3) = esk7_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_67,plain,
subset(esk7_0,X1),
inference(rw,[status(thm)],[c_0_58,c_0_47]) ).
cnf(c_0_68,negated_conjecture,
( ~ in(X1,esk15_0)
| ~ element(X1,X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,plain,
( in(esk5_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_70,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,plain,
( ~ empty(X1)
| empty(relation_rng(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
fof(c_0_72,plain,
! [X8] :
( function(X8)
| ~ empty(X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_funct_1])])]) ).
fof(c_0_73,plain,
! [X9] :
( relation(X9)
| ~ empty(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relat_1])])]) ).
cnf(c_0_74,plain,
( ~ empty(X1)
| ~ element(X2,X3)
| relation_dom(esk7_0) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_65]) ).
cnf(c_0_75,plain,
element(esk7_0,powerset(X1)),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
( esk15_0 != empty_set
| esk16_0 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_77,negated_conjecture,
( ~ element(esk5_1(esk15_0),X1)
| empty(esk15_0) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_78,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_66,c_0_70]) ).
cnf(c_0_79,plain,
( ~ empty(X1)
| relation_rng(X1) = esk7_0 ),
inference(spm,[status(thm)],[c_0_55,c_0_71]) ).
cnf(c_0_80,plain,
( ~ empty(X1)
| function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_81,plain,
( ~ empty(X1)
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_82,plain,
( ~ empty(X1)
| relation_dom(esk7_0) = X1 ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_83,negated_conjecture,
( esk9_0 != esk15_0
| esk9_0 = esk16_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_28]),c_0_28]) ).
cnf(c_0_84,negated_conjecture,
empty(esk15_0),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
( ~ empty(X1)
| relation_dom(X1) != esk16_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_79]),c_0_67])]),c_0_80]),c_0_81]) ).
cnf(c_0_86,plain,
relation_dom(esk7_0) = esk7_0,
inference(spm,[status(thm)],[c_0_82,c_0_40]) ).
cnf(c_0_87,negated_conjecture,
( esk15_0 != esk7_0
| esk16_0 = esk7_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_47]),c_0_47]) ).
cnf(c_0_88,negated_conjecture,
esk15_0 = esk7_0,
inference(spm,[status(thm)],[c_0_55,c_0_84]) ).
cnf(c_0_89,negated_conjecture,
esk16_0 != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_40])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]),c_0_89]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET996+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n006.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 05:46:14 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.51 Running first-order theorem proving
% 0.17/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.61 % Version: 3.5.1
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.61 % Starting sh5l with 300s (1) cores
% 0.26/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2123730 completed with status 0
% 0.26/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.61 % No SInE strategy applied
% 0.26/0.61 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.26/0.61 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.26/0.61 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.26/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.61 % G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2123741 completed with status 0
% 0.26/0.61 % Result found by G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.61 % No SInE strategy applied
% 0.26/0.61 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.26/0.61 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.26/0.61 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.26/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.61 % Preprocessing time : 0.001 s
% 0.26/0.61 % Presaturation interreduction done
% 0.26/0.61
% 0.26/0.61 % Proof found!
% 0.26/0.61 % SZS status Theorem
% 0.26/0.61 % SZS output start CNFRefutation
% See solution above
% 0.26/0.61 % Parsed axioms : 34
% 0.26/0.61 % Removed by relevancy pruning/SinE : 0
% 0.26/0.61 % Initial clauses : 57
% 0.26/0.61 % Removed in clause preprocessing : 0
% 0.26/0.61 % Initial clauses in saturation : 57
% 0.26/0.61 % Processed clauses : 800
% 0.26/0.61 % ...of these trivial : 5
% 0.26/0.61 % ...subsumed : 505
% 0.26/0.61 % ...remaining for further processing : 290
% 0.26/0.61 % Other redundant clauses eliminated : 8
% 0.26/0.61 % Clauses deleted for lack of memory : 0
% 0.26/0.61 % Backward-subsumed : 25
% 0.26/0.61 % Backward-rewritten : 30
% 0.26/0.61 % Generated clauses : 1389
% 0.26/0.61 % ...of the previous two non-redundant : 1277
% 0.26/0.61 % ...aggressively subsumed : 0
% 0.26/0.61 % Contextual simplify-reflections : 24
% 0.26/0.61 % Paramodulations : 1382
% 0.26/0.61 % Factorizations : 0
% 0.26/0.61 % NegExts : 0
% 0.26/0.61 % Equation resolutions : 8
% 0.26/0.61 % Disequality decompositions : 0
% 0.26/0.61 % Total rewrite steps : 379
% 0.26/0.61 % ...of those cached : 347
% 0.26/0.61 % Propositional unsat checks : 0
% 0.26/0.61 % Propositional check models : 0
% 0.26/0.61 % Propositional check unsatisfiable : 0
% 0.26/0.61 % Propositional clauses : 0
% 0.26/0.61 % Propositional clauses after purity: 0
% 0.26/0.61 % Propositional unsat core size : 0
% 0.26/0.61 % Propositional preprocessing time : 0.000
% 0.26/0.61 % Propositional encoding time : 0.000
% 0.26/0.61 % Propositional solver time : 0.000
% 0.26/0.61 % Success case prop preproc time : 0.000
% 0.26/0.61 % Success case prop encoding time : 0.000
% 0.26/0.61 % Success case prop solver time : 0.000
% 0.26/0.61 % Current number of processed clauses : 178
% 0.26/0.61 % Positive orientable unit clauses : 25
% 0.26/0.61 % Positive unorientable unit clauses: 0
% 0.26/0.61 % Negative unit clauses : 6
% 0.26/0.61 % Non-unit-clauses : 147
% 0.26/0.61 % Current number of unprocessed clauses: 512
% 0.26/0.61 % ...number of literals in the above : 1942
% 0.26/0.61 % Current number of archived formulas : 0
% 0.26/0.61 % Current number of archived clauses : 109
% 0.26/0.61 % Clause-clause subsumption calls (NU) : 8425
% 0.26/0.61 % Rec. Clause-clause subsumption calls : 4949
% 0.26/0.61 % Non-unit clause-clause subsumptions : 442
% 0.26/0.61 % Unit Clause-clause subsumption calls : 173
% 0.26/0.61 % Rewrite failures with RHS unbound : 0
% 0.26/0.61 % BW rewrite match attempts : 23
% 0.26/0.61 % BW rewrite match successes : 11
% 0.26/0.61 % Condensation attempts : 0
% 0.26/0.61 % Condensation successes : 0
% 0.26/0.61 % Termbank termtop insertions : 20075
% 0.26/0.61 % Search garbage collected termcells : 671
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.044 s
% 0.26/0.61 % System time : 0.005 s
% 0.26/0.61 % Total time : 0.049 s
% 0.26/0.61 % Maximum resident set size: 3660 pages
% 0.26/0.61
% 0.26/0.61 % -------------------------------------------------
% 0.26/0.61 % User time : 0.176 s
% 0.26/0.61 % System time : 0.027 s
% 0.26/0.61 % Total time : 0.203 s
% 0.26/0.61 % Maximum resident set size: 4608 pages
% 0.26/0.61 % E exiting
%------------------------------------------------------------------------------