↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SCT096-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n003.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:07:42 PM UTC 2026

% Result   : Unsatisfiable 195.33s 28.95s
% Output   : CNFRefutation 195.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   18
% Syntax   : Number of clauses     :   84 (  36 unt;  24 nHn;  29 RR)
%            Number of literals    :  142 (  36 equ;  48 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   2 con; 0-5 aty)
%            Number of variables   :  316 ( 135 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_mem__def_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

cnf(cls_insert__code_2,axiom,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_2) ).

cnf(cls_ComplI_0,axiom,
    ( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_ComplI_0) ).

cnf(cls_insert__code_0,axiom,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_0) ).

cnf(cls_insert__commute_0,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__commute_0) ).

cnf(cls_Int__insert__left_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
    | c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Int__insert__left_0) ).

cnf(cls_insert__not__empty_0,axiom,
    c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__not__empty_0) ).

cnf(cls_double__complement_0,axiom,
    hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_double__complement_0) ).

cnf(cls_Compl__disjoint_0,axiom,
    c_Lattices_Olower__semilattice__class_Oinf(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X1),tc_fun(X2,tc_bool)) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Compl__disjoint_0) ).

cnf(cls_mem__def_1,axiom,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

cnf(cls_bot1E_0,axiom,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_bot1E_0) ).

cnf(cls_COMBS__def_0,axiom,
    hAPP(c_COMBS(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),hAPP(X2,X6)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_COMBS__def_0) ).

cnf(cls_insert__absorb_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb_0) ).

cnf(cls_plus__nat_Oadd__0_0,axiom,
    hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_plus__nat_Oadd__0_0) ).

cnf(cls_ATP__Linkup_Oequal__imp__fequal_0,axiom,
    hBOOL(hAPP(hAPP(c_fequal(X1),X2),X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_ATP__Linkup_Oequal__imp__fequal_0) ).

cnf(cls_insert__code_1,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__code_1) ).

cnf(cls_insert__absorb2_0,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X1,X2,X3),X3) = c_Set_Oinsert(X1,X2,X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insert__absorb2_0) ).

cnf(cls_insertE_0,axiom,
    ( ~ hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X4,X3,X1)))
    | X2 = X4
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_insertE_0) ).

cnf(c_0_18,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_0]) ).

cnf(c_0_19,plain,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__code_2]) ).

cnf(c_0_20,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X2),X1))
    | hBOOL(hAPP(X1,X2)) ),
    c_0_18 ).

cnf(c_0_21,axiom,
    ( hBOOL(hAPP(hAPP(c_in(X1),X2),X3))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
    cls_ComplI_0 ).

cnf(c_0_22,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[cls_insert__code_0]) ).

cnf(c_0_23,plain,
    ( ~ hBOOL(hAPP(X2,X4))
    | hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X4)) ),
    c_0_19 ).

cnf(c_0_24,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    cls_insert__commute_0 ).

cnf(c_0_25,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
    | c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
    inference(fof_simplification,[status(thm)],[cls_Int__insert__left_0]) ).

cnf(c_0_26,plain,
    c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
    inference(fof_simplification,[status(thm)],[cls_insert__not__empty_0]) ).

cnf(c_0_27,plain,
    ( hBOOL(hAPP(hAPP(c_in(X1),X3),X2))
    | hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_28,axiom,
    hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2)) = X2,
    cls_double__complement_0 ).

cnf(c_0_29,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X3,X1,X4),X2))
    | X3 = X2
    | hBOOL(hAPP(X1,X2)) ),
    c_0_22 ).

cnf(c_0_30,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X1,X3,X4),X5))
    | hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4),X5)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,axiom,
    c_Lattices_Olower__semilattice__class_Oinf(X1,hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X1),tc_fun(X2,tc_bool)) = c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)),
    cls_Compl__disjoint_0 ).

cnf(c_0_32,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
    | c_Lattices_Olower__semilattice__class_Oinf(c_Set_Oinsert(X1,X2,X3),X4,tc_fun(X3,tc_bool)) = c_Set_Oinsert(X1,c_Lattices_Olower__semilattice__class_Oinf(X2,X4,tc_fun(X3,tc_bool)),X3) ),
    c_0_25 ).

cnf(c_0_33,plain,
    c_Set_Oinsert(X1,X2,X3) != c_Orderings_Obot__class_Obot(tc_fun(X3,tc_bool)),
    c_0_26 ).

cnf(c_0_34,plain,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    inference(fof_simplification,[status(thm)],[cls_mem__def_1]) ).

cnf(c_0_35,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    inference(fof_simplification,[status(thm)],[cls_bot1E_0]) ).

cnf(c_0_36,plain,
    ( hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_37,axiom,
    hAPP(c_COMBS(X1,X2,X3,X4,X5),X6) = hAPP(hAPP(X1,X6),hAPP(X2,X6)),
    cls_COMBS__def_0 ).

cnf(c_0_38,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X2,X4,X5),X1))
    | hBOOL(hAPP(c_Set_Oinsert(X3,X4,X5),X1))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_39,plain,
    ~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Set_Oinsert(X2,X3,X1)))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_40,plain,
    ( ~ hBOOL(hAPP(X3,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    c_0_34 ).

cnf(c_0_41,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_insert__absorb_0]) ).

cnf(c_0_42,plain,
    ~ hBOOL(hAPP(c_Orderings_Obot__class_Obot(tc_fun(X1,tc_bool)),X2)),
    c_0_35 ).

cnf(c_0_43,plain,
    ( hBOOL(hAPP(X5,X5))
    | hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2,X3,X4),X5)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_44,axiom,
    hAPP(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X1) = X1,
    cls_plus__nat_Oadd__0_0 ).

cnf(c_0_45,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X2,X5,X6),X1))
    | hBOOL(hAPP(c_Set_Oinsert(X3,c_Set_Oinsert(X4,X5,X6),X6),X1))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_38,c_0_30]) ).

cnf(c_0_46,plain,
    ~ hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Set_Oinsert(X2,X3,X1)),X2)),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_47,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X3),X1),X2))
    | c_Set_Oinsert(X1,X2,X3) = X2 ),
    c_0_41 ).

cnf(c_0_48,plain,
    ( ~ hBOOL(hAPP(c_COMBS(c_in(X3),X1,X4,X5,X6),X2))
    | hBOOL(hAPP(hAPP(X1,X2),X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_37]) ).

cnf(c_0_49,plain,
    hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2,X3,X4),c_Orderings_Obot__class_Obot(tc_fun(X5,tc_bool)))),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_50,axiom,
    hBOOL(hAPP(hAPP(c_fequal(X1),X2),X2)),
    cls_ATP__Linkup_Oequal__imp__fequal_0 ).

cnf(c_0_51,plain,
    hAPP(c_COMBS(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X1,X2,X3,X4),X5) = hAPP(X5,hAPP(X1,X5)),
    inference(spm,[status(thm)],[c_0_37,c_0_44]) ).

cnf(c_0_52,plain,
    ( ~ hBOOL(hAPP(X5,X1))
    | hBOOL(hAPP(c_Set_Oinsert(X3,c_Set_Oinsert(X4,X5,X6),X6),X1))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_45,c_0_23]) ).

cnf(c_0_53,axiom,
    hBOOL(hAPP(c_Set_Oinsert(X1,X2,X3),X1)),
    cls_insert__code_1 ).

cnf(c_0_54,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X1),X3),X2))
    | ~ hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_55,plain,
    hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool))),c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)))),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_56,plain,
    hBOOL(hAPP(hAPP(c_COMBS(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X1,X2,X3,X4),c_fequal(X5)),hAPP(X1,c_fequal(X5)))),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_57,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(X3,c_Set_Oinsert(X4,c_Set_Oinsert(X1,X5,X6),X7),X7),X1))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_58,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X1,X2,X3),X3) = c_Set_Oinsert(X1,X2,X3),
    cls_insert__absorb2_0 ).

cnf(c_0_59,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X4,X3,X1)))
    | X2 = X4
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    inference(fof_simplification,[status(thm)],[cls_insertE_0]) ).

cnf(c_0_60,plain,
    ~ hBOOL(hAPP(hAPP(c_in(X1),c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool))),c_Orderings_Obot__class_Obot(tc_fun(X2,tc_bool)))),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_61,plain,
    hAPP(c_COMBS(X1,hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X2,X3,X4),X5) = hAPP(hAPP(X1,X5),X5),
    inference(spm,[status(thm)],[c_0_37,c_0_44]) ).

cnf(c_0_62,plain,
    hBOOL(hAPP(c_COMBS(c_COMBS(hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X1,X2,X3,X4),X1,X5,X6,X7),c_fequal(X8))),
    inference(spm,[status(thm)],[c_0_56,c_0_37]) ).

cnf(c_0_63,plain,
    ( hBOOL(hAPP(c_Set_Oinsert(X3,c_Set_Oinsert(X1,X4,X5),X6),X1))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_57,c_0_58]) ).

cnf(c_0_64,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X4,X3,X1)))
    | X2 = X4
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    c_0_59 ).

cnf(c_0_65,plain,
    ~ hBOOL(hAPP(c_COMBS(c_in(X1),hAPP(c_HOL_Oplus__class_Oplus(tc_nat),c_HOL_Ozero__class_Ozero(tc_nat)),X2,X3,X4),c_Orderings_Obot__class_Obot(tc_fun(X5,tc_bool)))),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_66,plain,
    ( hBOOL(X2)
    | hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X5),X2)) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_67,plain,
    ( ~ hBOOL(hAPP(c_Set_Oinsert(X2,X4,X3),X1))
    | hBOOL(hAPP(hAPP(c_in(X3),X1),X4))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_64,c_0_40]) ).

cnf(c_0_68,plain,
    hBOOL(hAPP(c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X5),X2)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_63]),c_0_66]) ).

cnf(c_0_69,plain,
    ( hBOOL(hAPP(hAPP(c_in(X3),X1),c_Set_Oinsert(X1,X4,X5)))
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_70,plain,
    ( hBOOL(X2)
    | hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X2,X3,X4))) ),
    inference(spm,[status(thm)],[c_0_62,c_0_69]) ).

cnf(c_0_71,plain,
    hBOOL(hAPP(hAPP(c_in(X1),X2),c_Set_Oinsert(X2,X3,X4))),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_69]),c_0_70]) ).

cnf(c_0_72,plain,
    ( ~ hBOOL(hAPP(hAPP(c_in(X4),X2),X3))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_71,c_0_47]) ).

cnf(c_0_73,plain,
    ( hBOOL(hAPP(X4,X2))
    | hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X4))) ),
    inference(spm,[status(thm)],[c_0_72,c_0_36]) ).

cnf(c_0_74,plain,
    ( ~ hBOOL(hAPP(X3,X2))
    | ~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X3))) ),
    inference(spm,[status(thm)],[c_0_54,c_0_28]) ).

cnf(c_0_75,plain,
    ( hBOOL(hAPP(hAPP(c_in(X4),X3),X2))
    | hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_73,c_0_28]) ).

cnf(c_0_76,plain,
    ( ~ hBOOL(hAPP(X3,X4))
    | hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3)),X4)) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_77,plain,
    ( ~ hBOOL(hAPP(hAPP(X2,X6),X6))
    | hBOOL(hAPP(c_COMBS(c_in(X1),X2,X3,X4,X5),X6)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_37]) ).

cnf(c_0_78,plain,
    ( hBOOL(hAPP(X2,X3))
    | hBOOL(hAPP(hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X1,tc_bool)),X2),X3)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_36]) ).

cnf(c_0_79,plain,
    ( ~ hBOOL(hAPP(X4,X2))
    | ~ hBOOL(hAPP(hAPP(c_in(X1),X2),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(X3,tc_bool)),X4))) ),
    inference(spm,[status(thm)],[c_0_54,c_0_76]) ).

cnf(c_0_80,plain,
    ( hBOOL(hAPP(X6,X6))
    | hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),X6)) ),
    inference(spm,[status(thm)],[c_0_77,c_0_78]) ).

cnf(c_0_81,plain,
    ( ~ hBOOL(hAPP(X6,X6))
    | ~ hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),X6)) ),
    inference(spm,[status(thm)],[c_0_79,c_0_37]) ).

cnf(c_0_82,plain,
    hBOOL(hAPP(c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5),c_COMBS(c_in(X1),c_HOL_Ouminus__class_Ouminus(tc_fun(X2,tc_bool)),X3,X4,X5))),
    inference(ef,[status(thm)],[c_0_80]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SCT096-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.34  % Computer : n003.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 04:32:45 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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
% 195.33/28.95  % Version: 3.5.1
% 195.33/28.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 195.33/28.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.33/28.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 195.33/28.95  % Starting new_bool_3 with 600s (2) cores
% 195.33/28.95  % Starting new_bool_1 with 300s (1) cores
% 195.33/28.95  % Starting sh5l with 300s (1) cores
% 195.33/28.95  % new_bool_3 with pid 3407750 completed with status 0
% 195.33/28.95  % Result found by new_bool_3
% 195.33/28.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 195.33/28.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.33/28.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 195.33/28.95  % Starting new_bool_3 with 600s (2) cores
% 195.33/28.95  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 195.33/28.95  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 195.33/28.95  % Search class: FGHSM-FSLM32-DFFFFFNN
% 195.33/28.95  % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 195.33/28.95  % Starting SubtermCWHack with 55s (1) cores
% 195.33/28.95  % Starting new_bool_3 with 61s (1) cores
% 195.33/28.95  % SubtermCWHack with pid 3407753 completed with status 0
% 195.33/28.95  % Result found by SubtermCWHack
% 195.33/28.95  % Preprocessing class: FSLMSMSMSSSNFFN.
% 195.33/28.95  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 195.33/28.95  % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 195.33/28.95  % Starting new_bool_3 with 600s (2) cores
% 195.33/28.95  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 195.33/28.95  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 195.33/28.95  % Search class: FGHSM-FSLM32-DFFFFFNN
% 195.33/28.95  % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 195.33/28.95  % Starting SubtermCWHack with 55s (1) cores
% 195.33/28.95  % Preprocessing time       : 0.006 s
% 195.33/28.95  
% 195.33/28.95  % Proof found!
% 195.33/28.95  % SZS status Unsatisfiable
% 195.33/28.95  % SZS output start CNFRefutation
% See solution above
% 195.33/28.95  % Parsed axioms                        : 820
% 195.33/28.95  % Removed by relevancy pruning/SinE    : 524
% 195.33/28.95  % Initial clauses                      : 296
% 195.33/28.95  % Removed in clause preprocessing      : 0
% 195.33/28.95  % Initial clauses in saturation        : 296
% 195.33/28.95  % Processed clauses                    : 30481
% 195.33/28.95  % ...of these trivial                  : 481
% 195.33/28.95  % ...subsumed                          : 26474
% 195.33/28.95  % ...remaining for further processing  : 3526
% 195.33/28.95  % Other redundant clauses eliminated   : 4486
% 195.33/28.95  % Clauses deleted for lack of memory   : 0
% 195.33/28.95  % Backward-subsumed                    : 573
% 195.33/28.95  % Backward-rewritten                   : 96
% 195.33/28.95  % Generated clauses                    : 880948
% 195.33/28.95  % ...of the previous two non-redundant : 812393
% 195.33/28.95  % ...aggressively subsumed             : 0
% 195.33/28.95  % Contextual simplify-reflections      : 23
% 195.33/28.95  % Paramodulations                      : 875999
% 195.33/28.95  % Factorizations                       : 440
% 195.33/28.95  % NegExts                              : 0
% 195.33/28.95  % Equation resolutions                 : 4509
% 195.33/28.95  % Disequality decompositions           : 0
% 195.33/28.95  % Total rewrite steps                  : 242716
% 195.33/28.95  % ...of those cached                   : 225473
% 195.33/28.95  % Propositional unsat checks           : 0
% 195.33/28.95  %    Propositional check models        : 0
% 195.33/28.95  %    Propositional check unsatisfiable : 0
% 195.33/28.95  %    Propositional clauses             : 0
% 195.33/28.95  %    Propositional clauses after purity: 0
% 195.33/28.95  %    Propositional unsat core size     : 0
% 195.33/28.95  %    Propositional preprocessing time  : 0.000
% 195.33/28.95  %    Propositional encoding time       : 0.000
% 195.33/28.95  %    Propositional solver time         : 0.000
% 195.33/28.95  %    Success case prop preproc time    : 0.000
% 195.33/28.95  %    Success case prop encoding time   : 0.000
% 195.33/28.95  %    Success case prop solver time     : 0.000
% 195.33/28.95  % Current number of processed clauses  : 2857
% 195.33/28.95  %    Positive orientable unit clauses  : 262
% 195.33/28.95  %    Positive unorientable unit clauses: 57
% 195.33/28.95  %    Negative unit clauses             : 113
% 195.33/28.95  %    Non-unit-clauses                  : 2425
% 195.33/28.95  % Current number of unprocessed clauses: 772938
% 195.33/28.95  % ...number of literals in the above   : 2788504
% 195.33/28.95  % Current number of archived formulas  : 0
% 195.33/28.95  % Current number of archived clauses   : 669
% 195.33/28.95  % Clause-clause subsumption calls (NU) : 1207036
% 195.33/28.95  % Rec. Clause-clause subsumption calls : 528676
% 195.33/28.95  % Non-unit clause-clause subsumptions  : 24532
% 195.33/28.95  % Unit Clause-clause subsumption calls : 13355
% 195.33/28.95  % Rewrite failures with RHS unbound    : 3688
% 195.33/28.95  % BW rewrite match attempts            : 11601
% 195.33/28.95  % BW rewrite match successes           : 402
% 195.33/28.95  % Condensation attempts                : 0
% 195.33/28.95  % Condensation successes               : 0
% 195.33/28.95  % Termbank termtop insertions          : 22634630
% 195.33/28.95  % Search garbage collected termcells   : 3015
% 195.33/28.95  
% 195.33/28.95  % -------------------------------------------------
% 195.33/28.95  % User time                : 27.130 s
% 195.33/28.95  % System time              : 0.854 s
% 195.33/28.95  % Total time               : 27.983 s
% 195.33/28.95  % Maximum resident set size: 4860 pages
% 195.33/28.95  
% 195.33/28.95  % -------------------------------------------------
% 195.33/28.95  % User time                : 54.458 s
% 195.33/28.95  % System time              : 1.683 s
% 195.33/28.95  % Total time               : 56.140 s
% 195.33/28.95  % Maximum resident set size: 5632 pages
% 195.33/28.95  % E exiting
%------------------------------------------------------------------------------