TSTP Solution File: SET837-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET837-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:05 EDT 2024
% Result : Unsatisfiable 152.97s 19.97s
% Output : CNFRefutation 152.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of clauses : 89 ( 12 unt; 23 nHn; 67 RR)
% Number of literals : 222 ( 35 equ; 118 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 160 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OUnCI_1,axiom,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_Y,v_X,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OCompl__subset__Compl__iff__iff2_0,axiom,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OCompl__subset__Compl__iff__iff2_0) ).
cnf(cls_Set_OComplD__dest_0,axiom,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OComplD__dest_0) ).
cnf(cls_Set_OComplI_0,axiom,
( c_in(X1,X2,X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OComplI_0) ).
cnf(cls_Set_OUnCI_0,axiom,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
cnf(cls_Set_OCompl__subset__Compl__iff__iff1_0,axiom,
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OCompl__subset__Compl__iff__iff1_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( 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))
| v_X != c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_Z,v_X,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_3,negated_conjecture,
( c_lessequals(v_Z,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_5,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_X,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
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_Set_OUnE_0,axiom,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_lessequals(v_X,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(c_0_17,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_18,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_19,plain,
( c_in(X1,c_union(X2,X4,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_17 ).
cnf(c_0_20,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_Y,v_X,tc_set(t_a)) ),
cls_conjecture_0 ).
cnf(c_0_21,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_18 ).
cnf(c_0_22,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_23,negated_conjecture,
( c_in(X1,v_X,t_a)
| ~ c_in(X1,v_Y,t_a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_24,axiom,
( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_25,plain,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff2_0]) ).
cnf(c_0_26,plain,
( c_lessequals(X1,X2,tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
c_0_22 ).
cnf(c_0_27,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_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OComplD__dest_0]) ).
cnf(c_0_29,axiom,
( c_in(X1,X2,X3)
| c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
cls_Set_OComplI_0 ).
cnf(c_0_30,plain,
( c_lessequals(c_uminus(X2,tc_set(X3)),c_uminus(X1,tc_set(X3)),tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_25 ).
cnf(c_0_31,negated_conjecture,
c_lessequals(v_Y,v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( ~ c_in(X1,X2,X3)
| ~ c_in(X1,c_uminus(X2,tc_set(X3)),X3) ),
c_0_28 ).
cnf(c_0_33,plain,
( c_lessequals(X1,c_uminus(X2,tc_set(X3)),tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,c_uminus(X2,tc_set(X3)),X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_34,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_35,negated_conjecture,
c_lessequals(c_uminus(v_X,tc_set(t_a)),c_uminus(v_Y,tc_set(t_a)),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OCompl__subset__Compl__iff__iff1_0]) ).
cnf(c_0_37,plain,
( c_lessequals(X1,c_uminus(c_uminus(X2,tc_set(X3)),tc_set(X3)),tc_set(X3))
| ~ c_in(c_Main_OsubsetI__1(X1,c_uminus(c_uminus(X2,tc_set(X3)),tc_set(X3)),X3),X2,X3) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( 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))
| v_X != c_union(v_Y,v_Z,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_39,plain,
( c_in(X1,c_union(X4,X2,X3),X3)
| ~ c_in(X1,X2,X3) ),
c_0_34 ).
cnf(c_0_40,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_Z,v_X,tc_set(t_a)) ),
cls_conjecture_1 ).
cnf(c_0_41,negated_conjecture,
( c_lessequals(v_Z,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_42,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_X,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_43,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_44,negated_conjecture,
( c_in(X1,c_uminus(v_Y,tc_set(t_a)),t_a)
| ~ c_in(X1,c_uminus(v_X,tc_set(t_a)),t_a) ),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_45,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_46,plain,
( c_lessequals(X3,X1,tc_set(X2))
| ~ c_lessequals(c_uminus(X1,tc_set(X2)),c_uminus(X3,tc_set(X2)),tc_set(X2)) ),
c_0_36 ).
cnf(c_0_47,plain,
c_lessequals(X1,c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),tc_set(X2)),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_48,plain,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_49,negated_conjecture,
( 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))
| v_X != c_union(v_Y,v_Z,t_a) ),
c_0_38 ).
cnf(c_0_50,negated_conjecture,
( c_in(X1,v_X,t_a)
| ~ c_in(X1,v_Z,t_a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( c_lessequals(v_Z,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
c_0_41 ).
cnf(c_0_52,negated_conjecture,
( v_X = c_union(v_Y,v_Z,t_a)
| c_lessequals(v_X,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
c_0_42 ).
cnf(c_0_53,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_54,plain,
( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
| ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_55,negated_conjecture,
( ~ c_in(X1,c_uminus(v_X,tc_set(t_a)),t_a)
| ~ c_in(X1,v_Y,t_a) ),
inference(spm,[status(thm)],[c_0_32,c_0_44]) ).
cnf(c_0_56,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_45 ).
cnf(c_0_57,plain,
c_lessequals(c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)),X1,tc_set(X2)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_58,plain,
( c_in(X1,X3,X4)
| c_in(X1,X2,X4)
| ~ c_in(X1,c_union(X2,X3,X4),X4) ),
c_0_48 ).
cnf(c_0_59,negated_conjecture,
( c_in(X1,v_x,t_a)
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_in(X1,v_Y,t_a) ),
inference(spm,[status(thm)],[c_0_21,c_0_49]) ).
cnf(c_0_60,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_50,c_0_24]) ).
cnf(c_0_61,negated_conjecture,
( c_in(X1,v_x,t_a)
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_in(X1,v_Z,t_a) ),
inference(spm,[status(thm)],[c_0_21,c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( c_union(v_Y,v_Z,t_a) = v_X
| c_lessequals(v_X,c_union(v_Y,X1,t_a),tc_set(t_a))
| ~ c_lessequals(v_Z,c_union(v_Y,X1,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_54,c_0_24]) ).
cnf(c_0_64,negated_conjecture,
( c_lessequals(X1,c_uminus(c_uminus(v_X,tc_set(t_a)),tc_set(t_a)),tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,c_uminus(c_uminus(v_X,tc_set(t_a)),tc_set(t_a)),t_a),v_Y,t_a) ),
inference(spm,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_65,plain,
c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_47])]) ).
cnf(c_0_66,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_58,c_0_24]) ).
cnf(c_0_67,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Y,t_a) ),
inference(spm,[status(thm)],[c_0_26,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
c_lessequals(v_Z,v_X,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
( ~ c_lessequals(v_X,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_70,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_lessequals(v_Z,v_X,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Z,t_a) ),
inference(spm,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_71,negated_conjecture,
( c_union(v_Y,v_Z,t_a) = v_X
| c_lessequals(v_X,c_union(v_Y,v_Z,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_72,negated_conjecture,
( c_lessequals(X1,v_X,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_X,t_a),v_Y,t_a) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65]),c_0_65]) ).
cnf(c_0_73,negated_conjecture,
( c_lessequals(c_union(X1,v_Z,t_a),X2,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_union(X1,v_Z,t_a),X2,t_a),v_X,t_a)
| c_in(c_Main_OsubsetI__1(c_union(X1,v_Z,t_a),X2,t_a),X1,t_a) ),
inference(spm,[status(thm)],[c_0_50,c_0_66]) ).
cnf(c_0_74,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Y,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_75,negated_conjecture,
( ~ c_lessequals(v_X,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))
| v_X != c_union(v_Y,v_Z,t_a) ),
c_0_69 ).
cnf(c_0_76,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_Y,v_X,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Z,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_68])]) ).
cnf(c_0_77,negated_conjecture,
( c_union(v_Y,v_Z,t_a) = v_X
| ~ c_lessequals(c_union(v_Y,v_Z,t_a),v_X,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_56,c_0_71]) ).
cnf(c_0_78,negated_conjecture,
c_lessequals(c_union(v_Y,v_Z,t_a),v_X,tc_set(t_a)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_26]) ).
cnf(c_0_79,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Y,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_31])]) ).
cnf(c_0_80,negated_conjecture,
( c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_X,v_x,tc_set(t_a))
| ~ c_lessequals(v_Y,v_X,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_68])]) ).
cnf(c_0_81,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| c_union(v_Y,v_Z,t_a) != v_X
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Z,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_76,c_0_31])]) ).
cnf(c_0_82,negated_conjecture,
c_union(v_Y,v_Z,t_a) = v_X,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_83,negated_conjecture,
( c_lessequals(c_union(v_Y,X1,t_a),v_x,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_union(v_Y,X1,t_a),v_x,t_a),X1,t_a)
| c_union(v_Y,v_Z,t_a) != v_X ),
inference(spm,[status(thm)],[c_0_79,c_0_66]) ).
cnf(c_0_84,negated_conjecture,
( c_union(v_Y,v_Z,t_a) != v_X
| ~ c_lessequals(v_X,v_x,tc_set(t_a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_31])]) ).
cnf(c_0_85,negated_conjecture,
( c_lessequals(X1,v_x,tc_set(t_a))
| ~ c_in(c_Main_OsubsetI__1(X1,v_x,t_a),v_Z,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82])]) ).
cnf(c_0_86,negated_conjecture,
( c_lessequals(c_union(v_Y,X1,t_a),v_x,tc_set(t_a))
| c_in(c_Main_OsubsetI__1(c_union(v_Y,X1,t_a),v_x,t_a),X1,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_82])]) ).
cnf(c_0_87,negated_conjecture,
~ c_lessequals(v_X,v_x,tc_set(t_a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_82])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_82]),c_0_87]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SET837-1 : TPTP v8.2.0. Released v3.2.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 13:04:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 152.97/19.97 # Version: 3.1.0
% 152.97/19.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 152.97/19.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.97/19.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 152.97/19.97 # Starting new_bool_3 with 300s (1) cores
% 152.97/19.97 # Starting new_bool_1 with 300s (1) cores
% 152.97/19.97 # Starting sh5l with 300s (1) cores
% 152.97/19.97 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 10490 completed with status 0
% 152.97/19.97 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 152.97/19.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 152.97/19.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.97/19.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 152.97/19.97 # No SInE strategy applied
% 152.97/19.97 # Search class: FGHSM-SSLM33-MFFFFFNN
% 152.97/19.97 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 152.97/19.97 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 152.97/19.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 152.97/19.97 # Starting new_bool_3 with 136s (1) cores
% 152.97/19.97 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 152.97/19.97 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 152.97/19.97 # G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 10497 completed with status 0
% 152.97/19.97 # Result found by G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 152.97/19.97 # Preprocessing class: FMLMSMSMSSSNFFN.
% 152.97/19.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.97/19.97 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 152.97/19.97 # No SInE strategy applied
% 152.97/19.97 # Search class: FGHSM-SSLM33-MFFFFFNN
% 152.97/19.97 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 152.97/19.97 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 152.97/19.97 # Preprocessing time : 0.011 s
% 152.97/19.97 # Presaturation interreduction done
% 152.97/19.97
% 152.97/19.97 # Proof found!
% 152.97/19.97 # SZS status Unsatisfiable
% 152.97/19.97 # SZS output start CNFRefutation
% See solution above
% 152.97/19.97 # Parsed axioms : 1363
% 152.97/19.97 # Removed by relevancy pruning/SinE : 0
% 152.97/19.97 # Initial clauses : 1363
% 152.97/19.97 # Removed in clause preprocessing : 1
% 152.97/19.97 # Initial clauses in saturation : 1362
% 152.97/19.97 # Processed clauses : 55391
% 152.97/19.97 # ...of these trivial : 1266
% 152.97/19.97 # ...subsumed : 44605
% 152.97/19.97 # ...remaining for further processing : 9520
% 152.97/19.97 # Other redundant clauses eliminated : 231
% 152.97/19.97 # Clauses deleted for lack of memory : 0
% 152.97/19.97 # Backward-subsumed : 542
% 152.97/19.97 # Backward-rewritten : 2152
% 152.97/19.97 # Generated clauses : 340135
% 152.97/19.97 # ...of the previous two non-redundant : 321649
% 152.97/19.97 # ...aggressively subsumed : 0
% 152.97/19.97 # Contextual simplify-reflections : 16
% 152.97/19.97 # Paramodulations : 339827
% 152.97/19.97 # Factorizations : 36
% 152.97/19.97 # NegExts : 0
% 152.97/19.97 # Equation resolutions : 272
% 152.97/19.97 # Disequality decompositions : 0
% 152.97/19.97 # Total rewrite steps : 228259
% 152.97/19.97 # ...of those cached : 218806
% 152.97/19.97 # Propositional unsat checks : 1
% 152.97/19.97 # Propositional check models : 0
% 152.97/19.97 # Propositional check unsatisfiable : 0
% 152.97/19.97 # Propositional clauses : 0
% 152.97/19.97 # Propositional clauses after purity: 0
% 152.97/19.97 # Propositional unsat core size : 0
% 152.97/19.97 # Propositional preprocessing time : 0.000
% 152.97/19.97 # Propositional encoding time : 0.161
% 152.97/19.97 # Propositional solver time : 0.102
% 152.97/19.97 # Success case prop preproc time : 0.000
% 152.97/19.97 # Success case prop encoding time : 0.000
% 152.97/19.97 # Success case prop solver time : 0.000
% 152.97/19.97 # Current number of processed clauses : 5500
% 152.97/19.97 # Positive orientable unit clauses : 643
% 152.97/19.97 # Positive unorientable unit clauses: 0
% 152.97/19.97 # Negative unit clauses : 428
% 152.97/19.97 # Non-unit-clauses : 4429
% 152.97/19.97 # Current number of unprocessed clauses: 264330
% 152.97/19.97 # ...number of literals in the above : 782730
% 152.97/19.97 # Current number of archived formulas : 0
% 152.97/19.97 # Current number of archived clauses : 4020
% 152.97/19.97 # Clause-clause subsumption calls (NU) : 13875814
% 152.97/19.97 # Rec. Clause-clause subsumption calls : 9886374
% 152.97/19.97 # Non-unit clause-clause subsumptions : 24291
% 152.97/19.97 # Unit Clause-clause subsumption calls : 360283
% 152.97/19.97 # Rewrite failures with RHS unbound : 0
% 152.97/19.97 # BW rewrite match attempts : 2266
% 152.97/19.97 # BW rewrite match successes : 422
% 152.97/19.97 # Condensation attempts : 0
% 152.97/19.97 # Condensation successes : 0
% 152.97/19.97 # Termbank termtop insertions : 13824211
% 152.97/19.97 # Search garbage collected termcells : 1607
% 152.97/19.97
% 152.97/19.97 # -------------------------------------------------
% 152.97/19.97 # User time : 18.660 s
% 152.97/19.97 # System time : 0.391 s
% 152.97/19.97 # Total time : 19.051 s
% 152.97/19.97 # Maximum resident set size: 3892 pages
% 152.97/19.97
% 152.97/19.97 # -------------------------------------------------
% 152.97/19.97 # User time : 93.830 s
% 152.97/19.97 # System time : 1.632 s
% 152.97/19.97 # Total time : 95.462 s
% 152.97/19.97 # Maximum resident set size: 2408 pages
% 152.97/19.97 % E---3.1 exiting
%------------------------------------------------------------------------------