%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET163-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 : 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:16:45 PM UTC 2026
% Result : Unsatisfiable 0.12s 5.47s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 15 unt; 11 nHn; 25 RR)
% Number of literals : 82 ( 19 equ; 35 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; 3 con; 0-2 aty)
% Number of variables : 70 ( 10 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(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(regularity1,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_union_with_universal_class_1,negated_conjecture,
union(universal_class,x) != universal_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_with_universal_class_1) ).
cnf(c_0_11,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
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_11 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_12 ).
cnf(c_0_16,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_20,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_21,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_20 ).
cnf(c_0_23,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_24,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_25,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_26,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_27,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_17]) ).
cnf(c_0_28,plain,
( member(regular(intersection(X1,X2)),X1)
| intersection(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_29,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_30,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_23 ).
cnf(c_0_31,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_24 ).
cnf(c_0_32,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
union(universal_class,x) != universal_class,
inference(fof_simplification,[status(thm)],[prove_union_with_universal_class_1]) ).
cnf(c_0_34,plain,
complement(intersection(null_class,complement(X1))) = union(universal_class,X1),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_35,plain,
intersection(null_class,X1) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_36,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_29 ).
cnf(c_0_37,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_38,negated_conjecture,
union(universal_class,x) != universal_class,
c_0_33 ).
cnf(c_0_39,plain,
union(universal_class,X1) = complement(null_class),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ subclass(universal_class,X1)
| universal_class = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_41,plain,
subclass(X1,complement(null_class)),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
complement(null_class) != universal_class,
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET163-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/5.35 % Computer : n005.cluster.edu
% 0.08/5.35 % Model : x86_64 x86_64
% 0.08/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.35 % Memory : 8046.5625MB
% 0.08/5.35 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Mon Sep 21 04:57:39 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/5.39 Running first-order theorem proving
% 0.08/5.39 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.12/5.46 % Version: 3.5.1
% 0.12/5.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.46 % Starting sh5l with 300s (1) cores
% 0.12/5.46 % sh5l with pid 2603715 completed with status 0
% 0.12/5.46 % Result found by sh5l
% 0.12/5.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.46 % Starting sh5l with 300s (1) cores
% 0.12/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/5.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/5.46 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.12/5.46 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.46 % Starting SubtermCWHack with 28s (1) cores
% 0.12/5.46 % SubtermCWHack with pid 2603718 completed with status 0
% 0.12/5.47 % Result found by SubtermCWHack
% 0.12/5.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/5.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/5.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/5.47 % Starting new_bool_3 with 300s (1) cores
% 0.12/5.47 % Starting new_bool_1 with 300s (1) cores
% 0.12/5.47 % Starting sh5l with 300s (1) cores
% 0.12/5.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/5.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/5.47 % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.12/5.47 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.12/5.47 % Starting SubtermCWHack with 28s (1) cores
% 0.12/5.47 % Preprocessing time : 0.003 s
% 0.12/5.47
% 0.12/5.47 % Proof found!
% 0.12/5.47 % SZS status Unsatisfiable
% 0.12/5.47 % SZS output start CNFRefutation
% See solution above
% 0.12/5.47 % Parsed axioms : 113
% 0.12/5.47 % Removed by relevancy pruning/SinE : 14
% 0.12/5.47 % Initial clauses : 99
% 0.12/5.47 % Removed in clause preprocessing : 0
% 0.12/5.47 % Initial clauses in saturation : 99
% 0.12/5.47 % Processed clauses : 562
% 0.12/5.47 % ...of these trivial : 3
% 0.12/5.47 % ...subsumed : 208
% 0.12/5.47 % ...remaining for further processing : 351
% 0.12/5.47 % Other redundant clauses eliminated : 3
% 0.12/5.47 % Clauses deleted for lack of memory : 0
% 0.12/5.47 % Backward-subsumed : 16
% 0.12/5.47 % Backward-rewritten : 8
% 0.12/5.47 % Generated clauses : 2012
% 0.12/5.47 % ...of the previous two non-redundant : 1713
% 0.12/5.47 % ...aggressively subsumed : 0
% 0.12/5.47 % Contextual simplify-reflections : 2
% 0.12/5.47 % Paramodulations : 2009
% 0.12/5.47 % Factorizations : 0
% 0.12/5.47 % NegExts : 0
% 0.12/5.47 % Equation resolutions : 3
% 0.12/5.47 % Disequality decompositions : 0
% 0.12/5.47 % Total rewrite steps : 423
% 0.12/5.47 % ...of those cached : 327
% 0.12/5.47 % Propositional unsat checks : 0
% 0.12/5.47 % Propositional check models : 0
% 0.12/5.47 % Propositional check unsatisfiable : 0
% 0.12/5.47 % Propositional clauses : 0
% 0.12/5.47 % Propositional clauses after purity: 0
% 0.12/5.47 % Propositional unsat core size : 0
% 0.12/5.47 % Propositional preprocessing time : 0.000
% 0.12/5.47 % Propositional encoding time : 0.000
% 0.12/5.47 % Propositional solver time : 0.000
% 0.12/5.47 % Success case prop preproc time : 0.000
% 0.12/5.47 % Success case prop encoding time : 0.000
% 0.12/5.47 % Success case prop solver time : 0.000
% 0.12/5.47 % Current number of processed clauses : 324
% 0.12/5.47 % Positive orientable unit clauses : 77
% 0.12/5.47 % Positive unorientable unit clauses: 8
% 0.12/5.47 % Negative unit clauses : 10
% 0.12/5.47 % Non-unit-clauses : 229
% 0.12/5.47 % Current number of unprocessed clauses: 1211
% 0.12/5.47 % ...number of literals in the above : 3078
% 0.12/5.47 % Current number of archived formulas : 0
% 0.12/5.47 % Current number of archived clauses : 24
% 0.12/5.47 % Clause-clause subsumption calls (NU) : 9492
% 0.12/5.47 % Rec. Clause-clause subsumption calls : 7891
% 0.12/5.47 % Non-unit clause-clause subsumptions : 147
% 0.12/5.47 % Unit Clause-clause subsumption calls : 690
% 0.12/5.47 % Rewrite failures with RHS unbound : 50
% 0.12/5.47 % BW rewrite match attempts : 28
% 0.12/5.47 % BW rewrite match successes : 15
% 0.12/5.47 % Condensation attempts : 0
% 0.12/5.47 % Condensation successes : 0
% 0.12/5.47 % Termbank termtop insertions : 26132
% 0.12/5.47 % Search garbage collected termcells : 229
% 0.12/5.47
% 0.12/5.47 % -------------------------------------------------
% 0.12/5.47 % User time : 0.042 s
% 0.12/5.47 % System time : 0.009 s
% 0.12/5.47 % Total time : 0.051 s
% 0.12/5.47 % Maximum resident set size: 3736 pages
% 0.12/5.47
% 0.12/5.47 % -------------------------------------------------
% 0.12/5.47 % User time : 0.047 s
% 0.12/5.47 % System time : 0.012 s
% 0.12/5.47 % Total time : 0.059 s
% 0.12/5.47 % Maximum resident set size: 4864 pages
% 0.12/5.47 % E exiting
%------------------------------------------------------------------------------