%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM142-1 : 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 01:44:25 PM UTC 2026
% Result : Unsatisfiable 8.56s 1.60s
% Output : CNFRefutation 8.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 47 ( 18 unt; 9 nHn; 25 RR)
% Number of literals : 85 ( 12 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 7 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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(intersection1,axiom,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_successor_of_set_is_set3_1,negated_conjecture,
~ subclass(x,successor(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_successor_of_set_is_set3_1) ).
cnf(successor,axiom,
union(X1,singleton(X1)) = successor(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',successor) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_12,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_13,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_12 ).
cnf(c_0_14,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_15,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_16,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
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,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_19,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_15 ).
cnf(c_0_21,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_16 ).
cnf(c_0_22,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_19 ).
cnf(c_0_24,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_26,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_28,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_25 ).
cnf(c_0_29,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_30,plain,
( subclass(complement(complement(X1)),X2)
| member(not_subclass_element(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_21]),c_0_22]) ).
cnf(c_0_31,plain,
( ~ subclass(complement(complement(X1)),X1)
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_33,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_34,negated_conjecture,
~ subclass(x,successor(x)),
inference(fof_simplification,[status(thm)],[prove_successor_of_set_is_set3_1]) ).
cnf(c_0_35,axiom,
union(X1,singleton(X1)) = successor(X1),
successor ).
cnf(c_0_36,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_37,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_38,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
c_0_33 ).
cnf(c_0_39,negated_conjecture,
~ subclass(x,successor(x)),
c_0_34 ).
cnf(c_0_40,plain,
union(X1,unordered_pair(X1,X1)) = successor(X1),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_42,plain,
( ~ member(not_subclass_element(X1,X2),complement(X1))
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
cnf(c_0_43,plain,
( subclass(X1,complement(intersection(X2,X3)))
| member(not_subclass_element(X1,complement(intersection(X2,X3))),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_44,negated_conjecture,
~ subclass(x,complement(intersection(complement(x),complement(unordered_pair(x,x))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
subclass(X1,complement(intersection(complement(X1),X2))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM142-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 % Computer : n005.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Mon Sep 21 02:07:33 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.50 Running first-order theorem proving
% 0.15/0.50 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
% 8.56/1.60 % Version: 3.5.1
% 8.56/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.56/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.56/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.56/1.60 % Starting new_bool_3 with 300s (1) cores
% 8.56/1.60 % Starting new_bool_1 with 300s (1) cores
% 8.56/1.60 % Starting sh5l with 300s (1) cores
% 8.56/1.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2322910 completed with status 0
% 8.56/1.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.56/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.56/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.56/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.56/1.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.56/1.60 % No SInE strategy applied
% 8.56/1.60 % Search class: FGHSM-FFLM31-DFFFFFNN
% 8.56/1.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.56/1.60 % Starting SubtermCWHack with 136s (1) cores
% 8.56/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.56/1.60 % Starting new_bool_3 with 311s (1) cores
% 8.56/1.60 % Starting new_bool_1 with 308s (1) cores
% 8.56/1.60 % Starting sh5l with 304s (1) cores
% 8.56/1.60 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2322918 completed with status 0
% 8.56/1.60 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 8.56/1.60 % Preprocessing class: FSLSSMSMSSSNFFN.
% 8.56/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.56/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 8.56/1.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.56/1.60 % No SInE strategy applied
% 8.56/1.60 % Search class: FGHSM-FFLM31-DFFFFFNN
% 8.56/1.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.56/1.60 % Starting SubtermCWHack with 136s (1) cores
% 8.56/1.60 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 8.56/1.60 % Preprocessing time : 0.003 s
% 8.56/1.60 % Presaturation interreduction done
% 8.56/1.60
% 8.56/1.60 % Proof found!
% 8.56/1.60 % SZS status Unsatisfiable
% 8.56/1.60 % SZS output start CNFRefutation
% See solution above
% 8.56/1.60 % Parsed axioms : 159
% 8.56/1.60 % Removed by relevancy pruning/SinE : 0
% 8.56/1.60 % Initial clauses : 159
% 8.56/1.60 % Removed in clause preprocessing : 19
% 8.56/1.60 % Initial clauses in saturation : 140
% 8.56/1.60 % Processed clauses : 7636
% 8.56/1.60 % ...of these trivial : 120
% 8.56/1.60 % ...subsumed : 5189
% 8.56/1.60 % ...remaining for further processing : 2327
% 8.56/1.60 % Other redundant clauses eliminated : 26
% 8.56/1.60 % Clauses deleted for lack of memory : 0
% 8.56/1.60 % Backward-subsumed : 75
% 8.56/1.60 % Backward-rewritten : 509
% 8.56/1.60 % Generated clauses : 39033
% 8.56/1.60 % ...of the previous two non-redundant : 32013
% 8.56/1.60 % ...aggressively subsumed : 0
% 8.56/1.60 % Contextual simplify-reflections : 27
% 8.56/1.60 % Paramodulations : 38987
% 8.56/1.60 % Factorizations : 20
% 8.56/1.60 % NegExts : 0
% 8.56/1.60 % Equation resolutions : 26
% 8.56/1.60 % Disequality decompositions : 0
% 8.56/1.60 % Total rewrite steps : 15616
% 8.56/1.60 % ...of those cached : 14172
% 8.56/1.60 % Propositional unsat checks : 0
% 8.56/1.60 % Propositional check models : 0
% 8.56/1.60 % Propositional check unsatisfiable : 0
% 8.56/1.60 % Propositional clauses : 0
% 8.56/1.60 % Propositional clauses after purity: 0
% 8.56/1.60 % Propositional unsat core size : 0
% 8.56/1.60 % Propositional preprocessing time : 0.000
% 8.56/1.60 % Propositional encoding time : 0.000
% 8.56/1.60 % Propositional solver time : 0.000
% 8.56/1.60 % Success case prop preproc time : 0.000
% 8.56/1.60 % Success case prop encoding time : 0.000
% 8.56/1.60 % Success case prop solver time : 0.000
% 8.56/1.60 % Current number of processed clauses : 1598
% 8.56/1.60 % Positive orientable unit clauses : 218
% 8.56/1.60 % Positive unorientable unit clauses: 3
% 8.56/1.60 % Negative unit clauses : 9
% 8.56/1.60 % Non-unit-clauses : 1368
% 8.56/1.60 % Current number of unprocessed clauses: 23901
% 8.56/1.60 % ...number of literals in the above : 76138
% 8.56/1.60 % Current number of archived formulas : 0
% 8.56/1.60 % Current number of archived clauses : 742
% 8.56/1.60 % Clause-clause subsumption calls (NU) : 201250
% 8.56/1.60 % Rec. Clause-clause subsumption calls : 147465
% 8.56/1.60 % Non-unit clause-clause subsumptions : 4329
% 8.56/1.60 % Unit Clause-clause subsumption calls : 9958
% 8.56/1.60 % Rewrite failures with RHS unbound : 14
% 8.56/1.60 % BW rewrite match attempts : 984
% 8.56/1.60 % BW rewrite match successes : 688
% 8.56/1.60 % Condensation attempts : 0
% 8.56/1.60 % Condensation successes : 0
% 8.56/1.60 % Termbank termtop insertions : 1094525
% 8.56/1.60 % Search garbage collected termcells : 287
% 8.56/1.60
% 8.56/1.60 % -------------------------------------------------
% 8.56/1.60 % User time : 0.997 s
% 8.56/1.60 % System time : 0.043 s
% 8.56/1.60 % Total time : 1.040 s
% 8.56/1.60 % Maximum resident set size: 4036 pages
% 8.56/1.60
% 8.56/1.60 % -------------------------------------------------
% 8.56/1.60 % User time : 4.991 s
% 8.56/1.60 % System time : 0.215 s
% 8.56/1.60 % Total time : 5.206 s
% 8.56/1.60 % Maximum resident set size: 4864 pages
% 8.56/1.60 % E exiting
%------------------------------------------------------------------------------