%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET147-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 : n015.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:44 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.50s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 9 unt; 4 nHn; 22 RR)
% Number of literals : 63 ( 7 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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(intersection3,axiom,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection3) ).
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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(intersection2,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection2) ).
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(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_identity_for_intersection_1,negated_conjecture,
intersection(universal_class,x) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_identity_for_intersection_1) ).
cnf(c_0_8,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_9,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
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(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_8 ).
cnf(c_0_12,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
c_0_9 ).
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,intersection(X2,X3))
| member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_16,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X3)),X2)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| subclass(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X3) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_21,plain,
( ~ member(not_subclass_element(X1,intersection(X2,X1)),X2)
| subclass(X1,intersection(X2,X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
( subclass(intersection(X1,X2),X3)
| member(not_subclass_element(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
intersection(universal_class,x) != x,
inference(fof_simplification,[status(thm)],[prove_identity_for_intersection_1]) ).
cnf(c_0_25,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_20 ).
cnf(c_0_26,plain,
subclass(X1,intersection(universal_class,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_11,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
intersection(universal_class,x) != x,
c_0_24 ).
cnf(c_0_29,plain,
intersection(universal_class,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET147-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.37 % Computer : n015.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:59:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.50 % Version: 3.5.1
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.50 % Starting sh5l with 300s (1) cores
% 0.14/0.50 % new_bool_1 with pid 611945 completed with status 9
% 0.14/0.50 % new_bool_3 with pid 611944 completed with status 9
% 0.14/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 611943 completed with status 0
% 0.14/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.50 % Starting new_bool_3 with 311s (1) cores
% 0.14/0.50 % Starting new_bool_1 with 308s (1) cores
% 0.14/0.50 % Starting sh5l with 304s (1) cores
% 0.14/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 611953 completed with status 0
% 0.14/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.14/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.50 % No SInE strategy applied
% 0.14/0.50 % Search class: FGHSM-FFLM31-DFFFFFNN
% 0.14/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.14/0.50 % Preprocessing time : 0.003 s
% 0.14/0.50 % Presaturation interreduction done
% 0.14/0.50
% 0.14/0.50 % Proof found!
% 0.14/0.50 % SZS status Unsatisfiable
% 0.14/0.50 % SZS output start CNFRefutation
% See solution above
% 0.14/0.50 % Parsed axioms : 113
% 0.14/0.50 % Removed by relevancy pruning/SinE : 0
% 0.14/0.50 % Initial clauses : 113
% 0.14/0.50 % Removed in clause preprocessing : 17
% 0.14/0.50 % Initial clauses in saturation : 96
% 0.14/0.50 % Processed clauses : 541
% 0.14/0.50 % ...of these trivial : 4
% 0.14/0.50 % ...subsumed : 142
% 0.14/0.50 % ...remaining for further processing : 395
% 0.14/0.50 % Other redundant clauses eliminated : 6
% 0.14/0.50 % Clauses deleted for lack of memory : 0
% 0.14/0.50 % Backward-subsumed : 7
% 0.14/0.50 % Backward-rewritten : 35
% 0.14/0.50 % Generated clauses : 1135
% 0.14/0.50 % ...of the previous two non-redundant : 1006
% 0.14/0.50 % ...aggressively subsumed : 0
% 0.14/0.50 % Contextual simplify-reflections : 7
% 0.14/0.50 % Paramodulations : 1127
% 0.14/0.50 % Factorizations : 2
% 0.14/0.50 % NegExts : 0
% 0.14/0.50 % Equation resolutions : 6
% 0.14/0.50 % Disequality decompositions : 0
% 0.14/0.50 % Total rewrite steps : 198
% 0.14/0.50 % ...of those cached : 143
% 0.14/0.50 % Propositional unsat checks : 0
% 0.14/0.50 % Propositional check models : 0
% 0.14/0.50 % Propositional check unsatisfiable : 0
% 0.14/0.50 % Propositional clauses : 0
% 0.14/0.50 % Propositional clauses after purity: 0
% 0.14/0.50 % Propositional unsat core size : 0
% 0.14/0.50 % Propositional preprocessing time : 0.000
% 0.14/0.50 % Propositional encoding time : 0.000
% 0.14/0.50 % Propositional solver time : 0.000
% 0.14/0.50 % Success case prop preproc time : 0.000
% 0.14/0.50 % Success case prop encoding time : 0.000
% 0.14/0.50 % Success case prop solver time : 0.000
% 0.14/0.50 % Current number of processed clauses : 254
% 0.14/0.50 % Positive orientable unit clauses : 43
% 0.14/0.50 % Positive unorientable unit clauses: 1
% 0.14/0.50 % Negative unit clauses : 2
% 0.14/0.50 % Non-unit-clauses : 208
% 0.14/0.50 % Current number of unprocessed clauses: 619
% 0.14/0.50 % ...number of literals in the above : 1816
% 0.14/0.50 % Current number of archived formulas : 0
% 0.14/0.50 % Current number of archived clauses : 154
% 0.14/0.50 % Clause-clause subsumption calls (NU) : 8046
% 0.14/0.50 % Rec. Clause-clause subsumption calls : 5260
% 0.14/0.50 % Non-unit clause-clause subsumptions : 123
% 0.14/0.50 % Unit Clause-clause subsumption calls : 524
% 0.14/0.50 % Rewrite failures with RHS unbound : 0
% 0.14/0.50 % BW rewrite match attempts : 60
% 0.14/0.50 % BW rewrite match successes : 11
% 0.14/0.50 % Condensation attempts : 0
% 0.14/0.50 % Condensation successes : 0
% 0.14/0.50 % Termbank termtop insertions : 36577
% 0.14/0.50 % Search garbage collected termcells : 185
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.063 s
% 0.14/0.50 % System time : 0.006 s
% 0.14/0.50 % Total time : 0.068 s
% 0.14/0.50 % Maximum resident set size: 3992 pages
% 0.14/0.50
% 0.14/0.50 % -------------------------------------------------
% 0.14/0.50 % User time : 0.346 s
% 0.14/0.50 % System time : 0.062 s
% 0.14/0.50 % Total time : 0.409 s
% 0.14/0.50 % Maximum resident set size: 4864 pages
% 0.14/0.50 % E exiting
%------------------------------------------------------------------------------