%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET165-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 : n010.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:47 PM UTC 2026
% Result : Unsatisfiable 1.20s 0.64s
% Output : CNFRefutation 1.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 52 ( 15 unt; 10 nHn; 32 RR)
% Number of literals : 102 ( 12 equ; 47 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 103 ( 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_corollary_to_idempotency_of_union_1,negated_conjecture,
union(x,union(x,y)) != union(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_to_idempotency_of_union_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,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_25,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_26,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_23 ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_28,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
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(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_32,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_26]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
union(x,union(x,y)) != union(x,y),
inference(fof_simplification,[status(thm)],[prove_corollary_to_idempotency_of_union_1]) ).
cnf(c_0_36,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_29 ).
cnf(c_0_37,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_30,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_31,c_0_21]),c_0_22]) ).
cnf(c_0_39,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_40,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
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_34,c_0_18]) ).
cnf(c_0_42,negated_conjecture,
union(x,union(x,y)) != union(x,y),
c_0_35 ).
cnf(c_0_43,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_44,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_45,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_46,plain,
subclass(intersection(X1,X2),intersection(X1,intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_20,c_0_41]) ).
cnf(c_0_48,negated_conjecture,
complement(intersection(complement(x),complement(complement(intersection(complement(x),complement(y)))))) != complement(intersection(complement(x),complement(y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]),c_0_43]) ).
cnf(c_0_49,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_50,plain,
intersection(X1,intersection(X1,X2)) = intersection(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET165-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.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 04:57:59 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/0.42 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
% 1.20/0.64 % Version: 3.5.1
% 1.20/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.64 % Starting new_bool_3 with 300s (1) cores
% 1.20/0.64 % Starting new_bool_1 with 300s (1) cores
% 1.20/0.64 % Starting sh5l with 300s (1) cores
% 1.20/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 70857 completed with status 0
% 1.20/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.20/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.64 % No SInE strategy applied
% 1.20/0.64 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.20/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.64 % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.20/0.64 % Starting new_bool_3 with 311s (1) cores
% 1.20/0.64 % Starting new_bool_1 with 308s (1) cores
% 1.20/0.64 % Starting sh5l with 304s (1) cores
% 1.20/0.64 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 70865 completed with status 0
% 1.20/0.64 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.20/0.64 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.20/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.20/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.20/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.20/0.64 % No SInE strategy applied
% 1.20/0.64 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.20/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.20/0.64 % Starting SubtermCWHack with 136s (1) cores
% 1.20/0.64 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.20/0.64 % Preprocessing time : 0.002 s
% 1.20/0.64 % Presaturation interreduction done
% 1.20/0.64
% 1.20/0.64 % Proof found!
% 1.20/0.64 % SZS status Unsatisfiable
% 1.20/0.64 % SZS output start CNFRefutation
% See solution above
% 1.20/0.64 % Parsed axioms : 113
% 1.20/0.64 % Removed by relevancy pruning/SinE : 0
% 1.20/0.64 % Initial clauses : 113
% 1.20/0.64 % Removed in clause preprocessing : 17
% 1.20/0.64 % Initial clauses in saturation : 96
% 1.20/0.64 % Processed clauses : 2629
% 1.20/0.64 % ...of these trivial : 68
% 1.20/0.64 % ...subsumed : 1619
% 1.20/0.64 % ...remaining for further processing : 942
% 1.20/0.64 % Other redundant clauses eliminated : 14
% 1.20/0.64 % Clauses deleted for lack of memory : 0
% 1.20/0.64 % Backward-subsumed : 23
% 1.20/0.64 % Backward-rewritten : 362
% 1.20/0.64 % Generated clauses : 8713
% 1.20/0.64 % ...of the previous two non-redundant : 8006
% 1.20/0.64 % ...aggressively subsumed : 0
% 1.20/0.64 % Contextual simplify-reflections : 14
% 1.20/0.64 % Paramodulations : 8689
% 1.20/0.64 % Factorizations : 10
% 1.20/0.64 % NegExts : 0
% 1.20/0.64 % Equation resolutions : 14
% 1.20/0.64 % Disequality decompositions : 0
% 1.20/0.64 % Total rewrite steps : 3724
% 1.20/0.64 % ...of those cached : 3272
% 1.20/0.64 % Propositional unsat checks : 0
% 1.20/0.64 % Propositional check models : 0
% 1.20/0.64 % Propositional check unsatisfiable : 0
% 1.20/0.64 % Propositional clauses : 0
% 1.20/0.64 % Propositional clauses after purity: 0
% 1.20/0.64 % Propositional unsat core size : 0
% 1.20/0.64 % Propositional preprocessing time : 0.000
% 1.20/0.64 % Propositional encoding time : 0.000
% 1.20/0.64 % Propositional solver time : 0.000
% 1.20/0.64 % Success case prop preproc time : 0.000
% 1.20/0.64 % Success case prop encoding time : 0.000
% 1.20/0.64 % Success case prop solver time : 0.000
% 1.20/0.64 % Current number of processed clauses : 458
% 1.20/0.64 % Positive orientable unit clauses : 72
% 1.20/0.64 % Positive unorientable unit clauses: 1
% 1.20/0.64 % Negative unit clauses : 10
% 1.20/0.64 % Non-unit-clauses : 375
% 1.20/0.64 % Current number of unprocessed clauses: 5184
% 1.20/0.64 % ...number of literals in the above : 17461
% 1.20/0.64 % Current number of archived formulas : 0
% 1.20/0.64 % Current number of archived clauses : 497
% 1.20/0.64 % Clause-clause subsumption calls (NU) : 57980
% 1.20/0.64 % Rec. Clause-clause subsumption calls : 37340
% 1.20/0.64 % Non-unit clause-clause subsumptions : 1228
% 1.20/0.64 % Unit Clause-clause subsumption calls : 3144
% 1.20/0.64 % Rewrite failures with RHS unbound : 0
% 1.20/0.64 % BW rewrite match attempts : 238
% 1.20/0.64 % BW rewrite match successes : 126
% 1.20/0.64 % Condensation attempts : 0
% 1.20/0.64 % Condensation successes : 0
% 1.20/0.64 % Termbank termtop insertions : 412021
% 1.20/0.64 % Search garbage collected termcells : 185
% 1.20/0.64
% 1.20/0.64 % -------------------------------------------------
% 1.20/0.64 % User time : 0.188 s
% 1.20/0.64 % System time : 0.011 s
% 1.20/0.64 % Total time : 0.199 s
% 1.20/0.64 % Maximum resident set size: 4000 pages
% 1.20/0.64
% 1.20/0.64 % -------------------------------------------------
% 1.20/0.64 % User time : 0.849 s
% 1.20/0.64 % System time : 0.048 s
% 1.20/0.64 % Total time : 0.898 s
% 1.20/0.64 % Maximum resident set size: 4608 pages
% 1.20/0.64 % E exiting
%------------------------------------------------------------------------------