%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET511-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 : n011.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:18 PM UTC 2026
% Result : Unsatisfiable 0.60s 0.54s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 38 ( 14 unt; 10 nHn; 24 RR)
% Number of literals : 72 ( 31 equ; 31 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(unordered_pair_member,axiom,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(regularity2,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(prove_corollary_1_to_property_1_of_ordered_pair_1,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_property_1_of_ordered_pair_1) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_11,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_11 ).
cnf(c_0_16,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_18,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ member(X1,singleton(X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_24,axiom,
( intersection(X1,regular(X1)) = null_class
| X1 = null_class ),
regularity2 ).
cnf(c_0_25,plain,
( singleton(X1) = null_class
| regular(singleton(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_26,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_23 ).
cnf(c_0_28,plain,
( singleton(X1) = null_class
| intersection(singleton(X1),X1) = null_class ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_26]),c_0_19]) ).
cnf(c_0_30,plain,
( ~ member(X2,X1)
| ~ member(X2,singleton(X1))
| singleton(X1) = null_class ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
( ~ member(regular(singleton(X1)),X1)
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_32,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_property_1_of_ordered_pair_1]) ).
cnf(c_0_33,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_34,plain,
singleton(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
c_0_32 ).
cnf(c_0_36,plain,
unordered_pair(singleton(X1),unordered_pair(X1,null_class)) = ordered_pair(X1,universal_class),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET511-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.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 05:22:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/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.60/0.54 % Version: 3.5.1
% 0.60/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.54 % Starting sh5l with 300s (1) cores
% 0.60/0.54 % sh5l with pid 1047955 completed with status 0
% 0.60/0.54 % Result found by sh5l
% 0.60/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.54 % Starting sh5l with 300s (1) cores
% 0.60/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.60/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.60/0.54 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.60/0.54 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.60/0.54 % SubtermCWHack with pid 1047956 completed with status 0
% 0.60/0.54 % Result found by SubtermCWHack
% 0.60/0.54 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.54 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.54 % Starting sh5l with 300s (1) cores
% 0.60/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.60/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.60/0.54 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.60/0.54 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.60/0.54 % Starting SubtermCWHack with 28s (1) cores
% 0.60/0.54 % Preprocessing time : 0.003 s
% 0.60/0.54
% 0.60/0.54 % Proof found!
% 0.60/0.54 % SZS status Unsatisfiable
% 0.60/0.54 % SZS output start CNFRefutation
% See solution above
% 0.60/0.54 % Parsed axioms : 113
% 0.60/0.54 % Removed by relevancy pruning/SinE : 14
% 0.60/0.54 % Initial clauses : 99
% 0.60/0.54 % Removed in clause preprocessing : 0
% 0.60/0.54 % Initial clauses in saturation : 99
% 0.60/0.54 % Processed clauses : 1159
% 0.60/0.54 % ...of these trivial : 19
% 0.60/0.54 % ...subsumed : 535
% 0.60/0.54 % ...remaining for further processing : 605
% 0.60/0.54 % Other redundant clauses eliminated : 9
% 0.60/0.54 % Clauses deleted for lack of memory : 0
% 0.60/0.54 % Backward-subsumed : 23
% 0.60/0.54 % Backward-rewritten : 31
% 0.60/0.54 % Generated clauses : 5914
% 0.60/0.54 % ...of the previous two non-redundant : 5075
% 0.60/0.54 % ...aggressively subsumed : 0
% 0.60/0.54 % Contextual simplify-reflections : 5
% 0.60/0.54 % Paramodulations : 5899
% 0.60/0.54 % Factorizations : 6
% 0.60/0.54 % NegExts : 0
% 0.60/0.54 % Equation resolutions : 9
% 0.60/0.54 % Disequality decompositions : 0
% 0.60/0.54 % Total rewrite steps : 1465
% 0.60/0.54 % ...of those cached : 1225
% 0.60/0.54 % Propositional unsat checks : 0
% 0.60/0.54 % Propositional check models : 0
% 0.60/0.54 % Propositional check unsatisfiable : 0
% 0.60/0.54 % Propositional clauses : 0
% 0.60/0.54 % Propositional clauses after purity: 0
% 0.60/0.54 % Propositional unsat core size : 0
% 0.60/0.54 % Propositional preprocessing time : 0.000
% 0.60/0.54 % Propositional encoding time : 0.000
% 0.60/0.54 % Propositional solver time : 0.000
% 0.60/0.54 % Success case prop preproc time : 0.000
% 0.60/0.54 % Success case prop encoding time : 0.000
% 0.60/0.54 % Success case prop solver time : 0.000
% 0.60/0.54 % Current number of processed clauses : 548
% 0.60/0.54 % Positive orientable unit clauses : 120
% 0.60/0.54 % Positive unorientable unit clauses: 6
% 0.60/0.54 % Negative unit clauses : 19
% 0.60/0.54 % Non-unit-clauses : 403
% 0.60/0.54 % Current number of unprocessed clauses: 3879
% 0.60/0.54 % ...number of literals in the above : 9489
% 0.60/0.54 % Current number of archived formulas : 0
% 0.60/0.54 % Current number of archived clauses : 54
% 0.60/0.54 % Clause-clause subsumption calls (NU) : 24222
% 0.60/0.54 % Rec. Clause-clause subsumption calls : 20883
% 0.60/0.54 % Non-unit clause-clause subsumptions : 350
% 0.60/0.54 % Unit Clause-clause subsumption calls : 3050
% 0.60/0.54 % Rewrite failures with RHS unbound : 38
% 0.60/0.54 % BW rewrite match attempts : 34
% 0.60/0.54 % BW rewrite match successes : 19
% 0.60/0.54 % Condensation attempts : 0
% 0.60/0.54 % Condensation successes : 0
% 0.60/0.54 % Termbank termtop insertions : 73386
% 0.60/0.54 % Search garbage collected termcells : 229
% 0.60/0.54
% 0.60/0.54 % -------------------------------------------------
% 0.60/0.54 % User time : 0.109 s
% 0.60/0.54 % System time : 0.007 s
% 0.60/0.54 % Total time : 0.116 s
% 0.60/0.54 % Maximum resident set size: 3736 pages
% 0.60/0.54
% 0.60/0.54 % -------------------------------------------------
% 0.60/0.54 % User time : 0.111 s
% 0.60/0.54 % System time : 0.013 s
% 0.60/0.54 % Total time : 0.124 s
% 0.60/0.54 % Maximum resident set size: 4864 pages
% 0.60/0.54 % E exiting
%------------------------------------------------------------------------------