%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET454-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 : n004.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:17:11 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 12 unt; 2 nHn; 23 RR)
% Number of literals : 42 ( 8 equ; 16 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(subset_relation,axiom,
intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subset_relation) ).
cnf(inverse,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',inverse) ).
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(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(identity_relation,axiom,
intersection(inverse(subset_relation),subset_relation) = identity_relation,
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',identity_relation) ).
cnf(prove_identity_alternate_defn1_1,negated_conjecture,
~ subclass(identity_relation,cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_identity_alternate_defn1_1) ).
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(c_0_8,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_9,axiom,
intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),inverse(element_relation))))) = subset_relation,
subset_relation ).
cnf(c_0_10,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
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,intersection(X2,X3))
| member(X1,X2) ),
c_0_8 ).
cnf(c_0_13,plain,
intersection(cross_product(universal_class,universal_class),intersection(cross_product(universal_class,universal_class),complement(compose(complement(element_relation),domain_of(flip(cross_product(element_relation,universal_class))))))) = subset_relation,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_15,axiom,
intersection(inverse(subset_relation),subset_relation) = identity_relation,
identity_relation ).
cnf(c_0_16,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_11 ).
cnf(c_0_17,plain,
( ~ member(X1,subset_relation)
| member(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_14 ).
cnf(c_0_19,plain,
intersection(domain_of(flip(cross_product(subset_relation,universal_class))),subset_relation) = identity_relation,
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,cross_product(universal_class,universal_class)),subset_relation)
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(X1,identity_relation)
| member(X1,subset_relation) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ subclass(identity_relation,cross_product(universal_class,universal_class)),
inference(fof_simplification,[status(thm)],[prove_identity_alternate_defn1_1]) ).
cnf(c_0_23,plain,
( ~ member(not_subclass_element(X1,cross_product(universal_class,universal_class)),identity_relation)
| subclass(X1,cross_product(universal_class,universal_class)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_25,negated_conjecture,
~ subclass(identity_relation,cross_product(universal_class,universal_class)),
c_0_22 ).
cnf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET454-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:18:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2321180 completed with status 0
% 0.13/0.45 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.45 % Starting new_bool_3 with 311s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 308s (1) cores
% 0.13/0.45 % Starting sh5l with 304s (1) cores
% 0.13/0.45 % sh5l with pid 2321191 completed with status 0
% 0.13/0.45 % Result found by sh5l
% 0.13/0.45 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.45 % Starting new_bool_3 with 311s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 308s (1) cores
% 0.13/0.45 % Starting sh5l with 304s (1) cores
% 0.13/0.45 % Preprocessing time : 0.003 s
% 0.13/0.45 % Presaturation interreduction done
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 113
% 0.13/0.45 % Removed by relevancy pruning/SinE : 0
% 0.13/0.45 % Initial clauses : 113
% 0.13/0.45 % Removed in clause preprocessing : 17
% 0.13/0.45 % Initial clauses in saturation : 96
% 0.13/0.45 % Processed clauses : 201
% 0.13/0.45 % ...of these trivial : 1
% 0.13/0.45 % ...subsumed : 9
% 0.13/0.45 % ...remaining for further processing : 191
% 0.13/0.45 % Other redundant clauses eliminated : 4
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 0
% 0.13/0.45 % Backward-rewritten : 0
% 0.13/0.45 % Generated clauses : 130
% 0.13/0.45 % ...of the previous two non-redundant : 115
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 1
% 0.13/0.45 % Paramodulations : 126
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 4
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 9
% 0.13/0.45 % ...of those cached : 3
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 92
% 0.13/0.45 % Positive orientable unit clauses : 25
% 0.13/0.45 % Positive unorientable unit clauses: 1
% 0.13/0.45 % Negative unit clauses : 3
% 0.13/0.45 % Non-unit-clauses : 63
% 0.13/0.45 % Current number of unprocessed clauses: 105
% 0.13/0.45 % ...number of literals in the above : 257
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 112
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 1546
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 919
% 0.13/0.45 % Non-unit clause-clause subsumptions : 9
% 0.13/0.45 % Unit Clause-clause subsumption calls : 60
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 18
% 0.13/0.45 % BW rewrite match successes : 4
% 0.13/0.45 % Condensation attempts : 201
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 9806
% 0.13/0.45 % Search garbage collected termcells : 185
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.021 s
% 0.13/0.45 % System time : 0.006 s
% 0.13/0.45 % Total time : 0.027 s
% 0.13/0.45 % Maximum resident set size: 3992 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.099 s
% 0.13/0.45 % System time : 0.025 s
% 0.13/0.45 % Total time : 0.124 s
% 0.13/0.45 % Maximum resident set size: 4864 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------