TSTP Solution File: SET863-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET863-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:56:22 EDT 2024
% Result : Unsatisfiable 34.18s 4.83s
% Output : CNFRefutation 34.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of clauses : 91 ( 23 unt; 24 nHn; 82 RR)
% Number of literals : 231 ( 21 equ; 117 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 : 193 ( 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/sandbox/benchmark/Axioms/MSC001-2.ax',cls_SetInterval_OatLeast__subset__iff__iff2_0) ).
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/sandbox/benchmark/theBenchmark.p',cls_Zorn_Ochain__extend_0) ).
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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsarity_set_2) ).
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/sandbox/benchmark/Axioms/MSC001-2.ax',cls_SetInterval_OatLeast__iff__iff2_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/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
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/sandbox/benchmark/Axioms/MSC001-2.ax',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/sandbox/benchmark/theBenchmark.p',cls_conjecture_7) ).
cnf(clsarity_set_1,axiom,
class_Orderings_Oord(tc_set(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',clsarity_set_1) ).
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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__super__lemma_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(v_x,v_S,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_0) ).
cnf(cls_conjecture_4,negated_conjecture,
c_lessequals(v_y,v_x,tc_set(t_a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
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/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_6,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(v_xa,v_x,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_Set_OpsubsetE_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',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/sandbox/benchmark/theBenchmark.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/sandbox/benchmark/Axioms/MSC001-2.ax',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/sandbox/benchmark/Axioms/MSC001-0.ax',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/sandbox/benchmark/Axioms/MSC001-2.ax',cls_SetInterval_OatMost__iff__iff2_0) ).
cnf(c_0_22,plain,
( c_lessequals(c_SetInterval_OatLeast(X3,X1),c_SetInterval_OatLeast(X2,X1),tc_set(X1))
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeast__subset__iff__iff2_0]) ).
cnf(c_0_23,plain,
( 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))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Ochain__extend_0]) ).
cnf(c_0_24,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_25,plain,
( c_lessequals(c_SetInterval_OatLeast(X3,X1),c_SetInterval_OatLeast(X2,X1),tc_set(X1))
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_22 ).
cnf(c_0_26,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_27,plain,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeast__iff__iff2_0]) ).
cnf(c_0_28,plain,
( 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))) ),
c_0_23 ).
cnf(c_0_29,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_30,plain,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatLeast__iff__iff1_0]) ).
cnf(c_0_31,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_24 ).
cnf(c_0_32,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_25,c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( c_lessequals(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).
cnf(c_0_34,plain,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_27 ).
cnf(c_0_35,axiom,
class_Orderings_Oord(tc_set(X1)),
clsarity_set_1 ).
cnf(c_0_36,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__super__lemma_1]) ).
cnf(c_0_37,plain,
( 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))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__super__lemma_0]) ).
cnf(c_0_38,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_28,c_0_29]) ).
cnf(c_0_39,negated_conjecture,
c_in(v_x,v_S,tc_set(t_a)),
cls_conjecture_3 ).
cnf(c_0_40,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetI_0]) ).
cnf(c_0_41,plain,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
c_0_30 ).
cnf(c_0_42,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_31,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
( c_lessequals(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
c_0_33 ).
cnf(c_0_44,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_34,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
c_lessequals(v_y,v_x,tc_set(t_a)),
cls_conjecture_4 ).
cnf(c_0_46,plain,
( 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)) ),
c_0_36 ).
cnf(c_0_47,plain,
( 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))) ),
c_0_37 ).
cnf(c_0_48,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_38,c_0_39]) ).
cnf(c_0_49,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_50,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_40 ).
cnf(c_0_51,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_41,c_0_35]) ).
cnf(c_0_52,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_42,c_0_43]) ).
cnf(c_0_53,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_44,c_0_45]) ).
cnf(c_0_54,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_46,c_0_43]) ).
cnf(c_0_55,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_47,c_0_48]),c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_57,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_50,c_0_51]) ).
cnf(c_0_58,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_52,c_0_53]) ).
cnf(c_0_59,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_54,c_0_48]),c_0_49])]),c_0_55]) ).
cnf(c_0_60,negated_conjecture,
c_in(v_xa,v_x,t_a),
cls_conjecture_5 ).
cnf(c_0_61,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
c_0_56 ).
cnf(c_0_62,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetE_1]) ).
cnf(c_0_63,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_57,c_0_58]) ).
cnf(c_0_64,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_59,c_0_60]),c_0_61]) ).
cnf(c_0_65,plain,
( 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)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Ochain__extend_1]) ).
cnf(c_0_66,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
c_0_62 ).
cnf(c_0_67,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_63,c_0_64]) ).
cnf(c_0_68,plain,
( 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)) ),
c_0_65 ).
cnf(c_0_69,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_66,c_0_67]) ).
cnf(c_0_70,plain,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatMost(X3,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatMost__iff__iff1_0]) ).
cnf(c_0_71,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_68,c_0_69]) ).
cnf(c_0_72,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_73,plain,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatMost(X3,X1),X1) ),
c_0_70 ).
cnf(c_0_74,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_50,c_0_43]) ).
cnf(c_0_75,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_71,c_0_29]),c_0_39])]) ).
cnf(c_0_76,plain,
( c_in(X2,c_SetInterval_OatMost(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OatMost__iff__iff2_0]) ).
cnf(c_0_77,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_72 ).
cnf(c_0_78,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_73,c_0_35]) ).
cnf(c_0_79,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_74,c_0_64]) ).
cnf(c_0_80,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_47,c_0_75]),c_0_49])]) ).
cnf(c_0_81,plain,
( c_in(X2,c_SetInterval_OatMost(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_76 ).
cnf(c_0_82,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_77,c_0_78]) ).
cnf(c_0_83,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_66,c_0_79]) ).
cnf(c_0_84,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_54,c_0_75]),c_0_49])]),c_0_80]) ).
cnf(c_0_85,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_81,c_0_35]) ).
cnf(c_0_86,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_82,c_0_83]) ).
cnf(c_0_87,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_84,c_0_60]),c_0_61]) ).
cnf(c_0_88,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_85,c_0_45]) ).
cnf(c_0_89,negated_conjecture,
v_x = v_y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_87]),c_0_88])]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_89]),c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET863-1 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 12:51:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 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
% 34.18/4.83 # Version: 3.1.0
% 34.18/4.83 # Preprocessing class: FMLMSMSMSSSNFFN.
% 34.18/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.18/4.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.18/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.18/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.18/4.83 # Starting sh5l with 300s (1) cores
% 34.18/4.83 # sh5l with pid 12923 completed with status 0
% 34.18/4.83 # Result found by sh5l
% 34.18/4.83 # Preprocessing class: FMLMSMSMSSSNFFN.
% 34.18/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.18/4.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.18/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.18/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.18/4.83 # Starting sh5l with 300s (1) cores
% 34.18/4.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 34.18/4.83 # Search class: FGHSM-SSLM32-MFFFFFNN
% 34.18/4.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.18/4.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 34.18/4.83 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 12929 completed with status 0
% 34.18/4.83 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 34.18/4.83 # Preprocessing class: FMLMSMSMSSSNFFN.
% 34.18/4.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 34.18/4.83 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 34.18/4.83 # Starting new_bool_3 with 300s (1) cores
% 34.18/4.83 # Starting new_bool_1 with 300s (1) cores
% 34.18/4.83 # Starting sh5l with 300s (1) cores
% 34.18/4.83 # SinE strategy is gf500_gu_R04_F100_L20000
% 34.18/4.83 # Search class: FGHSM-SSLM32-MFFFFFNN
% 34.18/4.83 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 34.18/4.83 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 34.18/4.83 # Preprocessing time : 0.009 s
% 34.18/4.83 # Presaturation interreduction done
% 34.18/4.83
% 34.18/4.83 # Proof found!
% 34.18/4.83 # SZS status Unsatisfiable
% 34.18/4.83 # SZS output start CNFRefutation
% See solution above
% 34.18/4.83 # Parsed axioms : 1371
% 34.18/4.83 # Removed by relevancy pruning/SinE : 153
% 34.18/4.83 # Initial clauses : 1218
% 34.18/4.83 # Removed in clause preprocessing : 1
% 34.18/4.83 # Initial clauses in saturation : 1217
% 34.18/4.83 # Processed clauses : 12907
% 34.18/4.83 # ...of these trivial : 24
% 34.18/4.83 # ...subsumed : 6524
% 34.18/4.83 # ...remaining for further processing : 6359
% 34.18/4.83 # Other redundant clauses eliminated : 0
% 34.18/4.83 # Clauses deleted for lack of memory : 0
% 34.18/4.83 # Backward-subsumed : 217
% 34.18/4.83 # Backward-rewritten : 603
% 34.18/4.83 # Generated clauses : 151603
% 34.18/4.83 # ...of the previous two non-redundant : 150110
% 34.18/4.83 # ...aggressively subsumed : 0
% 34.18/4.83 # Contextual simplify-reflections : 4
% 34.18/4.83 # Paramodulations : 151573
% 34.18/4.83 # Factorizations : 6
% 34.18/4.83 # NegExts : 0
% 34.18/4.83 # Equation resolutions : 24
% 34.18/4.83 # Disequality decompositions : 0
% 34.18/4.83 # Total rewrite steps : 3982
% 34.18/4.83 # ...of those cached : 3600
% 34.18/4.83 # Propositional unsat checks : 1
% 34.18/4.83 # Propositional check models : 0
% 34.18/4.83 # Propositional check unsatisfiable : 0
% 34.18/4.83 # Propositional clauses : 0
% 34.18/4.83 # Propositional clauses after purity: 0
% 34.18/4.83 # Propositional unsat core size : 0
% 34.18/4.83 # Propositional preprocessing time : 0.000
% 34.18/4.83 # Propositional encoding time : 0.332
% 34.18/4.83 # Propositional solver time : 0.126
% 34.18/4.83 # Success case prop preproc time : 0.000
% 34.18/4.83 # Success case prop encoding time : 0.000
% 34.18/4.83 # Success case prop solver time : 0.000
% 34.18/4.83 # Current number of processed clauses : 4345
% 34.18/4.83 # Positive orientable unit clauses : 466
% 34.18/4.83 # Positive unorientable unit clauses: 0
% 34.18/4.83 # Negative unit clauses : 871
% 34.18/4.83 # Non-unit-clauses : 3008
% 34.18/4.83 # Current number of unprocessed clauses: 139471
% 34.18/4.83 # ...number of literals in the above : 164551
% 34.18/4.83 # Current number of archived formulas : 0
% 34.18/4.83 # Current number of archived clauses : 2014
% 34.18/4.83 # Clause-clause subsumption calls (NU) : 4867661
% 34.18/4.83 # Rec. Clause-clause subsumption calls : 4019487
% 34.18/4.83 # Non-unit clause-clause subsumptions : 4695
% 34.18/4.83 # Unit Clause-clause subsumption calls : 402870
% 34.18/4.83 # Rewrite failures with RHS unbound : 0
% 34.18/4.83 # BW rewrite match attempts : 1448
% 34.18/4.83 # BW rewrite match successes : 35
% 34.18/4.83 # Condensation attempts : 0
% 34.18/4.83 # Condensation successes : 0
% 34.18/4.83 # Termbank termtop insertions : 4655322
% 34.18/4.83 # Search garbage collected termcells : 1982
% 34.18/4.83
% 34.18/4.83 # -------------------------------------------------
% 34.18/4.83 # User time : 4.043 s
% 34.18/4.83 # System time : 0.186 s
% 34.18/4.83 # Total time : 4.229 s
% 34.18/4.83 # Maximum resident set size: 4064 pages
% 34.18/4.83
% 34.18/4.83 # -------------------------------------------------
% 34.18/4.83 # User time : 4.066 s
% 34.18/4.83 # System time : 0.188 s
% 34.18/4.83 # Total time : 4.254 s
% 34.18/4.83 # Maximum resident set size: 2416 pages
% 34.18/4.83 % E---3.1 exiting
% 34.18/4.84 % E exiting
%------------------------------------------------------------------------------