%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET099-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:16:32 PM UTC 2026
% Result : Unsatisfiable 0.43s 0.48s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 24
% Syntax : Number of clauses : 94 ( 30 unt; 27 nHn; 56 RR)
% Number of literals : 174 ( 71 equ; 70 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 : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 144 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(only_member_in_singleton,axiom,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',only_member_in_singleton) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(singleton_is_null_class,axiom,
( singleton(X1) = null_class
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_is_null_class) ).
cnf(prove_corollary_2_to_number_of_elements_in_class_1,negated_conjecture,
not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class) = not_subclass_element(x,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_number_of_elements_in_class_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(null_class_is_unique,axiom,
( member(not_subclass_element(X1,null_class),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_unique) ).
cnf(unordered_pair_equals_singleton1,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(prove_corollary_2_to_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_number_of_elements_in_class_2) ).
cnf(number_of_elements_in_class,axiom,
( X1 = null_class
| singleton(not_subclass_element(X1,null_class)) = X1
| member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_of_elements_in_class) ).
cnf(corollary_to_unordered_pair_axiom3,axiom,
( unordered_pair(X1,X2) != null_class
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_to_unordered_pair_axiom3) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(cartesian_product3,axiom,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(commutativity_of_unordered_pair,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_unordered_pair) ).
cnf(prove_corollary_2_to_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_2_to_number_of_elements_in_class_3) ).
cnf(unordered_pair_equals_singleton2,axiom,
( unordered_pair(X1,X2) = singleton(X2)
| member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_equals_singleton2) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(null_unordered_pair,axiom,
( member(X2,universal_class)
| member(X1,universal_class)
| unordered_pair(X1,X2) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_unordered_pair) ).
cnf(c_0_24,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[only_member_in_singleton]) ).
cnf(c_0_25,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_26,plain,
~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[existence_of_null_class]) ).
cnf(c_0_27,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
c_0_24 ).
cnf(c_0_28,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_29,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_25 ).
cnf(c_0_30,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_31,plain,
~ member(X1,null_class),
c_0_26 ).
cnf(c_0_32,plain,
( ~ member(X1,unordered_pair(X2,X2))
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_34,plain,
( ~ member(X2,X1)
| ~ member(X2,regular(X1))
| X1 = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_37,axiom,
( singleton(X1) = null_class
| member(X1,universal_class) ),
singleton_is_null_class ).
cnf(c_0_38,plain,
( ~ member(X2,X1)
| ~ member(X2,unordered_pair(X1,X1))
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_36 ).
cnf(c_0_40,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(rw,[status(thm)],[c_0_37,c_0_28]) ).
cnf(c_0_41,negated_conjecture,
not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class) = not_subclass_element(x,null_class),
prove_corollary_2_to_number_of_elements_in_class_1 ).
cnf(c_0_42,plain,
( ~ member(X1,X1)
| unordered_pair(X1,X1) = null_class ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_43,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_44,axiom,
( member(not_subclass_element(X1,null_class),X1)
| X1 = null_class ),
null_class_is_unique ).
cnf(c_0_45,negated_conjecture,
not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class) = not_subclass_element(x,null_class),
inference(rw,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_46,plain,
unordered_pair(universal_class,universal_class) = null_class,
inference(spm,[status(thm)],[c_0_42,c_0_40]) ).
cnf(c_0_47,axiom,
( unordered_pair(X2,X1) = singleton(X2)
| member(X1,universal_class) ),
unordered_pair_equals_singleton1 ).
cnf(c_0_48,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_49,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_43 ).
cnf(c_0_50,negated_conjecture,
( member(not_subclass_element(x,null_class),intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x))
| intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_number_of_elements_in_class_2]) ).
cnf(c_0_52,axiom,
( X1 = null_class
| singleton(not_subclass_element(X1,null_class)) = X1
| member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1)) ),
number_of_elements_in_class ).
cnf(c_0_53,plain,
~ member(universal_class,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_46]),c_0_31]) ).
cnf(c_0_54,plain,
( member(X1,universal_class)
| unordered_pair(X2,X1) = unordered_pair(X2,X2) ),
inference(rw,[status(thm)],[c_0_47,c_0_28]) ).
cnf(c_0_55,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_48 ).
cnf(c_0_56,negated_conjecture,
( member(not_subclass_element(x,null_class),complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))))
| intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
c_0_51 ).
cnf(c_0_58,plain,
( unordered_pair(X1,X2) != null_class
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
inference(fof_simplification,[status(thm)],[corollary_to_unordered_pair_axiom3]) ).
cnf(c_0_59,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_60,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product3]) ).
cnf(c_0_61,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_62,plain,
( member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class))),X1))
| unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class)) = X1
| X1 = null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_28]),c_0_28]),c_0_28]) ).
cnf(c_0_63,plain,
unordered_pair(X1,universal_class) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_64,axiom,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
commutativity_of_unordered_pair ).
cnf(c_0_65,negated_conjecture,
( ~ member(not_subclass_element(x,null_class),unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)))
| intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_66,negated_conjecture,
unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[c_0_57,c_0_28]) ).
cnf(c_0_67,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_number_of_elements_in_class_3]) ).
cnf(c_0_68,plain,
( unordered_pair(X1,X2) != null_class
| ~ member(ordered_pair(X1,X2),cross_product(X3,X4)) ),
c_0_58 ).
cnf(c_0_69,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_28]),c_0_28]) ).
cnf(c_0_70,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
c_0_60 ).
cnf(c_0_71,axiom,
( unordered_pair(X1,X2) = singleton(X2)
| member(X1,universal_class) ),
unordered_pair_equals_singleton2 ).
cnf(c_0_72,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_61 ).
cnf(c_0_73,plain,
( member(not_subclass_element(intersection(complement(unordered_pair(universal_class,not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(unordered_pair(universal_class,not_subclass_element(X1,null_class))),X1))
| X1 = null_class
| unordered_pair(universal_class,not_subclass_element(X1,null_class)) = X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_63]),c_0_64]),c_0_63]),c_0_64]) ).
cnf(c_0_74,negated_conjecture,
( ~ member(not_subclass_element(x,null_class),unordered_pair(universal_class,not_subclass_element(x,null_class)))
| intersection(complement(unordered_pair(universal_class,not_subclass_element(x,null_class))),x) = null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_63]),c_0_64]),c_0_63]),c_0_64]) ).
cnf(c_0_75,negated_conjecture,
unordered_pair(universal_class,not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_63]),c_0_64]) ).
cnf(c_0_76,negated_conjecture,
x != null_class,
c_0_67 ).
cnf(c_0_77,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_78,plain,
( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))
| unordered_pair(X1,X2) != null_class ),
inference(rw,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_79,plain,
( ~ member(X1,X2)
| ~ member(X3,X4)
| member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
inference(rw,[status(thm)],[c_0_70,c_0_69]) ).
cnf(c_0_80,plain,
( member(X1,universal_class)
| unordered_pair(X1,X2) = unordered_pair(X2,X2) ),
inference(rw,[status(thm)],[c_0_71,c_0_28]) ).
cnf(c_0_81,negated_conjecture,
( member(not_subclass_element(x,null_class),x)
| intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class ),
inference(spm,[status(thm)],[c_0_72,c_0_50]) ).
cnf(c_0_82,negated_conjecture,
~ member(not_subclass_element(x,null_class),unordered_pair(universal_class,not_subclass_element(x,null_class))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76]),c_0_31]) ).
cnf(c_0_83,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_77 ).
cnf(c_0_84,axiom,
( member(X2,universal_class)
| member(X1,universal_class)
| unordered_pair(X1,X2) = null_class ),
null_unordered_pair ).
cnf(c_0_85,plain,
( ~ member(X1,X4)
| ~ member(X2,X3)
| unordered_pair(X1,X2) != null_class ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_86,plain,
unordered_pair(universal_class,X1) = unordered_pair(X1,X1),
inference(spm,[status(thm)],[c_0_53,c_0_80]) ).
cnf(c_0_87,negated_conjecture,
( member(not_subclass_element(x,null_class),x)
| intersection(complement(unordered_pair(universal_class,not_subclass_element(x,null_class))),x) = null_class ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_63]),c_0_64]) ).
cnf(c_0_88,negated_conjecture,
~ member(not_subclass_element(x,null_class),universal_class),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_89,plain,
( member(X1,universal_class)
| unordered_pair(X1,universal_class) = null_class ),
inference(spm,[status(thm)],[c_0_53,c_0_84]) ).
cnf(c_0_90,plain,
( ~ member(X1,X2)
| unordered_pair(universal_class,X1) != null_class ),
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86])]) ).
cnf(c_0_91,negated_conjecture,
member(not_subclass_element(x,null_class),x),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_87]),c_0_75]),c_0_76]),c_0_31]) ).
cnf(c_0_92,negated_conjecture,
unordered_pair(universal_class,not_subclass_element(x,null_class)) = null_class,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_64]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET099-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:53:32 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.41 Running first-order theorem proving
% 0.09/0.41 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
% 0.43/0.48 % Version: 3.5.1
% 0.43/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.43/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.43/0.48 % Starting sh5l with 300s (1) cores
% 0.43/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2046024 completed with status 0
% 0.43/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.43/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.43/0.48 % No SInE strategy applied
% 0.43/0.48 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.43/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.43/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.43/0.48 % Starting new_bool_3 with 311s (1) cores
% 0.43/0.48 % Starting new_bool_1 with 308s (1) cores
% 0.43/0.48 % Starting sh5l with 304s (1) cores
% 0.43/0.48 % sh5l with pid 2046035 completed with status 0
% 0.43/0.48 % Result found by sh5l
% 0.43/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.43/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.43/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.43/0.48 % No SInE strategy applied
% 0.43/0.48 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.43/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.43/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.43/0.48 % Starting new_bool_3 with 311s (1) cores
% 0.43/0.48 % Starting new_bool_1 with 308s (1) cores
% 0.43/0.48 % Starting sh5l with 304s (1) cores
% 0.43/0.48 % Preprocessing time : 0.002 s
% 0.43/0.48 % Presaturation interreduction done
% 0.43/0.48
% 0.43/0.48 % Proof found!
% 0.43/0.48 % SZS status Unsatisfiable
% 0.43/0.48 % SZS output start CNFRefutation
% See solution above
% 0.43/0.49 % Parsed axioms : 144
% 0.43/0.49 % Removed by relevancy pruning/SinE : 0
% 0.43/0.49 % Initial clauses : 144
% 0.43/0.49 % Removed in clause preprocessing : 15
% 0.43/0.49 % Initial clauses in saturation : 129
% 0.43/0.49 % Processed clauses : 812
% 0.43/0.49 % ...of these trivial : 15
% 0.43/0.49 % ...subsumed : 438
% 0.43/0.49 % ...remaining for further processing : 359
% 0.43/0.49 % Other redundant clauses eliminated : 29
% 0.43/0.49 % Clauses deleted for lack of memory : 0
% 0.43/0.49 % Backward-subsumed : 12
% 0.43/0.49 % Backward-rewritten : 20
% 0.43/0.49 % Generated clauses : 2535
% 0.43/0.49 % ...of the previous two non-redundant : 2080
% 0.43/0.49 % ...aggressively subsumed : 0
% 0.43/0.49 % Contextual simplify-reflections : 3
% 0.43/0.49 % Paramodulations : 2495
% 0.43/0.49 % Factorizations : 5
% 0.43/0.49 % NegExts : 0
% 0.43/0.49 % Equation resolutions : 33
% 0.43/0.49 % Disequality decompositions : 0
% 0.43/0.49 % Total rewrite steps : 1309
% 0.43/0.49 % ...of those cached : 1192
% 0.43/0.49 % Propositional unsat checks : 0
% 0.43/0.49 % Propositional check models : 0
% 0.43/0.49 % Propositional check unsatisfiable : 0
% 0.43/0.49 % Propositional clauses : 0
% 0.43/0.49 % Propositional clauses after purity: 0
% 0.43/0.49 % Propositional unsat core size : 0
% 0.43/0.49 % Propositional preprocessing time : 0.000
% 0.43/0.49 % Propositional encoding time : 0.000
% 0.43/0.49 % Propositional solver time : 0.000
% 0.43/0.49 % Success case prop preproc time : 0.000
% 0.43/0.49 % Success case prop encoding time : 0.000
% 0.43/0.49 % Success case prop solver time : 0.000
% 0.43/0.49 % Current number of processed clauses : 200
% 0.43/0.49 % Positive orientable unit clauses : 38
% 0.43/0.49 % Positive unorientable unit clauses: 4
% 0.43/0.49 % Negative unit clauses : 18
% 0.43/0.49 % Non-unit-clauses : 140
% 0.43/0.49 % Current number of unprocessed clauses: 1499
% 0.43/0.49 % ...number of literals in the above : 4184
% 0.43/0.49 % Current number of archived formulas : 0
% 0.43/0.49 % Current number of archived clauses : 171
% 0.43/0.49 % Clause-clause subsumption calls (NU) : 6903
% 0.43/0.49 % Rec. Clause-clause subsumption calls : 4012
% 0.43/0.49 % Non-unit clause-clause subsumptions : 196
% 0.43/0.49 % Unit Clause-clause subsumption calls : 230
% 0.43/0.49 % Rewrite failures with RHS unbound : 0
% 0.43/0.49 % BW rewrite match attempts : 111
% 0.43/0.49 % BW rewrite match successes : 40
% 0.43/0.49 % Condensation attempts : 812
% 0.43/0.49 % Condensation successes : 3
% 0.43/0.49 % Termbank termtop insertions : 34587
% 0.43/0.49 % Search garbage collected termcells : 228
% 0.43/0.49
% 0.43/0.49 % -------------------------------------------------
% 0.43/0.49 % User time : 0.039 s
% 0.43/0.49 % System time : 0.004 s
% 0.43/0.49 % Total time : 0.043 s
% 0.43/0.49 % Maximum resident set size: 4004 pages
% 0.43/0.49
% 0.43/0.49 % -------------------------------------------------
% 0.43/0.49 % User time : 0.209 s
% 0.43/0.49 % System time : 0.022 s
% 0.43/0.49 % Total time : 0.231 s
% 0.43/0.49 % Maximum resident set size: 4608 pages
% 0.43/0.49 % E exiting
%------------------------------------------------------------------------------