%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET442-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 : n012.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:14:13 PM UTC 2026
% Result : Unsatisfiable 0.55s 0.52s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 41 ( 14 unt; 4 nHn; 31 RR)
% Number of literals : 80 ( 14 equ; 40 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 77 ( 4 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(function1,axiom,
( ~ function(X1)
| subclass(X1,cross_product(universal_class,universal_class)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',function1) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
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_restrict_a_function_2,negated_conjecture,
restrict(xf,universal_class,universal_class) != xf,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restrict_a_function_2) ).
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(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(prove_restrict_a_function_1,negated_conjecture,
function(xf),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_restrict_a_function_1) ).
cnf(c_0_11,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_12,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
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,
( ~ function(X1)
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(fof_simplification,[status(thm)],[function1]) ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_11 ).
cnf(c_0_16,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_18,plain,
( ~ function(X1)
| subclass(X1,cross_product(universal_class,universal_class)) ),
c_0_14 ).
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,X3)),X2)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| subclass(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| ~ function(X2)
| member(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
restrict(xf,universal_class,universal_class) != xf,
inference(fof_simplification,[status(thm)],[prove_restrict_a_function_2]) ).
cnf(c_0_25,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_26,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ function(X1)
| subclass(X1,X2)
| member(not_subclass_element(X1,X2),cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_28,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
restrict(xf,universal_class,universal_class) != xf,
c_0_24 ).
cnf(c_0_30,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_31,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_32,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ function(X1)
| subclass(X1,intersection(cross_product(universal_class,universal_class),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
intersection(xf,cross_product(universal_class,universal_class)) != xf,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_37,plain,
( ~ function(X1)
| intersection(cross_product(universal_class,universal_class),X1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
function(xf),
prove_restrict_a_function_1 ).
cnf(c_0_39,negated_conjecture,
intersection(cross_product(universal_class,universal_class),xf) != xf,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET442-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 05:17:38 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.34 Running first-order theorem proving
% 0.04/0.34 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.55/0.52 % Version: 3.5.1
% 0.55/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.55/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.55/0.52 % Starting sh5l with 300s (1) cores
% 0.55/0.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1626854 completed with status 0
% 0.55/0.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.55/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.55/0.52 % No SInE strategy applied
% 0.55/0.52 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.55/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.55/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.55/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.55/0.52 % Starting new_bool_3 with 311s (1) cores
% 0.55/0.52 % Starting new_bool_1 with 308s (1) cores
% 0.55/0.52 % Starting sh5l with 304s (1) cores
% 0.55/0.52 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1626862 completed with status 0
% 0.55/0.52 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.55/0.52 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.55/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.55/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.55/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.55/0.52 % No SInE strategy applied
% 0.55/0.52 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.55/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.55/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.55/0.52 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.55/0.52 % Preprocessing time : 0.002 s
% 0.55/0.52 % Presaturation interreduction done
% 0.55/0.52
% 0.55/0.52 % Proof found!
% 0.55/0.52 % SZS status Unsatisfiable
% 0.55/0.52 % SZS output start CNFRefutation
% See solution above
% 0.55/0.52 % Parsed axioms : 114
% 0.55/0.52 % Removed by relevancy pruning/SinE : 0
% 0.55/0.52 % Initial clauses : 114
% 0.55/0.52 % Removed in clause preprocessing : 17
% 0.55/0.52 % Initial clauses in saturation : 97
% 0.55/0.52 % Processed clauses : 1039
% 0.55/0.52 % ...of these trivial : 8
% 0.55/0.52 % ...subsumed : 445
% 0.55/0.52 % ...remaining for further processing : 586
% 0.55/0.52 % Other redundant clauses eliminated : 6
% 0.55/0.52 % Clauses deleted for lack of memory : 0
% 0.55/0.52 % Backward-subsumed : 11
% 0.55/0.52 % Backward-rewritten : 56
% 0.55/0.52 % Generated clauses : 2329
% 0.55/0.52 % ...of the previous two non-redundant : 2027
% 0.55/0.52 % ...aggressively subsumed : 0
% 0.55/0.52 % Contextual simplify-reflections : 9
% 0.55/0.52 % Paramodulations : 2321
% 0.55/0.52 % Factorizations : 2
% 0.55/0.52 % NegExts : 0
% 0.55/0.52 % Equation resolutions : 6
% 0.55/0.52 % Disequality decompositions : 0
% 0.55/0.52 % Total rewrite steps : 563
% 0.55/0.52 % ...of those cached : 415
% 0.55/0.52 % Propositional unsat checks : 0
% 0.55/0.52 % Propositional check models : 0
% 0.55/0.52 % Propositional check unsatisfiable : 0
% 0.55/0.52 % Propositional clauses : 0
% 0.55/0.52 % Propositional clauses after purity: 0
% 0.55/0.52 % Propositional unsat core size : 0
% 0.55/0.52 % Propositional preprocessing time : 0.000
% 0.55/0.52 % Propositional encoding time : 0.000
% 0.55/0.52 % Propositional solver time : 0.000
% 0.55/0.52 % Success case prop preproc time : 0.000
% 0.55/0.52 % Success case prop encoding time : 0.000
% 0.55/0.52 % Success case prop solver time : 0.000
% 0.55/0.52 % Current number of processed clauses : 419
% 0.55/0.52 % Positive orientable unit clauses : 69
% 0.55/0.52 % Positive unorientable unit clauses: 1
% 0.55/0.52 % Negative unit clauses : 3
% 0.55/0.52 % Non-unit-clauses : 346
% 0.55/0.52 % Current number of unprocessed clauses: 1087
% 0.55/0.52 % ...number of literals in the above : 3207
% 0.55/0.52 % Current number of archived formulas : 0
% 0.55/0.52 % Current number of archived clauses : 180
% 0.55/0.52 % Clause-clause subsumption calls (NU) : 21358
% 0.55/0.52 % Rec. Clause-clause subsumption calls : 15200
% 0.55/0.52 % Non-unit clause-clause subsumptions : 398
% 0.55/0.52 % Unit Clause-clause subsumption calls : 857
% 0.55/0.52 % Rewrite failures with RHS unbound : 0
% 0.55/0.52 % BW rewrite match attempts : 80
% 0.55/0.52 % BW rewrite match successes : 26
% 0.55/0.52 % Condensation attempts : 0
% 0.55/0.52 % Condensation successes : 0
% 0.55/0.52 % Termbank termtop insertions : 59729
% 0.55/0.52 % Search garbage collected termcells : 185
% 0.55/0.52
% 0.55/0.52 % -------------------------------------------------
% 0.55/0.52 % User time : 0.057 s
% 0.55/0.52 % System time : 0.005 s
% 0.55/0.52 % Total time : 0.062 s
% 0.55/0.52 % Maximum resident set size: 3992 pages
% 0.55/0.52
% 0.55/0.52 % -------------------------------------------------
% 0.55/0.52 % User time : 0.460 s
% 0.55/0.52 % System time : 0.034 s
% 0.55/0.52 % Total time : 0.494 s
% 0.55/0.52 % Maximum resident set size: 4608 pages
% 0.55/0.52 % E exiting
%------------------------------------------------------------------------------