TSTP Solution File: SET863-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n019.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 03:00:14 EDT 2024
% Result : Unsatisfiable 23.25s 3.46s
% Output : CNFRefutation 23.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 23
% Syntax : Number of clauses : 98 ( 25 unt; 25 nHn; 85 RR)
% Number of literals : 242 ( 20 equ; 122 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 : 203 ( 6 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/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/sandbox2/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/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(clsarity_set_2,axiom,
class_Orderings_Oorder(tc_set(X1)),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_7) ).
cnf(clsarity_set_1,axiom,
class_Orderings_Oord(tc_set(X1)),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_conjecture_6,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).
cnf(cls_conjecture_5,negated_conjecture,
c_in(v_xa,v_x,t_a),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_SetInterval_OatMost__iff__iff1_0) ).
cnf(cls_Set_OpsubsetE_0,axiom,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetE_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/benchmark/Axioms/MSC001-2.ax',cls_SetInterval_OatMost__iff__iff2_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(c_0_23,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_24,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_25,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_26,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_23 ).
cnf(c_0_27,axiom,
class_Orderings_Oorder(tc_set(X1)),
clsarity_set_2 ).
cnf(c_0_28,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_29,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_24 ).
cnf(c_0_30,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_31,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_32,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_25 ).
cnf(c_0_33,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_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)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_7]) ).
cnf(c_0_35,plain,
( c_in(X3,c_SetInterval_OatLeast(X2,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_28 ).
cnf(c_0_36,axiom,
class_Orderings_Oord(tc_set(X1)),
clsarity_set_1 ).
cnf(c_0_37,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_38,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_39,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_29,c_0_30]) ).
cnf(c_0_40,negated_conjecture,
c_in(v_x,v_S,tc_set(t_a)),
cls_conjecture_3 ).
cnf(c_0_41,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_42,plain,
( c_lessequals(X3,X2,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatLeast(X3,X1),X1) ),
c_0_31 ).
cnf(c_0_43,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_32,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( c_lessequals(X1,v_y,tc_set(t_a))
| ~ c_in(X1,v_c,tc_set(t_a)) ),
c_0_34 ).
cnf(c_0_45,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_35,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
c_lessequals(v_y,v_x,tc_set(t_a)),
cls_conjecture_4 ).
cnf(c_0_47,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_37 ).
cnf(c_0_48,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_38 ).
cnf(c_0_49,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_39,c_0_40]) ).
cnf(c_0_50,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_51,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_41 ).
cnf(c_0_52,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_42,c_0_36]) ).
cnf(c_0_53,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_43,c_0_44]) ).
cnf(c_0_54,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_45,c_0_46]) ).
cnf(c_0_55,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_47,c_0_44]) ).
cnf(c_0_56,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_48,c_0_49]),c_0_50])]) ).
cnf(c_0_57,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).
cnf(c_0_58,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_51,c_0_52]) ).
cnf(c_0_59,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_53,c_0_54]) ).
cnf(c_0_60,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_55,c_0_49]),c_0_50])]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
c_in(v_xa,v_x,t_a),
cls_conjecture_5 ).
cnf(c_0_62,negated_conjecture,
~ c_in(v_xa,v_y,t_a),
c_0_57 ).
cnf(c_0_63,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_64,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_58,c_0_59]) ).
cnf(c_0_65,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_60,c_0_61]),c_0_62]) ).
cnf(c_0_66,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_67,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_less(X1,X2,tc_set(X3)) ),
c_0_63 ).
cnf(c_0_68,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_64,c_0_65]) ).
cnf(c_0_69,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_66 ).
cnf(c_0_70,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_67,c_0_68]) ).
cnf(c_0_71,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_72,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_69,c_0_70]) ).
cnf(c_0_73,plain,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetE_0]) ).
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_51,c_0_44]) ).
cnf(c_0_75,plain,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OatMost(X3,X1),X1) ),
c_0_71 ).
cnf(c_0_76,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_72,c_0_30]),c_0_40])]) ).
cnf(c_0_77,plain,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_73 ).
cnf(c_0_78,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_65]) ).
cnf(c_0_79,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_75,c_0_36]) ).
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_48,c_0_76]),c_0_50])]) ).
cnf(c_0_81,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_82,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| ~ c_lessequals(v_y,c_Zorn_Ochain__extend__1(v_c,v_x,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,negated_conjecture,
( c_in(X1,c_SetInterval_OatLeast(v_y,tc_set(t_a)),tc_set(t_a))
| ~ c_in(X1,c_SetInterval_OatLeast(v_x,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_43,c_0_46]) ).
cnf(c_0_84,plain,
( c_in(X1,c_SetInterval_OatLeast(X2,tc_set(X3)),tc_set(X3))
| ~ c_in(X2,c_SetInterval_OatMost(X1,tc_set(X3)),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_x
| c_in(X1,v_y,t_a)
| ~ c_in(c_Zorn_Omaxchain__super__lemma__1(v_c,v_y,t_a),v_c,tc_set(t_a))
| ~ c_in(X1,v_x,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_76]),c_0_50])]) ).
cnf(c_0_86,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(v_xa,X1,t_a) ),
inference(spm,[status(thm)],[c_0_80,c_0_61]) ).
cnf(c_0_87,plain,
( c_in(X2,c_SetInterval_OatMost(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| ~ c_lessequals(X2,X3,X1) ),
c_0_81 ).
cnf(c_0_88,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| ~ c_in(c_Zorn_Ochain__extend__1(v_c,v_x,t_a),c_SetInterval_OatLeast(v_y,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_82,c_0_52]) ).
cnf(c_0_89,negated_conjecture,
( c_in(X1,c_SetInterval_OatLeast(v_y,tc_set(t_a)),tc_set(t_a))
| ~ c_in(v_x,c_SetInterval_OatMost(X1,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,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(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_62]) ).
cnf(c_0_91,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_87,c_0_36]) ).
cnf(c_0_92,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_93,negated_conjecture,
( c_Zorn_Ochain__extend__1(v_c,v_x,t_a) = v_y
| ~ c_in(v_x,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_88,c_0_89]) ).
cnf(c_0_94,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_90,c_0_61]),c_0_62]) ).
cnf(c_0_95,plain,
c_in(X1,c_SetInterval_OatMost(X1,tc_set(X2)),tc_set(X2)),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
v_x = v_y,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94]),c_0_94]),c_0_95])]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_96]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET863-1 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n019.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:39:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.25/3.46 # Version: 3.1.0
% 23.25/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.25/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.25/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.25/3.46 # Starting new_bool_3 with 300s (1) cores
% 23.25/3.46 # Starting new_bool_1 with 300s (1) cores
% 23.25/3.46 # Starting sh5l with 300s (1) cores
% 23.25/3.46 # sh5l with pid 26316 completed with status 0
% 23.25/3.46 # Result found by sh5l
% 23.25/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.25/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.25/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.25/3.46 # Starting new_bool_3 with 300s (1) cores
% 23.25/3.46 # Starting new_bool_1 with 300s (1) cores
% 23.25/3.46 # Starting sh5l with 300s (1) cores
% 23.25/3.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.25/3.46 # Search class: FGHSM-SSLM32-MFFFFFNN
% 23.25/3.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.25/3.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 23.25/3.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 26330 completed with status 0
% 23.25/3.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 23.25/3.46 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.25/3.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.25/3.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.25/3.46 # Starting new_bool_3 with 300s (1) cores
% 23.25/3.46 # Starting new_bool_1 with 300s (1) cores
% 23.25/3.46 # Starting sh5l with 300s (1) cores
% 23.25/3.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.25/3.46 # Search class: FGHSM-SSLM32-MFFFFFNN
% 23.25/3.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.25/3.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 23.25/3.46 # Preprocessing time : 0.010 s
% 23.25/3.46 # Presaturation interreduction done
% 23.25/3.46
% 23.25/3.46 # Proof found!
% 23.25/3.46 # SZS status Unsatisfiable
% 23.25/3.46 # SZS output start CNFRefutation
% See solution above
% 23.25/3.46 # Parsed axioms : 1371
% 23.25/3.46 # Removed by relevancy pruning/SinE : 153
% 23.25/3.46 # Initial clauses : 1218
% 23.25/3.46 # Removed in clause preprocessing : 1
% 23.25/3.46 # Initial clauses in saturation : 1217
% 23.25/3.46 # Processed clauses : 12880
% 23.25/3.46 # ...of these trivial : 24
% 23.25/3.46 # ...subsumed : 6510
% 23.25/3.46 # ...remaining for further processing : 6346
% 23.25/3.46 # Other redundant clauses eliminated : 0
% 23.25/3.46 # Clauses deleted for lack of memory : 0
% 23.25/3.46 # Backward-subsumed : 217
% 23.25/3.46 # Backward-rewritten : 602
% 23.25/3.46 # Generated clauses : 151333
% 23.25/3.46 # ...of the previous two non-redundant : 149861
% 23.25/3.46 # ...aggressively subsumed : 0
% 23.25/3.46 # Contextual simplify-reflections : 3
% 23.25/3.46 # Paramodulations : 151303
% 23.25/3.46 # Factorizations : 6
% 23.25/3.46 # NegExts : 0
% 23.25/3.46 # Equation resolutions : 24
% 23.25/3.46 # Disequality decompositions : 0
% 23.25/3.46 # Total rewrite steps : 3960
% 23.25/3.46 # ...of those cached : 3584
% 23.25/3.46 # Propositional unsat checks : 1
% 23.25/3.46 # Propositional check models : 0
% 23.25/3.46 # Propositional check unsatisfiable : 0
% 23.25/3.46 # Propositional clauses : 0
% 23.25/3.46 # Propositional clauses after purity: 0
% 23.25/3.46 # Propositional unsat core size : 0
% 23.25/3.46 # Propositional preprocessing time : 0.000
% 23.25/3.46 # Propositional encoding time : 0.243
% 23.25/3.46 # Propositional solver time : 0.068
% 23.25/3.46 # Success case prop preproc time : 0.000
% 23.25/3.46 # Success case prop encoding time : 0.000
% 23.25/3.46 # Success case prop solver time : 0.000
% 23.25/3.46 # Current number of processed clauses : 4333
% 23.25/3.46 # Positive orientable unit clauses : 460
% 23.25/3.46 # Positive unorientable unit clauses: 0
% 23.25/3.46 # Negative unit clauses : 871
% 23.25/3.46 # Non-unit-clauses : 3002
% 23.25/3.46 # Current number of unprocessed clauses: 139249
% 23.25/3.46 # ...number of literals in the above : 164342
% 23.25/3.46 # Current number of archived formulas : 0
% 23.25/3.46 # Current number of archived clauses : 2013
% 23.25/3.46 # Clause-clause subsumption calls (NU) : 4853033
% 23.25/3.46 # Rec. Clause-clause subsumption calls : 4009758
% 23.25/3.46 # Non-unit clause-clause subsumptions : 4697
% 23.25/3.46 # Unit Clause-clause subsumption calls : 401703
% 23.25/3.46 # Rewrite failures with RHS unbound : 0
% 23.25/3.46 # BW rewrite match attempts : 1422
% 23.25/3.46 # BW rewrite match successes : 33
% 23.25/3.46 # Condensation attempts : 0
% 23.25/3.46 # Condensation successes : 0
% 23.25/3.46 # Termbank termtop insertions : 4649645
% 23.25/3.46 # Search garbage collected termcells : 1982
% 23.25/3.46
% 23.25/3.46 # -------------------------------------------------
% 23.25/3.46 # User time : 2.729 s
% 23.25/3.46 # System time : 0.152 s
% 23.25/3.46 # Total time : 2.881 s
% 23.25/3.46 # Maximum resident set size: 4068 pages
% 23.25/3.46
% 23.25/3.46 # -------------------------------------------------
% 23.25/3.46 # User time : 2.750 s
% 23.25/3.46 # System time : 0.154 s
% 23.25/3.46 # Total time : 2.904 s
% 23.25/3.46 # Maximum resident set size: 2416 pages
% 23.25/3.46 % E---3.1 exiting
%------------------------------------------------------------------------------