%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET018-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 : n008.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:07 PM UTC 2026
% Result : Unsatisfiable 0.52s 0.48s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 17
% Syntax : Number of clauses : 97 ( 40 unt; 32 nHn; 65 RR)
% Number of literals : 175 ( 98 equ; 45 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 110 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pairs_in_universal,axiom,
member(unordered_pair(X1,X2),universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).
cnf(prove_ordered_pair_determines_components2_1,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_1) ).
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(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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
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(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(prove_ordered_pair_determines_components2_2,negated_conjecture,
member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_2) ).
cnf(prove_ordered_pair_determines_components2_3,negated_conjecture,
x != z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_determines_components2_3) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_18,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_19,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_20,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_17 ).
cnf(c_0_21,axiom,
member(unordered_pair(X1,X2),universal_class),
unordered_pairs_in_universal ).
cnf(c_0_22,negated_conjecture,
ordered_pair(w,x) = ordered_pair(y,z),
prove_ordered_pair_determines_components2_1 ).
cnf(c_0_23,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_18,c_0_19]),c_0_19]) ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_25,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_26,plain,
member(unordered_pair(X1,X2),unordered_pair(unordered_pair(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))) = unordered_pair(unordered_pair(w,w),unordered_pair(w,unordered_pair(x,x))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_28,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_24 ).
cnf(c_0_29,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_25 ).
cnf(c_0_30,negated_conjecture,
member(unordered_pair(w,w),unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
member(unordered_pair(X1,X2),unordered_pair(X3,unordered_pair(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( member(unordered_pair(z,z),unordered_pair(w,w))
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(X1,unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z))))
| X1 = unordered_pair(w,w)
| X1 = unordered_pair(w,unordered_pair(x,x)) ),
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_37,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_34 ).
cnf(c_0_38,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_39,negated_conjecture,
member(unordered_pair(w,unordered_pair(x,x)),unordered_pair(unordered_pair(y,y),unordered_pair(y,unordered_pair(z,z)))),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,unordered_pair(z,z)) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
( unordered_pair(w,w) = unordered_pair(y,y)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,unordered_pair(y,y))
| X1 = w
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_43,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_44,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_45,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,unordered_pair(z,z)) ),
inference(spm,[status(thm)],[c_0_29,c_0_39]) ).
cnf(c_0_47,negated_conjecture,
( member(unordered_pair(x,x),unordered_pair(y,unordered_pair(z,z)))
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( member(unordered_pair(x,x),unordered_pair(y,y))
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_31,c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( unordered_pair(z,z) = w
| unordered_pair(y,y) = null_class
| regular(unordered_pair(y,y)) = w ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_44 ).
cnf(c_0_51,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_45,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( unordered_pair(y,unordered_pair(z,z)) != unordered_pair(y,y)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
inference(ef,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( unordered_pair(x,x) = y
| unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(y,unordered_pair(z,z)) = unordered_pair(w,w) ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( unordered_pair(x,x) = y
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_29,c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( member(w,unordered_pair(y,y))
| unordered_pair(y,y) = null_class
| unordered_pair(z,z) = w ),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_56,plain,
( ~ member(regular(X1),complement(universal_class))
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_58,negated_conjecture,
( unordered_pair(x,x) = y
| unordered_pair(z,z) = unordered_pair(x,x)
| unordered_pair(w,unordered_pair(x,x)) = unordered_pair(y,y) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_59,negated_conjecture,
( w = y
| unordered_pair(z,z) = w
| unordered_pair(y,y) = null_class ),
inference(spm,[status(thm)],[c_0_29,c_0_55]) ).
cnf(c_0_60,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_61,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_56,c_0_43]) ).
cnf(c_0_62,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_57 ).
cnf(c_0_63,negated_conjecture,
( member(unordered_pair(x,x),unordered_pair(y,y))
| unordered_pair(x,x) = y
| unordered_pair(z,z) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_31,c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( member(w,unordered_pair(w,X1))
| w = y
| unordered_pair(y,y) = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_59]) ).
cnf(c_0_65,plain,
( ~ member(X2,domain_of(X1))
| restrict(X1,singleton(X2),universal_class) != null_class ),
c_0_60 ).
cnf(c_0_66,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_67,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_68,plain,
( ~ member(regular(X1),null_class)
| X1 = null_class ),
inference(rw,[status(thm)],[c_0_56,c_0_61]) ).
cnf(c_0_69,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_62,c_0_43]) ).
cnf(c_0_70,negated_conjecture,
( unordered_pair(x,x) = y
| unordered_pair(z,z) = unordered_pair(x,x) ),
inference(spm,[status(thm)],[c_0_29,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
member(x,universal_class),
prove_ordered_pair_determines_components2_2 ).
cnf(c_0_72,negated_conjecture,
x != z,
inference(fof_simplification,[status(thm)],[prove_ordered_pair_determines_components2_3]) ).
cnf(c_0_73,negated_conjecture,
( member(w,unordered_pair(y,y))
| w = y
| unordered_pair(y,y) = null_class
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_64,c_0_41]) ).
cnf(c_0_74,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_65,c_0_19]),c_0_66]) ).
cnf(c_0_75,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_67,c_0_66]) ).
cnf(c_0_76,plain,
intersection(X1,null_class) = null_class,
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,negated_conjecture,
( ~ member(X1,unordered_pair(x,x))
| X1 = z
| unordered_pair(x,x) = y ),
inference(spm,[status(thm)],[c_0_29,c_0_70]) ).
cnf(c_0_78,negated_conjecture,
member(x,unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_28,c_0_71]) ).
cnf(c_0_79,negated_conjecture,
x != z,
c_0_72 ).
cnf(c_0_80,negated_conjecture,
( member(w,unordered_pair(X1,w))
| w = y
| unordered_pair(y,y) = null_class ),
inference(spm,[status(thm)],[c_0_31,c_0_59]) ).
cnf(c_0_81,negated_conjecture,
( w = y
| unordered_pair(y,y) = null_class
| unordered_pair(w,w) = unordered_pair(y,y) ),
inference(spm,[status(thm)],[c_0_29,c_0_73]) ).
cnf(c_0_82,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_74,c_0_43]) ).
cnf(c_0_83,plain,
intersection(null_class,cross_product(X1,X2)) = null_class,
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_84,negated_conjecture,
unordered_pair(x,x) = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_85,negated_conjecture,
( member(w,unordered_pair(y,y))
| w = y
| unordered_pair(y,y) = null_class ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_86,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_87,negated_conjecture,
member(y,unordered_pair(X1,y)),
inference(spm,[status(thm)],[c_0_31,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
( w = y
| unordered_pair(y,y) = null_class ),
inference(spm,[status(thm)],[c_0_29,c_0_85]) ).
cnf(c_0_89,plain,
~ member(X1,null_class),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_86]),c_0_83])]) ).
cnf(c_0_90,negated_conjecture,
w = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]) ).
cnf(c_0_91,negated_conjecture,
unordered_pair(y,unordered_pair(z,z)) = unordered_pair(y,y),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_84]),c_0_90]),c_0_90]),c_0_90])]) ).
cnf(c_0_92,negated_conjecture,
member(unordered_pair(z,z),unordered_pair(y,y)),
inference(spm,[status(thm)],[c_0_31,c_0_91]) ).
cnf(c_0_93,negated_conjecture,
unordered_pair(z,z) = y,
inference(spm,[status(thm)],[c_0_29,c_0_92]) ).
cnf(c_0_94,negated_conjecture,
( ~ member(X1,y)
| X1 = z ),
inference(spm,[status(thm)],[c_0_29,c_0_93]) ).
cnf(c_0_95,negated_conjecture,
member(x,y),
inference(spm,[status(thm)],[c_0_78,c_0_84]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_79]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET018-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.11/0.36 % Computer : n008.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 04:43:39 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.52/0.48 % Version: 3.5.1
% 0.52/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.52/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.52/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.52/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.52/0.48 % Starting sh5l with 300s (1) cores
% 0.52/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 164884 completed with status 0
% 0.52/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.52/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.52/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.52/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.52/0.48 % No SInE strategy applied
% 0.52/0.48 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.52/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.52/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.52/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.52/0.48 % Starting new_bool_3 with 311s (1) cores
% 0.52/0.48 % Starting new_bool_1 with 308s (1) cores
% 0.52/0.48 % Starting sh5l with 304s (1) cores
% 0.52/0.48 % new_bool_1 with pid 164893 completed with status 0
% 0.52/0.48 % Result found by new_bool_1
% 0.52/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.52/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.52/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.52/0.48 % No SInE strategy applied
% 0.52/0.48 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.52/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.52/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.52/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.52/0.48 % Starting new_bool_3 with 311s (1) cores
% 0.52/0.48 % Starting new_bool_1 with 308s (1) cores
% 0.52/0.48 % Preprocessing time : 0.002 s
% 0.52/0.48 % Presaturation interreduction done
% 0.52/0.48
% 0.52/0.48 % Proof found!
% 0.52/0.48 % SZS status Unsatisfiable
% 0.52/0.48 % SZS output start CNFRefutation
% See solution above
% 0.52/0.48 % Parsed axioms : 94
% 0.52/0.48 % Removed by relevancy pruning/SinE : 0
% 0.52/0.48 % Initial clauses : 94
% 0.52/0.48 % Removed in clause preprocessing : 15
% 0.52/0.48 % Initial clauses in saturation : 79
% 0.52/0.48 % Processed clauses : 701
% 0.52/0.48 % ...of these trivial : 10
% 0.52/0.48 % ...subsumed : 211
% 0.52/0.48 % ...remaining for further processing : 480
% 0.52/0.48 % Other redundant clauses eliminated : 7
% 0.52/0.48 % Clauses deleted for lack of memory : 0
% 0.52/0.48 % Backward-subsumed : 42
% 0.52/0.48 % Backward-rewritten : 84
% 0.52/0.48 % Generated clauses : 2794
% 0.52/0.48 % ...of the previous two non-redundant : 2429
% 0.52/0.48 % ...aggressively subsumed : 0
% 0.52/0.48 % Contextual simplify-reflections : 1
% 0.52/0.48 % Paramodulations : 2776
% 0.52/0.48 % Factorizations : 11
% 0.52/0.48 % NegExts : 0
% 0.52/0.48 % Equation resolutions : 7
% 0.52/0.48 % Disequality decompositions : 0
% 0.52/0.48 % Total rewrite steps : 633
% 0.52/0.48 % ...of those cached : 513
% 0.52/0.48 % Propositional unsat checks : 0
% 0.52/0.48 % Propositional check models : 0
% 0.52/0.48 % Propositional check unsatisfiable : 0
% 0.52/0.48 % Propositional clauses : 0
% 0.52/0.48 % Propositional clauses after purity: 0
% 0.52/0.48 % Propositional unsat core size : 0
% 0.52/0.48 % Propositional preprocessing time : 0.000
% 0.52/0.48 % Propositional encoding time : 0.000
% 0.52/0.48 % Propositional solver time : 0.000
% 0.52/0.48 % Success case prop preproc time : 0.000
% 0.52/0.48 % Success case prop encoding time : 0.000
% 0.52/0.48 % Success case prop solver time : 0.000
% 0.52/0.48 % Current number of processed clauses : 273
% 0.52/0.48 % Positive orientable unit clauses : 69
% 0.52/0.48 % Positive unorientable unit clauses: 1
% 0.52/0.48 % Negative unit clauses : 36
% 0.52/0.48 % Non-unit-clauses : 167
% 0.52/0.48 % Current number of unprocessed clauses: 1845
% 0.52/0.48 % ...number of literals in the above : 5540
% 0.52/0.48 % Current number of archived formulas : 0
% 0.52/0.48 % Current number of archived clauses : 219
% 0.52/0.48 % Clause-clause subsumption calls (NU) : 10871
% 0.52/0.48 % Rec. Clause-clause subsumption calls : 5285
% 0.52/0.48 % Non-unit clause-clause subsumptions : 174
% 0.52/0.48 % Unit Clause-clause subsumption calls : 1655
% 0.52/0.48 % Rewrite failures with RHS unbound : 0
% 0.52/0.48 % BW rewrite match attempts : 32
% 0.52/0.48 % BW rewrite match successes : 11
% 0.52/0.48 % Condensation attempts : 0
% 0.52/0.48 % Condensation successes : 0
% 0.52/0.48 % Termbank termtop insertions : 60693
% 0.52/0.48 % Search garbage collected termcells : 156
% 0.52/0.48
% 0.52/0.48 % -------------------------------------------------
% 0.52/0.48 % User time : 0.049 s
% 0.52/0.48 % System time : 0.007 s
% 0.52/0.48 % Total time : 0.056 s
% 0.52/0.48 % Maximum resident set size: 3720 pages
% 0.52/0.48
% 0.52/0.48 % -------------------------------------------------
% 0.52/0.48 % User time : 0.236 s
% 0.52/0.48 % System time : 0.023 s
% 0.52/0.48 % Total time : 0.260 s
% 0.52/0.48 % Maximum resident set size: 4864 pages
% 0.52/0.48 % E exiting
%------------------------------------------------------------------------------