%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET190-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 : 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:13:51 PM UTC 2026
% Result : Unsatisfiable 1.48s 0.69s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 63 ( 21 unt; 14 nHn; 40 RR)
% Number of literals : 114 ( 23 equ; 46 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 13 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(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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
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(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(prove_subclass_property7_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property7_1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_subclass_property7_2,negated_conjecture,
union(complement(x),y) != universal_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property7_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_23,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
subclass(x,y),
prove_subclass_property7_1 ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_20 ).
cnf(c_0_27,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_29,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_25 ).
cnf(c_0_30,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_31,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_32,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_34,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(not_subclass_element(X1,y),x)
| subclass(X1,y) ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_36,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_37,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_38,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
union(complement(x),y) != universal_class,
inference(fof_simplification,[status(thm)],[prove_subclass_property7_2]) ).
cnf(c_0_40,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_31 ).
cnf(c_0_41,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_42,plain,
( subclass(complement(complement(X1)),X2)
| member(not_subclass_element(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_23]) ).
cnf(c_0_43,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_34 ).
cnf(c_0_44,negated_conjecture,
subclass(intersection(x,X1),y),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
union(complement(x),y) != universal_class,
c_0_39 ).
cnf(c_0_47,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_48,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_21,c_0_42]) ).
cnf(c_0_50,plain,
( member(regular(intersection(X1,X2)),X2)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_43,c_0_30]) ).
cnf(c_0_51,negated_conjecture,
( ~ member(X1,intersection(x,X2))
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_44]) ).
cnf(c_0_52,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_18]) ).
cnf(c_0_53,negated_conjecture,
complement(intersection(complement(complement(x)),complement(y))) != universal_class,
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_55,plain,
( ~ member(regular(intersection(X1,complement(X2))),X2)
| intersection(X1,complement(X2)) = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
( member(regular(intersection(x,X1)),y)
| intersection(x,X1) = null_class ),
inference(spm,[status(thm)],[c_0_51,c_0_30]) ).
cnf(c_0_57,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_58,plain,
subclass(X1,complement(null_class)),
inference(spm,[status(thm)],[c_0_52,c_0_27]) ).
cnf(c_0_59,negated_conjecture,
complement(intersection(x,complement(y))) != universal_class,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
intersection(x,complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,plain,
complement(null_class) = universal_class,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET190-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n015.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:03:05 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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
% 1.48/0.69 % Version: 3.5.1
% 1.48/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.48/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.48/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.48/0.69 % Starting sh5l with 300s (1) cores
% 1.48/0.69 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 617821 completed with status 0
% 1.48/0.69 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.48/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.48/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/0.69 % No SInE strategy applied
% 1.48/0.69 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.48/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.48/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.48/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.48/0.69 % Starting new_bool_3 with 311s (1) cores
% 1.48/0.69 % Starting new_bool_1 with 308s (1) cores
% 1.48/0.69 % Starting sh5l with 304s (1) cores
% 1.48/0.69 % SubtermCWHack with pid 617828 completed with status 0
% 1.48/0.69 % Result found by SubtermCWHack
% 1.48/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.48/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.48/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.48/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.48/0.69 % No SInE strategy applied
% 1.48/0.69 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.48/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.48/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.48/0.69 % Preprocessing time : 0.004 s
% 1.48/0.69
% 1.48/0.69 % Proof found!
% 1.48/0.69 % SZS status Unsatisfiable
% 1.48/0.69 % SZS output start CNFRefutation
% See solution above
% 1.48/0.69 % Parsed axioms : 114
% 1.48/0.69 % Removed by relevancy pruning/SinE : 0
% 1.48/0.69 % Initial clauses : 114
% 1.48/0.69 % Removed in clause preprocessing : 17
% 1.48/0.69 % Initial clauses in saturation : 97
% 1.48/0.69 % Processed clauses : 1266
% 1.48/0.69 % ...of these trivial : 9
% 1.48/0.69 % ...subsumed : 660
% 1.48/0.69 % ...remaining for further processing : 597
% 1.48/0.69 % Other redundant clauses eliminated : 8
% 1.48/0.69 % Clauses deleted for lack of memory : 0
% 1.48/0.69 % Backward-subsumed : 13
% 1.48/0.69 % Backward-rewritten : 56
% 1.48/0.69 % Generated clauses : 4388
% 1.48/0.69 % ...of the previous two non-redundant : 3396
% 1.48/0.69 % ...aggressively subsumed : 0
% 1.48/0.69 % Contextual simplify-reflections : 8
% 1.48/0.69 % Paramodulations : 4376
% 1.48/0.69 % Factorizations : 4
% 1.48/0.69 % NegExts : 0
% 1.48/0.69 % Equation resolutions : 8
% 1.48/0.69 % Disequality decompositions : 0
% 1.48/0.69 % Total rewrite steps : 1578
% 1.48/0.69 % ...of those cached : 1349
% 1.48/0.69 % Propositional unsat checks : 0
% 1.48/0.69 % Propositional check models : 0
% 1.48/0.69 % Propositional check unsatisfiable : 0
% 1.48/0.69 % Propositional clauses : 0
% 1.48/0.69 % Propositional clauses after purity: 0
% 1.48/0.69 % Propositional unsat core size : 0
% 1.48/0.69 % Propositional preprocessing time : 0.000
% 1.48/0.69 % Propositional encoding time : 0.000
% 1.48/0.69 % Propositional solver time : 0.000
% 1.48/0.69 % Success case prop preproc time : 0.000
% 1.48/0.69 % Success case prop encoding time : 0.000
% 1.48/0.69 % Success case prop solver time : 0.000
% 1.48/0.69 % Current number of processed clauses : 524
% 1.48/0.69 % Positive orientable unit clauses : 91
% 1.48/0.69 % Positive unorientable unit clauses: 1
% 1.48/0.69 % Negative unit clauses : 2
% 1.48/0.69 % Non-unit-clauses : 430
% 1.48/0.69 % Current number of unprocessed clauses: 2152
% 1.48/0.69 % ...number of literals in the above : 6319
% 1.48/0.69 % Current number of archived formulas : 0
% 1.48/0.69 % Current number of archived clauses : 86
% 1.48/0.69 % Clause-clause subsumption calls (NU) : 22130
% 1.48/0.69 % Rec. Clause-clause subsumption calls : 14123
% 1.48/0.69 % Non-unit clause-clause subsumptions : 506
% 1.48/0.69 % Unit Clause-clause subsumption calls : 1837
% 1.48/0.69 % Rewrite failures with RHS unbound : 0
% 1.48/0.69 % BW rewrite match attempts : 74
% 1.48/0.69 % BW rewrite match successes : 36
% 1.48/0.69 % Condensation attempts : 0
% 1.48/0.69 % Condensation successes : 0
% 1.48/0.69 % Termbank termtop insertions : 93127
% 1.48/0.69 % Search garbage collected termcells : 185
% 1.48/0.69
% 1.48/0.69 % -------------------------------------------------
% 1.48/0.69 % User time : 0.182 s
% 1.48/0.69 % System time : 0.014 s
% 1.48/0.69 % Total time : 0.196 s
% 1.48/0.69 % Maximum resident set size: 4000 pages
% 1.48/0.69
% 1.48/0.69 % -------------------------------------------------
% 1.48/0.69 % User time : 0.736 s
% 1.48/0.69 % System time : 0.061 s
% 1.48/0.69 % Total time : 0.797 s
% 1.48/0.69 % Maximum resident set size: 4864 pages
% 1.48/0.69 % E exiting
%------------------------------------------------------------------------------