%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET135-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 : n005.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:13:42 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.65s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 19
% Syntax : Number of clauses : 93 ( 37 unt; 12 nHn; 58 RR)
% Number of literals : 162 ( 37 equ; 70 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 149 ( 22 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(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
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(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(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(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(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',definition_of_set_builder) ).
cnf(prove_corollary_3_to_member_of_triple_2,negated_conjecture,
set_builder(x,set_builder(u,set_builder(z,null_class))) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_3_to_member_of_triple_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
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_member_of_triple_1,negated_conjecture,
member(u,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_3_to_member_of_triple_1) ).
cnf(c_0_19,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_19 ).
cnf(c_0_22,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_27,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_28,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_29,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_30,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_32,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_26 ).
cnf(c_0_34,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_27 ).
cnf(c_0_35,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_36,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_37,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_38,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_39,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_29 ).
cnf(c_0_40,plain,
subclass(complement(universal_class),X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_41,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_32 ).
cnf(c_0_42,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_43,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_34,c_0_35]),c_0_36]) ).
cnf(c_0_44,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( ~ subclass(X1,complement(universal_class))
| X1 = complement(universal_class) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_48,plain,
( ~ member(X2,domain_of(X1))
| intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != complement(universal_class) ),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
intersection(complement(universal_class),X1) = complement(universal_class),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
set_builder(x,set_builder(u,set_builder(z,null_class))) = null_class,
prove_corollary_3_to_member_of_triple_2 ).
cnf(c_0_51,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_47,c_0_35]) ).
cnf(c_0_52,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_53,plain,
~ member(X1,domain_of(complement(universal_class))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( member(regular(X1),X1)
| X1 = complement(universal_class) ),
inference(rw,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_55,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_56,negated_conjecture,
complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))) = null_class,
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_50,c_0_51]),c_0_51]),c_0_51]),c_0_52]),c_0_52]),c_0_52]) ).
cnf(c_0_57,plain,
domain_of(complement(universal_class)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_55 ).
cnf(c_0_59,negated_conjecture,
complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(complement(universal_class)))))))))) = complement(universal_class),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_44]),c_0_44]) ).
cnf(c_0_60,plain,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_53,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(complement(universal_class)))))))))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_62,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_63,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,complement(unordered_pair(x,x))) ),
inference(spm,[status(thm)],[c_0_33,c_0_61]) ).
cnf(c_0_64,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_62 ).
cnf(c_0_65,negated_conjecture,
~ member(X1,unordered_pair(x,x)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_63]),c_0_25]) ).
cnf(c_0_66,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X3)),X2)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| subclass(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_41,c_0_64]) ).
cnf(c_0_67,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_68,negated_conjecture,
unordered_pair(x,x) = complement(universal_class),
inference(spm,[status(thm)],[c_0_65,c_0_54]) ).
cnf(c_0_69,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_66,c_0_24]) ).
cnf(c_0_70,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_67 ).
cnf(c_0_71,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,complement(complement(universal_class))) ),
inference(spm,[status(thm)],[c_0_63,c_0_68]) ).
cnf(c_0_72,plain,
( ~ member(not_subclass_element(X1,intersection(X2,universal_class)),X2)
| subclass(X1,intersection(X2,universal_class)) ),
inference(spm,[status(thm)],[c_0_66,c_0_31]) ).
cnf(c_0_73,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_69,c_0_31]) ).
cnf(c_0_74,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_24]) ).
cnf(c_0_75,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_39,c_0_22]) ).
cnf(c_0_76,negated_conjecture,
subclass(X1,complement(complement(universal_class))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_71]),c_0_31]) ).
cnf(c_0_77,plain,
subclass(X1,intersection(X1,universal_class)),
inference(spm,[status(thm)],[c_0_72,c_0_24]) ).
cnf(c_0_78,plain,
( ~ subclass(intersection(universal_class,X1),X1)
| intersection(universal_class,X1) = X1 ),
inference(spm,[status(thm)],[c_0_39,c_0_73]) ).
cnf(c_0_79,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_41,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
complement(complement(universal_class)) = universal_class,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,plain,
intersection(X1,universal_class) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_77]),c_0_46])]) ).
cnf(c_0_82,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79])]) ).
cnf(c_0_83,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,complement(complement(intersection(complement(unordered_pair(u,u)),complement(complement(complement(unordered_pair(z,z)))))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_80]),c_0_68]),c_0_80]),c_0_81]),c_0_82]) ).
cnf(c_0_84,negated_conjecture,
~ member(X1,complement(intersection(complement(unordered_pair(u,u)),complement(complement(complement(unordered_pair(z,z))))))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_83]),c_0_25]) ).
cnf(c_0_85,negated_conjecture,
complement(intersection(complement(unordered_pair(u,u)),complement(complement(complement(unordered_pair(z,z)))))) = complement(universal_class),
inference(spm,[status(thm)],[c_0_84,c_0_54]) ).
cnf(c_0_86,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,intersection(complement(unordered_pair(u,u)),complement(complement(complement(unordered_pair(z,z)))))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_85]),c_0_60]) ).
cnf(c_0_87,negated_conjecture,
( ~ member(X1,universal_class)
| member(X1,complement(unordered_pair(u,u))) ),
inference(spm,[status(thm)],[c_0_33,c_0_86]) ).
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,
~ member(X1,unordered_pair(u,u)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_87]),c_0_25]) ).
cnf(c_0_90,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_88 ).
cnf(c_0_91,negated_conjecture,
member(u,universal_class),
prove_corollary_3_to_member_of_triple_1 ).
cnf(c_0_92,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET135-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 % Computer : n005.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.06/0.41 % CPULimit : 300
% 0.06/0.41 % WCLimit : 300
% 0.06/0.41 % DateTime : Mon Sep 21 04:55:33 UTC 2026
% 0.06/0.42 % CPUTime :
% 0.06/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.47 Running first-order theorem proving
% 0.06/0.47 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.24/0.65 % Version: 3.5.1
% 0.24/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.65 % Starting sh5l with 300s (1) cores
% 0.24/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2599549 completed with status 0
% 0.24/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.65 % No SInE strategy applied
% 0.24/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.65 % Starting new_bool_3 with 311s (1) cores
% 0.24/0.65 % Starting new_bool_1 with 308s (1) cores
% 0.24/0.65 % Starting sh5l with 304s (1) cores
% 0.24/0.65 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2599555 completed with status 0
% 0.24/0.65 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.24/0.65 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.24/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.24/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.65 % No SInE strategy applied
% 0.24/0.65 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.24/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.65 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.24/0.65 % Preprocessing time : 0.005 s
% 0.24/0.65 % Presaturation interreduction done
% 0.24/0.65
% 0.24/0.65 % Proof found!
% 0.24/0.65 % SZS status Unsatisfiable
% 0.24/0.65 % SZS output start CNFRefutation
% See solution above
% 0.24/0.65 % Parsed axioms : 94
% 0.24/0.65 % Removed by relevancy pruning/SinE : 0
% 0.24/0.65 % Initial clauses : 94
% 0.24/0.65 % Removed in clause preprocessing : 16
% 0.24/0.65 % Initial clauses in saturation : 78
% 0.24/0.65 % Processed clauses : 679
% 0.24/0.65 % ...of these trivial : 4
% 0.24/0.65 % ...subsumed : 260
% 0.24/0.65 % ...remaining for further processing : 415
% 0.24/0.65 % Other redundant clauses eliminated : 5
% 0.24/0.65 % Clauses deleted for lack of memory : 0
% 0.24/0.65 % Backward-subsumed : 56
% 0.24/0.65 % Backward-rewritten : 35
% 0.24/0.65 % Generated clauses : 1481
% 0.24/0.65 % ...of the previous two non-redundant : 1263
% 0.24/0.65 % ...aggressively subsumed : 0
% 0.24/0.65 % Contextual simplify-reflections : 10
% 0.24/0.65 % Paramodulations : 1474
% 0.24/0.65 % Factorizations : 2
% 0.24/0.65 % NegExts : 0
% 0.24/0.65 % Equation resolutions : 5
% 0.24/0.65 % Disequality decompositions : 0
% 0.24/0.65 % Total rewrite steps : 430
% 0.24/0.65 % ...of those cached : 340
% 0.24/0.65 % Propositional unsat checks : 0
% 0.24/0.65 % Propositional check models : 0
% 0.24/0.65 % Propositional check unsatisfiable : 0
% 0.24/0.65 % Propositional clauses : 0
% 0.24/0.65 % Propositional clauses after purity: 0
% 0.24/0.65 % Propositional unsat core size : 0
% 0.24/0.65 % Propositional preprocessing time : 0.000
% 0.24/0.65 % Propositional encoding time : 0.000
% 0.24/0.65 % Propositional solver time : 0.000
% 0.24/0.65 % Success case prop preproc time : 0.000
% 0.24/0.65 % Success case prop encoding time : 0.000
% 0.24/0.65 % Success case prop solver time : 0.000
% 0.24/0.65 % Current number of processed clauses : 244
% 0.24/0.65 % Positive orientable unit clauses : 39
% 0.24/0.65 % Positive unorientable unit clauses: 1
% 0.24/0.65 % Negative unit clauses : 4
% 0.24/0.65 % Non-unit-clauses : 200
% 0.24/0.65 % Current number of unprocessed clauses: 680
% 0.24/0.65 % ...number of literals in the above : 2069
% 0.24/0.65 % Current number of archived formulas : 0
% 0.24/0.65 % Current number of archived clauses : 184
% 0.24/0.65 % Clause-clause subsumption calls (NU) : 10704
% 0.24/0.65 % Rec. Clause-clause subsumption calls : 5829
% 0.24/0.65 % Non-unit clause-clause subsumptions : 227
% 0.24/0.65 % Unit Clause-clause subsumption calls : 508
% 0.24/0.65 % Rewrite failures with RHS unbound : 0
% 0.24/0.65 % BW rewrite match attempts : 59
% 0.24/0.65 % BW rewrite match successes : 19
% 0.24/0.65 % Condensation attempts : 0
% 0.24/0.65 % Condensation successes : 0
% 0.24/0.65 % Termbank termtop insertions : 44419
% 0.24/0.65 % Search garbage collected termcells : 154
% 0.24/0.65
% 0.24/0.65 % -------------------------------------------------
% 0.24/0.65 % User time : 0.121 s
% 0.24/0.65 % System time : 0.010 s
% 0.24/0.65 % Total time : 0.131 s
% 0.24/0.65 % Maximum resident set size: 3720 pages
% 0.24/0.65
% 0.24/0.65 % -------------------------------------------------
% 0.24/0.65 % User time : 0.456 s
% 0.24/0.65 % System time : 0.046 s
% 0.24/0.65 % Total time : 0.502 s
% 0.24/0.65 % Maximum resident set size: 4608 pages
% 0.24/0.65 % E exiting
%------------------------------------------------------------------------------