%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET553-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 : n002.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:21 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.58s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 12 unt; 3 nHn; 11 RR)
% Number of literals : 32 ( 7 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(cantor_class,axiom,
intersection(domain_of(X1),diagonalise(compose(inverse(element_relation),X1))) = cantor(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',cantor_class) ).
cnf(diagonalisation,axiom,
complement(domain_of(intersection(X1,identity_relation))) = diagonalise(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',diagonalisation) ).
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(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_cantor_class_alternate_defn_1,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cantor_class_alternate_defn_1) ).
cnf(c_0_7,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_8,axiom,
intersection(domain_of(X1),diagonalise(compose(inverse(element_relation),X1))) = cantor(X1),
cantor_class ).
cnf(c_0_9,axiom,
complement(domain_of(intersection(X1,identity_relation))) = diagonalise(X1),
diagonalisation ).
cnf(c_0_10,axiom,
domain_of(flip(cross_product(X1,universal_class))) = inverse(X1),
inverse ).
cnf(c_0_11,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_7 ).
cnf(c_0_12,plain,
intersection(domain_of(X1),complement(domain_of(intersection(compose(domain_of(flip(cross_product(element_relation,universal_class))),X1),identity_relation)))) = cantor(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_14,plain,
( ~ member(X1,cantor(X2))
| member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_16,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
inference(fof_simplification,[status(thm)],[prove_cantor_class_alternate_defn_1]) ).
cnf(c_0_17,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_13 ).
cnf(c_0_18,plain,
( subclass(cantor(X1),X2)
| member(not_subclass_element(cantor(X1),X2),domain_of(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
c_0_16 ).
cnf(c_0_20,plain,
subclass(cantor(X1),domain_of(X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET553-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.18/0.44 % Computer : n002.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 05:28:17 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.50 Running first-order theorem proving
% 0.25/0.51 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.25/0.58 % Version: 3.5.1
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.58 % Starting sh5l with 300s (1) cores
% 0.25/0.58 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2515346 completed with status 0
% 0.25/0.58 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.58 % Starting new_bool_3 with 311s (1) cores
% 0.25/0.58 % Starting new_bool_1 with 308s (1) cores
% 0.25/0.58 % Starting sh5l with 304s (1) cores
% 0.25/0.58 % new_bool_3 with pid 2515355 completed with status 0
% 0.25/0.58 % Result found by new_bool_3
% 0.25/0.58 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.58 % No SInE strategy applied
% 0.25/0.58 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.25/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.58 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.58 % Starting new_bool_3 with 311s (1) cores
% 0.25/0.58 % Preprocessing time : 0.002 s
% 0.25/0.58 % Presaturation interreduction done
% 0.25/0.58
% 0.25/0.58 % Proof found!
% 0.25/0.58 % SZS status Unsatisfiable
% 0.25/0.58 % SZS output start CNFRefutation
% See solution above
% 0.25/0.58 % Parsed axioms : 113
% 0.25/0.58 % Removed by relevancy pruning/SinE : 0
% 0.25/0.58 % Initial clauses : 113
% 0.25/0.58 % Removed in clause preprocessing : 17
% 0.25/0.58 % Initial clauses in saturation : 96
% 0.25/0.58 % Processed clauses : 432
% 0.25/0.58 % ...of these trivial : 5
% 0.25/0.58 % ...subsumed : 55
% 0.25/0.58 % ...remaining for further processing : 372
% 0.25/0.58 % Other redundant clauses eliminated : 6
% 0.25/0.58 % Clauses deleted for lack of memory : 0
% 0.25/0.58 % Backward-subsumed : 13
% 0.25/0.58 % Backward-rewritten : 6
% 0.25/0.58 % Generated clauses : 877
% 0.25/0.58 % ...of the previous two non-redundant : 719
% 0.25/0.58 % ...aggressively subsumed : 0
% 0.25/0.58 % Contextual simplify-reflections : 2
% 0.25/0.58 % Paramodulations : 868
% 0.25/0.58 % Factorizations : 2
% 0.25/0.58 % NegExts : 0
% 0.25/0.58 % Equation resolutions : 7
% 0.25/0.58 % Disequality decompositions : 0
% 0.25/0.58 % Total rewrite steps : 191
% 0.25/0.58 % ...of those cached : 141
% 0.25/0.58 % Propositional unsat checks : 0
% 0.25/0.58 % Propositional check models : 0
% 0.25/0.58 % Propositional check unsatisfiable : 0
% 0.25/0.58 % Propositional clauses : 0
% 0.25/0.58 % Propositional clauses after purity: 0
% 0.25/0.58 % Propositional unsat core size : 0
% 0.25/0.58 % Propositional preprocessing time : 0.000
% 0.25/0.58 % Propositional encoding time : 0.000
% 0.25/0.58 % Propositional solver time : 0.000
% 0.25/0.58 % Success case prop preproc time : 0.000
% 0.25/0.58 % Success case prop encoding time : 0.000
% 0.25/0.58 % Success case prop solver time : 0.000
% 0.25/0.58 % Current number of processed clauses : 254
% 0.25/0.58 % Positive orientable unit clauses : 46
% 0.25/0.58 % Positive unorientable unit clauses: 1
% 0.25/0.58 % Negative unit clauses : 13
% 0.25/0.58 % Non-unit-clauses : 194
% 0.25/0.58 % Current number of unprocessed clauses: 474
% 0.25/0.58 % ...number of literals in the above : 1052
% 0.25/0.58 % Current number of archived formulas : 0
% 0.25/0.58 % Current number of archived clauses : 131
% 0.25/0.58 % Clause-clause subsumption calls (NU) : 5308
% 0.25/0.58 % Rec. Clause-clause subsumption calls : 3265
% 0.25/0.58 % Non-unit clause-clause subsumptions : 53
% 0.25/0.58 % Unit Clause-clause subsumption calls : 301
% 0.25/0.58 % Rewrite failures with RHS unbound : 0
% 0.25/0.58 % BW rewrite match attempts : 18
% 0.25/0.58 % BW rewrite match successes : 8
% 0.25/0.58 % Condensation attempts : 0
% 0.25/0.58 % Condensation successes : 0
% 0.25/0.58 % Termbank termtop insertions : 25356
% 0.25/0.58 % Search garbage collected termcells : 185
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.038 s
% 0.25/0.58 % System time : 0.010 s
% 0.25/0.58 % Total time : 0.048 s
% 0.25/0.58 % Maximum resident set size: 3736 pages
% 0.25/0.58
% 0.25/0.58 % -------------------------------------------------
% 0.25/0.58 % User time : 0.179 s
% 0.25/0.58 % System time : 0.038 s
% 0.25/0.58 % Total time : 0.217 s
% 0.25/0.58 % Maximum resident set size: 4608 pages
% 0.25/0.58 % E exiting
%------------------------------------------------------------------------------