%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET837-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:32 PM UTC 2026
% Result : Unsatisfiable 0.56s 0.48s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of clauses : 88 ( 26 unt; 20 nHn; 60 RR)
% Number of literals : 185 ( 31 equ; 81 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 145 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).
cnf(cls_conjecture_0,negated_conjecture,
( c_lessequals(v_Y,v_X,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnE_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_lessequals(v_Z,v_X,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_3,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Z,v_x,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Y,v_x,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_4,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_lessequals(v_X,v_x,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(c_0_13,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_14,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_15,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_16,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(v_Y,v_X,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
cls_conjecture_0 ).
cnf(c_0_18,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_14 ).
cnf(c_0_19,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_20,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_21,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_15 ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(X1,v_Y,t_a)
| c_in(X1,v_X,t_a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_24,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_19 ).
cnf(c_0_25,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
( c_lessequals(v_Z,v_X,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
cls_conjecture_1 ).
cnf(c_0_27,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( c_lessequals(v_Y,X1,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(v_Y,X1,t_a),v_X,t_a) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_union(X1,X2,X3),X4,X3),X1,X3)
| c_in(c_Main_OsubsetI__1(c_union(X1,X2,X3),X4,X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ c_in(X1,v_Z,t_a)
| c_in(X1,v_X,t_a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18]) ).
cnf(c_0_31,negated_conjecture,
c_lessequals(v_Y,c_union(v_X,X1,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_33,plain,
( c_lessequals(c_union(X1,X1,X2),X3,tc_set(X2))
| c_in(c_Main_OsubsetI__1(c_union(X1,X1,X2),X3,X2),X1,X2) ),
inference(ef,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( c_lessequals(v_Z,X1,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(v_Z,X1,t_a),v_X,t_a) ),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_35,negated_conjecture,
( ~ c_in(X1,v_Y,t_a)
| c_in(X1,c_union(v_X,X2,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_36,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_32 ).
cnf(c_0_37,plain,
c_lessequals(c_union(X1,X1,X2),X1,tc_set(X2)),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_38,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_40,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_41,negated_conjecture,
c_lessequals(v_Z,c_union(v_X,X1,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_27,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(v_X,X2,t_a),t_a),v_Y,t_a)
| c_lessequals(X1,c_union(v_X,X2,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_43,plain,
c_union(X1,X1,X2) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a))
| v_X = c_union(v_Y,v_Z,t_a) ),
c_0_39 ).
cnf(c_0_45,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_40,c_0_23]) ).
cnf(c_0_46,negated_conjecture,
( ~ c_in(X1,v_Z,t_a)
| c_in(X1,c_union(v_X,X2,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,v_X,t_a),v_Y,t_a)
| c_lessequals(X1,v_X,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( c_lessequals(c_union(X1,X2,X3),X1,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_union(X1,X2,X3),X1,X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_49,negated_conjecture,
( ~ c_lessequals(v_Y,c_union(X1,v_Z,t_a),tc_set(t_a))
| c_lessequals(v_X,c_union(X1,v_Z,t_a),tc_set(t_a))
| c_union(v_Y,v_Z,t_a) = v_X ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(v_X,X2,t_a),t_a),v_Z,t_a)
| c_lessequals(X1,c_union(v_X,X2,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_51,plain,
( c_lessequals(c_union(X1,X2,X3),c_union(X4,X1,X3),tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_union(X1,X2,X3),c_union(X4,X1,X3),X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_52,negated_conjecture,
c_lessequals(c_union(v_X,v_Y,t_a),v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Z,v_x,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_54,negated_conjecture,
( c_lessequals(v_X,c_union(v_Y,v_Z,t_a),tc_set(t_a))
| c_union(v_Y,v_Z,t_a) = v_X ),
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_55,negated_conjecture,
c_lessequals(c_union(X1,v_Z,t_a),c_union(v_X,X1,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
c_union(v_X,v_Y,t_a) = v_X,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_52]),c_0_38])]) ).
cnf(c_0_57,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Y,v_x,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_58,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Z,v_x,tc_set(t_a)) ),
c_0_53 ).
cnf(c_0_59,negated_conjecture,
c_lessequals(v_Y,v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_60,negated_conjecture,
c_lessequals(v_Z,v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_21,c_0_34]) ).
cnf(c_0_61,negated_conjecture,
( ~ c_lessequals(c_union(v_Y,v_Z,t_a),v_X,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) = v_X ),
inference(spm,[status(thm)],[c_0_36,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
c_lessequals(c_union(v_Y,v_Z,t_a),v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| c_lessequals(v_Y,v_x,tc_set(t_a)) ),
c_0_57 ).
cnf(c_0_64,negated_conjecture,
( c_union(v_Y,v_Z,t_a) != v_X
| c_lessequals(v_Z,v_x,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_65,negated_conjecture,
c_union(v_Y,v_Z,t_a) = v_X,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_66,negated_conjecture,
( c_union(v_Y,v_Z,t_a) != v_X
| c_lessequals(v_Y,v_x,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_59]),c_0_60])]) ).
cnf(c_0_67,negated_conjecture,
c_lessequals(v_Z,v_x,tc_set(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_68,negated_conjecture,
c_lessequals(v_Y,v_x,tc_set(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_65])]) ).
cnf(c_0_69,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(c_union(X2,X3,X4),X5,X4),X4),X3,X4)
| c_lessequals(X1,c_union(c_union(X2,X3,X4),X5,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_70,plain,
c_lessequals(c_union(X1,X2,X3),c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_27,c_0_51]) ).
cnf(c_0_71,negated_conjecture,
( ~ c_in(X1,v_Z,t_a)
| c_in(X1,v_x,t_a) ),
inference(spm,[status(thm)],[c_0_18,c_0_67]) ).
cnf(c_0_72,negated_conjecture,
( ~ c_in(X1,v_Y,t_a)
| c_in(X1,v_x,t_a) ),
inference(spm,[status(thm)],[c_0_18,c_0_68]) ).
cnf(c_0_73,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_lessequals(v_X,v_x,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_74,plain,
c_lessequals(c_union(X1,X2,X3),c_union(c_union(X4,X2,X3),X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_69,c_0_51]) ).
cnf(c_0_75,plain,
c_union(X1,X2,X3) = c_union(X2,X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_70]),c_0_70])]) ).
cnf(c_0_76,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Z,t_a)
| c_lessequals(X1,v_x,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Y,t_a)
| c_lessequals(X1,v_x,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_21,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
( v_X != c_union(v_Y,v_Z,t_a)
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_lessequals(v_X,v_x,tc_set(t_a)) ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
c_lessequals(v_X,c_union(v_Y,c_union(X1,v_Z,t_a),t_a),tc_set(t_a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_65]),c_0_75]) ).
cnf(c_0_80,negated_conjecture,
c_lessequals(c_union(v_Z,v_x,t_a),v_x,tc_set(t_a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_48]),c_0_75]) ).
cnf(c_0_81,negated_conjecture,
c_lessequals(c_union(v_Y,v_x,t_a),v_x,tc_set(t_a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_48]),c_0_75]) ).
cnf(c_0_82,negated_conjecture,
( ~ c_lessequals(v_X,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_59]),c_0_60])]) ).
cnf(c_0_83,negated_conjecture,
c_lessequals(v_X,c_union(v_Y,c_union(v_Z,X1,t_a),t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_79,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
c_union(v_Z,v_x,t_a) = v_x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_80]),c_0_45])]) ).
cnf(c_0_85,negated_conjecture,
c_union(v_Y,v_x,t_a) = v_x,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_81]),c_0_45])]) ).
cnf(c_0_86,negated_conjecture,
~ c_lessequals(v_X,v_x,tc_set(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_65])]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET837-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:42:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.56/0.48 % Version: 3.5.1
% 0.56/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.56/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.56/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.56/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.56/0.48 % Starting sh5l with 300s (1) cores
% 0.56/0.48 % new_bool_1 with pid 1085549 completed with status 9
% 0.56/0.48 % new_bool_3 with pid 1085548 completed with status 9
% 0.56/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1085547 completed with status 0
% 0.56/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.56/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.56/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.56/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.56/0.48 % No SInE strategy applied
% 0.56/0.48 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.56/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.56/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.56/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.56/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.56/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.56/0.48 % SubtermCWHack with pid 1085552 completed with status 0
% 0.56/0.48 % Result found by SubtermCWHack
% 0.56/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.56/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.56/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.56/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.56/0.48 % No SInE strategy applied
% 0.56/0.48 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.56/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.56/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.56/0.48 % Preprocessing time : 0.001 s
% 0.56/0.48
% 0.56/0.48 % Proof found!
% 0.56/0.48 % SZS status Unsatisfiable
% 0.56/0.48 % SZS output start CNFRefutation
% See solution above
% 0.56/0.48 % Parsed axioms : 13
% 0.56/0.48 % Removed by relevancy pruning/SinE : 0
% 0.56/0.48 % Initial clauses : 13
% 0.56/0.48 % Removed in clause preprocessing : 0
% 0.56/0.48 % Initial clauses in saturation : 13
% 0.56/0.48 % Processed clauses : 562
% 0.56/0.48 % ...of these trivial : 32
% 0.56/0.48 % ...subsumed : 317
% 0.56/0.48 % ...remaining for further processing : 213
% 0.56/0.48 % Other redundant clauses eliminated : 0
% 0.56/0.48 % Clauses deleted for lack of memory : 0
% 0.56/0.48 % Backward-subsumed : 17
% 0.56/0.48 % Backward-rewritten : 40
% 0.56/0.48 % Generated clauses : 3743
% 0.56/0.48 % ...of the previous two non-redundant : 2650
% 0.56/0.48 % ...aggressively subsumed : 0
% 0.56/0.48 % Contextual simplify-reflections : 4
% 0.56/0.48 % Paramodulations : 3721
% 0.56/0.48 % Factorizations : 22
% 0.56/0.48 % NegExts : 0
% 0.56/0.48 % Equation resolutions : 0
% 0.56/0.48 % Disequality decompositions : 0
% 0.56/0.48 % Total rewrite steps : 1867
% 0.56/0.48 % ...of those cached : 1642
% 0.56/0.48 % Propositional unsat checks : 0
% 0.56/0.48 % Propositional check models : 0
% 0.56/0.48 % Propositional check unsatisfiable : 0
% 0.56/0.48 % Propositional clauses : 0
% 0.56/0.48 % Propositional clauses after purity: 0
% 0.56/0.48 % Propositional unsat core size : 0
% 0.56/0.48 % Propositional preprocessing time : 0.000
% 0.56/0.48 % Propositional encoding time : 0.000
% 0.56/0.48 % Propositional solver time : 0.000
% 0.56/0.48 % Success case prop preproc time : 0.000
% 0.56/0.48 % Success case prop encoding time : 0.000
% 0.56/0.48 % Success case prop solver time : 0.000
% 0.56/0.48 % Current number of processed clauses : 156
% 0.56/0.48 % Positive orientable unit clauses : 56
% 0.56/0.48 % Positive unorientable unit clauses: 1
% 0.56/0.48 % Negative unit clauses : 2
% 0.56/0.48 % Non-unit-clauses : 97
% 0.56/0.48 % Current number of unprocessed clauses: 1955
% 0.56/0.48 % ...number of literals in the above : 4322
% 0.56/0.48 % Current number of archived formulas : 0
% 0.56/0.48 % Current number of archived clauses : 57
% 0.56/0.48 % Clause-clause subsumption calls (NU) : 4516
% 0.56/0.48 % Rec. Clause-clause subsumption calls : 3353
% 0.56/0.48 % Non-unit clause-clause subsumptions : 330
% 0.56/0.48 % Unit Clause-clause subsumption calls : 991
% 0.56/0.48 % Rewrite failures with RHS unbound : 0
% 0.56/0.48 % BW rewrite match attempts : 205
% 0.56/0.48 % BW rewrite match successes : 102
% 0.56/0.48 % Condensation attempts : 0
% 0.56/0.48 % Condensation successes : 0
% 0.56/0.48 % Termbank termtop insertions : 59886
% 0.56/0.48 % Search garbage collected termcells : 39
% 0.56/0.48
% 0.56/0.48 % -------------------------------------------------
% 0.56/0.48 % User time : 0.047 s
% 0.56/0.48 % System time : 0.007 s
% 0.56/0.48 % Total time : 0.054 s
% 0.56/0.48 % Maximum resident set size: 3640 pages
% 0.56/0.48
% 0.56/0.48 % -------------------------------------------------
% 0.56/0.48 % User time : 0.307 s
% 0.56/0.48 % System time : 0.054 s
% 0.56/0.48 % Total time : 0.361 s
% 0.56/0.48 % Maximum resident set size: 4864 pages
% 0.56/0.48 % E exiting
%------------------------------------------------------------------------------