%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET195-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 : n019.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:52 PM UTC 2026
% Result : Unsatisfiable 4.39s 1.12s
% Output : CNFRefutation 4.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 55 ( 16 unt; 11 nHn; 34 RR)
% Number of literals : 107 ( 8 equ; 49 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 109 ( 10 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(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(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
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(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
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(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(prove_lattice_upper_bound2_1,negated_conjecture,
~ subclass(y,union(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lattice_upper_bound2_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_12 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_22,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_24,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_26,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_27,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_23 ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_24 ).
cnf(c_0_29,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_30,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_33,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_20,c_0_27]) ).
cnf(c_0_34,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_18]) ).
cnf(c_0_35,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_29 ).
cnf(c_0_36,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_30 ).
cnf(c_0_37,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_38,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_32,c_0_21]),c_0_22]) ).
cnf(c_0_39,negated_conjecture,
~ subclass(y,union(x,y)),
inference(fof_simplification,[status(thm)],[prove_lattice_upper_bound2_1]) ).
cnf(c_0_40,plain,
( ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3)
| subclass(intersection(X1,X2),intersection(X3,X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_42,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ subclass(y,union(x,y)),
c_0_39 ).
cnf(c_0_45,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_46,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_48,negated_conjecture,
~ subclass(y,complement(intersection(complement(x),complement(y)))),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_46])]) ).
cnf(c_0_50,plain,
( ~ member(not_subclass_element(X1,X2),complement(X1))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_47]) ).
cnf(c_0_51,plain,
( subclass(X1,complement(intersection(X2,X3)))
| member(not_subclass_element(X1,complement(intersection(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_52,negated_conjecture,
~ subclass(y,complement(intersection(complement(y),complement(x)))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
subclass(X1,complement(intersection(complement(X1),X2))),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET195-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.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 05:00:04 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 4.39/1.12 % Version: 3.5.1
% 4.39/1.12 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.39/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/1.12 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.39/1.12 % Starting new_bool_3 with 300s (1) cores
% 4.39/1.12 % Starting new_bool_1 with 300s (1) cores
% 4.39/1.12 % Starting sh5l with 300s (1) cores
% 4.39/1.12 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1737996 completed with status 0
% 4.39/1.12 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.39/1.12 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.39/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/1.12 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.39/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.39/1.12 % No SInE strategy applied
% 4.39/1.12 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.39/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.39/1.12 % Starting SubtermCWHack with 136s (1) cores
% 4.39/1.12 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.39/1.12 % Starting new_bool_3 with 311s (1) cores
% 4.39/1.12 % Starting new_bool_1 with 308s (1) cores
% 4.39/1.12 % Starting sh5l with 304s (1) cores
% 4.39/1.12 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1738004 completed with status 0
% 4.39/1.12 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.39/1.12 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.39/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.39/1.12 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.39/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.39/1.12 % No SInE strategy applied
% 4.39/1.12 % Search class: FGHSM-FFLM31-DFFFFFNN
% 4.39/1.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.39/1.12 % Starting SubtermCWHack with 136s (1) cores
% 4.39/1.12 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.39/1.12 % Preprocessing time : 0.003 s
% 4.39/1.12 % Presaturation interreduction done
% 4.39/1.12
% 4.39/1.12 % Proof found!
% 4.39/1.12 % SZS status Unsatisfiable
% 4.39/1.12 % SZS output start CNFRefutation
% See solution above
% 4.39/1.12 % Parsed axioms : 113
% 4.39/1.12 % Removed by relevancy pruning/SinE : 0
% 4.39/1.12 % Initial clauses : 113
% 4.39/1.12 % Removed in clause preprocessing : 17
% 4.39/1.12 % Initial clauses in saturation : 96
% 4.39/1.12 % Processed clauses : 5254
% 4.39/1.12 % ...of these trivial : 118
% 4.39/1.12 % ...subsumed : 3630
% 4.39/1.12 % ...remaining for further processing : 1506
% 4.39/1.12 % Other redundant clauses eliminated : 18
% 4.39/1.12 % Clauses deleted for lack of memory : 0
% 4.39/1.12 % Backward-subsumed : 88
% 4.39/1.12 % Backward-rewritten : 387
% 4.39/1.12 % Generated clauses : 24238
% 4.39/1.12 % ...of the previous two non-redundant : 19734
% 4.39/1.12 % ...aggressively subsumed : 0
% 4.39/1.12 % Contextual simplify-reflections : 20
% 4.39/1.12 % Paramodulations : 24206
% 4.39/1.12 % Factorizations : 14
% 4.39/1.12 % NegExts : 0
% 4.39/1.12 % Equation resolutions : 18
% 4.39/1.12 % Disequality decompositions : 0
% 4.39/1.12 % Total rewrite steps : 10507
% 4.39/1.12 % ...of those cached : 9454
% 4.39/1.12 % Propositional unsat checks : 0
% 4.39/1.12 % Propositional check models : 0
% 4.39/1.12 % Propositional check unsatisfiable : 0
% 4.39/1.12 % Propositional clauses : 0
% 4.39/1.12 % Propositional clauses after purity: 0
% 4.39/1.12 % Propositional unsat core size : 0
% 4.39/1.12 % Propositional preprocessing time : 0.000
% 4.39/1.12 % Propositional encoding time : 0.000
% 4.39/1.12 % Propositional solver time : 0.000
% 4.39/1.12 % Success case prop preproc time : 0.000
% 4.39/1.12 % Success case prop encoding time : 0.000
% 4.39/1.12 % Success case prop solver time : 0.000
% 4.39/1.12 % Current number of processed clauses : 932
% 4.39/1.12 % Positive orientable unit clauses : 162
% 4.39/1.12 % Positive unorientable unit clauses: 1
% 4.39/1.12 % Negative unit clauses : 11
% 4.39/1.12 % Non-unit-clauses : 758
% 4.39/1.12 % Current number of unprocessed clauses: 14265
% 4.39/1.12 % ...number of literals in the above : 44129
% 4.39/1.12 % Current number of archived formulas : 0
% 4.39/1.12 % Current number of archived clauses : 587
% 4.39/1.12 % Clause-clause subsumption calls (NU) : 122800
% 4.39/1.12 % Rec. Clause-clause subsumption calls : 79770
% 4.39/1.12 % Non-unit clause-clause subsumptions : 3001
% 4.39/1.12 % Unit Clause-clause subsumption calls : 7571
% 4.39/1.12 % Rewrite failures with RHS unbound : 0
% 4.39/1.12 % BW rewrite match attempts : 706
% 4.39/1.12 % BW rewrite match successes : 470
% 4.39/1.12 % Condensation attempts : 0
% 4.39/1.12 % Condensation successes : 0
% 4.39/1.12 % Termbank termtop insertions : 753214
% 4.39/1.12 % Search garbage collected termcells : 185
% 4.39/1.12
% 4.39/1.12 % -------------------------------------------------
% 4.39/1.12 % User time : 0.628 s
% 4.39/1.12 % System time : 0.019 s
% 4.39/1.12 % Total time : 0.647 s
% 4.39/1.12 % Maximum resident set size: 3692 pages
% 4.39/1.12
% 4.39/1.12 % -------------------------------------------------
% 4.39/1.12 % User time : 3.110 s
% 4.39/1.12 % System time : 0.133 s
% 4.39/1.12 % Total time : 3.243 s
% 4.39/1.12 % Maximum resident set size: 4608 pages
% 4.39/1.12 % E exiting
%------------------------------------------------------------------------------