%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET067-6 : 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 : n008.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:24 PM UTC 2026
% Result : Unsatisfiable 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 43 ( 15 unt; 13 nHn; 25 RR)
% Number of literals : 79 ( 23 equ; 31 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(prove_singleton_in_unordered_pair1_1,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_singleton_in_unordered_pair1_1) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(unordered_pair2,axiom,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(c_0_10,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_11,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_10 ).
cnf(c_0_12,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
inference(fof_simplification,[status(thm)],[prove_singleton_in_unordered_pair1_1]) ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_16,plain,
( subclass(unordered_pair(X1,X2),X3)
| not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_13 ).
cnf(c_0_19,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_20,negated_conjecture,
~ subclass(singleton(x),unordered_pair(x,y)),
c_0_14 ).
cnf(c_0_21,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_22,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_15 ).
cnf(c_0_23,plain,
( subclass(unordered_pair(X1,X1),X2)
| not_subclass_element(unordered_pair(X1,X1),X2) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_16])]) ).
cnf(c_0_24,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_25,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
~ subclass(unordered_pair(x,x),unordered_pair(x,y)),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( ~ member(X1,X2)
| subclass(unordered_pair(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_30,plain,
( unordered_pair(X1,X2) = null_class
| regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_31,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_32,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ member(x,unordered_pair(x,y)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_29 ).
cnf(c_0_35,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_30])]) ).
cnf(c_0_36,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ member(x,universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_32,c_0_35]) ).
cnf(c_0_39,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_26]) ).
cnf(c_0_40,negated_conjecture,
unordered_pair(x,x) = null_class,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
subclass(null_class,X1),
inference(spm,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_40]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET067-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 04:49:57 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.19/0.50 % Version: 3.5.1
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 177933 completed with status 0
% 0.19/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.50 % Starting new_bool_3 with 311s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 308s (1) cores
% 0.19/0.50 % Starting sh5l with 304s (1) cores
% 0.19/0.50 % SubtermCWHack with pid 177940 completed with status 0
% 0.19/0.50 % Result found by SubtermCWHack
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Preprocessing time : 0.003 s
% 0.19/0.50
% 0.19/0.50 % Proof found!
% 0.19/0.50 % SZS status Unsatisfiable
% 0.19/0.50 % SZS output start CNFRefutation
% See solution above
% 0.19/0.50 % Parsed axioms : 92
% 0.19/0.50 % Removed by relevancy pruning/SinE : 0
% 0.19/0.50 % Initial clauses : 92
% 0.19/0.50 % Removed in clause preprocessing : 15
% 0.19/0.50 % Initial clauses in saturation : 77
% 0.19/0.50 % Processed clauses : 576
% 0.19/0.50 % ...of these trivial : 4
% 0.19/0.50 % ...subsumed : 276
% 0.19/0.50 % ...remaining for further processing : 296
% 0.19/0.50 % Other redundant clauses eliminated : 7
% 0.19/0.50 % Clauses deleted for lack of memory : 0
% 0.19/0.50 % Backward-subsumed : 6
% 0.19/0.50 % Backward-rewritten : 21
% 0.19/0.50 % Generated clauses : 1799
% 0.19/0.50 % ...of the previous two non-redundant : 1400
% 0.19/0.50 % ...aggressively subsumed : 0
% 0.19/0.50 % Contextual simplify-reflections : 5
% 0.19/0.50 % Paramodulations : 1788
% 0.19/0.50 % Factorizations : 4
% 0.19/0.50 % NegExts : 0
% 0.19/0.50 % Equation resolutions : 7
% 0.19/0.50 % Disequality decompositions : 0
% 0.19/0.50 % Total rewrite steps : 590
% 0.19/0.50 % ...of those cached : 491
% 0.19/0.50 % Propositional unsat checks : 0
% 0.19/0.50 % Propositional check models : 0
% 0.19/0.50 % Propositional check unsatisfiable : 0
% 0.19/0.50 % Propositional clauses : 0
% 0.19/0.50 % Propositional clauses after purity: 0
% 0.19/0.50 % Propositional unsat core size : 0
% 0.19/0.50 % Propositional preprocessing time : 0.000
% 0.19/0.50 % Propositional encoding time : 0.000
% 0.19/0.50 % Propositional solver time : 0.000
% 0.19/0.50 % Success case prop preproc time : 0.000
% 0.19/0.50 % Success case prop encoding time : 0.000
% 0.19/0.50 % Success case prop solver time : 0.000
% 0.19/0.50 % Current number of processed clauses : 266
% 0.19/0.50 % Positive orientable unit clauses : 46
% 0.19/0.50 % Positive unorientable unit clauses: 1
% 0.19/0.50 % Negative unit clauses : 3
% 0.19/0.50 % Non-unit-clauses : 216
% 0.19/0.50 % Current number of unprocessed clauses: 857
% 0.19/0.50 % ...number of literals in the above : 2552
% 0.19/0.50 % Current number of archived formulas : 0
% 0.19/0.50 % Current number of archived clauses : 42
% 0.19/0.50 % Clause-clause subsumption calls (NU) : 9024
% 0.19/0.50 % Rec. Clause-clause subsumption calls : 5937
% 0.19/0.50 % Non-unit clause-clause subsumptions : 219
% 0.19/0.50 % Unit Clause-clause subsumption calls : 533
% 0.19/0.50 % Rewrite failures with RHS unbound : 0
% 0.19/0.50 % BW rewrite match attempts : 30
% 0.19/0.50 % BW rewrite match successes : 17
% 0.19/0.50 % Condensation attempts : 0
% 0.19/0.50 % Condensation successes : 0
% 0.19/0.50 % Termbank termtop insertions : 52430
% 0.19/0.50 % Search garbage collected termcells : 156
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.058 s
% 0.19/0.50 % System time : 0.003 s
% 0.19/0.50 % Total time : 0.061 s
% 0.19/0.50 % Maximum resident set size: 3720 pages
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.219 s
% 0.19/0.50 % System time : 0.021 s
% 0.19/0.50 % Total time : 0.239 s
% 0.19/0.50 % Maximum resident set size: 4608 pages
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------