%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET852-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 : n026.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:18:44 PM UTC 2026
% Result : Unsatisfiable 6.44s 1.41s
% Output : CNFRefutation 6.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 7 unt; 13 nHn; 16 RR)
% Number of literals : 46 ( 0 equ; 15 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_4,negated_conjecture,
( ~ c_in(X1,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Zorn_OUnion__lemma0_1,axiom,
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).
cnf(cls_Zorn_OUnion__lemma0_0,axiom,
( c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_Zorn_OUnion__lemma0_2,axiom,
( ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| c_lessequals(X1,c_Union(X3,X4),tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(c_0_6,negated_conjecture,
( ~ c_in(X1,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_7,plain,
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OUnion__lemma0_1]) ).
cnf(c_0_8,negated_conjecture,
( ~ c_in(X1,v_Y,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a))) ),
c_0_6 ).
cnf(c_0_9,axiom,
( c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4)) ),
cls_Zorn_OUnion__lemma0_0 ).
cnf(c_0_10,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| c_lessequals(X1,c_Union(X3,X4),tc_set(X4)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OUnion__lemma0_2]) ).
cnf(c_0_12,plain,
( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4)) ),
c_0_7 ).
cnf(c_0_13,negated_conjecture,
( c_lessequals(c_Union(v_Y,tc_set(t_a)),X1,tc_set(tc_set(t_a)))
| c_lessequals(X2,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(X1,X2,v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_16,plain,
( ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| c_lessequals(X1,c_Union(X3,X4),tc_set(X4)) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
( c_lessequals(X1,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(v_m,X1,v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET852-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.11/0.37 % Computer : n026.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 05:44:07 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 6.44/1.41 % Version: 3.5.1
% 6.44/1.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.44/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.44/1.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.44/1.41 % Starting new_bool_3 with 300s (1) cores
% 6.44/1.41 % Starting new_bool_1 with 300s (1) cores
% 6.44/1.41 % Starting sh5l with 300s (1) cores
% 6.44/1.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1484526 completed with status 0
% 6.44/1.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.44/1.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.44/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.44/1.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.44/1.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.44/1.41 % No SInE strategy applied
% 6.44/1.41 % Search class: FGHSM-SSLM33-MFFFFFNN
% 6.44/1.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.44/1.41 % Starting SubtermCWHack with 136s (1) cores
% 6.44/1.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.44/1.41 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 6.44/1.41 % Starting new_bool_3 with 136s (1) cores
% 6.44/1.41 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 6.44/1.41 % G-E--_200_B02_F1_AE_CS_SP_PI_S2k with pid 1484535 completed with status 0
% 6.44/1.41 % Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S2k
% 6.44/1.41 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.44/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.44/1.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.44/1.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.44/1.41 % No SInE strategy applied
% 6.44/1.41 % Search class: FGHSM-SSLM33-MFFFFFNN
% 6.44/1.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.44/1.41 % Starting SubtermCWHack with 136s (1) cores
% 6.44/1.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.44/1.41 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 6.44/1.41 % Preprocessing time : 0.007 s
% 6.44/1.41
% 6.44/1.41 % Proof found!
% 6.44/1.41 % SZS status Unsatisfiable
% 6.44/1.41 % SZS output start CNFRefutation
% See solution above
% 6.44/1.41 % Parsed axioms : 1367
% 6.44/1.41 % Removed by relevancy pruning/SinE : 0
% 6.44/1.41 % Initial clauses : 1367
% 6.44/1.41 % Removed in clause preprocessing : 1
% 6.44/1.41 % Initial clauses in saturation : 1366
% 6.44/1.41 % Processed clauses : 7455
% 6.44/1.41 % ...of these trivial : 481
% 6.44/1.41 % ...subsumed : 2560
% 6.44/1.41 % ...remaining for further processing : 4414
% 6.44/1.41 % Other redundant clauses eliminated : 9
% 6.44/1.41 % Clauses deleted for lack of memory : 0
% 6.44/1.41 % Backward-subsumed : 137
% 6.44/1.41 % Backward-rewritten : 377
% 6.44/1.41 % Generated clauses : 50874
% 6.44/1.41 % ...of the previous two non-redundant : 42750
% 6.44/1.41 % ...aggressively subsumed : 0
% 6.44/1.41 % Contextual simplify-reflections : 2
% 6.44/1.41 % Paramodulations : 50820
% 6.44/1.41 % Factorizations : 6
% 6.44/1.41 % NegExts : 0
% 6.44/1.41 % Equation resolutions : 48
% 6.44/1.41 % Disequality decompositions : 0
% 6.44/1.41 % Total rewrite steps : 19893
% 6.44/1.41 % ...of those cached : 16887
% 6.44/1.41 % Propositional unsat checks : 0
% 6.44/1.41 % Propositional check models : 0
% 6.44/1.41 % Propositional check unsatisfiable : 0
% 6.44/1.41 % Propositional clauses : 0
% 6.44/1.41 % Propositional clauses after purity: 0
% 6.44/1.41 % Propositional unsat core size : 0
% 6.44/1.41 % Propositional preprocessing time : 0.000
% 6.44/1.41 % Propositional encoding time : 0.000
% 6.44/1.41 % Propositional solver time : 0.000
% 6.44/1.41 % Success case prop preproc time : 0.000
% 6.44/1.41 % Success case prop encoding time : 0.000
% 6.44/1.41 % Success case prop solver time : 0.000
% 6.44/1.41 % Current number of processed clauses : 3900
% 6.44/1.41 % Positive orientable unit clauses : 707
% 6.44/1.41 % Positive unorientable unit clauses: 1
% 6.44/1.41 % Negative unit clauses : 771
% 6.44/1.41 % Non-unit-clauses : 2421
% 6.44/1.41 % Current number of unprocessed clauses: 36085
% 6.44/1.41 % ...number of literals in the above : 65599
% 6.44/1.41 % Current number of archived formulas : 0
% 6.44/1.41 % Current number of archived clauses : 514
% 6.44/1.41 % Clause-clause subsumption calls (NU) : 1289995
% 6.44/1.41 % Rec. Clause-clause subsumption calls : 1232476
% 6.44/1.41 % Non-unit clause-clause subsumptions : 1335
% 6.44/1.41 % Unit Clause-clause subsumption calls : 126778
% 6.44/1.41 % Rewrite failures with RHS unbound : 0
% 6.44/1.41 % BW rewrite match attempts : 634
% 6.44/1.41 % BW rewrite match successes : 154
% 6.44/1.41 % Condensation attempts : 0
% 6.44/1.41 % Condensation successes : 0
% 6.44/1.41 % Termbank termtop insertions : 1150041
% 6.44/1.41 % Search garbage collected termcells : 1608
% 6.44/1.41
% 6.44/1.41 % -------------------------------------------------
% 6.44/1.41 % User time : 0.879 s
% 6.44/1.41 % System time : 0.054 s
% 6.44/1.41 % Total time : 0.933 s
% 6.44/1.41 % Maximum resident set size: 5632 pages
% 6.44/1.41
% 6.44/1.41 % -------------------------------------------------
% 6.44/1.41 % User time : 4.258 s
% 6.44/1.41 % System time : 0.203 s
% 6.44/1.41 % Total time : 4.461 s
% 6.44/1.41 % Maximum resident set size: 5632 pages
% 6.44/1.41 % E exiting
%------------------------------------------------------------------------------