%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET260-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 : n009.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:16:57 PM UTC 2026
% Result : Unsatisfiable 3.17s 1.01s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 23 unt; 7 nHn; 40 RR)
% Number of literals : 115 ( 16 equ; 56 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 117 ( 21 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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(domain2,axiom,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',domain2) ).
cnf(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(cartesian_product3,axiom,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product3) ).
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(cartesian_product2,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product2) ).
cnf(prove_domain_alternate_defn3_2,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_alternate_defn3_2) ).
cnf(cartesian_product1,axiom,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cartesian_product1) ).
cnf(prove_domain_alternate_defn3_1,negated_conjecture,
member(ordered_pair(x,y),xr),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_alternate_defn3_1) ).
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(prove_domain_alternate_defn3_3,negated_conjecture,
~ member(x,domain_of(xr)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_alternate_defn3_3) ).
cnf(c_0_16,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
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_16 ).
cnf(c_0_19,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_17 ).
cnf(c_0_21,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_22,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class ),
inference(fof_simplification,[status(thm)],[domain2]) ).
cnf(c_0_24,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_27,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| restrict(X2,singleton(X1),universal_class) = null_class ),
c_0_23 ).
cnf(c_0_28,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_29,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_30,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
inference(fof_simplification,[status(thm)],[cartesian_product3]) ).
cnf(c_0_32,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_33,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
inference(fof_simplification,[status(thm)],[cartesian_product2]) ).
cnf(c_0_34,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_26 ).
cnf(c_0_35,plain,
( ~ member(X1,universal_class)
| member(X1,domain_of(X2))
| intersection(X2,cross_product(unordered_pair(X1,X1),universal_class)) = null_class ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_36,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_30]),c_0_22]) ).
cnf(c_0_37,plain,
( ~ member(X3,X4)
| ~ member(X1,X2)
| member(ordered_pair(X1,X3),cross_product(X2,X4)) ),
c_0_31 ).
cnf(c_0_38,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_32,c_0_28]),c_0_28]) ).
cnf(c_0_39,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X2,X4) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
member(ordered_pair(x,y),cross_product(universal_class,universal_class)),
prove_domain_alternate_defn3_2 ).
cnf(c_0_41,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[cartesian_product1]) ).
cnf(c_0_42,plain,
( ~ member(X3,X2)
| ~ member(X1,universal_class)
| ~ member(X3,cross_product(unordered_pair(X1,X1),universal_class))
| member(X1,domain_of(X2)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_43,plain,
( ~ member(X1,X2)
| ~ member(X3,X4)
| member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X3,X3))),cross_product(X2,X4)) ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
member(ordered_pair(x,y),xr),
prove_domain_alternate_defn3_1 ).
cnf(c_0_45,plain,
( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))
| member(X2,X4) ),
inference(rw,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),cross_product(universal_class,universal_class)),
inference(rw,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_47,plain,
( ~ member(ordered_pair(X1,X2),cross_product(X3,X4))
| member(X1,X3) ),
c_0_41 ).
cnf(c_0_48,plain,
( ~ member(X4,universal_class)
| ~ member(X1,universal_class)
| ~ member(X3,unordered_pair(X1,X1))
| ~ member(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,unordered_pair(X4,X4))),X2)
| member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
member(unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(y,y))),xr),
inference(rw,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_50,negated_conjecture,
member(y,universal_class),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_52,plain,
( ~ member(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))),cross_product(X3,X4))
| member(X1,X3) ),
inference(rw,[status(thm)],[c_0_47,c_0_38]) ).
cnf(c_0_53,negated_conjecture,
~ member(x,domain_of(xr)),
inference(fof_simplification,[status(thm)],[prove_domain_alternate_defn3_3]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(X1,universal_class)
| ~ member(x,unordered_pair(X1,X1))
| member(X1,domain_of(xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_55,plain,
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X1,X2)) ),
c_0_51 ).
cnf(c_0_56,negated_conjecture,
member(x,universal_class),
inference(spm,[status(thm)],[c_0_52,c_0_46]) ).
cnf(c_0_57,negated_conjecture,
~ member(x,domain_of(xr)),
c_0_53 ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET260-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 : n009.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 05:03:42 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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
% 3.17/1.01 % Version: 3.5.1
% 3.17/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.17/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.17/1.01 % Starting new_bool_3 with 300s (1) cores
% 3.17/1.01 % Starting new_bool_1 with 300s (1) cores
% 3.17/1.01 % Starting sh5l with 300s (1) cores
% 3.17/1.01 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 903927 completed with status 0
% 3.17/1.01 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.17/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.17/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.17/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/1.01 % No SInE strategy applied
% 3.17/1.01 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.17/1.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/1.01 % Starting SubtermCWHack with 136s (1) cores
% 3.17/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.17/1.01 % Starting new_bool_3 with 311s (1) cores
% 3.17/1.01 % Starting new_bool_1 with 308s (1) cores
% 3.17/1.01 % Starting sh5l with 304s (1) cores
% 3.17/1.01 % sh5l with pid 903938 completed with status 0
% 3.17/1.01 % Result found by sh5l
% 3.17/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 3.17/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.17/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.17/1.01 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.17/1.01 % No SInE strategy applied
% 3.17/1.01 % Search class: FGHSM-FFLM31-DFFFFFNN
% 3.17/1.01 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.17/1.01 % Starting SubtermCWHack with 136s (1) cores
% 3.17/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.17/1.01 % Starting new_bool_3 with 311s (1) cores
% 3.17/1.01 % Starting new_bool_1 with 308s (1) cores
% 3.17/1.01 % Starting sh5l with 304s (1) cores
% 3.17/1.01 % Preprocessing time : 0.005 s
% 3.17/1.01 % Presaturation interreduction done
% 3.17/1.01
% 3.17/1.01 % Proof found!
% 3.17/1.01 % SZS status Unsatisfiable
% 3.17/1.01 % SZS output start CNFRefutation
% See solution above
% 3.17/1.01 % Parsed axioms : 115
% 3.17/1.01 % Removed by relevancy pruning/SinE : 0
% 3.17/1.01 % Initial clauses : 115
% 3.17/1.01 % Removed in clause preprocessing : 17
% 3.17/1.01 % Initial clauses in saturation : 98
% 3.17/1.01 % Processed clauses : 2375
% 3.17/1.01 % ...of these trivial : 2
% 3.17/1.01 % ...subsumed : 1516
% 3.17/1.01 % ...remaining for further processing : 857
% 3.17/1.01 % Other redundant clauses eliminated : 8
% 3.17/1.01 % Clauses deleted for lack of memory : 0
% 3.17/1.01 % Backward-subsumed : 43
% 3.17/1.01 % Backward-rewritten : 45
% 3.17/1.01 % Generated clauses : 8252
% 3.17/1.01 % ...of the previous two non-redundant : 7235
% 3.17/1.01 % ...aggressively subsumed : 0
% 3.17/1.01 % Contextual simplify-reflections : 24
% 3.17/1.01 % Paramodulations : 8240
% 3.17/1.01 % Factorizations : 4
% 3.17/1.01 % NegExts : 0
% 3.17/1.01 % Equation resolutions : 8
% 3.17/1.01 % Disequality decompositions : 0
% 3.17/1.01 % Total rewrite steps : 4168
% 3.17/1.01 % ...of those cached : 3922
% 3.17/1.01 % Propositional unsat checks : 0
% 3.17/1.01 % Propositional check models : 0
% 3.17/1.01 % Propositional check unsatisfiable : 0
% 3.17/1.01 % Propositional clauses : 0
% 3.17/1.01 % Propositional clauses after purity: 0
% 3.17/1.01 % Propositional unsat core size : 0
% 3.17/1.01 % Propositional preprocessing time : 0.000
% 3.17/1.01 % Propositional encoding time : 0.000
% 3.17/1.01 % Propositional solver time : 0.000
% 3.17/1.01 % Success case prop preproc time : 0.000
% 3.17/1.01 % Success case prop encoding time : 0.000
% 3.17/1.01 % Success case prop solver time : 0.000
% 3.17/1.01 % Current number of processed clauses : 668
% 3.17/1.01 % Positive orientable unit clauses : 74
% 3.17/1.01 % Positive unorientable unit clauses: 1
% 3.17/1.01 % Negative unit clauses : 3
% 3.17/1.01 % Non-unit-clauses : 590
% 3.17/1.01 % Current number of unprocessed clauses: 4967
% 3.17/1.01 % ...number of literals in the above : 16438
% 3.17/1.01 % Current number of archived formulas : 0
% 3.17/1.01 % Current number of archived clauses : 202
% 3.17/1.01 % Clause-clause subsumption calls (NU) : 70245
% 3.17/1.01 % Rec. Clause-clause subsumption calls : 51614
% 3.17/1.01 % Non-unit clause-clause subsumptions : 1375
% 3.17/1.01 % Unit Clause-clause subsumption calls : 1278
% 3.17/1.01 % Rewrite failures with RHS unbound : 0
% 3.17/1.01 % BW rewrite match attempts : 58
% 3.17/1.01 % BW rewrite match successes : 20
% 3.17/1.01 % Condensation attempts : 2375
% 3.17/1.01 % Condensation successes : 58
% 3.17/1.01 % Termbank termtop insertions : 177385
% 3.17/1.01 % Search garbage collected termcells : 185
% 3.17/1.01
% 3.17/1.01 % -------------------------------------------------
% 3.17/1.01 % User time : 0.405 s
% 3.17/1.01 % System time : 0.029 s
% 3.17/1.01 % Total time : 0.434 s
% 3.17/1.01 % Maximum resident set size: 3488 pages
% 3.17/1.01
% 3.17/1.01 % -------------------------------------------------
% 3.17/1.01 % User time : 1.870 s
% 3.17/1.01 % System time : 0.102 s
% 3.17/1.01 % Total time : 1.972 s
% 3.17/1.01 % Maximum resident set size: 4864 pages
% 3.17/1.01 % E exiting
%------------------------------------------------------------------------------