%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET257-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 : 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:16:57 PM UTC 2026
% Result : Unsatisfiable 0.06s 5.39s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 27 ( 10 unt; 3 nHn; 19 RR)
% Number of literals : 51 ( 10 equ; 25 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 52 ( 4 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(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
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_property5_1,negated_conjecture,
restrict(cross_product(x,y),x,y) != cross_product(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_restriction_property5_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_7,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_8,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_9,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_7 ).
cnf(c_0_10,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_8 ).
cnf(c_0_11,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_12,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_9,c_0_10]) ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_14,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_11 ).
cnf(c_0_15,negated_conjecture,
restrict(cross_product(x,y),x,y) != cross_product(x,y),
inference(fof_simplification,[status(thm)],[prove_restriction_property5_1]) ).
cnf(c_0_16,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_17,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
restrict(cross_product(x,y),x,y) != cross_product(x,y),
c_0_15 ).
cnf(c_0_20,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_21,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_16 ).
cnf(c_0_22,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_23,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_9,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
intersection(cross_product(x,y),cross_product(x,y)) != cross_product(x,y),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET257-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/5.32 % Computer : n012.cluster.edu
% 0.06/5.32 % Model : x86_64 x86_64
% 0.06/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/5.32 % Memory : 8046.5625MB
% 0.06/5.32 % OS : Linux 6.8.0-71-generic
% 0.06/5.32 % CPULimit : 300
% 0.06/5.32 % WCLimit : 300
% 0.06/5.32 % DateTime : Mon Sep 21 05:03:45 UTC 2026
% 0.06/5.32 % CPUTime :
% 0.06/5.32 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/5.35 Running first-order theorem proving
% 0.06/5.35 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
% 0.06/5.39 % Version: 3.5.1
% 0.06/5.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.06/5.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/5.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.06/5.39 % Starting new_bool_3 with 300s (1) cores
% 0.06/5.39 % Starting new_bool_1 with 300s (1) cores
% 0.06/5.39 % Starting sh5l with 300s (1) cores
% 0.06/5.39 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1613024 completed with status 0
% 0.06/5.39 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.06/5.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.06/5.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/5.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.06/5.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/5.39 % No SInE strategy applied
% 0.06/5.39 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.06/5.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/5.39 % Starting SubtermCWHack with 136s (1) cores
% 0.06/5.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.06/5.39 % Starting new_bool_3 with 311s (1) cores
% 0.06/5.39 % Starting new_bool_1 with 308s (1) cores
% 0.06/5.39 % Starting sh5l with 304s (1) cores
% 0.06/5.39 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1613032 completed with status 0
% 0.06/5.39 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.06/5.39 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.06/5.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/5.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.06/5.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/5.39 % No SInE strategy applied
% 0.06/5.39 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.06/5.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/5.39 % Starting SubtermCWHack with 136s (1) cores
% 0.06/5.39 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.06/5.39 % Preprocessing time : 0.002 s
% 0.06/5.39 % Presaturation interreduction done
% 0.06/5.39
% 0.06/5.39 % Proof found!
% 0.06/5.39 % SZS status Unsatisfiable
% 0.06/5.39 % SZS output start CNFRefutation
% See solution above
% 0.06/5.39 % Parsed axioms : 113
% 0.06/5.39 % Removed by relevancy pruning/SinE : 0
% 0.06/5.39 % Initial clauses : 113
% 0.06/5.39 % Removed in clause preprocessing : 17
% 0.06/5.39 % Initial clauses in saturation : 96
% 0.06/5.39 % Processed clauses : 440
% 0.06/5.39 % ...of these trivial : 8
% 0.06/5.39 % ...subsumed : 93
% 0.06/5.39 % ...remaining for further processing : 339
% 0.06/5.39 % Other redundant clauses eliminated : 6
% 0.06/5.39 % Clauses deleted for lack of memory : 0
% 0.06/5.39 % Backward-subsumed : 6
% 0.06/5.39 % Backward-rewritten : 27
% 0.06/5.39 % Generated clauses : 803
% 0.06/5.39 % ...of the previous two non-redundant : 714
% 0.06/5.39 % ...aggressively subsumed : 0
% 0.06/5.39 % Contextual simplify-reflections : 1
% 0.06/5.39 % Paramodulations : 795
% 0.06/5.39 % Factorizations : 2
% 0.06/5.39 % NegExts : 0
% 0.06/5.39 % Equation resolutions : 6
% 0.06/5.39 % Disequality decompositions : 0
% 0.06/5.39 % Total rewrite steps : 149
% 0.06/5.39 % ...of those cached : 103
% 0.06/5.39 % Propositional unsat checks : 0
% 0.06/5.39 % Propositional check models : 0
% 0.06/5.39 % Propositional check unsatisfiable : 0
% 0.06/5.39 % Propositional clauses : 0
% 0.06/5.39 % Propositional clauses after purity: 0
% 0.06/5.39 % Propositional unsat core size : 0
% 0.06/5.39 % Propositional preprocessing time : 0.000
% 0.06/5.39 % Propositional encoding time : 0.000
% 0.06/5.39 % Propositional solver time : 0.000
% 0.06/5.39 % Success case prop preproc time : 0.000
% 0.06/5.39 % Success case prop encoding time : 0.000
% 0.06/5.39 % Success case prop solver time : 0.000
% 0.06/5.39 % Current number of processed clauses : 207
% 0.06/5.39 % Positive orientable unit clauses : 37
% 0.06/5.39 % Positive unorientable unit clauses: 1
% 0.06/5.39 % Negative unit clauses : 2
% 0.06/5.39 % Non-unit-clauses : 167
% 0.06/5.39 % Current number of unprocessed clauses: 443
% 0.06/5.39 % ...number of literals in the above : 1240
% 0.06/5.39 % Current number of archived formulas : 0
% 0.06/5.39 % Current number of archived clauses : 145
% 0.06/5.39 % Clause-clause subsumption calls (NU) : 5588
% 0.06/5.39 % Rec. Clause-clause subsumption calls : 3526
% 0.06/5.39 % Non-unit clause-clause subsumptions : 79
% 0.06/5.39 % Unit Clause-clause subsumption calls : 288
% 0.06/5.39 % Rewrite failures with RHS unbound : 0
% 0.06/5.39 % BW rewrite match attempts : 55
% 0.06/5.39 % BW rewrite match successes : 11
% 0.06/5.39 % Condensation attempts : 0
% 0.06/5.39 % Condensation successes : 0
% 0.06/5.39 % Termbank termtop insertions : 26128
% 0.06/5.39 % Search garbage collected termcells : 185
% 0.06/5.39
% 0.06/5.39 % -------------------------------------------------
% 0.06/5.39 % User time : 0.027 s
% 0.06/5.39 % System time : 0.003 s
% 0.06/5.39 % Total time : 0.030 s
% 0.06/5.39 % Maximum resident set size: 3744 pages
% 0.06/5.39
% 0.06/5.39 % -------------------------------------------------
% 0.06/5.39 % User time : 0.121 s
% 0.06/5.39 % System time : 0.021 s
% 0.06/5.39 % Total time : 0.142 s
% 0.06/5.39 % Maximum resident set size: 4864 pages
% 0.06/5.39 % E exiting
%------------------------------------------------------------------------------