%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET851-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 : n003.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.47s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 14 unt; 5 nHn; 17 RR)
% Number of literals : 36 ( 4 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 19 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Zorn_Osucc__trans_0,axiom,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Osucc__trans_0) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| X1 = v_m
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
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_7,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Osucc__trans_0]) ).
cnf(c_0_9,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_Osucc(v_S,v_x,t_a),tc_set(tc_set(t_a))),
c_0_7 ).
cnf(c_0_10,plain,
( ~ c_lessequals(X1,X2,tc_set(tc_set(X3)))
| c_lessequals(X1,c_Zorn_Osucc(X4,X2,X3),tc_set(tc_set(X3))) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| X1 = v_m
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_12,negated_conjecture,
( c_lessequals(v_x,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))) ),
cls_conjecture_4 ).
cnf(c_0_13,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),v_x,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a)))
| ~ c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| X1 = v_m
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a))) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_1 ).
cnf(c_0_17,negated_conjecture,
c_lessequals(v_x,v_m,tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
v_x = v_m,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_20,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET851-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n003.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 05:43:15 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 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
% 0.21/0.47 % Version: 3.5.1
% 0.21/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.47 % Starting sh5l with 300s (1) cores
% 0.21/0.47 % new_bool_3 with pid 3527106 completed with status 0
% 0.21/0.47 % Result found by new_bool_3
% 0.21/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.47 % SubtermCWHack with pid 3527109 completed with status 0
% 0.21/0.47 % Result found by SubtermCWHack
% 0.21/0.47 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.47 % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.47 % Preprocessing time : 0.004 s
% 0.21/0.47
% 0.21/0.47 % Proof found!
% 0.21/0.47 % SZS status Unsatisfiable
% 0.21/0.47 % SZS output start CNFRefutation
% See solution above
% 0.21/0.47 % Parsed axioms : 1367
% 0.21/0.47 % Removed by relevancy pruning/SinE : 984
% 0.21/0.47 % Initial clauses : 383
% 0.21/0.47 % Removed in clause preprocessing : 0
% 0.21/0.47 % Initial clauses in saturation : 383
% 0.21/0.47 % Processed clauses : 474
% 0.21/0.47 % ...of these trivial : 1
% 0.21/0.47 % ...subsumed : 80
% 0.21/0.47 % ...remaining for further processing : 393
% 0.21/0.47 % Other redundant clauses eliminated : 0
% 0.21/0.47 % Clauses deleted for lack of memory : 0
% 0.21/0.47 % Backward-subsumed : 2
% 0.21/0.47 % Backward-rewritten : 7
% 0.21/0.47 % Generated clauses : 153
% 0.21/0.47 % ...of the previous two non-redundant : 101
% 0.21/0.47 % ...aggressively subsumed : 0
% 0.21/0.47 % Contextual simplify-reflections : 0
% 0.21/0.47 % Paramodulations : 149
% 0.21/0.47 % Factorizations : 0
% 0.21/0.47 % NegExts : 0
% 0.21/0.47 % Equation resolutions : 3
% 0.21/0.47 % Disequality decompositions : 0
% 0.21/0.47 % Total rewrite steps : 64
% 0.21/0.47 % ...of those cached : 33
% 0.21/0.47 % Propositional unsat checks : 0
% 0.21/0.47 % Propositional check models : 0
% 0.21/0.47 % Propositional check unsatisfiable : 0
% 0.21/0.47 % Propositional clauses : 0
% 0.21/0.47 % Propositional clauses after purity: 0
% 0.21/0.47 % Propositional unsat core size : 0
% 0.21/0.47 % Propositional preprocessing time : 0.000
% 0.21/0.47 % Propositional encoding time : 0.000
% 0.21/0.47 % Propositional solver time : 0.000
% 0.21/0.47 % Success case prop preproc time : 0.000
% 0.21/0.47 % Success case prop encoding time : 0.000
% 0.21/0.47 % Success case prop solver time : 0.000
% 0.21/0.47 % Current number of processed clauses : 383
% 0.21/0.47 % Positive orientable unit clauses : 37
% 0.21/0.47 % Positive unorientable unit clauses: 0
% 0.21/0.47 % Negative unit clauses : 6
% 0.21/0.47 % Non-unit-clauses : 340
% 0.21/0.47 % Current number of unprocessed clauses: 5
% 0.21/0.47 % ...number of literals in the above : 15
% 0.21/0.47 % Current number of archived formulas : 0
% 0.21/0.47 % Current number of archived clauses : 10
% 0.21/0.47 % Clause-clause subsumption calls (NU) : 37978
% 0.21/0.47 % Rec. Clause-clause subsumption calls : 37393
% 0.21/0.47 % Non-unit clause-clause subsumptions : 79
% 0.21/0.47 % Unit Clause-clause subsumption calls : 366
% 0.21/0.47 % Rewrite failures with RHS unbound : 0
% 0.21/0.47 % BW rewrite match attempts : 4
% 0.21/0.47 % BW rewrite match successes : 2
% 0.21/0.47 % Condensation attempts : 0
% 0.21/0.47 % Condensation successes : 0
% 0.21/0.47 % Termbank termtop insertions : 15845
% 0.21/0.47 % Search garbage collected termcells : 2526
% 0.21/0.47
% 0.21/0.47 % -------------------------------------------------
% 0.21/0.47 % User time : 0.025 s
% 0.21/0.47 % System time : 0.006 s
% 0.21/0.47 % Total time : 0.031 s
% 0.21/0.47 % Maximum resident set size: 4868 pages
% 0.21/0.47
% 0.21/0.47 % -------------------------------------------------
% 0.21/0.47 % User time : 0.046 s
% 0.21/0.47 % System time : 0.010 s
% 0.21/0.47 % Total time : 0.057 s
% 0.21/0.47 % Maximum resident set size: 5376 pages
% 0.21/0.47 % E exiting
%------------------------------------------------------------------------------