TSTP Solution File: ANA025-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ANA025-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 18:38:33 EDT 2024
% Result : Unsatisfiable 23.61s 3.51s
% Output : CNFRefutation 23.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 73 ( 11 unt; 5 nHn; 60 RR)
% Number of literals : 176 ( 15 equ; 107 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 126 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Oneg__equal__iff__equal_0,axiom,
( X2 = X3
| ~ class_OrderedGroup_Oab__group__add(X1)
| c_uminus(X2,X1) != c_uminus(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oneg__equal__iff__equal_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_4) ).
cnf(cls_OrderedGroup_Ominus__minus_0,axiom,
( c_uminus(c_uminus(X2,X1),X1) = X2
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Ominus__minus_0) ).
cnf(cls_OrderedGroup_Oneg__0__le__iff__le_1,axiom,
( c_lessequals(c_0,c_uminus(X2,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oneg__0__le__iff__le_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_tcs) ).
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/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__class_Oorder__trans_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_44) ).
cnf(cls_OrderedGroup_Oneg__le__0__iff__le_1,axiom,
( c_lessequals(c_uminus(X2,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_0,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oneg__le__0__iff__le_1) ).
cnf(cls_Orderings_Oorder__less__imp__le_0,axiom,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Oorder__less__imp__le_0) ).
cnf(cls_Orderings_Olinorder__not__le_0,axiom,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Orderings_Olinorder__not__le_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_33,axiom,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_33) ).
cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_OrderedGroup_Oabs__ge__zero_0) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2,axiom,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-1.ax',cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',clsrel_Ring__and__Field_Oordered__idom_50) ).
cnf(c_0_17,plain,
( X2 = X3
| ~ class_OrderedGroup_Oab__group__add(X1)
| c_uminus(X2,X1) != c_uminus(X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oneg__equal__iff__equal_0]) ).
cnf(c_0_18,plain,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_4]) ).
cnf(c_0_19,plain,
( X2 = X3
| ~ class_OrderedGroup_Oab__group__add(X1)
| c_uminus(X2,X1) != c_uminus(X3,X1) ),
c_0_17 ).
cnf(c_0_20,plain,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_18 ).
cnf(c_0_21,plain,
( c_uminus(c_uminus(X2,X1),X1) = X2
| ~ class_OrderedGroup_Oab__group__add(X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Ominus__minus_0]) ).
cnf(c_0_22,plain,
( c_lessequals(c_0,c_uminus(X2,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_0,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oneg__0__le__iff__le_1]) ).
cnf(c_0_23,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_54]) ).
cnf(c_0_24,plain,
( X1 = X2
| c_uminus(X1,X3) != c_uminus(X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_26,plain,
( c_uminus(c_uminus(X2,X1),X1) = X2
| ~ class_OrderedGroup_Oab__group__add(X1) ),
c_0_21 ).
cnf(c_0_27,plain,
( c_lessequals(c_0,c_uminus(X2,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_0,X1) ),
c_0_22 ).
cnf(c_0_28,plain,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_23 ).
cnf(c_0_29,negated_conjecture,
( X1 = X2
| c_uminus(X1,t_b) != c_uminus(X2,t_b) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( c_uminus(c_uminus(X1,X2),X2) = X1
| ~ class_Ring__and__Field_Oordered__idom(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_31,plain,
( c_lessequals(c_0,c_uminus(X1,X2),X2)
| ~ class_Ring__and__Field_Oordered__idom(X2)
| ~ c_lessequals(X1,c_0,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
c_uminus(c_uminus(X1,t_b),t_b) = X1,
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25])])]) ).
cnf(c_0_33,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__class_Oorder__trans_0]) ).
cnf(c_0_34,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X1,t_b),c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]) ).
cnf(c_0_35,plain,
( c_lessequals(X4,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X2,X1) ),
c_0_33 ).
cnf(c_0_36,negated_conjecture,
( c_lessequals(c_0,c_uminus(X1,t_b),t_b)
| ~ c_lessequals(X1,c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_25])]) ).
cnf(c_0_37,plain,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_44]) ).
cnf(c_0_38,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_Orderings_Oorder(t_b)
| ~ c_lessequals(c_uminus(X2,t_b),X1,t_b)
| ~ c_lessequals(X2,c_0,t_b) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( class_Orderings_Oorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_37 ).
cnf(c_0_40,plain,
( c_lessequals(c_uminus(X2,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_0,X2,X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oneg__le__0__iff__le_1]) ).
cnf(c_0_41,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X2,t_b),X1,t_b)
| ~ c_lessequals(X2,c_0,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_25])]) ).
cnf(c_0_42,plain,
( c_lessequals(c_uminus(X2,X1),c_0,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_0,X2,X1) ),
c_0_40 ).
cnf(c_0_43,plain,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Oorder__less__imp__le_0]) ).
cnf(c_0_44,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Olinorder__not__le_0]) ).
cnf(c_0_45,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_33]) ).
cnf(c_0_46,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_uminus(X2,t_b),c_0,t_b)
| ~ c_lessequals(X2,X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_30]),c_0_25])]) ).
cnf(c_0_47,plain,
( c_lessequals(c_uminus(X1,X2),c_0,X2)
| ~ class_Ring__and__Field_Oordered__idom(X2)
| ~ c_lessequals(c_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_42,c_0_28]) ).
cnf(c_0_48,plain,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
inference(fof_simplification,[status(thm)],[cls_OrderedGroup_Oabs__ge__zero_0]) ).
cnf(c_0_49,plain,
( c_lessequals(X2,X3,X1)
| ~ class_Orderings_Oorder(X1)
| ~ c_less(X2,X3,X1) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_51,plain,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[cls_Orderings_Omin__max_Obelow__sup_Oabove__sup__conv_2]) ).
cnf(c_0_52,plain,
( c_less(X2,X3,X1)
| c_lessequals(X3,X2,X1)
| ~ class_Orderings_Olinorder(X1) ),
c_0_44 ).
cnf(c_0_53,plain,
( class_Orderings_Olinorder(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_45 ).
cnf(c_0_54,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ c_lessequals(c_0,X2,t_b)
| ~ c_lessequals(X2,X1,t_b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_25])]) ).
cnf(c_0_55,plain,
( c_lessequals(c_0,c_HOL_Oabs(X2,X1),X1)
| ~ class_OrderedGroup_Olordered__ab__group__abs(X1) ),
c_0_48 ).
cnf(c_0_56,plain,
( c_lessequals(X1,X2,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3)
| ~ c_less(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_39]) ).
cnf(c_0_57,negated_conjecture,
~ c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b),
c_0_50 ).
cnf(c_0_58,plain,
( c_lessequals(c_Orderings_Omax(X4,X2,X1),X3,X1)
| ~ class_Orderings_Olinorder(X1)
| ~ c_lessequals(X2,X3,X1)
| ~ c_lessequals(X4,X3,X1) ),
c_0_51 ).
cnf(c_0_59,plain,
( c_less(X1,X2,X3)
| c_lessequals(X2,X1,X3)
| ~ class_Ring__and__Field_Oordered__idom(X3) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_lessequals(c_HOL_Oabs(X2,t_b),X1,t_b) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( c_lessequals(X1,X2,t_b)
| ~ c_less(X1,X2,t_b) ),
inference(spm,[status(thm)],[c_0_56,c_0_25]) ).
cnf(c_0_62,negated_conjecture,
( ~ class_Orderings_Olinorder(t_b)
| ~ c_lessequals(c_minus(v_k(v_x),v_g(v_x),t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,negated_conjecture,
( c_less(X1,X2,t_b)
| c_lessequals(X2,X1,t_b) ),
inference(spm,[status(thm)],[c_0_59,c_0_25]) ).
cnf(c_0_64,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_65,negated_conjecture,
( c_lessequals(c_0,X1,t_b)
| ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ c_less(c_HOL_Oabs(X2,t_b),X1,t_b) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( c_less(c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),c_minus(v_k(v_x),v_g(v_x),t_b),t_b)
| ~ class_Orderings_Olinorder(t_b)
| ~ c_lessequals(c_0,c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
~ c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),
c_0_64 ).
cnf(c_0_68,plain,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
inference(fof_simplification,[status(thm)],[clsrel_Ring__and__Field_Oordered__idom_50]) ).
cnf(c_0_69,negated_conjecture,
( ~ class_OrderedGroup_Olordered__ab__group__abs(t_b)
| ~ class_Orderings_Olinorder(t_b) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_55]) ).
cnf(c_0_70,plain,
( class_OrderedGroup_Olordered__ab__group__abs(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
c_0_68 ).
cnf(c_0_71,negated_conjecture,
~ class_Orderings_Olinorder(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_25])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_53]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : ANA025-1 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 07:57:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.23/0.47 Running first-order model finding
% 0.23/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 23.61/3.51 # Version: 3.1.0
% 23.61/3.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.61/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.61/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.61/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.61/3.51 # Starting new_bool_1 with 300s (1) cores
% 23.61/3.51 # Starting sh5l with 300s (1) cores
% 23.61/3.51 # sh5l with pid 32210 completed with status 0
% 23.61/3.51 # Result found by sh5l
% 23.61/3.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.61/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.61/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.61/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.61/3.51 # Starting new_bool_1 with 300s (1) cores
% 23.61/3.51 # Starting sh5l with 300s (1) cores
% 23.61/3.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.61/3.51 # Search class: FGHSM-SMLM32-DFFFFFNN
% 23.61/3.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 23.61/3.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 23.61/3.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 32213 completed with status 0
% 23.61/3.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 23.61/3.51 # Preprocessing class: FMLMSMSMSSSNFFN.
% 23.61/3.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.61/3.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 23.61/3.51 # Starting new_bool_3 with 300s (1) cores
% 23.61/3.51 # Starting new_bool_1 with 300s (1) cores
% 23.61/3.51 # Starting sh5l with 300s (1) cores
% 23.61/3.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 23.61/3.51 # Search class: FGHSM-SMLM32-DFFFFFNN
% 23.61/3.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 23.61/3.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 23.61/3.51 # Preprocessing time : 0.026 s
% 23.61/3.51 # Presaturation interreduction done
% 23.61/3.51
% 23.61/3.51 # Proof found!
% 23.61/3.51 # SZS status Unsatisfiable
% 23.61/3.51 # SZS output start CNFRefutation
% See solution above
% 23.61/3.51 # Parsed axioms : 2809
% 23.61/3.51 # Removed by relevancy pruning/SinE : 265
% 23.61/3.51 # Initial clauses : 2544
% 23.61/3.51 # Removed in clause preprocessing : 1
% 23.61/3.51 # Initial clauses in saturation : 2543
% 23.61/3.51 # Processed clauses : 19808
% 23.61/3.51 # ...of these trivial : 118
% 23.61/3.51 # ...subsumed : 12528
% 23.61/3.51 # ...remaining for further processing : 7162
% 23.61/3.51 # Other redundant clauses eliminated : 482
% 23.61/3.51 # Clauses deleted for lack of memory : 0
% 23.61/3.51 # Backward-subsumed : 334
% 23.61/3.51 # Backward-rewritten : 290
% 23.61/3.51 # Generated clauses : 60711
% 23.61/3.51 # ...of the previous two non-redundant : 52838
% 23.61/3.51 # ...aggressively subsumed : 0
% 23.61/3.51 # Contextual simplify-reflections : 95
% 23.61/3.51 # Paramodulations : 60182
% 23.61/3.51 # Factorizations : 6
% 23.61/3.51 # NegExts : 0
% 23.61/3.51 # Equation resolutions : 523
% 23.61/3.51 # Disequality decompositions : 0
% 23.61/3.51 # Total rewrite steps : 30476
% 23.61/3.51 # ...of those cached : 28446
% 23.61/3.51 # Propositional unsat checks : 1
% 23.61/3.51 # Propositional check models : 1
% 23.61/3.51 # Propositional check unsatisfiable : 0
% 23.61/3.51 # Propositional clauses : 0
% 23.61/3.51 # Propositional clauses after purity: 0
% 23.61/3.51 # Propositional unsat core size : 0
% 23.61/3.51 # Propositional preprocessing time : 0.000
% 23.61/3.51 # Propositional encoding time : 0.036
% 23.61/3.51 # Propositional solver time : 0.028
% 23.61/3.51 # Success case prop preproc time : 0.000
% 23.61/3.51 # Success case prop encoding time : 0.000
% 23.61/3.51 # Success case prop solver time : 0.000
% 23.61/3.51 # Current number of processed clauses : 4102
% 23.61/3.51 # Positive orientable unit clauses : 594
% 23.61/3.51 # Positive unorientable unit clauses: 8
% 23.61/3.51 # Negative unit clauses : 292
% 23.61/3.51 # Non-unit-clauses : 3208
% 23.61/3.51 # Current number of unprocessed clauses: 36457
% 23.61/3.51 # ...number of literals in the above : 127895
% 23.61/3.51 # Current number of archived formulas : 0
% 23.61/3.51 # Current number of archived clauses : 3060
% 23.61/3.51 # Clause-clause subsumption calls (NU) : 8458996
% 23.61/3.51 # Rec. Clause-clause subsumption calls : 4610463
% 23.61/3.51 # Non-unit clause-clause subsumptions : 7083
% 23.61/3.51 # Unit Clause-clause subsumption calls : 89295
% 23.61/3.51 # Rewrite failures with RHS unbound : 0
% 23.61/3.51 # BW rewrite match attempts : 1676
% 23.61/3.51 # BW rewrite match successes : 128
% 23.61/3.51 # Condensation attempts : 0
% 23.61/3.51 # Condensation successes : 0
% 23.61/3.51 # Termbank termtop insertions : 1069628
% 23.61/3.51 # Search garbage collected termcells : 4736
% 23.61/3.51
% 23.61/3.51 # -------------------------------------------------
% 23.61/3.51 # User time : 2.854 s
% 23.61/3.51 # System time : 0.056 s
% 23.61/3.51 # Total time : 2.909 s
% 23.61/3.51 # Maximum resident set size: 7040 pages
% 23.61/3.51
% 23.61/3.51 # -------------------------------------------------
% 23.61/3.51 # User time : 2.907 s
% 23.61/3.51 # System time : 0.063 s
% 23.61/3.51 # Total time : 2.970 s
% 23.61/3.51 # Maximum resident set size: 3508 pages
% 23.61/3.51 % E---3.1 exiting
%------------------------------------------------------------------------------