%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET847-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:15:34 PM UTC 2026
% Result : Unsatisfiable 5.31s 1.24s
% Output : CNFRefutation 5.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 16 unt; 8 nHn; 31 RR)
% Number of literals : 71 ( 15 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Onot__psubset__empty__iff1_0,axiom,
~ c_less(X1,c_emptyset,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_Onot__psubset__empty__iff1_0) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OpsubsetI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Zorn_Osucc__not__equals_0,axiom,
( c_Zorn_Osucc(X2,X1,X3) != X1
| ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__not__equals_0) ).
cnf(cls_Set_ODiffI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffI_0) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OemptyE_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OemptyE_0) ).
cnf(cls_Zorn_OTFin__chain__lemma4_0,axiom,
( ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__chain__lemma4_0) ).
cnf(cls_Zorn_Oequal__succ__Union_1,axiom,
( ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Oequal__succ__Union_1) ).
cnf(cls_Zorn_OTFin__UnionI_0,axiom,
( ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3))))
| c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(c_0_11,plain,
~ c_less(X1,c_emptyset,tc_set(X2)),
inference(fof_simplification,[status(thm)],[cls_Set_Onot__psubset__empty__iff1_0]) ).
cnf(c_0_12,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetI_0]) ).
cnf(c_0_13,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_14,plain,
( c_Zorn_Osucc(X2,X1,X3) != X1
| ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Osucc__not__equals_0]) ).
cnf(c_0_15,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffI_0]) ).
cnf(c_0_16,plain,
~ c_less(X1,c_emptyset,tc_set(X2)),
c_0_11 ).
cnf(c_0_17,plain,
( ~ c_lessequals(X1,X2,tc_set(X3))
| X1 = X2
| c_less(X1,X2,tc_set(X3)) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
c_0_13 ).
cnf(c_0_19,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_20,plain,
( c_Zorn_Osucc(X2,X1,X3) != X1
| ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3))) ),
c_0_14 ).
cnf(c_0_21,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
c_0_15 ).
cnf(c_0_22,plain,
( ~ c_lessequals(X1,c_emptyset,tc_set(X2))
| X1 = c_emptyset ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
c_lessequals(c_Zorn_Omaxchain(v_S,t_a),X1,tc_set(tc_set(tc_set(t_a)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
~ c_in(X1,c_emptyset,X2),
inference(fof_simplification,[status(thm)],[cls_Set_OemptyE_0]) ).
cnf(c_0_25,plain,
( ~ c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| c_Zorn_Osucc(X2,X1,X3) != X1
| c_in(X1,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
c_Zorn_Omaxchain(v_S,t_a) = c_emptyset,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
~ c_in(X1,c_emptyset,X2),
c_0_24 ).
cnf(c_0_28,plain,
( ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__chain__lemma4_0]) ).
cnf(c_0_29,plain,
( ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Oequal__succ__Union_1]) ).
cnf(c_0_30,plain,
( ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3))))
| c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__UnionI_0]) ).
cnf(c_0_31,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_Zorn_Osucc(v_S,X1,t_a) != X1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
( ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
c_0_28 ).
cnf(c_0_33,plain,
( ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2)))
| c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) ),
c_0_29 ).
cnf(c_0_34,plain,
( ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3))))
| c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_30 ).
cnf(c_0_35,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_36,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| c_Zorn_Osucc(v_S,X1,t_a) != X1 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) = c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_38,negated_conjecture,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET847-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:41:05 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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
% 5.31/1.24 % Version: 3.5.1
% 5.31/1.24 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.31/1.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.24 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.31/1.24 % Starting new_bool_3 with 300s (1) cores
% 5.31/1.24 % Starting new_bool_1 with 300s (1) cores
% 5.31/1.24 % Starting sh5l with 300s (1) cores
% 5.31/1.24 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3252463 completed with status 0
% 5.31/1.24 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 5.31/1.24 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.31/1.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.24 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.31/1.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.31/1.24 % No SInE strategy applied
% 5.31/1.24 % Search class: FGHSM-SSLM33-MFFFFFNN
% 5.31/1.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.24 % Starting SubtermCWHack with 136s (1) cores
% 5.31/1.24 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 5.31/1.24 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 5.31/1.24 % Starting new_bool_3 with 136s (1) cores
% 5.31/1.24 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 5.31/1.24 % SubtermCWHack with pid 3252469 completed with status 0
% 5.31/1.24 % Result found by SubtermCWHack
% 5.31/1.24 % Preprocessing class: FMLMSMSMSSSNFFN.
% 5.31/1.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.31/1.24 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.31/1.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.31/1.24 % No SInE strategy applied
% 5.31/1.24 % Search class: FGHSM-SSLM33-MFFFFFNN
% 5.31/1.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 5.31/1.24 % Starting SubtermCWHack with 136s (1) cores
% 5.31/1.24 % Preprocessing time : 0.010 s
% 5.31/1.24
% 5.31/1.24 % Proof found!
% 5.31/1.24 % SZS status Unsatisfiable
% 5.31/1.24 % SZS output start CNFRefutation
% See solution above
% 5.31/1.24 % Parsed axioms : 1364
% 5.31/1.24 % Removed by relevancy pruning/SinE : 0
% 5.31/1.24 % Initial clauses : 1364
% 5.31/1.24 % Removed in clause preprocessing : 1
% 5.31/1.24 % Initial clauses in saturation : 1363
% 5.31/1.24 % Processed clauses : 6962
% 5.31/1.24 % ...of these trivial : 203
% 5.31/1.24 % ...subsumed : 4185
% 5.31/1.24 % ...remaining for further processing : 2574
% 5.31/1.24 % Other redundant clauses eliminated : 45
% 5.31/1.24 % Clauses deleted for lack of memory : 0
% 5.31/1.24 % Backward-subsumed : 72
% 5.31/1.24 % Backward-rewritten : 282
% 5.31/1.24 % Generated clauses : 29833
% 5.31/1.24 % ...of the previous two non-redundant : 23452
% 5.31/1.24 % ...aggressively subsumed : 0
% 5.31/1.24 % Contextual simplify-reflections : 0
% 5.31/1.24 % Paramodulations : 29748
% 5.31/1.24 % Factorizations : 6
% 5.31/1.24 % NegExts : 0
% 5.31/1.24 % Equation resolutions : 79
% 5.31/1.24 % Disequality decompositions : 0
% 5.31/1.24 % Total rewrite steps : 11478
% 5.31/1.24 % ...of those cached : 9911
% 5.31/1.24 % Propositional unsat checks : 0
% 5.31/1.24 % Propositional check models : 0
% 5.31/1.24 % Propositional check unsatisfiable : 0
% 5.31/1.24 % Propositional clauses : 0
% 5.31/1.24 % Propositional clauses after purity: 0
% 5.31/1.24 % Propositional unsat core size : 0
% 5.31/1.24 % Propositional preprocessing time : 0.000
% 5.31/1.24 % Propositional encoding time : 0.000
% 5.31/1.24 % Propositional solver time : 0.000
% 5.31/1.24 % Success case prop preproc time : 0.000
% 5.31/1.24 % Success case prop encoding time : 0.000
% 5.31/1.24 % Success case prop solver time : 0.000
% 5.31/1.24 % Current number of processed clauses : 2220
% 5.31/1.24 % Positive orientable unit clauses : 440
% 5.31/1.24 % Positive unorientable unit clauses: 0
% 5.31/1.24 % Negative unit clauses : 47
% 5.31/1.24 % Non-unit-clauses : 1733
% 5.31/1.24 % Current number of unprocessed clauses: 16809
% 5.31/1.24 % ...number of literals in the above : 46337
% 5.31/1.24 % Current number of archived formulas : 0
% 5.31/1.24 % Current number of archived clauses : 354
% 5.31/1.24 % Clause-clause subsumption calls (NU) : 1573800
% 5.31/1.24 % Rec. Clause-clause subsumption calls : 1479942
% 5.31/1.24 % Non-unit clause-clause subsumptions : 3635
% 5.31/1.24 % Unit Clause-clause subsumption calls : 22999
% 5.31/1.24 % Rewrite failures with RHS unbound : 0
% 5.31/1.24 % BW rewrite match attempts : 1088
% 5.31/1.24 % BW rewrite match successes : 186
% 5.31/1.24 % Condensation attempts : 0
% 5.31/1.24 % Condensation successes : 0
% 5.31/1.24 % Termbank termtop insertions : 478226
% 5.31/1.24 % Search garbage collected termcells : 1608
% 5.31/1.24
% 5.31/1.24 % -------------------------------------------------
% 5.31/1.24 % User time : 0.742 s
% 5.31/1.24 % System time : 0.038 s
% 5.31/1.24 % Total time : 0.780 s
% 5.31/1.24 % Maximum resident set size: 5632 pages
% 5.31/1.24
% 5.31/1.24 % -------------------------------------------------
% 5.31/1.24 % User time : 3.663 s
% 5.31/1.24 % System time : 0.190 s
% 5.31/1.24 % Total time : 3.853 s
% 5.31/1.24 % Maximum resident set size: 5632 pages
% 5.31/1.24 % E exiting
%------------------------------------------------------------------------------