TSTP Solution File: NUM094-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM094-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 18:58:19 EDT 2023
% Result : Unsatisfiable 379.02s 48.81s
% Output : CNFRefutation 379.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 21
% Syntax : Number of clauses : 107 ( 38 unt; 33 nHn; 62 RR)
% Number of literals : 196 ( 50 equ; 70 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-3 aty)
% Number of variables : 170 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',intersection1) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',regularity2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',not_subclass_members1) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',intersection3) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',subclass_implies_equal) ).
cnf(well_ordering2,axiom,
( X3 = null_class
| member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',well_ordering2) ).
cnf(prove_sections_property3_1,negated_conjecture,
well_ordering(xr,y),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',prove_sections_property3_1) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',restriction1) ).
cnf(prove_sections_property3_3,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),y),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',prove_sections_property3_3) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',regularity1) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',complement1) ).
cnf(section1,axiom,
( subclass(X2,X3)
| ~ section(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',section1) ).
cnf(prove_sections_property3_2,negated_conjecture,
section(xr,w,y),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',prove_sections_property3_2) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',class_elements_are_sets) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',complement2) ).
cnf(prove_sections_property3_4,negated_conjecture,
y != w,
file('/export/starexec/sandbox2/tmp/tmp.fux6YjbiuU/E---3.1_25249.p',prove_sections_property3_4) ).
cnf(c_0_21,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_22,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_23,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_25,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_26,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_27,plain,
( X1 = null_class
| member(not_subclass_element(null_class,X2),X1)
| subclass(null_class,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_30,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_31,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_32,plain,
( X1 = null_class
| subclass(null_class,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_33,plain,
( subclass(intersection(X1,X2),intersection(X3,X1))
| ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_35,axiom,
( X3 = null_class
| member(least(X1,X3),X3)
| ~ well_ordering(X1,X2)
| ~ subclass(X3,X2) ),
well_ordering2 ).
cnf(c_0_36,negated_conjecture,
well_ordering(xr,y),
prove_sections_property3_1 ).
cnf(c_0_37,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
domain1 ).
cnf(c_0_38,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_39,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_40,plain,
( X1 = null_class
| ~ subclass(X1,null_class) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_42,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( X1 = null_class
| member(least(xr,X1),X1)
| ~ subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_44,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
intersection(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),y),
prove_sections_property3_3 ).
cnf(c_0_47,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_42]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
( intersection(y,X1) = null_class
| member(least(xr,intersection(y,X1)),intersection(y,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_41]) ).
cnf(c_0_49,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_51,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_52,negated_conjecture,
~ member(least(xr,intersection(y,complement(w))),y),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( intersection(y,X1) = null_class
| member(least(xr,intersection(y,X1)),y) ),
inference(spm,[status(thm)],[c_0_21,c_0_48]) ).
cnf(c_0_54,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_56,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_50]) ).
cnf(c_0_57,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_50]) ).
cnf(c_0_58,axiom,
( subclass(X2,X3)
| ~ section(X1,X2,X3) ),
section1 ).
cnf(c_0_59,negated_conjecture,
section(xr,w,y),
prove_sections_property3_2 ).
cnf(c_0_60,plain,
( member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2)
| ~ subclass(X1,X3) ),
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_61,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_62,negated_conjecture,
intersection(y,complement(w)) = null_class,
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_64,plain,
( intersection(X1,complement(X2)) = null_class
| ~ member(regular(intersection(X1,complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_65,plain,
( intersection(intersection(X1,X2),X3) = null_class
| member(regular(intersection(intersection(X1,X2),X3)),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_57]) ).
cnf(c_0_66,negated_conjecture,
subclass(w,y),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_68,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
( ~ member(X1,complement(w))
| ~ member(X1,y) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_62]),c_0_63]) ).
cnf(c_0_70,plain,
intersection(intersection(X1,X2),complement(X2)) = null_class,
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( member(not_subclass_element(w,X1),y)
| subclass(w,X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_66]) ).
cnf(c_0_72,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_73,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_74,negated_conjecture,
( intersection(complement(w),X1) = null_class
| ~ member(regular(intersection(complement(w),X1)),y) ),
inference(spm,[status(thm)],[c_0_69,c_0_57]) ).
cnf(c_0_75,plain,
( intersection(X1,intersection(X2,X3)) = null_class
| member(regular(intersection(X1,intersection(X2,X3))),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_56]) ).
cnf(c_0_76,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_77,plain,
( ~ member(X1,intersection(X2,X3))
| ~ member(X1,complement(X3)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_70]),c_0_63]) ).
cnf(c_0_78,negated_conjecture,
subclass(w,intersection(y,w)),
inference(spm,[status(thm)],[c_0_67,c_0_71]) ).
cnf(c_0_79,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_80,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_72]),c_0_73])]) ).
cnf(c_0_81,negated_conjecture,
intersection(complement(w),intersection(X1,y)) = null_class,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_82,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_76,c_0_61]) ).
cnf(c_0_83,plain,
( subclass(intersection(X1,X2),X3)
| ~ member(not_subclass_element(intersection(X1,X2),X3),complement(X2)) ),
inference(spm,[status(thm)],[c_0_77,c_0_24]) ).
cnf(c_0_84,negated_conjecture,
intersection(y,w) = w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_78]),c_0_73])]) ).
cnf(c_0_85,plain,
( member(not_subclass_element(X1,X2),complement(X3))
| member(not_subclass_element(X1,X2),X3)
| subclass(X1,X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_29]),c_0_80]),c_0_80]),c_0_80]) ).
cnf(c_0_86,negated_conjecture,
( ~ member(X1,intersection(X2,y))
| ~ member(X1,complement(w)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_81]),c_0_63]) ).
cnf(c_0_87,plain,
( intersection(complement(X1),X2) = null_class
| ~ member(regular(intersection(complement(X1),X2)),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_57]) ).
cnf(c_0_88,plain,
( X1 = null_class
| member(regular(X1),complement(X2))
| member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_82]) ).
cnf(c_0_89,negated_conjecture,
( subclass(w,X1)
| ~ member(not_subclass_element(w,X1),complement(w)) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_90,plain,
( member(not_subclass_element(X1,intersection(complement(X2),X1)),X2)
| subclass(X1,intersection(complement(X2),X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_85]) ).
cnf(c_0_91,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_24]) ).
cnf(c_0_92,negated_conjecture,
( intersection(X1,y) = null_class
| ~ member(regular(intersection(X1,y)),complement(w)) ),
inference(spm,[status(thm)],[c_0_86,c_0_50]) ).
cnf(c_0_93,plain,
( intersection(complement(complement(X1)),X2) = null_class
| member(regular(intersection(complement(complement(X1)),X2)),X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,negated_conjecture,
subclass(w,intersection(w,complement(complement(w)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_47]) ).
cnf(c_0_95,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(spm,[status(thm)],[c_0_91,c_0_85]) ).
cnf(c_0_96,negated_conjecture,
intersection(y,complement(complement(complement(w)))) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_47]) ).
cnf(c_0_97,plain,
( intersection(X1,X2) = X2
| ~ subclass(X2,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_73]) ).
cnf(c_0_98,negated_conjecture,
intersection(w,complement(complement(w))) = w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_94]),c_0_41])]) ).
cnf(c_0_99,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_25,c_0_95]) ).
cnf(c_0_100,negated_conjecture,
( ~ member(X1,complement(complement(complement(w))))
| ~ member(X1,y) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_96]),c_0_63]) ).
cnf(c_0_101,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_85]) ).
cnf(c_0_102,negated_conjecture,
complement(complement(w)) = w,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99])]) ).
cnf(c_0_103,negated_conjecture,
y != w,
prove_sections_property3_4 ).
cnf(c_0_104,negated_conjecture,
( subclass(X1,w)
| ~ member(not_subclass_element(X1,w),y) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_102]),c_0_102]),c_0_102]),c_0_102]) ).
cnf(c_0_105,negated_conjecture,
~ subclass(y,w),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_66]),c_0_103]) ).
cnf(c_0_106,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_24]),c_0_105]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM094-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 14:24:24 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 Running first-order model finding
% 0.23/0.52 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/tmp/tmp.fux6YjbiuU/E---3.1_25249.p
% 379.02/48.81 # Version: 3.1pre001
% 379.02/48.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 379.02/48.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 379.02/48.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 379.02/48.81 # Starting new_bool_3 with 300s (1) cores
% 379.02/48.81 # Starting new_bool_1 with 300s (1) cores
% 379.02/48.81 # Starting sh5l with 300s (1) cores
% 379.02/48.81 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 25326 completed with status 0
% 379.02/48.81 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 379.02/48.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 379.02/48.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 379.02/48.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 379.02/48.81 # No SInE strategy applied
% 379.02/48.81 # Search class: FGHSM-FFLM31-DFFFFFNN
% 379.02/48.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 379.02/48.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 379.02/48.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 379.02/48.81 # Starting new_bool_1 with 308s (1) cores
% 379.02/48.81 # Starting sh5l with 304s (1) cores
% 379.02/48.81 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 379.02/48.81 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25333 completed with status 0
% 379.02/48.81 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 379.02/48.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 379.02/48.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 379.02/48.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 379.02/48.81 # No SInE strategy applied
% 379.02/48.81 # Search class: FGHSM-FFLM31-DFFFFFNN
% 379.02/48.81 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 379.02/48.81 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 379.02/48.81 # Preprocessing time : 0.004 s
% 379.02/48.81 # Presaturation interreduction done
% 379.02/48.81
% 379.02/48.81 # Proof found!
% 379.02/48.81 # SZS status Unsatisfiable
% 379.02/48.81 # SZS output start CNFRefutation
% See solution above
% 379.02/48.81 # Parsed axioms : 162
% 379.02/48.81 # Removed by relevancy pruning/SinE : 0
% 379.02/48.81 # Initial clauses : 162
% 379.02/48.81 # Removed in clause preprocessing : 19
% 379.02/48.81 # Initial clauses in saturation : 143
% 379.02/48.81 # Processed clauses : 148254
% 379.02/48.81 # ...of these trivial : 717
% 379.02/48.81 # ...subsumed : 129750
% 379.02/48.81 # ...remaining for further processing : 17787
% 379.02/48.81 # Other redundant clauses eliminated : 34
% 379.02/48.81 # Clauses deleted for lack of memory : 0
% 379.02/48.81 # Backward-subsumed : 1114
% 379.02/48.81 # Backward-rewritten : 2193
% 379.02/48.81 # Generated clauses : 1248688
% 379.02/48.81 # ...of the previous two non-redundant : 1061092
% 379.02/48.81 # ...aggressively subsumed : 0
% 379.02/48.81 # Contextual simplify-reflections : 183
% 379.02/48.81 # Paramodulations : 1248593
% 379.02/48.81 # Factorizations : 59
% 379.02/48.81 # NegExts : 0
% 379.02/48.81 # Equation resolutions : 35
% 379.02/48.81 # Total rewrite steps : 792415
% 379.02/48.81 # Propositional unsat checks : 3
% 379.02/48.81 # Propositional check models : 0
% 379.02/48.81 # Propositional check unsatisfiable : 0
% 379.02/48.81 # Propositional clauses : 0
% 379.02/48.81 # Propositional clauses after purity: 0
% 379.02/48.81 # Propositional unsat core size : 0
% 379.02/48.81 # Propositional preprocessing time : 0.000
% 379.02/48.81 # Propositional encoding time : 2.798
% 379.02/48.81 # Propositional solver time : 0.563
% 379.02/48.81 # Success case prop preproc time : 0.000
% 379.02/48.81 # Success case prop encoding time : 0.000
% 379.02/48.81 # Success case prop solver time : 0.000
% 379.02/48.81 # Current number of processed clauses : 14331
% 379.02/48.81 # Positive orientable unit clauses : 403
% 379.02/48.81 # Positive unorientable unit clauses: 4
% 379.02/48.81 # Negative unit clauses : 453
% 379.02/48.81 # Non-unit-clauses : 13471
% 379.02/48.81 # Current number of unprocessed clauses: 889928
% 379.02/48.81 # ...number of literals in the above : 3700611
% 379.02/48.81 # Current number of archived formulas : 0
% 379.02/48.81 # Current number of archived clauses : 3469
% 379.02/48.81 # Clause-clause subsumption calls (NU) : 35076879
% 379.02/48.81 # Rec. Clause-clause subsumption calls : 8522540
% 379.02/48.81 # Non-unit clause-clause subsumptions : 45047
% 379.02/48.81 # Unit Clause-clause subsumption calls : 452434
% 379.02/48.81 # Rewrite failures with RHS unbound : 0
% 379.02/48.81 # BW rewrite match attempts : 2304
% 379.02/48.81 # BW rewrite match successes : 551
% 379.02/48.81 # Condensation attempts : 0
% 379.02/48.81 # Condensation successes : 0
% 379.02/48.81 # Termbank termtop insertions : 90454878
% 379.02/48.81
% 379.02/48.81 # -------------------------------------------------
% 379.02/48.81 # User time : 46.340 s
% 379.02/48.81 # System time : 0.657 s
% 379.02/48.81 # Total time : 46.997 s
% 379.02/48.81 # Maximum resident set size: 2240 pages
% 379.02/48.81
% 379.02/48.81 # -------------------------------------------------
% 379.02/48.81 # User time : 234.364 s
% 379.02/48.81 # System time : 1.920 s
% 379.02/48.81 # Total time : 236.284 s
% 379.02/48.81 # Maximum resident set size: 1816 pages
% 379.02/48.81 % E---3.1 exiting
%------------------------------------------------------------------------------