%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET103-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 : n005.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:36 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.72s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 16 unt; 9 nHn; 16 RR)
% Number of literals : 49 ( 25 equ; 17 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(prove_property_1_of_ordered_pair_1,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_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/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(prove_property_1_of_ordered_pair_2,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_property_1_of_ordered_pair_2) ).
cnf(c_0_8,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( ~ member(X1,unordered_pair(X2,X3))
| X1 = X3
| X1 = X2 ),
c_0_9 ).
cnf(c_0_13,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,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_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,y),
inference(fof_simplification,[status(thm)],[prove_property_1_of_ordered_pair_1]) ).
cnf(c_0_17,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_18,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_19,negated_conjecture,
~ member(y,universal_class),
inference(fof_simplification,[status(thm)],[prove_property_1_of_ordered_pair_2]) ).
cnf(c_0_20,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,plain,
( unordered_pair(X1,X1) = null_class
| regular(unordered_pair(X1,X1)) = X1 ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_15])]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,y),
c_0_16 ).
cnf(c_0_23,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
~ member(y,universal_class),
c_0_19 ).
cnf(c_0_25,plain,
( member(X1,universal_class)
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_18]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
unordered_pair(y,y) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_26,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET103-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46 % Computer : n005.cluster.edu
% 0.21/0.46 % Model : x86_64 x86_64
% 0.21/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46 % Memory : 8046.5625MB
% 0.21/0.46 % OS : Linux 6.8.0-71-generic
% 0.21/0.46 % CPULimit : 300
% 0.21/0.46 % WCLimit : 300
% 0.21/0.46 % DateTime : Mon Sep 21 04:52:47 UTC 2026
% 0.21/0.47 % CPUTime :
% 0.21/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.55 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.31/0.72 % Version: 3.5.1
% 0.31/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.72 % Starting sh5l with 300s (1) cores
% 0.31/0.72 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2595834 completed with status 0
% 0.31/0.72 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.31/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.72 % No SInE strategy applied
% 0.31/0.72 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.31/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.31/0.72 % Starting new_bool_3 with 311s (1) cores
% 0.31/0.72 % Starting new_bool_1 with 308s (1) cores
% 0.31/0.72 % Starting sh5l with 304s (1) cores
% 0.31/0.72 % SubtermCWHack with pid 2595841 completed with status 0
% 0.31/0.72 % Result found by SubtermCWHack
% 0.31/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.31/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.31/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.72 % No SInE strategy applied
% 0.31/0.72 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.31/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.72 % Preprocessing time : 0.004 s
% 0.31/0.72
% 0.31/0.72 % Proof found!
% 0.31/0.72 % SZS status Unsatisfiable
% 0.31/0.72 % SZS output start CNFRefutation
% See solution above
% 0.31/0.72 % Parsed axioms : 93
% 0.31/0.72 % Removed by relevancy pruning/SinE : 0
% 0.31/0.72 % Initial clauses : 93
% 0.31/0.72 % Removed in clause preprocessing : 15
% 0.31/0.72 % Initial clauses in saturation : 78
% 0.31/0.72 % Processed clauses : 721
% 0.31/0.72 % ...of these trivial : 4
% 0.31/0.72 % ...subsumed : 376
% 0.31/0.72 % ...remaining for further processing : 341
% 0.31/0.72 % Other redundant clauses eliminated : 7
% 0.31/0.72 % Clauses deleted for lack of memory : 0
% 0.31/0.72 % Backward-subsumed : 8
% 0.31/0.72 % Backward-rewritten : 11
% 0.31/0.72 % Generated clauses : 2477
% 0.31/0.72 % ...of the previous two non-redundant : 1991
% 0.31/0.72 % ...aggressively subsumed : 0
% 0.31/0.72 % Contextual simplify-reflections : 6
% 0.31/0.72 % Paramodulations : 2466
% 0.31/0.72 % Factorizations : 4
% 0.31/0.72 % NegExts : 0
% 0.31/0.72 % Equation resolutions : 7
% 0.31/0.72 % Disequality decompositions : 0
% 0.31/0.72 % Total rewrite steps : 833
% 0.31/0.72 % ...of those cached : 729
% 0.31/0.72 % Propositional unsat checks : 0
% 0.31/0.72 % Propositional check models : 0
% 0.31/0.72 % Propositional check unsatisfiable : 0
% 0.31/0.72 % Propositional clauses : 0
% 0.31/0.72 % Propositional clauses after purity: 0
% 0.31/0.72 % Propositional unsat core size : 0
% 0.31/0.72 % Propositional preprocessing time : 0.000
% 0.31/0.72 % Propositional encoding time : 0.000
% 0.31/0.72 % Propositional solver time : 0.000
% 0.31/0.72 % Success case prop preproc time : 0.000
% 0.31/0.72 % Success case prop encoding time : 0.000
% 0.31/0.72 % Success case prop solver time : 0.000
% 0.31/0.72 % Current number of processed clauses : 319
% 0.31/0.72 % Positive orientable unit clauses : 55
% 0.31/0.72 % Positive unorientable unit clauses: 1
% 0.31/0.72 % Negative unit clauses : 3
% 0.31/0.72 % Non-unit-clauses : 260
% 0.31/0.72 % Current number of unprocessed clauses: 1294
% 0.31/0.72 % ...number of literals in the above : 4002
% 0.31/0.72 % Current number of archived formulas : 0
% 0.31/0.72 % Current number of archived clauses : 34
% 0.31/0.72 % Clause-clause subsumption calls (NU) : 16422
% 0.31/0.72 % Rec. Clause-clause subsumption calls : 8360
% 0.31/0.72 % Non-unit clause-clause subsumptions : 318
% 0.31/0.72 % Unit Clause-clause subsumption calls : 875
% 0.31/0.72 % Rewrite failures with RHS unbound : 0
% 0.31/0.72 % BW rewrite match attempts : 29
% 0.31/0.72 % BW rewrite match successes : 12
% 0.31/0.72 % Condensation attempts : 0
% 0.31/0.72 % Condensation successes : 0
% 0.31/0.72 % Termbank termtop insertions : 64533
% 0.31/0.73 % Search garbage collected termcells : 158
% 0.31/0.73
% 0.31/0.73 % -------------------------------------------------
% 0.31/0.73 % User time : 0.112 s
% 0.31/0.73 % System time : 0.009 s
% 0.31/0.73 % Total time : 0.122 s
% 0.31/0.73 % Maximum resident set size: 3976 pages
% 0.31/0.73
% 0.31/0.73 % -------------------------------------------------
% 0.31/0.73 % User time : 0.387 s
% 0.31/0.73 % System time : 0.035 s
% 0.31/0.73 % Total time : 0.422 s
% 0.31/0.73 % Maximum resident set size: 4864 pages
% 0.31/0.73 % E exiting
%------------------------------------------------------------------------------