%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET513-6 : 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 : n018.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:14:18 PM UTC 2026
% Result : Unsatisfiable 52.02s 8.34s
% Output : CNFRefutation 52.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 22
% Syntax : Number of clauses : 106 ( 36 unt; 31 nHn; 56 RR)
% Number of literals : 199 ( 67 equ; 70 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 174 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(domain1,axiom,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
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(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
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(inductive1,axiom,
( ~ inductive(X1)
| member(null_class,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',inductive1) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',omega_is_inductive1) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
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(prove_corollary_3_to_property_1_of_ordered_pair_1,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_3_to_property_1_of_ordered_pair_1) ).
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(c_0_22,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_23,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_22 ).
cnf(c_0_24,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_25 ).
cnf(c_0_29,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ member(regular(X1),complement(universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_32,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_33,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_34,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_32 ).
cnf(c_0_36,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_37,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_38,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_39,plain,
( ~ member(regular(X1),null_class)
| X1 = null_class ),
inference(rw,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_40,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_34,c_0_27]) ).
cnf(c_0_41,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_42,plain,
( ~ member(X2,domain_of(X1))
| intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_43,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_44,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_41 ).
cnf(c_0_46,plain,
( intersection(X1,cross_product(unordered_pair(regular(domain_of(X1)),regular(domain_of(X1))),universal_class)) != null_class
| domain_of(X1) = null_class ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_47,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( member(regular(X1),X2)
| member(regular(X1),complement(X2))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_45,c_0_29]) ).
cnf(c_0_49,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_50,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ member(regular(X1),complement(complement(X2)))
| member(regular(X1),X2)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_28,c_0_48]) ).
cnf(c_0_52,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_53,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_54,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_55,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_49 ).
cnf(c_0_56,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_50]),c_0_47])]) ).
cnf(c_0_57,plain,
( member(regular(complement(complement(X1))),X1)
| complement(complement(X1)) = null_class ),
inference(spm,[status(thm)],[c_0_51,c_0_27]) ).
cnf(c_0_58,plain,
( ~ inductive(X1)
| member(null_class,X1) ),
inference(fof_simplification,[status(thm)],[inductive1]) ).
cnf(c_0_59,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_52 ).
cnf(c_0_60,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_26,c_0_53]) ).
cnf(c_0_61,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_54 ).
cnf(c_0_62,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X2
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_55,c_0_27]) ).
cnf(c_0_63,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_64,plain,
( subclass(universal_class,X1)
| member(not_subclass_element(universal_class,X1),X2)
| member(not_subclass_element(universal_class,X1),complement(X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_53]) ).
cnf(c_0_65,plain,
complement(complement(null_class)) = null_class,
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_66,plain,
( ~ inductive(X1)
| member(null_class,X1) ),
c_0_58 ).
cnf(c_0_67,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_68,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),unordered_pair(X3,not_subclass_element(X1,X2))) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,plain,
( ~ member(regular(X1),X2)
| member(regular(X1),intersection(X2,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_61,c_0_29]) ).
cnf(c_0_70,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_71,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_62])]) ).
cnf(c_0_72,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_73,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_63 ).
cnf(c_0_74,plain,
( subclass(universal_class,X1)
| member(not_subclass_element(universal_class,X1),complement(null_class)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_56]) ).
cnf(c_0_75,plain,
( subclass(unordered_pair(X1,X2),X3)
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_55,c_0_53]) ).
cnf(c_0_76,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_77,plain,
( ~ member(not_subclass_element(X1,X2),complement(unordered_pair(X3,not_subclass_element(X1,X2))))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_68]) ).
cnf(c_0_78,plain,
( member(regular(X1),intersection(X1,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_69,c_0_27]) ).
cnf(c_0_79,plain,
( unordered_pair(X1,X1) = null_class
| intersection(unordered_pair(X1,X1),X1) = null_class ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_80,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_72 ).
cnf(c_0_81,plain,
subclass(universal_class,complement(null_class)),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_82,plain,
( subclass(unordered_pair(X1,X1),X2)
| not_subclass_element(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_75])]) ).
cnf(c_0_83,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_26,c_0_76]) ).
cnf(c_0_84,plain,
( ~ member(X1,complement(unordered_pair(X4,X1)))
| subclass(unordered_pair(X1,X2),X3)
| not_subclass_element(unordered_pair(X1,X2),X3) = X2 ),
inference(spm,[status(thm)],[c_0_77,c_0_75]) ).
cnf(c_0_85,plain,
unordered_pair(universal_class,universal_class) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_56]) ).
cnf(c_0_86,plain,
complement(null_class) = universal_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_24])]) ).
cnf(c_0_87,plain,
( subclass(unordered_pair(X1,X2),X3)
| member(X1,universal_class)
| not_subclass_element(unordered_pair(X1,X2),X3) = X2 ),
inference(spm,[status(thm)],[c_0_60,c_0_75]) ).
cnf(c_0_88,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_89,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
inference(fof_simplification,[status(thm)],[prove_corollary_3_to_property_1_of_ordered_pair_1]) ).
cnf(c_0_90,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_91,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_82]) ).
cnf(c_0_92,plain,
member(null_class,unordered_pair(X1,null_class)),
inference(spm,[status(thm)],[c_0_59,c_0_83]) ).
cnf(c_0_93,plain,
( subclass(unordered_pair(universal_class,X1),X2)
| not_subclass_element(unordered_pair(universal_class,X1),X2) = X1 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87]) ).
cnf(c_0_94,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_88 ).
cnf(c_0_95,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
c_0_89 ).
cnf(c_0_96,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_90,c_0_36]),c_0_36]) ).
cnf(c_0_97,plain,
subclass(unordered_pair(null_class,null_class),unordered_pair(X1,null_class)),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_98,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(universal_class,X1),X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_93]) ).
cnf(c_0_99,plain,
member(null_class,unordered_pair(null_class,X1)),
inference(spm,[status(thm)],[c_0_94,c_0_83]) ).
cnf(c_0_100,negated_conjecture,
unordered_pair(unordered_pair(universal_class,universal_class),unordered_pair(universal_class,unordered_pair(universal_class,universal_class))) != unordered_pair(null_class,unordered_pair(null_class,null_class)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_36]),c_0_96]) ).
cnf(c_0_101,plain,
( ~ subclass(unordered_pair(X1,null_class),unordered_pair(null_class,null_class))
| unordered_pair(X1,null_class) = unordered_pair(null_class,null_class) ),
inference(spm,[status(thm)],[c_0_80,c_0_97]) ).
cnf(c_0_102,plain,
subclass(unordered_pair(universal_class,null_class),unordered_pair(null_class,X1)),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
unordered_pair(null_class,unordered_pair(null_class,null_class)) != unordered_pair(null_class,unordered_pair(universal_class,null_class)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_85]),c_0_85]) ).
cnf(c_0_104,plain,
unordered_pair(null_class,null_class) = unordered_pair(universal_class,null_class),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_103,c_0_104])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET513-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.63 % Computer : n018.cluster.edu
% 0.17/0.63 % Model : x86_64 x86_64
% 0.17/0.63 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.63 % Memory : 8046.5625MB
% 0.17/0.63 % OS : Linux 6.8.0-71-generic
% 0.17/0.63 % CPULimit : 300
% 0.17/0.63 % WCLimit : 300
% 0.17/0.63 % DateTime : Mon Sep 21 05:24:58 UTC 2026
% 0.17/0.64 % CPUTime :
% 0.17/0.64 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.71 Running first-order theorem proving
% 0.21/0.71 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
% 52.02/8.34 % Version: 3.5.1
% 52.02/8.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 52.02/8.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.02/8.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 52.02/8.34 % Starting new_bool_3 with 300s (1) cores
% 52.02/8.34 % Starting new_bool_1 with 300s (1) cores
% 52.02/8.34 % Starting sh5l with 300s (1) cores
% 52.02/8.34 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1047111 completed with status 0
% 52.02/8.34 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 52.02/8.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 52.02/8.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.02/8.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 52.02/8.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 52.02/8.34 % No SInE strategy applied
% 52.02/8.34 % Search class: FGHSM-FFLM31-DFFFFFNN
% 52.02/8.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 52.02/8.34 % Starting SubtermCWHack with 136s (1) cores
% 52.02/8.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 52.02/8.34 % Starting new_bool_3 with 311s (1) cores
% 52.02/8.34 % Starting new_bool_1 with 308s (1) cores
% 52.02/8.34 % Starting sh5l with 304s (1) cores
% 52.02/8.34 % new_bool_1 with pid 1047121 completed with status 0
% 52.02/8.34 % Result found by new_bool_1
% 52.02/8.34 % Preprocessing class: FSLSSMSMSSSNFFN.
% 52.02/8.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.02/8.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 52.02/8.34 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 52.02/8.34 % No SInE strategy applied
% 52.02/8.34 % Search class: FGHSM-FFLM31-DFFFFFNN
% 52.02/8.34 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 52.02/8.34 % Starting SubtermCWHack with 136s (1) cores
% 52.02/8.34 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 52.02/8.34 % Starting new_bool_3 with 311s (1) cores
% 52.02/8.34 % Starting new_bool_1 with 308s (1) cores
% 52.02/8.34 % Preprocessing time : 0.005 s
% 52.02/8.34 % Presaturation interreduction done
% 52.02/8.34
% 52.02/8.34 % Proof found!
% 52.02/8.34 % SZS status Unsatisfiable
% 52.02/8.34 % SZS output start CNFRefutation
% See solution above
% 52.02/8.34 % Parsed axioms : 113
% 52.02/8.34 % Removed by relevancy pruning/SinE : 0
% 52.02/8.34 % Initial clauses : 113
% 52.02/8.34 % Removed in clause preprocessing : 17
% 52.02/8.34 % Initial clauses in saturation : 96
% 52.02/8.34 % Processed clauses : 13290
% 52.02/8.34 % ...of these trivial : 1421
% 52.02/8.34 % ...subsumed : 7651
% 52.02/8.34 % ...remaining for further processing : 4218
% 52.02/8.34 % Other redundant clauses eliminated : 18
% 52.02/8.34 % Clauses deleted for lack of memory : 0
% 52.02/8.34 % Backward-subsumed : 238
% 52.02/8.34 % Backward-rewritten : 486
% 52.02/8.34 % Generated clauses : 259362
% 52.02/8.34 % ...of the previous two non-redundant : 219883
% 52.02/8.34 % ...aggressively subsumed : 0
% 52.02/8.34 % Contextual simplify-reflections : 22
% 52.02/8.34 % Paramodulations : 259328
% 52.02/8.34 % Factorizations : 14
% 52.02/8.34 % NegExts : 0
% 52.02/8.34 % Equation resolutions : 20
% 52.02/8.34 % Disequality decompositions : 0
% 52.02/8.34 % Total rewrite steps : 102070
% 52.02/8.34 % ...of those cached : 98982
% 52.02/8.34 % Propositional unsat checks : 0
% 52.02/8.34 % Propositional check models : 0
% 52.02/8.34 % Propositional check unsatisfiable : 0
% 52.02/8.34 % Propositional clauses : 0
% 52.02/8.34 % Propositional clauses after purity: 0
% 52.02/8.34 % Propositional unsat core size : 0
% 52.02/8.34 % Propositional preprocessing time : 0.000
% 52.02/8.34 % Propositional encoding time : 0.000
% 52.02/8.34 % Propositional solver time : 0.000
% 52.02/8.34 % Success case prop preproc time : 0.000
% 52.02/8.34 % Success case prop encoding time : 0.000
% 52.02/8.34 % Success case prop solver time : 0.000
% 52.02/8.34 % Current number of processed clauses : 3395
% 52.02/8.34 % Positive orientable unit clauses : 746
% 52.02/8.34 % Positive unorientable unit clauses: 1
% 52.02/8.34 % Negative unit clauses : 522
% 52.02/8.34 % Non-unit-clauses : 2126
% 52.02/8.34 % Current number of unprocessed clauses: 206138
% 52.02/8.34 % ...number of literals in the above : 393902
% 52.02/8.34 % Current number of archived formulas : 0
% 52.02/8.34 % Current number of archived clauses : 836
% 52.02/8.34 % Clause-clause subsumption calls (NU) : 426282
% 52.02/8.34 % Rec. Clause-clause subsumption calls : 247316
% 52.02/8.34 % Non-unit clause-clause subsumptions : 5351
% 52.02/8.34 % Unit Clause-clause subsumption calls : 35284
% 52.02/8.34 % Rewrite failures with RHS unbound : 0
% 52.02/8.34 % BW rewrite match attempts : 9045
% 52.02/8.34 % BW rewrite match successes : 45
% 52.02/8.34 % Condensation attempts : 0
% 52.02/8.34 % Condensation successes : 0
% 52.02/8.34 % Termbank termtop insertions : 6000507
% 52.02/8.34 % Search garbage collected termcells : 185
% 52.02/8.34
% 52.02/8.34 % -------------------------------------------------
% 52.02/8.34 % User time : 7.101 s
% 52.02/8.34 % System time : 0.293 s
% 52.02/8.34 % Total time : 7.394 s
% 52.02/8.34 % Maximum resident set size: 3992 pages
% 52.02/8.34
% 52.02/8.34 % -------------------------------------------------
% 52.02/8.34 % User time : 35.616 s
% 52.02/8.34 % System time : 1.051 s
% 52.02/8.34 % Total time : 36.666 s
% 52.02/8.34 % Maximum resident set size: 4864 pages
% 52.02/8.34 % E exiting
%------------------------------------------------------------------------------