%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET188-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 : n006.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:51 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 10 unt; 9 nHn; 24 RR)
% Number of literals : 69 ( 7 equ; 33 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 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(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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(prove_subclass_property6_1,negated_conjecture,
intersection(complement(y),x) = null_class,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property6_1) ).
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_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(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(prove_subclass_property6_2,negated_conjecture,
~ subclass(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subclass_property6_2) ).
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,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_10 ).
cnf(c_0_13,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_11 ).
cnf(c_0_15,axiom,
( member(regular(X1),X1)
| X1 = null_class ),
regularity1 ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( ~ member(regular(complement(X1)),X1)
| complement(X1) = null_class ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( member(regular(X1),universal_class)
| X1 = null_class ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_20,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_19 ).
cnf(c_0_22,negated_conjecture,
intersection(complement(y),x) = null_class,
prove_subclass_property6_1 ).
cnf(c_0_23,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16]) ).
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,negated_conjecture,
( ~ member(X1,x)
| ~ member(X1,complement(y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_24 ).
cnf(c_0_27,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,x)
| member(X1,y) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]) ).
cnf(c_0_29,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_30,negated_conjecture,
~ subclass(x,y),
inference(fof_simplification,[status(thm)],[prove_subclass_property6_2]) ).
cnf(c_0_31,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( subclass(x,X1)
| member(not_subclass_element(x,X1),y) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
~ subclass(x,y),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET188-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.11/0.38 % Computer : n006.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 04:59:12 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.16/0.47 % Version: 3.5.1
% 0.16/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 % Starting sh5l with 300s (1) cores
% 0.16/0.47 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2052410 completed with status 0
% 0.16/0.47 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.47 % No SInE strategy applied
% 0.16/0.47 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.47 % Starting new_bool_3 with 311s (1) cores
% 0.16/0.47 % Starting new_bool_1 with 308s (1) cores
% 0.16/0.47 % Starting sh5l with 304s (1) cores
% 0.16/0.47 % SubtermCWHack with pid 2052417 completed with status 0
% 0.16/0.47 % Result found by SubtermCWHack
% 0.16/0.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.47 % No SInE strategy applied
% 0.16/0.47 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.47 % Preprocessing time : 0.003 s
% 0.16/0.47
% 0.16/0.47 % Proof found!
% 0.16/0.47 % SZS status Unsatisfiable
% 0.16/0.47 % SZS output start CNFRefutation
% See solution above
% 0.16/0.47 % Parsed axioms : 114
% 0.16/0.47 % Removed by relevancy pruning/SinE : 0
% 0.16/0.47 % Initial clauses : 114
% 0.16/0.47 % Removed in clause preprocessing : 17
% 0.16/0.47 % Initial clauses in saturation : 97
% 0.16/0.47 % Processed clauses : 106
% 0.16/0.47 % ...of these trivial : 0
% 0.16/0.47 % ...subsumed : 17
% 0.16/0.47 % ...remaining for further processing : 89
% 0.16/0.47 % Other redundant clauses eliminated : 2
% 0.16/0.47 % Clauses deleted for lack of memory : 0
% 0.16/0.47 % Backward-subsumed : 7
% 0.16/0.47 % Backward-rewritten : 2
% 0.16/0.47 % Generated clauses : 127
% 0.16/0.47 % ...of the previous two non-redundant : 112
% 0.16/0.47 % ...aggressively subsumed : 0
% 0.16/0.47 % Contextual simplify-reflections : 2
% 0.16/0.47 % Paramodulations : 125
% 0.16/0.47 % Factorizations : 0
% 0.16/0.47 % NegExts : 0
% 0.16/0.47 % Equation resolutions : 2
% 0.16/0.47 % Disequality decompositions : 0
% 0.16/0.47 % Total rewrite steps : 8
% 0.16/0.47 % ...of those cached : 1
% 0.16/0.47 % Propositional unsat checks : 0
% 0.16/0.47 % Propositional check models : 0
% 0.16/0.47 % Propositional check unsatisfiable : 0
% 0.16/0.47 % Propositional clauses : 0
% 0.16/0.47 % Propositional clauses after purity: 0
% 0.16/0.47 % Propositional unsat core size : 0
% 0.16/0.47 % Propositional preprocessing time : 0.000
% 0.16/0.47 % Propositional encoding time : 0.000
% 0.16/0.47 % Propositional solver time : 0.000
% 0.16/0.47 % Success case prop preproc time : 0.000
% 0.16/0.47 % Success case prop encoding time : 0.000
% 0.16/0.47 % Success case prop solver time : 0.000
% 0.16/0.47 % Current number of processed clauses : 78
% 0.16/0.47 % Positive orientable unit clauses : 24
% 0.16/0.47 % Positive unorientable unit clauses: 1
% 0.16/0.47 % Negative unit clauses : 2
% 0.16/0.47 % Non-unit-clauses : 51
% 0.16/0.47 % Current number of unprocessed clauses: 101
% 0.16/0.47 % ...number of literals in the above : 239
% 0.16/0.47 % Current number of archived formulas : 0
% 0.16/0.47 % Current number of archived clauses : 26
% 0.16/0.47 % Clause-clause subsumption calls (NU) : 571
% 0.16/0.47 % Rec. Clause-clause subsumption calls : 311
% 0.16/0.47 % Non-unit clause-clause subsumptions : 18
% 0.16/0.47 % Unit Clause-clause subsumption calls : 48
% 0.16/0.47 % Rewrite failures with RHS unbound : 0
% 0.16/0.47 % BW rewrite match attempts : 8
% 0.16/0.47 % BW rewrite match successes : 2
% 0.16/0.47 % Condensation attempts : 0
% 0.16/0.47 % Condensation successes : 0
% 0.16/0.47 % Termbank termtop insertions : 6208
% 0.16/0.47 % Search garbage collected termcells : 185
% 0.16/0.47
% 0.16/0.47 % -------------------------------------------------
% 0.16/0.47 % User time : 0.009 s
% 0.16/0.47 % System time : 0.008 s
% 0.16/0.47 % Total time : 0.018 s
% 0.16/0.47 % Maximum resident set size: 4000 pages
% 0.16/0.47
% 0.16/0.47 % -------------------------------------------------
% 0.16/0.47 % User time : 0.040 s
% 0.16/0.47 % System time : 0.024 s
% 0.16/0.47 % Total time : 0.064 s
% 0.16/0.47 % Maximum resident set size: 4608 pages
% 0.16/0.47 % E exiting
%------------------------------------------------------------------------------