%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM094-1 : 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 : n011.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 01:44:21 PM UTC 2026
% Result : Unsatisfiable 4.77s 16.53s
% Output : CNFRefutation 4.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 19 unt; 14 nHn; 47 RR)
% Number of literals : 119 ( 17 equ; 58 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 11 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(well_ordering2,axiom,
( ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3)
| X3 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',well_ordering2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(prove_sections_property3_1,negated_conjecture,
well_ordering(xr,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sections_property3_1) ).
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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_sections_property3_3,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sections_property3_3) ).
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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(section1,axiom,
( ~ section(X1,X2,X3)
| subclass(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM004-0.ax',section1) ).
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(prove_sections_property3_2,negated_conjecture,
section(xr,w,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sections_property3_2) ).
cnf(prove_sections_property3_4,negated_conjecture,
y != w,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_sections_property3_4) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_17,plain,
( ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3)
| X3 = null_class ),
inference(fof_simplification,[status(thm)],[well_ordering2]) ).
cnf(c_0_18,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_16 ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,plain,
( ~ subclass(X3,X2)
| ~ well_ordering(X1,X2)
| member(least(X1,X3),X3)
| X3 = null_class ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
well_ordering(xr,y),
prove_sections_property3_1 ).
cnf(c_0_24,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_18 ).
cnf(c_0_26,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_27,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_28,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_29,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),y),
inference(fof_simplification,[status(thm)],[prove_sections_property3_3]) ).
cnf(c_0_31,negated_conjecture,
( ~ subclass(X1,y)
| member(least(xr,X1),X1)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_24 ).
cnf(c_0_33,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_36,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_37,negated_conjecture,
~ member(least(xr,intersection(complement(w),y)),y),
c_0_30 ).
cnf(c_0_38,negated_conjecture,
( ~ subclass(intersection(X1,X2),y)
| member(least(xr,intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_39,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_36 ).
cnf(c_0_42,negated_conjecture,
intersection(complement(w),y) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_43,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_40]),c_0_29]) ).
cnf(c_0_44,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_45,plain,
( ~ section(X1,X2,X3)
| subclass(X2,X3) ),
inference(fof_simplification,[status(thm)],[section1]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(X1,y)
| ~ member(X1,complement(w)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_44 ).
cnf(c_0_48,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_49,plain,
( ~ section(X1,X2,X3)
| subclass(X2,X3) ),
c_0_45 ).
cnf(c_0_50,negated_conjecture,
section(xr,w,y),
prove_sections_property3_2 ).
cnf(c_0_51,negated_conjecture,
y != w,
inference(fof_simplification,[status(thm)],[prove_sections_property3_4]) ).
cnf(c_0_52,negated_conjecture,
( ~ member(X1,y)
| member(X1,w) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_29]) ).
cnf(c_0_53,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_48 ).
cnf(c_0_54,negated_conjecture,
subclass(w,y),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
y != w,
c_0_51 ).
cnf(c_0_56,negated_conjecture,
( ~ member(not_subclass_element(X1,w),y)
| subclass(X1,w) ),
inference(spm,[status(thm)],[c_0_32,c_0_52]) ).
cnf(c_0_57,negated_conjecture,
~ subclass(y,w),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM094-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.14/15.70 % CPULimit : 300
% 0.14/15.70 % WCLimit : 300
% 0.14/15.70 % DateTime : Mon Sep 21 02:04:13 UTC 2026
% 0.14/15.71 % CPUTime :
% 0.14/15.71 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/15.76 Running first-order theorem proving
% 0.14/15.76 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
% 4.77/16.53 % Version: 3.5.1
% 4.77/16.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.77/16.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.77/16.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.77/16.53 % Starting new_bool_3 with 300s (1) cores
% 4.77/16.53 % Starting new_bool_1 with 300s (1) cores
% 4.77/16.53 % Starting sh5l with 300s (1) cores
% 4.77/16.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1779617 completed with status 0
% 4.77/16.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.77/16.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.77/16.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.77/16.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.77/16.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.77/16.53 % No SInE strategy applied
% 4.77/16.53 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.77/16.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.77/16.53 % Starting SubtermCWHack with 136s (1) cores
% 4.77/16.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.77/16.53 % Starting new_bool_3 with 311s (1) cores
% 4.77/16.53 % Starting new_bool_1 with 308s (1) cores
% 4.77/16.53 % Starting sh5l with 304s (1) cores
% 4.77/16.53 % SubtermCWHack with pid 1779624 completed with status 0
% 4.77/16.53 % Result found by SubtermCWHack
% 4.77/16.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.77/16.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.77/16.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.77/16.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.77/16.53 % No SInE strategy applied
% 4.77/16.53 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.77/16.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.77/16.53 % Starting SubtermCWHack with 136s (1) cores
% 4.77/16.53 % Preprocessing time : 0.005 s
% 4.77/16.53
% 4.77/16.53 % Proof found!
% 4.77/16.53 % SZS status Unsatisfiable
% 4.77/16.53 % SZS output start CNFRefutation
% See solution above
% 4.77/16.53 % Parsed axioms : 162
% 4.77/16.53 % Removed by relevancy pruning/SinE : 0
% 4.77/16.53 % Initial clauses : 162
% 4.77/16.53 % Removed in clause preprocessing : 19
% 4.77/16.53 % Initial clauses in saturation : 143
% 4.77/16.53 % Processed clauses : 4287
% 4.77/16.53 % ...of these trivial : 3
% 4.77/16.53 % ...subsumed : 3020
% 4.77/16.53 % ...remaining for further processing : 1264
% 4.77/16.53 % Other redundant clauses eliminated : 14
% 4.77/16.53 % Clauses deleted for lack of memory : 0
% 4.77/16.53 % Backward-subsumed : 102
% 4.77/16.53 % Backward-rewritten : 30
% 4.77/16.53 % Generated clauses : 21891
% 4.77/16.53 % ...of the previous two non-redundant : 18923
% 4.77/16.53 % ...aggressively subsumed : 0
% 4.77/16.53 % Contextual simplify-reflections : 18
% 4.77/16.53 % Paramodulations : 21869
% 4.77/16.53 % Factorizations : 8
% 4.77/16.53 % NegExts : 0
% 4.77/16.53 % Equation resolutions : 14
% 4.77/16.53 % Disequality decompositions : 0
% 4.77/16.53 % Total rewrite steps : 6135
% 4.77/16.53 % ...of those cached : 5644
% 4.77/16.53 % Propositional unsat checks : 0
% 4.77/16.53 % Propositional check models : 0
% 4.77/16.53 % Propositional check unsatisfiable : 0
% 4.77/16.53 % Propositional clauses : 0
% 4.77/16.53 % Propositional clauses after purity: 0
% 4.77/16.53 % Propositional unsat core size : 0
% 4.77/16.53 % Propositional preprocessing time : 0.000
% 4.77/16.53 % Propositional encoding time : 0.000
% 4.77/16.53 % Propositional solver time : 0.000
% 4.77/16.53 % Success case prop preproc time : 0.000
% 4.77/16.53 % Success case prop encoding time : 0.000
% 4.77/16.53 % Success case prop solver time : 0.000
% 4.77/16.53 % Current number of processed clauses : 1126
% 4.77/16.53 % Positive orientable unit clauses : 146
% 4.77/16.53 % Positive unorientable unit clauses: 3
% 4.77/16.53 % Negative unit clauses : 11
% 4.77/16.53 % Non-unit-clauses : 966
% 4.77/16.53 % Current number of unprocessed clauses: 14648
% 4.77/16.53 % ...number of literals in the above : 48491
% 4.77/16.53 % Current number of archived formulas : 0
% 4.77/16.53 % Current number of archived clauses : 151
% 4.77/16.53 % Clause-clause subsumption calls (NU) : 65309
% 4.77/16.53 % Rec. Clause-clause subsumption calls : 46099
% 4.77/16.53 % Non-unit clause-clause subsumptions : 2011
% 4.77/16.53 % Unit Clause-clause subsumption calls : 3703
% 4.77/16.53 % Rewrite failures with RHS unbound : 14
% 4.77/16.53 % BW rewrite match attempts : 81
% 4.77/16.53 % BW rewrite match successes : 13
% 4.77/16.53 % Condensation attempts : 0
% 4.77/16.53 % Condensation successes : 0
% 4.77/16.53 % Termbank termtop insertions : 378451
% 4.77/16.53 % Search garbage collected termcells : 289
% 4.77/16.53
% 4.77/16.53 % -------------------------------------------------
% 4.77/16.53 % User time : 0.688 s
% 4.77/16.53 % System time : 0.030 s
% 4.77/16.53 % Total time : 0.718 s
% 4.77/16.53 % Maximum resident set size: 4036 pages
% 4.77/16.53
% 4.77/16.53 % -------------------------------------------------
% 4.77/16.53 % User time : 3.023 s
% 4.77/16.53 % System time : 0.124 s
% 4.77/16.53 % Total time : 3.147 s
% 4.77/16.53 % Maximum resident set size: 4864 pages
% 4.77/16.53 % E exiting
%------------------------------------------------------------------------------