↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : PUZ064-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:02:29 PM UTC 2026

% Result   : Unsatisfiable 219.99s 32.39s
% Output   : CNFRefutation 219.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   22
% Syntax   : Number of clauses     :   84 (  56 unt;   0 nHn;  57 RR)
%            Number of literals    :  132 (  60 equ;  55 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-4 aty)
%            Number of variables   :  149 (  13 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_4,negated_conjecture,
    c_inter(c_union(v_a,v_t,t_a),v_u,t_a) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_Relation_OImage__diag_0,axiom,
    c_Relation_OImage(c_Relation_Odiag(X1,X2),X3,X2,X2) = c_inter(X1,X3,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Relation_OImage__diag_0) ).

cnf(cls_Set_ODiff__Compl_0,axiom,
    c_minus(X1,c_uminus(X2,tc_set(X3)),tc_set(X3)) = c_inter(X1,X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__Compl_0) ).

cnf(cls_Set_OCompl__Un_0,axiom,
    c_uminus(c_union(X1,X2,X3),tc_set(X3)) = c_inter(c_uminus(X1,tc_set(X3)),c_uminus(X2,tc_set(X3)),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OCompl__Un_0) ).

cnf(cls_Set_ODiff__disjoint_0,axiom,
    c_inter(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__disjoint_0) ).

cnf(cls_Set_Odouble__complement_0,axiom,
    c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Odouble__complement_0) ).

cnf(cls_Set_OUn__Diff__cancel2_0,axiom,
    c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__Diff__cancel2_0) ).

cnf(cls_Set_OUn__empty__left_0,axiom,
    c_union(c_emptyset,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__empty__left_0) ).

cnf(cls_Set_OUn__assoc_0,axiom,
    c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUn__assoc_0) ).

cnf(cls_Mutil_Otiling_OUn_0,axiom,
    ( c_inter(X1,X4,X3) != c_emptyset
    | ~ c_in(X4,c_Mutil_Otiling(X2,X3),tc_set(X3))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(X1,X4,X3),c_Mutil_Otiling(X2,X3),tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Mutil_Otiling_OUn_0) ).

cnf(cls_conjecture_6,negated_conjecture,
    ( ~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | c_inter(v_t,v_u,t_a) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_6) ).

cnf(cls_Set_OUn__absorb_0,axiom,
    c_union(X1,X1,X2) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__absorb_0) ).

cnf(cls_conjecture_5,negated_conjecture,
    ~ c_in(c_union(c_union(v_a,v_t,t_a),v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

cnf(cls_conjecture_3,negated_conjecture,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_Set_OCompl__Diff__eq_0,axiom,
    c_uminus(c_minus(X1,X2,tc_set(X3)),tc_set(X3)) = c_union(c_uminus(X1,tc_set(X3)),X2,X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OCompl__Diff__eq_0) ).

cnf(cls_Set_OInt__subset__iff_2,axiom,
    ( ~ c_lessequals(X1,X4,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X1,c_inter(X4,X2,X3),tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OInt__subset__iff_2) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_a,v_A,tc_set(t_a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_Set_ODiff__eq__empty__iff_1,axiom,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__eq__empty__iff_1) ).

cnf(cls_Set_ODiff__cancel_0,axiom,
    c_minus(X1,X1,tc_set(X2)) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__cancel_0) ).

cnf(cls_Set_ODiff__eq__empty__iff_0,axiom,
    ( c_minus(X1,X2,tc_set(X3)) != c_emptyset
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_ODiff__eq__empty__iff_0) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_inter(v_a,v_t,t_a) = c_emptyset,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(cls_Set_OUn__subset__iff_0,axiom,
    ( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
    | c_lessequals(X1,X4,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_OUn__subset__iff_0) ).

cnf(c_0_22,negated_conjecture,
    c_inter(c_union(v_a,v_t,t_a),v_u,t_a) = c_emptyset,
    cls_conjecture_4 ).

cnf(c_0_23,axiom,
    c_Relation_OImage(c_Relation_Odiag(X1,X2),X3,X2,X2) = c_inter(X1,X3,X2),
    cls_Relation_OImage__diag_0 ).

cnf(c_0_24,axiom,
    c_minus(X1,c_uminus(X2,tc_set(X3)),tc_set(X3)) = c_inter(X1,X2,X3),
    cls_Set_ODiff__Compl_0 ).

cnf(c_0_25,axiom,
    c_uminus(c_union(X1,X2,X3),tc_set(X3)) = c_inter(c_uminus(X1,tc_set(X3)),c_uminus(X2,tc_set(X3)),X3),
    cls_Set_OCompl__Un_0 ).

cnf(c_0_26,negated_conjecture,
    c_Relation_OImage(c_Relation_Odiag(c_union(v_a,v_t,t_a),t_a),v_u,t_a,t_a) = c_emptyset,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    c_minus(X1,c_uminus(X2,tc_set(X3)),tc_set(X3)) = c_Relation_OImage(c_Relation_Odiag(X1,X3),X2,X3,X3),
    inference(rw,[status(thm)],[c_0_24,c_0_23]) ).

cnf(c_0_28,axiom,
    c_inter(X1,c_minus(X2,X1,tc_set(X3)),X3) = c_emptyset,
    cls_Set_ODiff__disjoint_0 ).

cnf(c_0_29,plain,
    c_uminus(c_union(X1,X2,X3),tc_set(X3)) = c_Relation_OImage(c_Relation_Odiag(c_uminus(X1,tc_set(X3)),X3),c_uminus(X2,tc_set(X3)),X3,X3),
    inference(rw,[status(thm)],[c_0_25,c_0_23]) ).

cnf(c_0_30,axiom,
    c_uminus(c_uminus(X1,tc_set(X2)),tc_set(X2)) = X1,
    cls_Set_Odouble__complement_0 ).

cnf(c_0_31,axiom,
    c_union(c_minus(X1,X2,tc_set(X3)),X2,X3) = c_union(X1,X2,X3),
    cls_Set_OUn__Diff__cancel2_0 ).

cnf(c_0_32,negated_conjecture,
    c_minus(c_union(v_a,v_t,t_a),c_uminus(v_u,tc_set(t_a)),tc_set(t_a)) = c_emptyset,
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,axiom,
    c_union(c_emptyset,X1,X2) = X1,
    cls_Set_OUn__empty__left_0 ).

cnf(c_0_34,axiom,
    c_union(c_union(X1,X2,X3),X4,X3) = c_union(X1,c_union(X2,X4,X3),X3),
    cls_Set_OUn__assoc_0 ).

cnf(c_0_35,plain,
    c_Relation_OImage(c_Relation_Odiag(X1,X3),c_minus(X2,X1,tc_set(X3)),X3,X3) = c_emptyset,
    inference(rw,[status(thm)],[c_0_28,c_0_23]) ).

cnf(c_0_36,plain,
    c_uminus(c_union(X1,X2,X3),tc_set(X3)) = c_minus(c_uminus(X1,tc_set(X3)),X2,tc_set(X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_27]),c_0_30]) ).

cnf(c_0_37,negated_conjecture,
    c_union(v_a,c_union(v_t,c_uminus(v_u,tc_set(t_a)),t_a),t_a) = c_uminus(v_u,tc_set(t_a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).

cnf(c_0_38,plain,
    c_minus(X1,c_uminus(c_minus(X2,X1,tc_set(X3)),tc_set(X3)),tc_set(X3)) = c_emptyset,
    inference(rw,[status(thm)],[c_0_35,c_0_27]) ).

cnf(c_0_39,negated_conjecture,
    c_minus(c_uminus(v_a,tc_set(t_a)),c_union(v_t,c_uminus(v_u,tc_set(t_a)),t_a),tc_set(t_a)) = v_u,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30]) ).

cnf(c_0_40,plain,
    ( c_inter(X1,X4,X3) != c_emptyset
    | ~ c_in(X4,c_Mutil_Otiling(X2,X3),tc_set(X3))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(X1,X4,X3),c_Mutil_Otiling(X2,X3),tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Mutil_Otiling_OUn_0]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | c_inter(v_t,v_u,t_a) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_6]) ).

cnf(c_0_42,negated_conjecture,
    c_minus(c_union(v_t,c_uminus(v_u,tc_set(t_a)),t_a),c_uminus(v_u,tc_set(t_a)),tc_set(t_a)) = c_emptyset,
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,axiom,
    c_union(X1,X1,X2) = X1,
    cls_Set_OUn__absorb_0 ).

cnf(c_0_44,negated_conjecture,
    ~ c_in(c_union(c_union(v_a,v_t,t_a),v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_45,plain,
    ( c_inter(X1,X4,X3) != c_emptyset
    | ~ c_in(X4,c_Mutil_Otiling(X2,X3),tc_set(X3))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_in(c_union(X1,X4,X3),c_Mutil_Otiling(X2,X3),tc_set(X3)) ),
    c_0_40 ).

cnf(c_0_46,negated_conjecture,
    ( ~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | c_inter(v_t,v_u,t_a) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    c_0_41 ).

cnf(c_0_47,negated_conjecture,
    c_union(v_t,c_uminus(v_u,tc_set(t_a)),t_a) = c_uminus(v_u,tc_set(t_a)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_42]),c_0_33]),c_0_34]),c_0_43]) ).

cnf(c_0_48,negated_conjecture,
    ~ c_in(c_union(c_union(v_a,v_t,t_a),v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    c_0_44 ).

cnf(c_0_49,plain,
    ( ~ c_in(X4,c_Mutil_Otiling(X2,X3),tc_set(X3))
    | ~ c_in(X1,X2,tc_set(X3))
    | c_Relation_OImage(c_Relation_Odiag(X1,X3),X4,X3,X3) != c_emptyset
    | c_in(c_union(X1,X4,X3),c_Mutil_Otiling(X2,X3),tc_set(X3)) ),
    inference(rw,[status(thm)],[c_0_45,c_0_23]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | c_Relation_OImage(c_Relation_Odiag(v_t,t_a),v_u,t_a,t_a) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    inference(rw,[status(thm)],[c_0_46,c_0_23]) ).

cnf(c_0_51,negated_conjecture,
    c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    cls_conjecture_3 ).

cnf(c_0_52,negated_conjecture,
    c_minus(c_uminus(v_t,tc_set(t_a)),c_uminus(v_u,tc_set(t_a)),tc_set(t_a)) = v_u,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_47]),c_0_30]) ).

cnf(c_0_53,axiom,
    c_uminus(c_minus(X1,X2,tc_set(X3)),tc_set(X3)) = c_union(c_uminus(X1,tc_set(X3)),X2,X3),
    cls_Set_OCompl__Diff__eq_0 ).

cnf(c_0_54,plain,
    ( ~ c_lessequals(X1,X4,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X1,c_inter(X4,X2,X3),tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OInt__subset__iff_2]) ).

cnf(c_0_55,negated_conjecture,
    ~ c_in(c_union(v_a,c_union(v_t,v_u,t_a),t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(rw,[status(thm)],[c_0_48,c_0_34]) ).

cnf(c_0_56,plain,
    ( ~ c_in(X1,X4,tc_set(X3))
    | ~ c_in(X2,c_Mutil_Otiling(X4,X3),tc_set(X3))
    | c_minus(X1,c_uminus(X2,tc_set(X3)),tc_set(X3)) != c_emptyset
    | c_in(c_union(X1,X2,X3),c_Mutil_Otiling(X4,X3),tc_set(X3)) ),
    inference(rw,[status(thm)],[c_0_49,c_0_27]) ).

cnf(c_0_57,negated_conjecture,
    c_in(v_a,v_A,tc_set(t_a)),
    cls_conjecture_0 ).

cnf(c_0_58,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    inference(fof_simplification,[status(thm)],[cls_Set_ODiff__eq__empty__iff_1]) ).

cnf(c_0_59,negated_conjecture,
    ( c_Relation_OImage(c_Relation_Odiag(v_t,t_a),v_u,t_a,t_a) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).

cnf(c_0_60,negated_conjecture,
    c_union(v_u,c_uminus(v_u,tc_set(t_a)),t_a) = c_uminus(c_minus(v_t,c_uminus(v_u,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_52]),c_0_53]) ).

cnf(c_0_61,axiom,
    c_minus(X1,X1,tc_set(X2)) = c_emptyset,
    cls_Set_ODiff__cancel_0 ).

cnf(c_0_62,plain,
    ( ~ c_lessequals(X1,X4,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | c_lessequals(X1,c_inter(X4,X2,X3),tc_set(X3)) ),
    c_0_54 ).

cnf(c_0_63,plain,
    ( c_minus(X1,X2,tc_set(X3)) != c_emptyset
    | c_lessequals(X1,X2,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_ODiff__eq__empty__iff_0]) ).

cnf(c_0_64,negated_conjecture,
    c_inter(v_a,v_t,t_a) = c_emptyset,
    cls_conjecture_2 ).

cnf(c_0_65,negated_conjecture,
    ( ~ c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | c_minus(v_a,c_minus(c_uminus(v_t,tc_set(t_a)),v_u,tc_set(t_a)),tc_set(t_a)) != c_emptyset ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_36]),c_0_57])]) ).

cnf(c_0_66,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | c_minus(X1,X2,tc_set(X3)) = c_emptyset ),
    c_0_58 ).

cnf(c_0_67,negated_conjecture,
    ( c_minus(v_t,c_uminus(v_u,tc_set(t_a)),tc_set(t_a)) != c_emptyset
    | c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ),
    inference(rw,[status(thm)],[c_0_59,c_0_27]) ).

cnf(c_0_68,negated_conjecture,
    c_minus(v_t,c_uminus(v_u,tc_set(t_a)),tc_set(t_a)) = c_emptyset,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_60]),c_0_30]),c_0_61]) ).

cnf(c_0_69,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X1,X4,tc_set(X3))
    | c_lessequals(X1,c_Relation_OImage(c_Relation_Odiag(X4,X3),X2,X3,X3),tc_set(X3)) ),
    inference(rw,[status(thm)],[c_0_62,c_0_23]) ).

cnf(c_0_70,plain,
    ( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
    | c_lessequals(X1,X4,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUn__subset__iff_0]) ).

cnf(c_0_71,plain,
    ( c_minus(X1,X2,tc_set(X3)) != c_emptyset
    | c_lessequals(X1,X2,tc_set(X3)) ),
    c_0_63 ).

cnf(c_0_72,negated_conjecture,
    c_Relation_OImage(c_Relation_Odiag(v_a,t_a),v_t,t_a,t_a) = c_emptyset,
    inference(rw,[status(thm)],[c_0_64,c_0_23]) ).

cnf(c_0_73,negated_conjecture,
    ( ~ c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a))
    | ~ c_lessequals(v_a,c_minus(c_uminus(v_t,tc_set(t_a)),v_u,tc_set(t_a)),tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_74,negated_conjecture,
    c_in(c_union(v_t,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).

cnf(c_0_75,plain,
    ( ~ c_lessequals(X1,X3,tc_set(X4))
    | ~ c_lessequals(X1,X2,tc_set(X4))
    | c_lessequals(X1,c_minus(X2,c_uminus(X3,tc_set(X4)),tc_set(X4)),tc_set(X4)) ),
    inference(rw,[status(thm)],[c_0_69,c_0_27]) ).

cnf(c_0_76,plain,
    ( ~ c_lessequals(c_union(X1,X2,X3),X4,tc_set(X3))
    | c_lessequals(X1,X4,tc_set(X3)) ),
    c_0_70 ).

cnf(c_0_77,negated_conjecture,
    c_lessequals(c_union(v_a,v_t,t_a),c_uminus(v_u,tc_set(t_a)),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_71,c_0_32]) ).

cnf(c_0_78,negated_conjecture,
    c_minus(v_a,c_uminus(v_t,tc_set(t_a)),tc_set(t_a)) = c_emptyset,
    inference(rw,[status(thm)],[c_0_72,c_0_27]) ).

cnf(c_0_79,negated_conjecture,
    ~ c_lessequals(v_a,c_minus(c_uminus(v_t,tc_set(t_a)),v_u,tc_set(t_a)),tc_set(t_a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).

cnf(c_0_80,plain,
    ( ~ c_lessequals(X1,X2,tc_set(X4))
    | ~ c_lessequals(X1,c_uminus(X3,tc_set(X4)),tc_set(X4))
    | c_lessequals(X1,c_minus(X2,X3,tc_set(X4)),tc_set(X4)) ),
    inference(spm,[status(thm)],[c_0_75,c_0_30]) ).

cnf(c_0_81,negated_conjecture,
    c_lessequals(v_a,c_uminus(v_u,tc_set(t_a)),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_82,negated_conjecture,
    c_lessequals(v_a,c_uminus(v_t,tc_set(t_a)),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_71,c_0_78]) ).

cnf(c_0_83,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ064-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37  % Computer : n026.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8046.5625MB
% 0.13/0.37  % OS       : Linux 6.8.0-71-generic
% 0.13/0.37  % CPULimit : 300
% 0.13/0.37  % WCLimit  : 300
% 0.13/0.37  % DateTime : Mon Sep 21 03:52:22 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44  Running first-order theorem proving
% 0.13/0.44  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 219.99/32.39  % Version: 3.5.1
% 219.99/32.39  % Preprocessing class: FMLMSMSMSSSNFFN.
% 219.99/32.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 219.99/32.39  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 219.99/32.39  % Starting new_bool_3 with 300s (1) cores
% 219.99/32.39  % Starting new_bool_1 with 300s (1) cores
% 219.99/32.39  % Starting sh5l with 300s (1) cores
% 219.99/32.39  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1302444 completed with status 0
% 219.99/32.39  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 219.99/32.39  % Preprocessing class: FMLMSMSMSSSNFFN.
% 219.99/32.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 219.99/32.39  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 219.99/32.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 219.99/32.39  % No SInE strategy applied
% 219.99/32.39  % Search class: FGHSM-SMLM33-DFFFFFNN
% 219.99/32.39  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 219.99/32.39  % Starting SubtermCWHack with 136s (1) cores
% 219.99/32.39  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 219.99/32.39  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 219.99/32.39  % Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 219.99/32.39  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 219.99/32.39  % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1302454 completed with status 0
% 219.99/32.39  % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 219.99/32.39  % Preprocessing class: FMLMSMSMSSSNFFN.
% 219.99/32.39  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 219.99/32.39  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 219.99/32.39  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 219.99/32.39  % No SInE strategy applied
% 219.99/32.39  % Search class: FGHSM-SMLM33-DFFFFFNN
% 219.99/32.39  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 219.99/32.39  % Starting SubtermCWHack with 136s (1) cores
% 219.99/32.39  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 219.99/32.39  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 219.99/32.39  % Starting SAT001_CA_MinMin_p005000_rr with 136s (1) cores
% 219.99/32.39  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 219.99/32.39  % Preprocessing time       : 0.045 s
% 219.99/32.39  % Presaturation interreduction done
% 219.99/32.39  
% 219.99/32.39  % Proof found!
% 219.99/32.39  % SZS status Unsatisfiable
% 219.99/32.39  % SZS output start CNFRefutation
% See solution above
% 219.99/32.39  % Parsed axioms                        : 2739
% 219.99/32.39  % Removed by relevancy pruning/SinE    : 0
% 219.99/32.39  % Initial clauses                      : 2739
% 219.99/32.39  % Removed in clause preprocessing      : 9
% 219.99/32.39  % Initial clauses in saturation        : 2730
% 219.99/32.39  % Processed clauses                    : 81538
% 219.99/32.39  % ...of these trivial                  : 363
% 219.99/32.39  % ...subsumed                          : 63574
% 219.99/32.39  % ...remaining for further processing  : 17601
% 219.99/32.39  % Other redundant clauses eliminated   : 2728
% 219.99/32.39  % Clauses deleted for lack of memory   : 0
% 219.99/32.39  % Backward-subsumed                    : 1566
% 219.99/32.39  % Backward-rewritten                   : 1388
% 219.99/32.39  % Generated clauses                    : 450503
% 219.99/32.39  % ...of the previous two non-redundant : 416472
% 219.99/32.39  % ...aggressively subsumed             : 0
% 219.99/32.39  % Contextual simplify-reflections      : 695
% 219.99/32.39  % Paramodulations                      : 447681
% 219.99/32.39  % Factorizations                       : 8
% 219.99/32.39  % NegExts                              : 0
% 219.99/32.39  % Equation resolutions                 : 2802
% 219.99/32.39  % Disequality decompositions           : 0
% 219.99/32.39  % Total rewrite steps                  : 275821
% 219.99/32.39  % ...of those cached                   : 259478
% 219.99/32.39  % Propositional unsat checks           : 3
% 219.99/32.39  %    Propositional check models        : 1
% 219.99/32.39  %    Propositional check unsatisfiable : 0
% 219.99/32.39  %    Propositional clauses             : 0
% 219.99/32.39  %    Propositional clauses after purity: 0
% 219.99/32.39  %    Propositional unsat core size     : 0
% 219.99/32.39  %    Propositional preprocessing time  : 0.000
% 219.99/32.39  %    Propositional encoding time       : 0.922
% 219.99/32.39  %    Propositional solver time         : 0.816
% 219.99/32.39  %    Success case prop preproc time    : 0.000
% 219.99/32.39  %    Success case prop encoding time   : 0.000
% 219.99/32.39  %    Success case prop solver time     : 0.000
% 219.99/32.39  % Current number of processed clauses  : 12026
% 219.99/32.39  %    Positive orientable unit clauses  : 1095
% 219.99/32.39  %    Positive unorientable unit clauses: 64
% 219.99/32.39  %    Negative unit clauses             : 1515
% 219.99/32.39  %    Non-unit-clauses                  : 9352
% 219.99/32.39  % Current number of unprocessed clauses: 329707
% 219.99/32.39  % ...number of literals in the above   : 1039567
% 219.99/32.39  % Current number of archived formulas  : 0
% 219.99/32.39  % Current number of archived clauses   : 5575
% 219.99/32.39  % Clause-clause subsumption calls (NU) : 21858447
% 219.99/32.39  % Rec. Clause-clause subsumption calls : 12946978
% 219.99/32.39  % Non-unit clause-clause subsumptions  : 23767
% 219.99/32.39  % Unit Clause-clause subsumption calls : 872268
% 219.99/32.39  % Rewrite failures with RHS unbound    : 334
% 219.99/32.39  % BW rewrite match attempts            : 3631
% 219.99/32.39  % BW rewrite match successes           : 900
% 219.99/32.39  % Condensation attempts                : 0
% 219.99/32.39  % Condensation successes               : 0
% 219.99/32.39  % Termbank termtop insertions          : 11483384
% 219.99/32.39  % Search garbage collected termcells   : 3977
% 219.99/32.39  
% 219.99/32.39  % -------------------------------------------------
% 219.99/32.39  % User time                : 30.625 s
% 219.99/32.39  % System time              : 0.629 s
% 219.99/32.39  % Total time               : 31.254 s
% 219.99/32.39  % Maximum resident set size: 8468 pages
% 219.99/32.39  
% 219.99/32.39  % -------------------------------------------------
% 219.99/32.39  % User time                : 153.471 s
% 219.99/32.39  % System time              : 3.674 s
% 219.99/32.39  % Total time               : 157.144 s
% 219.99/32.39  % Maximum resident set size: 6400 pages
% 219.99/32.39  % E exiting
%------------------------------------------------------------------------------