%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET075-7 : 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 : n026.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:27 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 15 unt; 0 nHn; 17 RR)
% Number of literals : 33 ( 8 equ; 13 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 30 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(corollary_of_null_class_is_subclass,axiom,
( ~ subclass(X1,null_class)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_of_null_class_is_subclass) ).
cnf(singleton_in_unordered_pair2,axiom,
subclass(singleton(X1),unordered_pair(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_in_unordered_pair2) ).
cnf(prove_corollary_to_unordered_pair_axiom3_2,negated_conjecture,
unordered_pair(x,y) = null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom3_2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(unordered_pair3,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair3) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
cnf(corollary_2_to_cartesian_product,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary_2_to_cartesian_product) ).
cnf(prove_corollary_to_unordered_pair_axiom3_1,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_to_unordered_pair_axiom3_1) ).
cnf(c_0_8,plain,
( ~ subclass(X1,null_class)
| X1 = null_class ),
inference(fof_simplification,[status(thm)],[corollary_of_null_class_is_subclass]) ).
cnf(c_0_9,axiom,
subclass(singleton(X1),unordered_pair(X2,X1)),
singleton_in_unordered_pair2 ).
cnf(c_0_10,negated_conjecture,
unordered_pair(x,y) = null_class,
prove_corollary_to_unordered_pair_axiom3_2 ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_13,plain,
( ~ subclass(X1,null_class)
| X1 = null_class ),
c_0_8 ).
cnf(c_0_14,negated_conjecture,
subclass(unordered_pair(y,y),null_class),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[existence_of_null_class]) ).
cnf(c_0_16,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,universal_class) ),
inference(fof_simplification,[status(thm)],[corollary_2_to_cartesian_product]) ).
cnf(c_0_17,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
unordered_pair(y,y) = null_class,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ member(X1,null_class),
c_0_15 ).
cnf(c_0_20,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,universal_class) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
member(ordered_pair(x,y),cross_product(u,v)),
prove_corollary_to_unordered_pair_axiom3_1 ).
cnf(c_0_22,negated_conjecture,
~ member(y,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET075-7 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n026.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 04:52:52 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.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 % new_bool_1 with pid 1407293 completed with status 0
% 0.13/0.45 % Result found by new_bool_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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGUSM-FFMS21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 1407295 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.45 % Search class: FGUSM-FFMS21-MFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.002 s
% 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 : 117
% 0.13/0.45 % Removed by relevancy pruning/SinE : 83
% 0.13/0.45 % Initial clauses : 34
% 0.13/0.45 % Removed in clause preprocessing : 0
% 0.13/0.45 % Initial clauses in saturation : 34
% 0.13/0.45 % Processed clauses : 121
% 0.13/0.45 % ...of these trivial : 3
% 0.13/0.45 % ...subsumed : 55
% 0.13/0.45 % ...remaining for further processing : 63
% 0.13/0.45 % Other redundant clauses eliminated : 2
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 3
% 0.13/0.45 % Backward-rewritten : 3
% 0.13/0.45 % Generated clauses : 374
% 0.13/0.45 % ...of the previous two non-redundant : 224
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 372
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 2
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 180
% 0.13/0.45 % ...of those cached : 129
% 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 : 55
% 0.13/0.45 % Positive orientable unit clauses : 27
% 0.13/0.45 % Positive unorientable unit clauses: 2
% 0.13/0.45 % Negative unit clauses : 3
% 0.13/0.45 % Non-unit-clauses : 23
% 0.13/0.45 % Current number of unprocessed clauses: 135
% 0.13/0.45 % ...number of literals in the above : 316
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 6
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 89
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 88
% 0.13/0.45 % Non-unit clause-clause subsumptions : 46
% 0.13/0.45 % Unit Clause-clause subsumption calls : 3
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 21
% 0.13/0.45 % BW rewrite match successes : 15
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 4061
% 0.13/0.45 % Search garbage collected termcells : 435
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.006 s
% 0.13/0.45 % System time : 0.004 s
% 0.13/0.45 % Total time : 0.010 s
% 0.13/0.45 % Maximum resident set size: 3676 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.011 s
% 0.13/0.45 % System time : 0.008 s
% 0.13/0.45 % Total time : 0.019 s
% 0.13/0.45 % Maximum resident set size: 4608 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------