%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET508-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:17 PM UTC 2026
% Result : Unsatisfiable 249.43s 37.58s
% Output : CNFRefutation 249.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 18
% Syntax : Number of clauses : 102 ( 27 unt; 39 nHn; 48 RR)
% Number of literals : 203 ( 75 equ; 66 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 175 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(domain1,axiom,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_corollary_1_to_singleton_in_unordered_pair_1,negated_conjecture,
unordered_pair(x,universal_class) != singleton(x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_singleton_in_unordered_pair_1) ).
cnf(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_19,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_18 ).
cnf(c_0_20,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_21 ).
cnf(c_0_25,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_27,plain,
( ~ member(regular(X1),complement(universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_29,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_26 ).
cnf(c_0_30,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_31,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_28 ).
cnf(c_0_34,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_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_31 ).
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_27,c_0_32]) ).
cnf(c_0_40,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_41,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_42,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_43,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_34])]) ).
cnf(c_0_44,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_45,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_46,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_47,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
unordered_pair(x,universal_class) != singleton(x),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_singleton_in_unordered_pair_1]) ).
cnf(c_0_49,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_41 ).
cnf(c_0_50,plain,
( subclass(unordered_pair(X1,X1),X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_44 ).
cnf(c_0_52,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_29,c_0_23]) ).
cnf(c_0_53,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_45,c_0_23]) ).
cnf(c_0_54,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,negated_conjecture,
unordered_pair(x,universal_class) != singleton(x),
c_0_48 ).
cnf(c_0_56,plain,
( ~ subclass(X1,unordered_pair(X2,X2))
| member(X2,universal_class)
| X1 = unordered_pair(X2,X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,plain,
( ~ member(regular(X1),X2)
| member(regular(X1),intersection(X2,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_51,c_0_25]) ).
cnf(c_0_58,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_59,plain,
( member(X1,universal_class)
| unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_52]) ).
cnf(c_0_60,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,negated_conjecture,
unordered_pair(x,x) != unordered_pair(x,universal_class),
inference(rw,[status(thm)],[c_0_55,c_0_36]) ).
cnf(c_0_62,plain,
( member(X2,universal_class)
| member(X1,universal_class)
| unordered_pair(X1,X1) = unordered_pair(X2,X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_50]) ).
cnf(c_0_63,plain,
( member(X2,universal_class)
| unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X1 ),
inference(spm,[status(thm)],[c_0_25,c_0_52]) ).
cnf(c_0_64,plain,
( member(regular(X1),intersection(X1,universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_57,c_0_23]) ).
cnf(c_0_65,plain,
( member(X1,universal_class)
| unordered_pair(X1,X2) = null_class
| intersection(unordered_pair(X1,X2),X2) = null_class ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_60]),c_0_54])]) ).
cnf(c_0_67,negated_conjecture,
( unordered_pair(X1,X1) != unordered_pair(x,universal_class)
| member(X1,universal_class)
| member(x,universal_class) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
( member(X1,universal_class)
| member(X2,universal_class)
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_63]) ).
cnf(c_0_69,plain,
( member(X1,universal_class)
| unordered_pair(X1,universal_class) = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_70,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_71,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_72,negated_conjecture,
( member(X1,universal_class)
| member(x,universal_class) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]) ).
cnf(c_0_73,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_70 ).
cnf(c_0_74,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
member(x,universal_class),
inference(ef,[status(thm)],[c_0_72]) ).
cnf(c_0_76,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_73,c_0_43]) ).
cnf(c_0_77,negated_conjecture,
member(x,unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_78,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_42,c_0_34]) ).
cnf(c_0_79,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_80,negated_conjecture,
subclass(unordered_pair(x,x),unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,plain,
( ~ member(X2,X3)
| subclass(unordered_pair(X1,X2),X3)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_73,c_0_78]) ).
cnf(c_0_82,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_79 ).
cnf(c_0_83,negated_conjecture,
( ~ subclass(unordered_pair(X1,x),unordered_pair(x,x))
| unordered_pair(X1,x) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_49,c_0_80]) ).
cnf(c_0_84,negated_conjecture,
( subclass(unordered_pair(X1,x),unordered_pair(X2,x))
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_81,c_0_77]) ).
cnf(c_0_85,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_52])]) ).
cnf(c_0_86,negated_conjecture,
member(x,unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_82,c_0_75]) ).
cnf(c_0_87,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(X1,x) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_88,plain,
( unordered_pair(X1,X1) = null_class
| intersection(unordered_pair(X1,X1),X1) = null_class ),
inference(spm,[status(thm)],[c_0_58,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
subclass(unordered_pair(x,x),unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_76,c_0_86]) ).
cnf(c_0_90,negated_conjecture,
( member(X1,unordered_pair(X2,X1))
| unordered_pair(X1,x) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_74,c_0_87]) ).
cnf(c_0_91,plain,
unordered_pair(universal_class,universal_class) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_88]),c_0_66]) ).
cnf(c_0_92,plain,
( subclass(unordered_pair(X1,X2),X3)
| member(X2,universal_class)
| not_subclass_element(unordered_pair(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_93,negated_conjecture,
( ~ subclass(unordered_pair(x,X1),unordered_pair(x,x))
| unordered_pair(x,X1) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_49,c_0_89]) ).
cnf(c_0_94,negated_conjecture,
unordered_pair(x,x) = unordered_pair(universal_class,x),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_66]) ).
cnf(c_0_95,plain,
( ~ member(X2,X3)
| subclass(unordered_pair(X2,X1),X3)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_73,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
( ~ subclass(unordered_pair(x,X1),unordered_pair(universal_class,x))
| unordered_pair(x,X1) = unordered_pair(universal_class,x) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_93,c_0_94]),c_0_94]) ).
cnf(c_0_97,negated_conjecture,
( subclass(unordered_pair(x,X1),unordered_pair(X2,x))
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_95,c_0_77]) ).
cnf(c_0_98,negated_conjecture,
( member(X1,universal_class)
| unordered_pair(x,X1) = unordered_pair(universal_class,x) ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_99,negated_conjecture,
( member(X1,unordered_pair(X2,X1))
| unordered_pair(x,X1) = unordered_pair(universal_class,x) ),
inference(spm,[status(thm)],[c_0_74,c_0_98]) ).
cnf(c_0_100,negated_conjecture,
unordered_pair(x,universal_class) != unordered_pair(universal_class,x),
inference(rw,[status(thm)],[c_0_61,c_0_94]) ).
cnf(c_0_101,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_91]),c_0_100]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET508-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/5.44 % Computer : n015.cluster.edu
% 0.18/5.44 % Model : x86_64 x86_64
% 0.18/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.44 % Memory : 8046.5625MB
% 0.18/5.44 % OS : Linux 6.8.0-71-generic
% 0.18/5.44 % CPULimit : 300
% 0.18/5.44 % WCLimit : 300
% 0.18/5.44 % DateTime : Mon Sep 21 05:25:41 UTC 2026
% 0.18/5.45 % CPUTime :
% 0.18/5.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 249.43/37.58 % Version: 3.5.1
% 249.43/37.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 249.43/37.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 249.43/37.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 249.43/37.58 % Starting new_bool_3 with 300s (1) cores
% 249.43/37.58 % Starting new_bool_1 with 300s (1) cores
% 249.43/37.58 % Starting sh5l with 300s (1) cores
% 249.43/37.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 642946 completed with status 0
% 249.43/37.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 249.43/37.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 249.43/37.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 249.43/37.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 249.43/37.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 249.43/37.58 % No SInE strategy applied
% 249.43/37.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 249.43/37.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 249.43/37.58 % Starting SubtermCWHack with 136s (1) cores
% 249.43/37.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 249.43/37.58 % Starting new_bool_3 with 311s (1) cores
% 249.43/37.58 % Starting new_bool_1 with 308s (1) cores
% 249.43/37.58 % Starting sh5l with 304s (1) cores
% 249.43/37.58 % new_bool_3 with pid 642955 completed with status 0
% 249.43/37.58 % Result found by new_bool_3
% 249.43/37.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 249.43/37.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 249.43/37.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 249.43/37.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 249.43/37.58 % No SInE strategy applied
% 249.43/37.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 249.43/37.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 249.43/37.58 % Starting SubtermCWHack with 136s (1) cores
% 249.43/37.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 249.43/37.58 % Starting new_bool_3 with 311s (1) cores
% 249.43/37.58 % Preprocessing time : 0.005 s
% 249.43/37.58 % Presaturation interreduction done
% 249.43/37.58
% 249.43/37.58 % Proof found!
% 249.43/37.58 % SZS status Unsatisfiable
% 249.43/37.58 % SZS output start CNFRefutation
% See solution above
% 249.43/37.58 % Parsed axioms : 113
% 249.43/37.58 % Removed by relevancy pruning/SinE : 0
% 249.43/37.58 % Initial clauses : 113
% 249.43/37.58 % Removed in clause preprocessing : 17
% 249.43/37.58 % Initial clauses in saturation : 96
% 249.43/37.58 % Processed clauses : 71061
% 249.43/37.58 % ...of these trivial : 2977
% 249.43/37.58 % ...subsumed : 60629
% 249.43/37.58 % ...remaining for further processing : 7455
% 249.43/37.58 % Other redundant clauses eliminated : 18
% 249.43/37.58 % Clauses deleted for lack of memory : 0
% 249.43/37.58 % Backward-subsumed : 423
% 249.43/37.58 % Backward-rewritten : 378
% 249.43/37.58 % Generated clauses : 1059804
% 249.43/37.58 % ...of the previous two non-redundant : 881896
% 249.43/37.58 % ...aggressively subsumed : 0
% 249.43/37.58 % Contextual simplify-reflections : 66
% 249.43/37.58 % Paramodulations : 1059722
% 249.43/37.58 % Factorizations : 32
% 249.43/37.58 % NegExts : 0
% 249.43/37.58 % Equation resolutions : 21
% 249.43/37.58 % Disequality decompositions : 0
% 249.43/37.58 % Total rewrite steps : 567789
% 249.43/37.58 % ...of those cached : 557289
% 249.43/37.58 % Propositional unsat checks : 1
% 249.43/37.58 % Propositional check models : 0
% 249.43/37.58 % Propositional check unsatisfiable : 0
% 249.43/37.58 % Propositional clauses : 0
% 249.43/37.58 % Propositional clauses after purity: 0
% 249.43/37.58 % Propositional unsat core size : 0
% 249.43/37.58 % Propositional preprocessing time : 0.000
% 249.43/37.58 % Propositional encoding time : 1.197
% 249.43/37.58 % Propositional solver time : 0.719
% 249.43/37.58 % Success case prop preproc time : 0.000
% 249.43/37.58 % Success case prop encoding time : 0.000
% 249.43/37.58 % Success case prop solver time : 0.000
% 249.43/37.58 % Current number of processed clauses : 6526
% 249.43/37.58 % Positive orientable unit clauses : 1171
% 249.43/37.58 % Positive unorientable unit clauses: 1
% 249.43/37.58 % Negative unit clauses : 378
% 249.43/37.58 % Non-unit-clauses : 4976
% 249.43/37.58 % Current number of unprocessed clauses: 806802
% 249.43/37.58 % ...number of literals in the above : 2396920
% 249.43/37.58 % Current number of archived formulas : 0
% 249.43/37.58 % Current number of archived clauses : 942
% 249.43/37.58 % Clause-clause subsumption calls (NU) : 2711854
% 249.43/37.58 % Rec. Clause-clause subsumption calls : 1568806
% 249.43/37.58 % Non-unit clause-clause subsumptions : 42158
% 249.43/37.58 % Unit Clause-clause subsumption calls : 78839
% 249.43/37.58 % Rewrite failures with RHS unbound : 0
% 249.43/37.58 % BW rewrite match attempts : 35840
% 249.43/37.58 % BW rewrite match successes : 136
% 249.43/37.58 % Condensation attempts : 0
% 249.43/37.58 % Condensation successes : 0
% 249.43/37.58 % Termbank termtop insertions : 43062895
% 249.43/37.58 % Search garbage collected termcells : 185
% 249.43/37.58
% 249.43/37.58 % -------------------------------------------------
% 249.43/37.58 % User time : 30.596 s
% 249.43/37.58 % System time : 0.992 s
% 249.43/37.58 % Total time : 31.588 s
% 249.43/37.58 % Maximum resident set size: 3480 pages
% 249.43/37.58
% 249.43/37.58 % -------------------------------------------------
% 249.43/37.58 % User time : 153.476 s
% 249.43/37.58 % System time : 3.634 s
% 249.43/37.58 % Total time : 157.110 s
% 249.43/37.58 % Maximum resident set size: 4608 pages
% 249.43/37.58 % E exiting
%------------------------------------------------------------------------------