%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET199-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 : n001.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:53 PM UTC 2026
% Result : Unsatisfiable 0.41s 0.63s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 12 unt; 5 nHn; 35 RR)
% Number of literals : 80 ( 4 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 70 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(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(prove_greatest_lower_bound_2,negated_conjecture,
subclass(z,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_2) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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_greatest_lower_bound_1,negated_conjecture,
subclass(z,x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_1) ).
cnf(prove_greatest_lower_bound_3,negated_conjecture,
~ subclass(z,intersection(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_greatest_lower_bound_3) ).
cnf(c_0_10,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_11,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_12,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_15,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_12,c_0_13]) ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_17,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
subclass(z,y),
prove_greatest_lower_bound_2 ).
cnf(c_0_19,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(X1,z)
| member(X1,y) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_19 ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_24,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(not_subclass_element(X1,intersection(y,X1)),z)
| subclass(X1,intersection(y,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_27,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_23 ).
cnf(c_0_28,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_24 ).
cnf(c_0_29,negated_conjecture,
subclass(z,intersection(y,z)),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_30,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_12,c_0_26]) ).
cnf(c_0_31,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,negated_conjecture,
intersection(y,z) = z,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
( subclass(z,X1)
| member(not_subclass_element(z,X1),y) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,negated_conjecture,
subclass(z,x),
prove_greatest_lower_bound_1 ).
cnf(c_0_35,negated_conjecture,
~ subclass(z,intersection(x,y)),
inference(fof_simplification,[status(thm)],[prove_greatest_lower_bound_3]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(not_subclass_element(z,intersection(X1,y)),X1)
| subclass(z,intersection(X1,y)) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(X1,z)
| member(X1,x) ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ subclass(z,intersection(x,y)),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
~ member(not_subclass_element(z,intersection(x,y)),z),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_16]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET199-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.11/0.37 % Computer : n001.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:05:43 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/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
% 0.41/0.63 % Version: 3.5.1
% 0.41/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.41/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.41/0.63 % Starting sh5l with 300s (1) cores
% 0.41/0.63 % new_bool_3 with pid 2250113 completed with status 9
% 0.41/0.63 % new_bool_1 with pid 2250114 completed with status 9
% 0.41/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2250112 completed with status 0
% 0.41/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.41/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.63 % No SInE strategy applied
% 0.41/0.63 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.41/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.41/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.41/0.63 % Starting new_bool_3 with 311s (1) cores
% 0.41/0.63 % Starting new_bool_1 with 308s (1) cores
% 0.41/0.63 % Starting sh5l with 304s (1) cores
% 0.41/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2250121 completed with status 0
% 0.41/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.41/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.41/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.41/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.41/0.63 % No SInE strategy applied
% 0.41/0.63 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.41/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.41/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.41/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.41/0.63 % Preprocessing time : 0.005 s
% 0.41/0.63 % Presaturation interreduction done
% 0.41/0.63
% 0.41/0.63 % Proof found!
% 0.41/0.63 % SZS status Unsatisfiable
% 0.41/0.63 % SZS output start CNFRefutation
% See solution above
% 0.41/0.63 % Parsed axioms : 115
% 0.41/0.63 % Removed by relevancy pruning/SinE : 0
% 0.41/0.63 % Initial clauses : 115
% 0.41/0.63 % Removed in clause preprocessing : 17
% 0.41/0.63 % Initial clauses in saturation : 98
% 0.41/0.63 % Processed clauses : 638
% 0.41/0.63 % ...of these trivial : 5
% 0.41/0.63 % ...subsumed : 193
% 0.41/0.63 % ...remaining for further processing : 440
% 0.41/0.63 % Other redundant clauses eliminated : 6
% 0.41/0.63 % Clauses deleted for lack of memory : 0
% 0.41/0.63 % Backward-subsumed : 6
% 0.41/0.63 % Backward-rewritten : 30
% 0.41/0.63 % Generated clauses : 1430
% 0.41/0.63 % ...of the previous two non-redundant : 1218
% 0.41/0.64 % ...aggressively subsumed : 0
% 0.41/0.64 % Contextual simplify-reflections : 5
% 0.41/0.64 % Paramodulations : 1422
% 0.41/0.64 % Factorizations : 2
% 0.41/0.64 % NegExts : 0
% 0.41/0.64 % Equation resolutions : 6
% 0.41/0.64 % Disequality decompositions : 0
% 0.41/0.64 % Total rewrite steps : 342
% 0.41/0.64 % ...of those cached : 255
% 0.41/0.64 % Propositional unsat checks : 0
% 0.41/0.64 % Propositional check models : 0
% 0.41/0.64 % Propositional check unsatisfiable : 0
% 0.41/0.64 % Propositional clauses : 0
% 0.41/0.64 % Propositional clauses after purity: 0
% 0.41/0.64 % Propositional unsat core size : 0
% 0.41/0.64 % Propositional preprocessing time : 0.000
% 0.41/0.64 % Propositional encoding time : 0.000
% 0.41/0.64 % Propositional solver time : 0.000
% 0.41/0.64 % Success case prop preproc time : 0.000
% 0.41/0.64 % Success case prop encoding time : 0.000
% 0.41/0.64 % Success case prop solver time : 0.000
% 0.41/0.64 % Current number of processed clauses : 303
% 0.41/0.64 % Positive orientable unit clauses : 53
% 0.41/0.64 % Positive unorientable unit clauses: 1
% 0.41/0.64 % Negative unit clauses : 4
% 0.41/0.64 % Non-unit-clauses : 245
% 0.41/0.64 % Current number of unprocessed clauses: 733
% 0.41/0.64 % ...number of literals in the above : 2030
% 0.41/0.64 % Current number of archived formulas : 0
% 0.41/0.64 % Current number of archived clauses : 150
% 0.41/0.64 % Clause-clause subsumption calls (NU) : 10324
% 0.41/0.64 % Rec. Clause-clause subsumption calls : 6794
% 0.41/0.64 % Non-unit clause-clause subsumptions : 170
% 0.41/0.64 % Unit Clause-clause subsumption calls : 652
% 0.41/0.64 % Rewrite failures with RHS unbound : 0
% 0.41/0.64 % BW rewrite match attempts : 77
% 0.41/0.64 % BW rewrite match successes : 14
% 0.41/0.64 % Condensation attempts : 0
% 0.41/0.64 % Condensation successes : 0
% 0.41/0.64 % Termbank termtop insertions : 35908
% 0.41/0.64 % Search garbage collected termcells : 185
% 0.41/0.64
% 0.41/0.64 % -------------------------------------------------
% 0.41/0.64 % User time : 0.106 s
% 0.41/0.64 % System time : 0.009 s
% 0.41/0.64 % Total time : 0.115 s
% 0.41/0.64 % Maximum resident set size: 4000 pages
% 0.41/0.64
% 0.41/0.64 % -------------------------------------------------
% 0.41/0.64 % User time : 0.677 s
% 0.41/0.64 % System time : 0.104 s
% 0.41/0.64 % Total time : 0.780 s
% 0.41/0.64 % Maximum resident set size: 4864 pages
% 0.41/0.64 % E exiting
%------------------------------------------------------------------------------