TSTP Solution File: ANA038-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA038-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:16:07 EDT 2023
% Result : Unsatisfiable 13.71s 2.63s
% Output : CNFRefutation 13.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 25
% Syntax : Number of clauses : 77 ( 48 unt; 2 nHn; 61 RR)
% Number of literals : 122 ( 36 equ; 51 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 : 92 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Nat_Onot__add__less1_0,axiom,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Nat_Onot__add__less1_0) ).
cnf(cls_SetInterval_OlessThan__iff_0,axiom,
( c_less(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_SetInterval_OlessThan__iff_0) ).
cnf(clsarity_nat_2,axiom,
class_Orderings_Oord(tc_nat),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',clsarity_nat_2) ).
cnf(cls_Nat_Ole__add__diff__inverse_0,axiom,
( c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Nat_Ole__add__diff__inverse_0) ).
cnf(cls_List_Odrop__eq__Nil_0,axiom,
( c_lessequals(c_Nat_Osize(X2,tc_List_Olist(X3)),X1,tc_nat)
| c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_List_Odrop_Odrop__Nil_0) ).
cnf(cls_Set_Oall__not__in__conv_0,axiom,
( c_in(c_Main_Oall__not__in__conv__1(X1,X2),X1,X2)
| X1 = c_emptyset ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Datatype_Ounit_Osize_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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_conjecture_3) ).
cnf(cls_SetInterval_OlessThan__eq__iff_0,axiom,
( X2 = X3
| ~ class_Orderings_Olinorder(X1)
| c_SetInterval_OlessThan(X2,X1) != c_SetInterval_OlessThan(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_SetInterval_OlessThan__eq__iff_0) ).
cnf(clsarity_nat_7,axiom,
class_Orderings_Olinorder(tc_nat),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',clsarity_nat_7) ).
cnf(cls_SetInterval_OlessThan__0_0,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_SetInterval_OlessThan__0_0) ).
cnf(cls_Finite__Set_Ocard__empty_0,axiom,
c_Finite__Set_Ocard(c_emptyset,X1) = c_0,
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Finite__Set_Ocard__empty_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',tfree_tcs) ).
cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom,
( c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(c_0,X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0) ).
cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_conjecture_5) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',clsrel_Ring__and__Field_Oordered__idom_42) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_Orderings_Ole__maxI2_0,axiom,
( c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.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/sandbox/tmp/tmp.ASVGTf3tog/E---3.1_5497.p',cls_conjecture_8) ).
cnf(c_0_25,axiom,
~ c_less(c_plus(X1,X2,tc_nat),X1,tc_nat),
cls_Nat_Onot__add__less1_0 ).
cnf(c_0_26,axiom,
( c_less(X2,X3,X1)
| ~ class_Orderings_Oord(X1)
| ~ c_in(X2,c_SetInterval_OlessThan(X3,X1),X1) ),
cls_SetInterval_OlessThan__iff_0 ).
cnf(c_0_27,axiom,
class_Orderings_Oord(tc_nat),
clsarity_nat_2 ).
cnf(c_0_28,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_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,axiom,
( c_plus(X1,c_minus(X2,X1,tc_nat),tc_nat) = X2
| ~ c_lessequals(X1,X2,tc_nat) ),
cls_Nat_Ole__add__diff__inverse_0 ).
cnf(c_0_30,plain,
( ~ c_lessequals(X1,X2,tc_nat)
| ~ c_in(X2,c_SetInterval_OlessThan(X1,tc_nat),tc_nat) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,axiom,
( c_lessequals(c_Nat_Osize(X2,tc_List_Olist(X3)),X1,tc_nat)
| c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil ),
cls_List_Odrop__eq__Nil_0 ).
cnf(c_0_32,plain,
( c_List_Odrop(X1,X2,X3) != c_List_Olist_ONil
| ~ c_in(X1,c_SetInterval_OlessThan(c_Nat_Osize(X2,tc_List_Olist(X3)),tc_nat),tc_nat) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,axiom,
c_List_Odrop(X1,c_List_Olist_ONil,X2) = c_List_Olist_ONil,
cls_List_Odrop_Odrop__Nil_0 ).
cnf(c_0_34,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_32,c_0_33]) ).
cnf(c_0_35,axiom,
( c_in(c_Main_Oall__not__in__conv__1(X1,X2),X1,X2)
| X1 = c_emptyset ),
cls_Set_Oall__not__in__conv_0 ).
cnf(c_0_36,axiom,
c_Finite__Set_Ocard(c_SetInterval_OlessThan(X1,tc_nat),tc_nat) = X1,
cls_SetInterval_Ocard__lessThan_0 ).
cnf(c_0_37,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_34,c_0_35]) ).
cnf(c_0_38,axiom,
c_Nat_Osize(c_List_Onibble_ONibble9,tc_List_Onibble) = c_0,
cls_List_Onibble_Osize__10_0 ).
cnf(c_0_39,axiom,
c_Nat_Osize(c_Product__Type_OUnity,tc_Product__Type_Ounit) = c_0,
cls_Datatype_Ounit_Osize_0 ).
cnf(c_0_40,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_36,c_0_37]) ).
cnf(c_0_41,axiom,
c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat) = c_0,
cls_NatBin_Onat__numeral__0__eq__0_0 ).
cnf(c_0_42,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_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
c_lessequals(c_0,v_g(v_xa),t_b),
cls_conjecture_3 ).
cnf(c_0_44,axiom,
( X2 = X3
| ~ class_Orderings_Olinorder(X1)
| c_SetInterval_OlessThan(X2,X1) != c_SetInterval_OlessThan(X3,X1) ),
cls_SetInterval_OlessThan__eq__iff_0 ).
cnf(c_0_45,plain,
c_SetInterval_OlessThan(c_Finite__Set_Ocard(c_emptyset,tc_nat),tc_nat) = c_emptyset,
inference(rw,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_46,axiom,
class_Orderings_Olinorder(tc_nat),
clsarity_nat_7 ).
cnf(c_0_47,axiom,
c_SetInterval_OlessThan(c_0,tc_nat) = c_emptyset,
cls_SetInterval_OlessThan__0_0 ).
cnf(c_0_48,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_41,c_0_39]),c_0_42]) ).
cnf(c_0_49,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_43,c_0_39]),c_0_42]) ).
cnf(c_0_50,plain,
( c_Finite__Set_Ocard(c_emptyset,tc_nat) = X1
| c_SetInterval_OlessThan(X1,tc_nat) != c_emptyset ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]) ).
cnf(c_0_51,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_47,c_0_39]),c_0_42]),c_0_48]) ).
cnf(c_0_52,axiom,
c_Finite__Set_Ocard(c_emptyset,X1) = c_0,
cls_Finite__Set_Ocard__empty_0 ).
cnf(c_0_53,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_44 ).
cnf(c_0_54,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_55,axiom,
( c_lessequals(c_times(X2,X4,X1),c_times(X3,X4,X1),X1)
| ~ class_Ring__and__Field_Opordered__semiring(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(c_0,X4,X1) ),
cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0 ).
cnf(c_0_56,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_49,c_0_48]) ).
cnf(c_0_57,plain,
c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat) = c_Finite__Set_Ocard(c_emptyset,tc_nat),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,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_52,c_0_39]),c_0_42]),c_0_48]) ).
cnf(c_0_59,axiom,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
cls_Orderings_Oorder__class_Oorder__trans_0 ).
cnf(c_0_60,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_61,negated_conjecture,
class_Orderings_Oorder(t_b),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,plain,
( c_lessequals(c_times(X1,X2,X3),c_times(X4,X2,X3),X3)
| ~ class_Ring__and__Field_Opordered__semiring(X3)
| ~ c_lessequals(c_Numeral_Onumber__of(c_Numeral_OPls,tc_nat),X2,X3)
| ~ c_lessequals(X1,X4,X3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_39]),c_0_42]),c_0_48]) ).
cnf(c_0_63,axiom,
( class_Ring__and__Field_Opordered__semiring(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_42 ).
cnf(c_0_64,negated_conjecture,
c_lessequals(c_Finite__Set_Ocard(c_emptyset,tc_nat),v_g(v_xa),t_b),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_65,plain,
c_Finite__Set_Ocard(c_emptyset,X1) = c_Finite__Set_Ocard(c_emptyset,tc_nat),
inference(rw,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),X1,t_b)
| ~ c_lessequals(c_times(v_ca,v_g(v_xa),t_b),X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_67,plain,
( c_lessequals(c_times(X1,X2,X3),c_times(X4,X2,X3),X3)
| ~ class_Ring__and__Field_Opordered__semiring(X3)
| ~ c_lessequals(c_Finite__Set_Ocard(c_emptyset,tc_nat),X2,X3)
| ~ c_lessequals(X1,X4,X3) ),
inference(rw,[status(thm)],[c_0_62,c_0_57]) ).
cnf(c_0_68,negated_conjecture,
class_Ring__and__Field_Opordered__semiring(t_b),
inference(spm,[status(thm)],[c_0_63,c_0_54]) ).
cnf(c_0_69,negated_conjecture,
c_lessequals(c_Finite__Set_Ocard(c_emptyset,X1),v_g(v_xa),t_b),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_70,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_33 ).
cnf(c_0_71,negated_conjecture,
( c_lessequals(c_HOL_Oabs(v_b(v_xa),t_b),c_times(X1,v_g(v_xa),t_b),t_b)
| ~ c_lessequals(v_ca,X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69])]) ).
cnf(c_0_72,axiom,
( c_lessequals(X2,c_Orderings_Omax(X3,X2,X1),X1)
| ~ class_Orderings_Olinorder(X1) ),
cls_Orderings_Ole__maxI2_0 ).
cnf(c_0_73,negated_conjecture,
class_Orderings_Olinorder(t_b),
inference(spm,[status(thm)],[c_0_70,c_0_54]) ).
cnf(c_0_74,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),
cls_conjecture_8 ).
cnf(c_0_75,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_71,c_0_72]),c_0_73])]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.32 % Problem : ANA038-1 : TPTP v8.1.2. Released v3.2.0.
% 0.32/0.33 % Command : run_E %s %d THM
% 0.34/0.54 % Computer : n011.cluster.edu
% 0.34/0.54 % Model : x86_64 x86_64
% 0.34/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.34/0.54 % Memory : 8042.1875MB
% 0.34/0.54 % OS : Linux 3.10.0-693.el7.x86_64
% 0.34/0.54 % CPULimit : 2400
% 0.34/0.54 % WCLimit : 300
% 0.34/0.54 % DateTime : Mon Oct 2 15:10:23 EDT 2023
% 0.34/0.54 % CPUTime :
% 0.73/0.88 Running first-order theorem proving
% 0.73/0.88 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/tmp/tmp.ASVGTf3tog/E---3.1_5497.p
% 13.71/2.63 # Version: 3.1pre001
% 13.71/2.63 # Preprocessing class: FMLMSMSMSSSNFFN.
% 13.71/2.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.71/2.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.71/2.63 # Starting new_bool_3 with 300s (1) cores
% 13.71/2.63 # Starting new_bool_1 with 300s (1) cores
% 13.71/2.63 # Starting sh5l with 300s (1) cores
% 13.71/2.63 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5647 completed with status 0
% 13.71/2.63 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.71/2.63 # Preprocessing class: FMLMSMSMSSSNFFN.
% 13.71/2.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.71/2.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.71/2.63 # No SInE strategy applied
% 13.71/2.63 # Search class: FGHSM-SMLM32-DFFFFFNN
% 13.71/2.63 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 13.71/2.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 13.71/2.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.71/2.63 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 13.71/2.63 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 13.71/2.63 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 113s (1) cores
% 13.71/2.63 # G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5657 completed with status 0
% 13.71/2.63 # Result found by G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 13.71/2.63 # Preprocessing class: FMLMSMSMSSSNFFN.
% 13.71/2.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.71/2.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.71/2.63 # No SInE strategy applied
% 13.71/2.63 # Search class: FGHSM-SMLM32-DFFFFFNN
% 13.71/2.63 # Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 13.71/2.63 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 113s (1) cores
% 13.71/2.63 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.71/2.63 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 113s (1) cores
% 13.71/2.63 # Starting G-E--_208_B07CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 113s (1) cores
% 13.71/2.63 # Preprocessing time : 0.028 s
% 13.71/2.63 # Presaturation interreduction done
% 13.71/2.63
% 13.71/2.63 # Proof found!
% 13.71/2.63 # SZS status Unsatisfiable
% 13.71/2.63 # SZS output start CNFRefutation
% See solution above
% 13.71/2.63 # Parsed axioms : 2802
% 13.71/2.63 # Removed by relevancy pruning/SinE : 0
% 13.71/2.63 # Initial clauses : 2802
% 13.71/2.63 # Removed in clause preprocessing : 9
% 13.71/2.63 # Initial clauses in saturation : 2793
% 13.71/2.63 # Processed clauses : 12335
% 13.71/2.63 # ...of these trivial : 99
% 13.71/2.63 # ...subsumed : 5683
% 13.71/2.63 # ...remaining for further processing : 6553
% 13.71/2.63 # Other redundant clauses eliminated : 183
% 13.71/2.63 # Clauses deleted for lack of memory : 0
% 13.71/2.63 # Backward-subsumed : 160
% 13.71/2.63 # Backward-rewritten : 335
% 13.71/2.63 # Generated clauses : 27037
% 13.71/2.63 # ...of the previous two non-redundant : 22509
% 13.71/2.63 # ...aggressively subsumed : 0
% 13.71/2.63 # Contextual simplify-reflections : 36
% 13.71/2.63 # Paramodulations : 26810
% 13.71/2.63 # Factorizations : 0
% 13.71/2.63 # NegExts : 0
% 13.71/2.63 # Equation resolutions : 227
% 13.71/2.63 # Total rewrite steps : 18472
% 13.71/2.63 # Propositional unsat checks : 1
% 13.71/2.63 # Propositional check models : 1
% 13.71/2.63 # Propositional check unsatisfiable : 0
% 13.71/2.63 # Propositional clauses : 0
% 13.71/2.63 # Propositional clauses after purity: 0
% 13.71/2.63 # Propositional unsat core size : 0
% 13.71/2.63 # Propositional preprocessing time : 0.000
% 13.71/2.63 # Propositional encoding time : 0.011
% 13.71/2.63 # Propositional solver time : 0.010
% 13.71/2.63 # Success case prop preproc time : 0.000
% 13.71/2.63 # Success case prop encoding time : 0.000
% 13.71/2.63 # Success case prop solver time : 0.000
% 13.71/2.63 # Current number of processed clauses : 3394
% 13.71/2.63 # Positive orientable unit clauses : 853
% 13.71/2.63 # Positive unorientable unit clauses: 12
% 13.71/2.63 # Negative unit clauses : 330
% 13.71/2.63 # Non-unit-clauses : 2199
% 13.71/2.63 # Current number of unprocessed clauses: 15168
% 13.71/2.63 # ...number of literals in the above : 37312
% 13.71/2.63 # Current number of archived formulas : 0
% 13.71/2.63 # Current number of archived clauses : 3167
% 13.71/2.63 # Clause-clause subsumption calls (NU) : 5279996
% 13.71/2.63 # Rec. Clause-clause subsumption calls : 3103270
% 13.71/2.63 # Non-unit clause-clause subsumptions : 3513
% 13.71/2.63 # Unit Clause-clause subsumption calls : 111267
% 13.71/2.63 # Rewrite failures with RHS unbound : 0
% 13.71/2.63 # BW rewrite match attempts : 1563
% 13.71/2.63 # BW rewrite match successes : 162
% 13.71/2.63 # Condensation attempts : 0
% 13.71/2.63 # Condensation successes : 0
% 13.71/2.63 # Termbank termtop insertions : 465010
% 13.71/2.63
% 13.71/2.63 # -------------------------------------------------
% 13.71/2.63 # User time : 1.627 s
% 13.71/2.63 # System time : 0.042 s
% 13.71/2.63 # Total time : 1.669 s
% 13.71/2.63 # Maximum resident set size: 6428 pages
% 13.71/2.63
% 13.71/2.63 # -------------------------------------------------
% 13.71/2.63 # User time : 8.034 s
% 13.71/2.63 # System time : 0.193 s
% 13.71/2.63 # Total time : 8.228 s
% 13.71/2.63 # Maximum resident set size: 3524 pages
% 13.71/2.63 % E---3.1 exiting
% 13.71/2.63 % E---3.1 exiting
%------------------------------------------------------------------------------