%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET194-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 : 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:52 PM UTC 2026
% Result : Unsatisfiable 5.19s 1.23s
% Output : CNFRefutation 5.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 42 ( 13 unt; 9 nHn; 25 RR)
% Number of literals : 80 ( 7 equ; 36 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 : 75 ( 7 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(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(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_lattice_upper_bound1_1,negated_conjecture,
~ subclass(x,union(x,y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lattice_upper_bound1_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_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_12,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_13,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_13 ).
cnf(c_0_19,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_20,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_22,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_24,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_26,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_23 ).
cnf(c_0_27,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_28,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_25,c_0_19]),c_0_20]) ).
cnf(c_0_29,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_31,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_32,negated_conjecture,
~ subclass(x,union(x,y)),
inference(fof_simplification,[status(thm)],[prove_lattice_upper_bound1_1]) ).
cnf(c_0_33,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_34,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
~ subclass(x,union(x,y)),
c_0_32 ).
cnf(c_0_36,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_37,plain,
( ~ member(not_subclass_element(X1,X2),complement(X1))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_33]) ).
cnf(c_0_38,plain,
( subclass(X1,complement(intersection(X2,X3)))
| member(not_subclass_element(X1,complement(intersection(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_39,negated_conjecture,
~ subclass(x,complement(intersection(complement(x),complement(y)))),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
subclass(X1,complement(intersection(complement(X1),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET194-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.12/0.38 % Computer : n008.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 05:00:38 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.43 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
% 5.19/1.23 % Version: 3.5.1
% 5.19/1.23 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.19/1.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.19/1.23 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.19/1.23 % Starting new_bool_3 with 300s (1) cores
% 5.19/1.23 % Starting new_bool_1 with 300s (1) cores
% 5.19/1.23 % Starting sh5l with 300s (1) cores
% 5.19/1.23 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 197520 completed with status 0
% 5.19/1.23 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.19/1.23 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.19/1.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.19/1.23 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.19/1.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.19/1.23 % No SInE strategy applied
% 5.19/1.23 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.19/1.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.19/1.23 % Starting SubtermCWHack with 136s (1) cores
% 5.19/1.23 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.19/1.23 % Starting new_bool_3 with 311s (1) cores
% 5.19/1.23 % Starting new_bool_1 with 308s (1) cores
% 5.19/1.23 % Starting sh5l with 304s (1) cores
% 5.19/1.23 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 197528 completed with status 0
% 5.19/1.23 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 5.19/1.23 % Preprocessing class: FSLSSMSMSSSNFFN.
% 5.19/1.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.19/1.23 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 5.19/1.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.19/1.23 % No SInE strategy applied
% 5.19/1.23 % Search class: FGHSM-FFLM31-DFFFFFNN
% 5.19/1.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.19/1.23 % Starting SubtermCWHack with 136s (1) cores
% 5.19/1.23 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 5.19/1.23 % Preprocessing time : 0.003 s
% 5.19/1.23 % Presaturation interreduction done
% 5.19/1.23
% 5.19/1.23 % Proof found!
% 5.19/1.23 % SZS status Unsatisfiable
% 5.19/1.23 % SZS output start CNFRefutation
% See solution above
% 5.19/1.23 % Parsed axioms : 113
% 5.19/1.23 % Removed by relevancy pruning/SinE : 0
% 5.19/1.23 % Initial clauses : 113
% 5.19/1.23 % Removed in clause preprocessing : 17
% 5.19/1.23 % Initial clauses in saturation : 96
% 5.19/1.23 % Processed clauses : 5265
% 5.19/1.23 % ...of these trivial : 106
% 5.19/1.23 % ...subsumed : 3655
% 5.19/1.23 % ...remaining for further processing : 1504
% 5.19/1.23 % Other redundant clauses eliminated : 18
% 5.19/1.23 % Clauses deleted for lack of memory : 0
% 5.19/1.23 % Backward-subsumed : 84
% 5.19/1.23 % Backward-rewritten : 390
% 5.19/1.23 % Generated clauses : 24235
% 5.19/1.23 % ...of the previous two non-redundant : 19623
% 5.19/1.23 % ...aggressively subsumed : 0
% 5.19/1.23 % Contextual simplify-reflections : 19
% 5.19/1.23 % Paramodulations : 24203
% 5.19/1.23 % Factorizations : 14
% 5.19/1.23 % NegExts : 0
% 5.19/1.23 % Equation resolutions : 18
% 5.19/1.23 % Disequality decompositions : 0
% 5.19/1.23 % Total rewrite steps : 10765
% 5.19/1.23 % ...of those cached : 9713
% 5.19/1.23 % Propositional unsat checks : 0
% 5.19/1.23 % Propositional check models : 0
% 5.19/1.23 % Propositional check unsatisfiable : 0
% 5.19/1.23 % Propositional clauses : 0
% 5.19/1.23 % Propositional clauses after purity: 0
% 5.19/1.23 % Propositional unsat core size : 0
% 5.19/1.23 % Propositional preprocessing time : 0.000
% 5.19/1.23 % Propositional encoding time : 0.000
% 5.19/1.23 % Propositional solver time : 0.000
% 5.19/1.23 % Success case prop preproc time : 0.000
% 5.19/1.23 % Success case prop encoding time : 0.000
% 5.19/1.23 % Success case prop solver time : 0.000
% 5.19/1.23 % Current number of processed clauses : 931
% 5.19/1.23 % Positive orientable unit clauses : 161
% 5.19/1.23 % Positive unorientable unit clauses: 1
% 5.19/1.23 % Negative unit clauses : 10
% 5.19/1.23 % Non-unit-clauses : 759
% 5.19/1.23 % Current number of unprocessed clauses: 14159
% 5.19/1.23 % ...number of literals in the above : 43798
% 5.19/1.23 % Current number of archived formulas : 0
% 5.19/1.23 % Current number of archived clauses : 586
% 5.19/1.23 % Clause-clause subsumption calls (NU) : 122542
% 5.19/1.23 % Rec. Clause-clause subsumption calls : 79504
% 5.19/1.23 % Non-unit clause-clause subsumptions : 3019
% 5.19/1.23 % Unit Clause-clause subsumption calls : 7572
% 5.19/1.23 % Rewrite failures with RHS unbound : 0
% 5.19/1.23 % BW rewrite match attempts : 713
% 5.19/1.23 % BW rewrite match successes : 472
% 5.19/1.23 % Condensation attempts : 0
% 5.19/1.23 % Condensation successes : 0
% 5.19/1.23 % Termbank termtop insertions : 754000
% 5.19/1.23 % Search garbage collected termcells : 185
% 5.19/1.23
% 5.19/1.23 % -------------------------------------------------
% 5.19/1.23 % User time : 0.716 s
% 5.19/1.23 % System time : 0.025 s
% 5.19/1.23 % Total time : 0.741 s
% 5.19/1.23 % Maximum resident set size: 3692 pages
% 5.19/1.23
% 5.19/1.23 % -------------------------------------------------
% 5.19/1.23 % User time : 3.522 s
% 5.19/1.23 % System time : 0.145 s
% 5.19/1.23 % Total time : 3.667 s
% 5.19/1.23 % Maximum resident set size: 4608 pages
% 5.19/1.23 % E exiting
%------------------------------------------------------------------------------