%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET244-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 : n009.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:58 PM UTC 2026
% Result : Unsatisfiable 1.05s 0.75s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 12 unt; 4 nHn; 23 RR)
% Number of literals : 66 ( 10 equ; 32 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 67 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(prove_restriction_with_universal_class_1,negated_conjecture,
restrict(universal_class,x,y) != cross_product(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_restriction_with_universal_class_1) ).
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(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(c_0_9,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_10,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_11,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_12,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_11 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_17,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_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,universal_class) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
restrict(universal_class,x,y) != cross_product(x,y),
inference(fof_simplification,[status(thm)],[prove_restriction_with_universal_class_1]) ).
cnf(c_0_22,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_23,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_25,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
restrict(universal_class,x,y) != cross_product(x,y),
c_0_21 ).
cnf(c_0_27,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_28,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_22 ).
cnf(c_0_29,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
intersection(universal_class,cross_product(x,y)) != cross_product(x,y),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
intersection(universal_class,X1) = X1,
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,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET244-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n009.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 05:03:12 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.52 Running first-order theorem proving
% 0.25/0.52 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.05/0.75 % Version: 3.5.1
% 1.05/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.05/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.05/0.75 % Starting new_bool_3 with 300s (1) cores
% 1.05/0.75 % Starting new_bool_1 with 300s (1) cores
% 1.05/0.75 % Starting sh5l with 300s (1) cores
% 1.05/0.75 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 902261 completed with status 0
% 1.05/0.75 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.05/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.05/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.05/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.05/0.75 % No SInE strategy applied
% 1.05/0.75 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.05/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.05/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.05/0.75 % Starting new_bool_3 with 311s (1) cores
% 1.05/0.75 % Starting new_bool_1 with 308s (1) cores
% 1.05/0.75 % Starting sh5l with 304s (1) cores
% 1.05/0.75 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 902269 completed with status 0
% 1.05/0.75 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.05/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.05/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.05/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.05/0.75 % No SInE strategy applied
% 1.05/0.75 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.05/0.75 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.75 % Starting SubtermCWHack with 136s (1) cores
% 1.05/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.05/0.75 % Preprocessing time : 0.005 s
% 1.05/0.75 % Presaturation interreduction done
% 1.05/0.75
% 1.05/0.75 % Proof found!
% 1.05/0.75 % SZS status Unsatisfiable
% 1.05/0.75 % SZS output start CNFRefutation
% See solution above
% 1.05/0.75 % Parsed axioms : 113
% 1.05/0.75 % Removed by relevancy pruning/SinE : 0
% 1.05/0.75 % Initial clauses : 113
% 1.05/0.75 % Removed in clause preprocessing : 17
% 1.05/0.75 % Initial clauses in saturation : 96
% 1.05/0.75 % Processed clauses : 521
% 1.05/0.75 % ...of these trivial : 4
% 1.05/0.75 % ...subsumed : 136
% 1.05/0.75 % ...remaining for further processing : 381
% 1.05/0.75 % Other redundant clauses eliminated : 6
% 1.05/0.75 % Clauses deleted for lack of memory : 0
% 1.05/0.75 % Backward-subsumed : 4
% 1.05/0.75 % Backward-rewritten : 37
% 1.05/0.75 % Generated clauses : 1093
% 1.05/0.75 % ...of the previous two non-redundant : 969
% 1.05/0.75 % ...aggressively subsumed : 0
% 1.05/0.75 % Contextual simplify-reflections : 3
% 1.05/0.75 % Paramodulations : 1085
% 1.05/0.75 % Factorizations : 2
% 1.05/0.75 % NegExts : 0
% 1.05/0.75 % Equation resolutions : 6
% 1.05/0.75 % Disequality decompositions : 0
% 1.05/0.75 % Total rewrite steps : 198
% 1.05/0.75 % ...of those cached : 146
% 1.05/0.75 % Propositional unsat checks : 0
% 1.05/0.75 % Propositional check models : 0
% 1.05/0.75 % Propositional check unsatisfiable : 0
% 1.05/0.75 % Propositional clauses : 0
% 1.05/0.75 % Propositional clauses after purity: 0
% 1.05/0.75 % Propositional unsat core size : 0
% 1.05/0.75 % Propositional preprocessing time : 0.000
% 1.05/0.75 % Propositional encoding time : 0.000
% 1.05/0.75 % Propositional solver time : 0.000
% 1.05/0.75 % Success case prop preproc time : 0.000
% 1.05/0.75 % Success case prop encoding time : 0.000
% 1.05/0.75 % Success case prop solver time : 0.000
% 1.05/0.75 % Current number of processed clauses : 241
% 1.05/0.75 % Positive orientable unit clauses : 41
% 1.05/0.75 % Positive unorientable unit clauses: 1
% 1.05/0.75 % Negative unit clauses : 2
% 1.05/0.75 % Non-unit-clauses : 197
% 1.05/0.75 % Current number of unprocessed clauses: 608
% 1.05/0.75 % ...number of literals in the above : 1771
% 1.05/0.75 % Current number of archived formulas : 0
% 1.05/0.75 % Current number of archived clauses : 153
% 1.05/0.75 % Clause-clause subsumption calls (NU) : 7112
% 1.05/0.75 % Rec. Clause-clause subsumption calls : 4597
% 1.05/0.75 % Non-unit clause-clause subsumptions : 111
% 1.05/0.75 % Unit Clause-clause subsumption calls : 440
% 1.05/0.75 % Rewrite failures with RHS unbound : 0
% 1.05/0.75 % BW rewrite match attempts : 28
% 1.05/0.75 % BW rewrite match successes : 14
% 1.05/0.75 % Condensation attempts : 0
% 1.05/0.75 % Condensation successes : 0
% 1.05/0.75 % Termbank termtop insertions : 35957
% 1.05/0.75 % Search garbage collected termcells : 185
% 1.05/0.75
% 1.05/0.75 % -------------------------------------------------
% 1.05/0.75 % User time : 0.085 s
% 1.05/0.75 % System time : 0.015 s
% 1.05/0.75 % Total time : 0.100 s
% 1.05/0.75 % Maximum resident set size: 3744 pages
% 1.05/0.75
% 1.05/0.75 % -------------------------------------------------
% 1.05/0.75 % User time : 0.518 s
% 1.05/0.75 % System time : 0.044 s
% 1.05/0.75 % Total time : 0.562 s
% 1.05/0.75 % Maximum resident set size: 4864 pages
% 1.05/0.75 % E exiting
%------------------------------------------------------------------------------