%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ANA038-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 : n015.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 12:02:51 PM UTC 2026
% Result : Unsatisfiable 11.41s 2.11s
% Output : CNFRefutation 11.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 25
% Syntax : Number of clauses : 89 ( 50 unt; 2 nHn; 72 RR)
% Number of literals : 150 ( 40 equ; 69 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 27 ( 27 usr; 13 con; 0-3 aty)
% Number of variables : 119 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Nat_Onot__add__less1_0,axiom,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Onot__add__less1_0) ).
cnf(cls_SetInterval_OlessThan__iff_0,axiom,
( ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| c_less(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OlessThan__iff_0) ).
cnf(clsarity_nat_2,axiom,
class_Orderings_Oord(tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_nat_2) ).
cnf(cls_Nat_Ole__add__diff__inverse_0,axiom,
( ~ c_lessequals(X1,X2,tc_nat)
| c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Nat_Ole__add__diff__inverse_0) ).
cnf(cls_List_Odrop__eq__Nil_0,axiom,
( c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil
| c_lessequals(c_Nat_Osize(X2,tc_List_Olist(X3)),X1,tc_nat) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_List_Odrop__eq__Nil_0) ).
cnf(cls_List_Odrop_Odrop__Nil_0,axiom,
c_List_Odrop(X1,c_List_Olist_ONil,X2) = c_List_Olist_ONil,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_List_Odrop_Odrop__Nil_0) ).
cnf(cls_Set_Oall__not__in__conv_0,axiom,
( X1 = c_emptyset
| c_in(c_Main_Oall__not__in__conv__1(X1,X2),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Set_Oall__not__in__conv_0) ).
cnf(cls_SetInterval_Ocard__lessThan_0,axiom,
c_Finite__Set_Ocard(c_SetInterval_OlessThan(X1,tc_nat),tc_nat) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_Ocard__lessThan_0) ).
cnf(cls_List_Onibble_Osize__10_0,axiom,
c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble) = c_0,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_List_Onibble_Osize__10_0) ).
cnf(cls_Datatype_Ounit_Osize_0,axiom,
c_Nat_Osize(c_Product__Type_OUnity,tc_Product__Type_Ounit) = c_0,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Datatype_Ounit_Osize_0) ).
cnf(cls_SetInterval_OlessThan__eq__iff_0,axiom,
( c_SetInterval_OlessThan(X2,X1) != c_SetInterval_OlessThan(X3,X1)
| ~ class_Orderings_Olinorder(X1)
| X2 = X3 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OlessThan__eq__iff_0) ).
cnf(cls_NatBin_Onat__numeral__0__eq__0_0,axiom,
c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat) = c_0,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_NatBin_Onat__numeral__0__eq__0_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_lessequals(c_0,v_g(v_xa),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(clsarity_nat_7,axiom,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsarity_nat_7) ).
cnf(cls_SetInterval_OlessThan__0_0,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_SetInterval_OlessThan__0_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Oorder(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
( ~ c_lessequals(c_0,X4,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0) ).
cnf(cls_Finite__Set_Ocard__empty_0,axiom,
c_Finite__Set_Ocard(c_emptyset,X1) = c_0,
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Finite__Set_Ocard__empty_0) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Ring__and__Field_Opordered__semiring(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_42) ).
cnf(cls_conjecture_5,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_Orderings_Ole__maxI2_0,axiom,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Ole__maxI2_0) ).
cnf(cls_conjecture_8,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_8) ).
cnf(c_0_25,plain,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
inference(fof_simplification,[status(thm)],[cls_Nat_Onot__add__less1_0]) ).
cnf(c_0_26,plain,
( ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| c_less(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OlessThan__iff_0]) ).
cnf(c_0_27,plain,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
c_0_25 ).
cnf(c_0_28,plain,
( ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1)
| ~ class_Orderings_Oord(X1)
| c_less(X2,X3,X1) ),
c_0_26 ).
cnf(c_0_29,axiom,
class_Orderings_Oord(tc_nat),
clsarity_nat_2 ).
cnf(c_0_30,plain,
( ~ c_lessequals(X1,X2,tc_nat)
| c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2 ),
inference(fof_simplification,[status(thm)],[cls_Nat_Ole__add__diff__inverse_0]) ).
cnf(c_0_31,plain,
~ c_in(c_plus(X1,X2,tc_nat),c_SetInterval_OlessThan(X1,tc_nat),tc_nat),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,plain,
( ~ c_lessequals(X1,X2,tc_nat)
| c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2 ),
c_0_30 ).
cnf(c_0_33,plain,
( c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil
| c_lessequals(c_Nat_Osize(X2,tc_List_Olist(X3)),X1,tc_nat) ),
inference(fof_simplification,[status(thm)],[cls_List_Odrop__eq__Nil_0]) ).
cnf(c_0_34,plain,
( ~ c_in(X2,c_SetInterval_OlessThan(X1,tc_nat),tc_nat)
| ~ c_lessequals(X1,X2,tc_nat) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil
| c_lessequals(c_Nat_Osize(X2,tc_List_Olist(X3)),X1,tc_nat) ),
c_0_33 ).
cnf(c_0_36,plain,
( ~ c_in(X1,c_SetInterval_OlessThan(c_Nat_Osize(X2,tc_List_Olist(X3)),tc_nat),tc_nat)
| c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,axiom,
c_List_Odrop(X1,c_List_Olist_ONil,X2) = c_List_Olist_ONil,
cls_List_Odrop_Odrop__Nil_0 ).
cnf(c_0_38,plain,
~ c_in(X1,c_SetInterval_OlessThan(c_Nat_Osize(c_List_Olist_ONil,tc_List_Olist(X2)),tc_nat),tc_nat),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,axiom,
( X1 = c_emptyset
| c_in(c_Main_Oall__not__in__conv__1(X1,X2),X1,X2) ),
cls_Set_Oall__not__in__conv_0 ).
cnf(c_0_40,axiom,
c_Finite__Set_Ocard(c_SetInterval_OlessThan(X1,tc_nat),tc_nat) = X1,
cls_SetInterval_Ocard__lessThan_0 ).
cnf(c_0_41,plain,
c_SetInterval_OlessThan(c_Nat_Osize(c_List_Olist_ONil,tc_List_Olist(X1)),tc_nat) = c_emptyset,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble) = c_0,
cls_List_Onibble_Osize__10_0 ).
cnf(c_0_43,axiom,
c_Nat_Osize(c_Product__Type_OUnity,tc_Product__Type_Ounit) = c_0,
cls_Datatype_Ounit_Osize_0 ).
cnf(c_0_44,plain,
( c_SetInterval_OlessThan(X2,X1) != c_SetInterval_OlessThan(X3,X1)
| ~ class_Orderings_Olinorder(X1)
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[cls_SetInterval_OlessThan__eq__iff_0]) ).
cnf(c_0_45,plain,
c_Nat_Osize(c_List_Olist_ONil,tc_List_Olist(X1)) = c_Finite__Set_Ocard(c_emptyset,tc_nat),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,axiom,
c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat) = c_0,
cls_NatBin_Onat__numeral__0__eq__0_0 ).
cnf(c_0_47,plain,
c_Nat_Osize(c_Product__Type_OUnity,tc_Product__Type_Ounit) = c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,negated_conjecture,
c_lessequals(c_0,v_g(v_xa),t_b),
cls_conjecture_3 ).
cnf(c_0_49,plain,
( c_SetInterval_OlessThan(X2,X1) != c_SetInterval_OlessThan(X3,X1)
| ~ class_Orderings_Olinorder(X1)
| X2 = X3 ),
c_0_44 ).
cnf(c_0_50,plain,
c_SetInterval_OlessThan(c_Finite__Set_Ocard(c_emptyset,tc_nat),tc_nat) = c_emptyset,
inference(rw,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_51,axiom,
class_Orderings_Olinorder(tc_nat),
clsarity_nat_7 ).
cnf(c_0_52,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
cls_SetInterval_OlessThan__0_0 ).
cnf(c_0_53,plain,
c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble) = c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_43]),c_0_47]) ).
cnf(c_0_54,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Oorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_44]) ).
cnf(c_0_55,plain,
( ~ c_lessequals(c_0,X4,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0]) ).
cnf(c_0_56,negated_conjecture,
c_lessequals(c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble),v_g(v_xa),t_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_43]),c_0_47]) ).
cnf(c_0_57,plain,
( c_SetInterval_OlessThan(X1,tc_nat) != c_emptyset
| X1 = c_Finite__Set_Ocard(c_emptyset,tc_nat) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_58,plain,
c_SetInterval_OlessThan(c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),tc_nat) = c_emptyset,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_43]),c_0_47]),c_0_53]) ).
cnf(c_0_59,axiom,
c_Finite__Set_Ocard(c_emptyset,X1) = c_0,
cls_Finite__Set_Ocard__empty_0 ).
cnf(c_0_60,plain,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_0_61,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Oorder(X1) ),
c_0_54 ).
cnf(c_0_62,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_63,plain,
( ~ c_lessequals(c_0,X4,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1) ),
c_0_55 ).
cnf(c_0_64,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Ring__and__Field_Opordered__semiring(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_42]) ).
cnf(c_0_65,negated_conjecture,
c_lessequals(c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),v_g(v_xa),t_b),
inference(rw,[status(thm)],[c_0_56,c_0_53]) ).
cnf(c_0_66,plain,
c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat) = c_Finite__Set_Ocard(c_emptyset,tc_nat),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_67,plain,
c_Finite__Set_Ocard(c_emptyset,X1) = c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_43]),c_0_47]),c_0_53]) ).
cnf(c_0_68,plain,
( ~ c_lessequals(X4,X2,X1)
| ~ c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| c_lessequals(X4,X3,X1) ),
c_0_60 ).
cnf(c_0_69,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(v_ca,v_g(v_xa),t_b),t_b),
cls_conjecture_5 ).
cnf(c_0_70,negated_conjecture,
class_Orderings_Oorder(t_b),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_71,plain,
( ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),X2,X3)
| ~ class_Ring__and__Field_Opordered__semiring(X3)
| c_lessequals(c_times(X1,X2,X3),c_times(X4,X2,X3),X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_43]),c_0_47]),c_0_53]) ).
cnf(c_0_72,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Ring__and__Field_Opordered__semiring(X1) ),
c_0_64 ).
cnf(c_0_73,negated_conjecture,
c_lessequals(c_Finite__Set_Ocard(c_emptyset,tc_nat),v_g(v_xa),t_b),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
c_Finite__Set_Ocard(c_emptyset,X1) = c_Finite__Set_Ocard(c_emptyset,tc_nat),
inference(rw,[status(thm)],[c_0_67,c_0_66]) ).
cnf(c_0_75,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).
cnf(c_0_76,negated_conjecture,
( ~ c_lessequals(c_times(v_ca,v_g(v_xa),t_b),X1,t_b)
| c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_77,plain,
( ~ c_lessequals(X1,X4,X3)
| ~ c_lessequals(c_Finite__Set_Ocard(c_emptyset,tc_nat),X2,X3)
| ~ class_Ring__and__Field_Opordered__semiring(X3)
| c_lessequals(c_times(X1,X2,X3),c_times(X4,X2,X3),X3) ),
inference(rw,[status(thm)],[c_0_71,c_0_66]) ).
cnf(c_0_78,negated_conjecture,
class_Ring__and__Field_Opordered__semiring(t_b),
inference(spm,[status(thm)],[c_0_72,c_0_62]) ).
cnf(c_0_79,negated_conjecture,
c_lessequals(c_Finite__Set_Ocard(c_emptyset,X1),v_g(v_xa),t_b),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_80,plain,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Ole__maxI2_0]) ).
cnf(c_0_81,plain,
( ~ class_Ring__and__Field_Oordered__idom(X1)
| class_Orderings_Olinorder(X1) ),
c_0_75 ).
cnf(c_0_82,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_8]) ).
cnf(c_0_83,negated_conjecture,
( ~ c_lessequals(v_ca,X1,t_b)
| c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(X1,v_g(v_xa),t_b),t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79])]) ).
cnf(c_0_84,plain,
( ~ class_Orderings_Olinorder(X1)
| c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1) ),
c_0_80 ).
cnf(c_0_85,negated_conjecture,
class_Orderings_Olinorder(t_b),
inference(spm,[status(thm)],[c_0_81,c_0_62]) ).
cnf(c_0_86,negated_conjecture,
~ c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(v_c,v_ca,t_b),v_g(v_xa),t_b),t_b),
c_0_82 ).
cnf(c_0_87,negated_conjecture,
c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(c_Orderings_Omax(X1,v_ca,t_b),v_g(v_xa),t_b),t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ANA038-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.09/0.37 % Computer : n015.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 13:29:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 11.41/2.11 % Version: 3.5.1
% 11.41/2.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 11.41/2.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.41/2.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.41/2.11 % Starting new_bool_3 with 300s (1) cores
% 11.41/2.11 % Starting new_bool_1 with 300s (1) cores
% 11.41/2.11 % Starting sh5l with 300s (1) cores
% 11.41/2.11 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1564436 completed with status 0
% 11.41/2.11 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 11.41/2.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 11.41/2.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.41/2.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.41/2.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.41/2.11 % No SInE strategy applied
% 11.41/2.11 % Search class: FGHSM-SMLM32-DFFFFFNN
% 11.41/2.11 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.41/2.11 % Starting SubtermCWHack with 136s (1) cores
% 11.41/2.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.41/2.11 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 11.41/2.11 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 11.41/2.11 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 11.41/2.11 % G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1564452 completed with status 0
% 11.41/2.11 % Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 11.41/2.11 % Preprocessing class: FMLMSMSMSSSNFFN.
% 11.41/2.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.41/2.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 11.41/2.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.41/2.11 % No SInE strategy applied
% 11.41/2.11 % Search class: FGHSM-SMLM32-DFFFFFNN
% 11.41/2.11 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 11.41/2.11 % Starting SubtermCWHack with 136s (1) cores
% 11.41/2.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 11.41/2.11 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 113s (1) cores
% 11.41/2.11 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 11.41/2.11 % Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 11.41/2.11 % Preprocessing time : 0.046 s
% 11.41/2.11 % Presaturation interreduction done
% 11.41/2.11
% 11.41/2.11 % Proof found!
% 11.41/2.11 % SZS status Unsatisfiable
% 11.41/2.11 % SZS output start CNFRefutation
% See solution above
% 11.41/2.11 % Parsed axioms : 2802
% 11.41/2.11 % Removed by relevancy pruning/SinE : 0
% 11.41/2.11 % Initial clauses : 2802
% 11.41/2.11 % Removed in clause preprocessing : 9
% 11.41/2.11 % Initial clauses in saturation : 2793
% 11.41/2.11 % Processed clauses : 12346
% 11.41/2.11 % ...of these trivial : 99
% 11.41/2.11 % ...subsumed : 5690
% 11.41/2.11 % ...remaining for further processing : 6557
% 11.41/2.11 % Other redundant clauses eliminated : 183
% 11.41/2.11 % Clauses deleted for lack of memory : 0
% 11.41/2.11 % Backward-subsumed : 160
% 11.41/2.11 % Backward-rewritten : 335
% 11.41/2.11 % Generated clauses : 27154
% 11.41/2.11 % ...of the previous two non-redundant : 22606
% 11.41/2.11 % ...aggressively subsumed : 0
% 11.41/2.11 % Contextual simplify-reflections : 36
% 11.41/2.11 % Paramodulations : 26927
% 11.41/2.11 % Factorizations : 0
% 11.41/2.11 % NegExts : 0
% 11.41/2.11 % Equation resolutions : 227
% 11.41/2.11 % Disequality decompositions : 0
% 11.41/2.11 % Total rewrite steps : 18606
% 11.41/2.11 % ...of those cached : 16863
% 11.41/2.11 % Propositional unsat checks : 1
% 11.41/2.11 % Propositional check models : 1
% 11.41/2.11 % Propositional check unsatisfiable : 0
% 11.41/2.11 % Propositional clauses : 0
% 11.41/2.11 % Propositional clauses after purity: 0
% 11.41/2.11 % Propositional unsat core size : 0
% 11.41/2.11 % Propositional preprocessing time : 0.000
% 11.41/2.11 % Propositional encoding time : 0.010
% 11.41/2.11 % Propositional solver time : 0.010
% 11.41/2.11 % Success case prop preproc time : 0.000
% 11.41/2.11 % Success case prop encoding time : 0.000
% 11.41/2.11 % Success case prop solver time : 0.000
% 11.41/2.11 % Current number of processed clauses : 3398
% 11.41/2.11 % Positive orientable unit clauses : 856
% 11.41/2.11 % Positive unorientable unit clauses: 12
% 11.41/2.11 % Negative unit clauses : 330
% 11.41/2.11 % Non-unit-clauses : 2200
% 11.41/2.11 % Current number of unprocessed clauses: 15252
% 11.41/2.11 % ...number of literals in the above : 37528
% 11.41/2.11 % Current number of archived formulas : 0
% 11.41/2.11 % Current number of archived clauses : 3167
% 11.41/2.11 % Clause-clause subsumption calls (NU) : 3763179
% 11.41/2.11 % Rec. Clause-clause subsumption calls : 2822861
% 11.41/2.11 % Non-unit clause-clause subsumptions : 3516
% 11.41/2.11 % Unit Clause-clause subsumption calls : 113943
% 11.41/2.11 % Rewrite failures with RHS unbound : 0
% 11.41/2.11 % BW rewrite match attempts : 1565
% 11.41/2.11 % BW rewrite match successes : 162
% 11.41/2.11 % Condensation attempts : 0
% 11.41/2.11 % Condensation successes : 0
% 11.41/2.11 % Termbank termtop insertions : 491823
% 11.41/2.11 % Search garbage collected termcells : 4089
% 11.41/2.11
% 11.41/2.11 % -------------------------------------------------
% 11.41/2.11 % User time : 1.522 s
% 11.41/2.11 % System time : 0.046 s
% 11.41/2.11 % Total time : 1.568 s
% 11.41/2.11 % Maximum resident set size: 8516 pages
% 11.41/2.11
% 11.41/2.11 % -------------------------------------------------
% 11.41/2.11 % User time : 7.157 s
% 11.41/2.11 % System time : 0.254 s
% 11.41/2.11 % Total time : 7.411 s
% 11.41/2.11 % Maximum resident set size: 6400 pages
% 11.41/2.11 % E exiting
%------------------------------------------------------------------------------