%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET848-1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:15:35 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.46s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 8 unt; 3 nHn; 19 RR)
% Number of literals : 47 ( 9 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 57 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/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/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_ODiffI_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/sandbox2/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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__refl_0) ).
cnf(c_0_7,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_8,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_9,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_7 ).
cnf(c_0_10,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| c_in(X1,X4,X3) ),
c_0_8 ).
cnf(c_0_11,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_12,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_13,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_14,negated_conjecture,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_15,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_9,c_0_10]) ).
cnf(c_0_16,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_11 ).
cnf(c_0_17,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_12 ).
cnf(c_0_18,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_13 ).
cnf(c_0_19,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_20,negated_conjecture,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
c_0_14 ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_Zorn_OTFin(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_15,c_0_16]) ).
cnf(c_0_22,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_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,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(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET848-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.35 % Computer : n015.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8046.5625MB
% 0.12/0.35 % OS : Linux 6.8.0-71-generic
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 05:44:50 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 0.21/0.46 % Version: 3.5.1
% 0.21/0.46 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % Starting sh5l with 300s (1) cores
% 0.21/0.46 % new_bool_1 with pid 680410 completed with status 0
% 0.21/0.46 % Result found by new_bool_1
% 0.21/0.46 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.46 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.21/0.46 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.46 % SubtermCWHack with pid 680412 completed with status 0
% 0.21/0.46 % Result found by SubtermCWHack
% 0.21/0.46 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.46 % Search class: FGHSM-FFMS32-MFFFFFNN
% 0.21/0.46 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.46 % Preprocessing time : 0.003 s
% 0.21/0.46
% 0.21/0.46 % Proof found!
% 0.21/0.46 % SZS status Unsatisfiable
% 0.21/0.46 % SZS output start CNFRefutation
% See solution above
% 0.21/0.46 % Parsed axioms : 1366
% 0.21/0.46 % Removed by relevancy pruning/SinE : 1299
% 0.21/0.46 % Initial clauses : 67
% 0.21/0.46 % Removed in clause preprocessing : 0
% 0.21/0.46 % Initial clauses in saturation : 67
% 0.21/0.46 % Processed clauses : 118
% 0.21/0.46 % ...of these trivial : 1
% 0.21/0.46 % ...subsumed : 16
% 0.21/0.46 % ...remaining for further processing : 101
% 0.21/0.46 % Other redundant clauses eliminated : 0
% 0.21/0.46 % Clauses deleted for lack of memory : 0
% 0.21/0.46 % Backward-subsumed : 4
% 0.21/0.46 % Backward-rewritten : 15
% 0.21/0.46 % Generated clauses : 283
% 0.21/0.46 % ...of the previous two non-redundant : 259
% 0.21/0.46 % ...aggressively subsumed : 0
% 0.21/0.46 % Contextual simplify-reflections : 0
% 0.21/0.46 % Paramodulations : 280
% 0.21/0.46 % Factorizations : 0
% 0.21/0.46 % NegExts : 0
% 0.21/0.46 % Equation resolutions : 3
% 0.21/0.46 % Disequality decompositions : 0
% 0.21/0.46 % Total rewrite steps : 27
% 0.21/0.46 % ...of those cached : 4
% 0.21/0.46 % Propositional unsat checks : 0
% 0.21/0.46 % Propositional check models : 0
% 0.21/0.46 % Propositional check unsatisfiable : 0
% 0.21/0.46 % Propositional clauses : 0
% 0.21/0.46 % Propositional clauses after purity: 0
% 0.21/0.46 % Propositional unsat core size : 0
% 0.21/0.46 % Propositional preprocessing time : 0.000
% 0.21/0.46 % Propositional encoding time : 0.000
% 0.21/0.46 % Propositional solver time : 0.000
% 0.21/0.46 % Success case prop preproc time : 0.000
% 0.21/0.46 % Success case prop encoding time : 0.000
% 0.21/0.46 % Success case prop solver time : 0.000
% 0.21/0.46 % Current number of processed clauses : 82
% 0.21/0.46 % Positive orientable unit clauses : 21
% 0.21/0.46 % Positive unorientable unit clauses: 0
% 0.21/0.46 % Negative unit clauses : 6
% 0.21/0.46 % Non-unit-clauses : 55
% 0.21/0.46 % Current number of unprocessed clauses: 122
% 0.21/0.46 % ...number of literals in the above : 299
% 0.21/0.46 % Current number of archived formulas : 0
% 0.21/0.46 % Current number of archived clauses : 19
% 0.21/0.46 % Clause-clause subsumption calls (NU) : 477
% 0.21/0.46 % Rec. Clause-clause subsumption calls : 465
% 0.21/0.46 % Non-unit clause-clause subsumptions : 13
% 0.21/0.46 % Unit Clause-clause subsumption calls : 11
% 0.21/0.46 % Rewrite failures with RHS unbound : 0
% 0.21/0.46 % BW rewrite match attempts : 49
% 0.21/0.46 % BW rewrite match successes : 15
% 0.21/0.46 % Condensation attempts : 0
% 0.21/0.46 % Condensation successes : 0
% 0.21/0.46 % Termbank termtop insertions : 14388
% 0.21/0.46 % Search garbage collected termcells : 2605
% 0.21/0.46
% 0.21/0.46 % -------------------------------------------------
% 0.21/0.46 % User time : 0.010 s
% 0.21/0.46 % System time : 0.007 s
% 0.21/0.46 % Total time : 0.017 s
% 0.21/0.46 % Maximum resident set size: 4608 pages
% 0.21/0.46
% 0.21/0.46 % -------------------------------------------------
% 0.21/0.46 % User time : 0.028 s
% 0.21/0.46 % System time : 0.014 s
% 0.21/0.46 % Total time : 0.042 s
% 0.21/0.46 % Maximum resident set size: 5376 pages
% 0.21/0.46 % E exiting
%------------------------------------------------------------------------------