%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET382-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 : n011.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:08 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.51s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 15 unt; 4 nHn; 27 RR)
% Number of literals : 69 ( 13 equ; 33 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 69 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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(prove_corollary_1_to_relation_property2_1,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_relation_property2_1) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(prove_corollary_1_to_relation_property2_2,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_relation_property2_2) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
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(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(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) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
subclass(x,cross_product(universal_class,universal_class)),
prove_corollary_1_to_relation_property2_1 ).
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,negated_conjecture,
( ~ member(X1,x)
| member(X1,cross_product(universal_class,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,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_20,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_relation_property2_2]) ).
cnf(c_0_21,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_22,negated_conjecture,
( subclass(x,X1)
| member(not_subclass_element(x,X1),cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_24,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_19 ).
cnf(c_0_26,negated_conjecture,
restrict(x,universal_class,universal_class) != x,
c_0_20 ).
cnf(c_0_27,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(not_subclass_element(x,intersection(X1,cross_product(universal_class,universal_class))),X1)
| subclass(x,intersection(X1,cross_product(universal_class,universal_class))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
intersection(x,cross_product(universal_class,universal_class)) != x,
inference(rw,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_27 ).
cnf(c_0_33,negated_conjecture,
subclass(x,intersection(cross_product(universal_class,universal_class),x)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]) ).
cnf(c_0_34,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
intersection(cross_product(universal_class,universal_class),x) != x,
inference(rw,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET382-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n011.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 05:13:26 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.53/0.51 % Version: 3.5.1
% 0.53/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.51 % Starting sh5l with 300s (1) cores
% 0.53/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1038032 completed with status 0
% 0.53/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.53/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.51 % No SInE strategy applied
% 0.53/0.51 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.53/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.53/0.51 % Starting new_bool_3 with 311s (1) cores
% 0.53/0.51 % Starting new_bool_1 with 308s (1) cores
% 0.53/0.51 % Starting sh5l with 304s (1) cores
% 0.53/0.51 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1038039 completed with status 0
% 0.53/0.51 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.53/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.53/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.53/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.51 % No SInE strategy applied
% 0.53/0.51 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.53/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.53/0.51 % Preprocessing time : 0.005 s
% 0.53/0.51 % Presaturation interreduction done
% 0.53/0.51
% 0.53/0.51 % Proof found!
% 0.53/0.51 % SZS status Unsatisfiable
% 0.53/0.51 % SZS output start CNFRefutation
% See solution above
% 0.53/0.51 % Parsed axioms : 114
% 0.53/0.51 % Removed by relevancy pruning/SinE : 0
% 0.53/0.51 % Initial clauses : 114
% 0.53/0.51 % Removed in clause preprocessing : 17
% 0.53/0.51 % Initial clauses in saturation : 97
% 0.53/0.51 % Processed clauses : 522
% 0.53/0.51 % ...of these trivial : 3
% 0.53/0.51 % ...subsumed : 126
% 0.53/0.51 % ...remaining for further processing : 393
% 0.53/0.51 % Other redundant clauses eliminated : 6
% 0.53/0.51 % Clauses deleted for lack of memory : 0
% 0.53/0.51 % Backward-subsumed : 14
% 0.53/0.51 % Backward-rewritten : 39
% 0.53/0.51 % Generated clauses : 982
% 0.53/0.51 % ...of the previous two non-redundant : 914
% 0.53/0.51 % ...aggressively subsumed : 0
% 0.53/0.51 % Contextual simplify-reflections : 4
% 0.53/0.51 % Paramodulations : 974
% 0.53/0.51 % Factorizations : 2
% 0.53/0.51 % NegExts : 0
% 0.53/0.51 % Equation resolutions : 6
% 0.53/0.51 % Disequality decompositions : 0
% 0.53/0.51 % Total rewrite steps : 178
% 0.53/0.51 % ...of those cached : 132
% 0.53/0.51 % Propositional unsat checks : 0
% 0.53/0.51 % Propositional check models : 0
% 0.53/0.51 % Propositional check unsatisfiable : 0
% 0.53/0.51 % Propositional clauses : 0
% 0.53/0.51 % Propositional clauses after purity: 0
% 0.53/0.51 % Propositional unsat core size : 0
% 0.53/0.51 % Propositional preprocessing time : 0.000
% 0.53/0.51 % Propositional encoding time : 0.000
% 0.53/0.51 % Propositional solver time : 0.000
% 0.53/0.51 % Success case prop preproc time : 0.000
% 0.53/0.51 % Success case prop encoding time : 0.000
% 0.53/0.51 % Success case prop solver time : 0.000
% 0.53/0.51 % Current number of processed clauses : 240
% 0.53/0.51 % Positive orientable unit clauses : 40
% 0.53/0.51 % Positive unorientable unit clauses: 1
% 0.53/0.51 % Negative unit clauses : 3
% 0.53/0.51 % Non-unit-clauses : 196
% 0.53/0.51 % Current number of unprocessed clauses: 555
% 0.53/0.51 % ...number of literals in the above : 1636
% 0.53/0.51 % Current number of archived formulas : 0
% 0.53/0.51 % Current number of archived clauses : 166
% 0.53/0.51 % Clause-clause subsumption calls (NU) : 8136
% 0.53/0.51 % Rec. Clause-clause subsumption calls : 5261
% 0.53/0.51 % Non-unit clause-clause subsumptions : 125
% 0.53/0.51 % Unit Clause-clause subsumption calls : 322
% 0.53/0.51 % Rewrite failures with RHS unbound : 0
% 0.53/0.51 % BW rewrite match attempts : 25
% 0.53/0.51 % BW rewrite match successes : 9
% 0.53/0.51 % Condensation attempts : 0
% 0.53/0.51 % Condensation successes : 0
% 0.53/0.51 % Termbank termtop insertions : 33286
% 0.53/0.51 % Search garbage collected termcells : 185
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.070 s
% 0.53/0.51 % System time : 0.014 s
% 0.53/0.51 % Total time : 0.084 s
% 0.53/0.51 % Maximum resident set size: 3736 pages
% 0.53/0.51
% 0.53/0.51 % -------------------------------------------------
% 0.53/0.51 % User time : 0.347 s
% 0.53/0.51 % System time : 0.040 s
% 0.53/0.51 % Total time : 0.387 s
% 0.53/0.51 % Maximum resident set size: 4608 pages
% 0.53/0.51 % E exiting
%------------------------------------------------------------------------------