TSTP Solution File: SET863-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET863-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:21:10 EDT 2023
% Result : Unsatisfiable 35.96s 5.14s
% Output : CNFRefutation 35.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of clauses : 76 ( 22 unt; 21 nHn; 68 RR)
% Number of literals : 184 ( 19 equ; 87 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 144 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_SetInterval_OatLeast__subset__iff__iff2_0,axiom,
( c_lessequals(c_SetInterval_OatLeast(X3,X1),c_SetInterval_OatLeast(X2,X1),tc_set(X1))
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_SetInterval_OatLeast__subset__iff__iff2_0) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',clsarity_set_2) ).
cnf(cls_Zorn_Ochain__extend_0,axiom,
( c_in(c_Zorn_Ochain__extend__1(X4,X1,X3),X4,tc_set(X3))
| c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Zorn_Ochain__extend_0) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_1) ).
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Set_OsubsetD_0) ).
cnf(cls_SetInterval_OatLeast__iff__iff2_0,axiom,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_SetInterval_OatLeast__iff__iff2_0) ).
cnf(clsarity_set_1,axiom,
class_Orderings_Oord(tc_set(X1)),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',clsarity_set_1) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(v_x,v_S,tc_set(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_3) ).
cnf(cls_SetInterval_OatLeast__iff__iff1_0,axiom,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_SetInterval_OatLeast__iff__iff1_0) ).
cnf(cls_conjecture_7,negated_conjecture,
( c_lessequals(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_7) ).
cnf(cls_conjecture_4,negated_conjecture,
c_lessequals(v_y,v_x,tc_set(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_4) ).
cnf(cls_Zorn_Omaxchain__super__lemma_1,axiom,
( c_in(X1,X6,X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
| ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X6,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Zorn_Omaxchain__super__lemma_1) ).
cnf(cls_Zorn_Omaxchain__super__lemma_0,axiom,
( c_in(X1,X6,X3)
| c_in(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
| ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Zorn_Omaxchain__super__lemma_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_0) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Set_OpsubsetI_0) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(v_xa,v_x,t_a),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_5) ).
cnf(cls_conjecture_6,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_conjecture_6) ).
cnf(cls_Set_OpsubsetE_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Set_OpsubsetE_1) ).
cnf(cls_Zorn_Ochain__extend_1,axiom,
( c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Ochain__extend__1(X4,X1,X3),X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Zorn_Ochain__extend_1) ).
cnf(cls_SetInterval_OatMost__iff__iff1_0,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatMost(X3,X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_SetInterval_OatMost__iff__iff1_0) ).
cnf(cls_Set_Osubset__antisym_0,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_SetInterval_OatMost__iff__iff2_0,axiom,
( c_in(X2,c_SetInterval_OatMost(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.YmLiatIhe1/E---3.1_18283.p',cls_SetInterval_OatMost__iff__iff2_0) ).
cnf(c_0_22,axiom,
( c_lessequals(c_SetInterval_OatLeast(X3,X1),c_SetInterval_OatLeast(X2,X1),tc_set(X1))
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
cls_SetInterval_OatLeast__subset__iff__iff2_0 ).
cnf(c_0_23,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_24,axiom,
( c_in(c_Zorn_Ochain__extend__1(X4,X1,X3),X4,tc_set(X3))
| c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
cls_Zorn_Ochain__extend_0 ).
cnf(c_0_25,negated_conjecture,
c_in(v_c,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_1 ).
cnf(c_0_26,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
cls_Set_OsubsetD_0 ).
cnf(c_0_27,plain,
( c_lessequals(c_SetInterval_OatLeast(X1,tc_set(X2)),c_SetInterval_OatLeast(X3,tc_set(X2)),tc_set(tc_set(X2)))
| ~ c_lessequals(X3,X1,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
cls_SetInterval_OatLeast__iff__iff2_0 ).
cnf(c_0_29,axiom,
class_Orderings_Oord(tc_set(X1)),
clsarity_set_1 ).
cnf(c_0_30,negated_conjecture,
( c_in(c_union(c_insert(X1,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Zorn_Ochain__extend__1(v_c,X1,t_a),v_c,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
c_in(v_x,v_S,tc_set(t_a)),
cls_conjecture_3 ).
cnf(c_0_32,axiom,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
cls_SetInterval_OatLeast__iff__iff1_0 ).
cnf(c_0_33,plain,
( c_in(X1,c_SetInterval_OatLeast(X2,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,c_SetInterval_OatLeast(X4,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( c_lessequals(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
cls_conjecture_7 ).
cnf(c_0_35,plain,
( c_in(X1,c_SetInterval_OatLeast(X2,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
c_lessequals(v_y,v_x,tc_set(t_a)),
cls_conjecture_4 ).
cnf(c_0_37,axiom,
( c_in(X1,X6,X3)
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
| ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X6,tc_set(X3)) ),
cls_Zorn_Omaxchain__super__lemma_1 ).
cnf(c_0_38,axiom,
( c_in(X1,X6,X3)
| c_in(c_Zorn_Omaxchain__super__lemma__1(X4,X6,X3),X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| ~ c_in(X4,c_Zorn_Omaxchain(X5,X3),tc_set(tc_set(X3)))
| ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X5,X3),tc_set(tc_set(X3))) ),
cls_Zorn_Omaxchain__super__lemma_0 ).
cnf(c_0_39,negated_conjecture,
( c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_40,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_41,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OpsubsetI_0 ).
cnf(c_0_42,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X2,c_SetInterval_OatLeast(X1,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
( c_in(X1,c_SetInterval_OatLeast(X2,tc_set(t_a)),tc_set(t_a))
| ~ c_in(X1,c_SetInterval_OatLeast(v_y,tc_set(t_a)),tc_set(t_a))
| ~ c_in(X2,v_c,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,negated_conjecture,
c_in(v_x,c_SetInterval_OatLeast(v_y,tc_set(t_a)),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( c_in(X1,v_y,t_a)
| ~ c_in(c_union(c_insert(X2,c_emptyset,tc_set(t_a)),X3,tc_set(t_a)),c_Zorn_Ochain(X4,t_a),tc_set(tc_set(t_a)))
| ~ c_in(c_Zorn_Omaxchain__super__lemma__1(X3,v_y,t_a),v_c,tc_set(t_a))
| ~ c_in(X3,c_Zorn_Omaxchain(X4,t_a),tc_set(tc_set(t_a)))
| ~ c_in(X1,X2,t_a) ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
( c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))
| c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X1,t_a),v_c,tc_set(t_a))
| c_in(X2,X1,t_a)
| ~ c_in(X2,v_x,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_47,plain,
( X1 = X2
| c_less(X1,X2,tc_set(X3))
| ~ c_in(X2,c_SetInterval_OatLeast(X1,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( c_in(v_x,c_SetInterval_OatLeast(X1,tc_set(t_a)),tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
( c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a))
| c_in(X1,v_y,t_a)
| ~ c_in(X1,v_x,t_a) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_39]),c_0_40])]),c_0_46]) ).
cnf(c_0_50,negated_conjecture,
c_in(v_xa,v_x,t_a),
cls_conjecture_5 ).
cnf(c_0_51,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
cls_conjecture_6 ).
cnf(c_0_52,negated_conjecture,
( X1 = v_x
| c_less(X1,v_x,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_c,tc_set(t_a)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
cls_Set_OpsubsetE_1 ).
cnf(c_0_55,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_less(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,axiom,
( c_in(c_union(c_insert(X1,c_emptyset,tc_set(X3)),X4,tc_set(X3)),c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Zorn_Ochain__extend__1(X4,X1,X3),X1,tc_set(X3)) ),
cls_Zorn_Ochain__extend_1 ).
cnf(c_0_57,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_x,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(X1,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_c,c_Zorn_Ochain(X1,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_x,X1,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatMost(X3,X1),X1) ),
cls_SetInterval_OatMost__iff__iff1_0 ).
cnf(c_0_60,negated_conjecture,
( X1 = v_y
| c_less(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_61,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_in(c_union(c_insert(v_x,c_emptyset,tc_set(t_a)),v_c,tc_set(t_a)),c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_25]),c_0_31])]) ).
cnf(c_0_62,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_Osubset__antisym_0 ).
cnf(c_0_63,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X1,c_SetInterval_OatMost(X2,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_59,c_0_29]) ).
cnf(c_0_64,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| c_less(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_60,c_0_53]) ).
cnf(c_0_65,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,X1,t_a),v_c,tc_set(t_a))
| c_in(X2,X1,t_a)
| ~ c_in(X2,v_x,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_61]),c_0_40])]) ).
cnf(c_0_66,axiom,
( c_in(X2,c_SetInterval_OatMost(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
cls_SetInterval_OatMost__iff__iff2_0 ).
cnf(c_0_67,plain,
( X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(X2,c_SetInterval_OatMost(X1,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_68,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| c_lessequals(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),v_y,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_54,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_in(X1,v_y,t_a)
| ~ c_in(X1,v_x,t_a) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_61]),c_0_40])]),c_0_65]) ).
cnf(c_0_70,plain,
( c_in(X1,c_SetInterval_OatMost(X2,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_66,c_0_29]) ).
cnf(c_0_71,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| ~ c_in(v_y,c_SetInterval_OatMost(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_50]),c_0_51]) ).
cnf(c_0_73,negated_conjecture,
c_in(v_y,c_SetInterval_OatMost(v_x,tc_set(t_a)),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_70,c_0_36]) ).
cnf(c_0_74,negated_conjecture,
v_x = v_y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_72]),c_0_73])]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_74]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.18 % Problem : SET863-1 : TPTP v8.1.2. Released v3.2.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.18/0.39 % Computer : n016.cluster.edu
% 0.18/0.39 % Model : x86_64 x86_64
% 0.18/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39 % Memory : 8042.1875MB
% 0.18/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39 % CPULimit : 2400
% 0.18/0.39 % WCLimit : 300
% 0.18/0.39 % DateTime : Mon Oct 2 17:50:21 EDT 2023
% 0.18/0.39 % CPUTime :
% 0.37/0.59 Running first-order theorem proving
% 0.37/0.59 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/tmp/tmp.YmLiatIhe1/E---3.1_18283.p
% 35.96/5.14 # Version: 3.1pre001
% 35.96/5.14 # Preprocessing class: FMLMSMSMSSSNFFN.
% 35.96/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.96/5.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.96/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.96/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.96/5.14 # Starting sh5l with 300s (1) cores
% 35.96/5.14 # sh5l with pid 18364 completed with status 0
% 35.96/5.14 # Result found by sh5l
% 35.96/5.14 # Preprocessing class: FMLMSMSMSSSNFFN.
% 35.96/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.96/5.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.96/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.96/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.96/5.14 # Starting sh5l with 300s (1) cores
% 35.96/5.14 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.96/5.14 # Search class: FGHSM-SSLM32-MFFFFFNN
% 35.96/5.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.96/5.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 35.96/5.14 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 18367 completed with status 0
% 35.96/5.14 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 35.96/5.14 # Preprocessing class: FMLMSMSMSSSNFFN.
% 35.96/5.14 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.96/5.14 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.96/5.14 # Starting new_bool_3 with 300s (1) cores
% 35.96/5.14 # Starting new_bool_1 with 300s (1) cores
% 35.96/5.14 # Starting sh5l with 300s (1) cores
% 35.96/5.14 # SinE strategy is gf500_gu_R04_F100_L20000
% 35.96/5.14 # Search class: FGHSM-SSLM32-MFFFFFNN
% 35.96/5.14 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 35.96/5.14 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 35.96/5.14 # Preprocessing time : 0.008 s
% 35.96/5.14 # Presaturation interreduction done
% 35.96/5.14
% 35.96/5.14 # Proof found!
% 35.96/5.14 # SZS status Unsatisfiable
% 35.96/5.14 # SZS output start CNFRefutation
% See solution above
% 35.96/5.14 # Parsed axioms : 1371
% 35.96/5.14 # Removed by relevancy pruning/SinE : 153
% 35.96/5.14 # Initial clauses : 1218
% 35.96/5.14 # Removed in clause preprocessing : 1
% 35.96/5.14 # Initial clauses in saturation : 1217
% 35.96/5.14 # Processed clauses : 12907
% 35.96/5.14 # ...of these trivial : 24
% 35.96/5.14 # ...subsumed : 6524
% 35.96/5.14 # ...remaining for further processing : 6359
% 35.96/5.14 # Other redundant clauses eliminated : 0
% 35.96/5.14 # Clauses deleted for lack of memory : 0
% 35.96/5.14 # Backward-subsumed : 217
% 35.96/5.14 # Backward-rewritten : 603
% 35.96/5.14 # Generated clauses : 151603
% 35.96/5.14 # ...of the previous two non-redundant : 150110
% 35.96/5.14 # ...aggressively subsumed : 0
% 35.96/5.14 # Contextual simplify-reflections : 4
% 35.96/5.14 # Paramodulations : 151573
% 35.96/5.14 # Factorizations : 6
% 35.96/5.14 # NegExts : 0
% 35.96/5.14 # Equation resolutions : 24
% 35.96/5.14 # Total rewrite steps : 3982
% 35.96/5.14 # Propositional unsat checks : 1
% 35.96/5.14 # Propositional check models : 0
% 35.96/5.14 # Propositional check unsatisfiable : 0
% 35.96/5.14 # Propositional clauses : 0
% 35.96/5.14 # Propositional clauses after purity: 0
% 35.96/5.14 # Propositional unsat core size : 0
% 35.96/5.14 # Propositional preprocessing time : 0.000
% 35.96/5.14 # Propositional encoding time : 0.358
% 35.96/5.14 # Propositional solver time : 0.104
% 35.96/5.14 # Success case prop preproc time : 0.000
% 35.96/5.14 # Success case prop encoding time : 0.000
% 35.96/5.14 # Success case prop solver time : 0.000
% 35.96/5.14 # Current number of processed clauses : 4345
% 35.96/5.14 # Positive orientable unit clauses : 466
% 35.96/5.14 # Positive unorientable unit clauses: 0
% 35.96/5.14 # Negative unit clauses : 871
% 35.96/5.14 # Non-unit-clauses : 3008
% 35.96/5.14 # Current number of unprocessed clauses: 139471
% 35.96/5.14 # ...number of literals in the above : 164551
% 35.96/5.14 # Current number of archived formulas : 0
% 35.96/5.14 # Current number of archived clauses : 2014
% 35.96/5.14 # Clause-clause subsumption calls (NU) : 4867660
% 35.96/5.14 # Rec. Clause-clause subsumption calls : 4019490
% 35.96/5.14 # Non-unit clause-clause subsumptions : 4695
% 35.96/5.14 # Unit Clause-clause subsumption calls : 402870
% 35.96/5.14 # Rewrite failures with RHS unbound : 0
% 35.96/5.14 # BW rewrite match attempts : 1448
% 35.96/5.14 # BW rewrite match successes : 35
% 35.96/5.14 # Condensation attempts : 0
% 35.96/5.14 # Condensation successes : 0
% 35.96/5.14 # Termbank termtop insertions : 4649887
% 35.96/5.14
% 35.96/5.14 # -------------------------------------------------
% 35.96/5.14 # User time : 4.241 s
% 35.96/5.14 # System time : 0.190 s
% 35.96/5.14 # Total time : 4.431 s
% 35.96/5.14 # Maximum resident set size: 3960 pages
% 35.96/5.14
% 35.96/5.14 # -------------------------------------------------
% 35.96/5.14 # User time : 4.261 s
% 35.96/5.14 # System time : 0.192 s
% 35.96/5.14 # Total time : 4.452 s
% 35.96/5.14 # Maximum resident set size: 2408 pages
% 35.96/5.14 % E---3.1 exiting
% 35.96/5.14 % E---3.1 exiting
%------------------------------------------------------------------------------