%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET852-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 : 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:15:36 PM UTC 2026
% Result : Unsatisfiable 12.83s 7.13s
% Output : CNFRefutation 12.83s
% 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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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.02 % Problem : SET852-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.37 % Computer : n026.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 05:44:12 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42 Running first-order theorem proving
% 0.14/5.42 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
% 12.83/7.13 % Version: 3.5.1
% 12.83/7.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.83/7.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.83/7.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.83/7.13 % Starting new_bool_3 with 300s (1) cores
% 12.83/7.13 % Starting new_bool_1 with 300s (1) cores
% 12.83/7.13 % Starting sh5l with 300s (1) cores
% 12.83/7.13 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1484714 completed with status 0
% 12.83/7.13 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 12.83/7.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.83/7.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.83/7.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.83/7.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.83/7.13 % No SInE strategy applied
% 12.83/7.13 % Search class: FGHSM-SSLM33-MFFFFFNN
% 12.83/7.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.83/7.13 % Starting SubtermCWHack with 136s (1) cores
% 12.83/7.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.83/7.13 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 12.83/7.13 % Starting new_bool_3 with 136s (1) cores
% 12.83/7.13 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 12.83/7.13 % G-E--_200_B02_F1_AE_CS_SP_PI_S2k with pid 1484722 completed with status 0
% 12.83/7.13 % Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S2k
% 12.83/7.13 % Preprocessing class: FMLMSMSMSSSNFFN.
% 12.83/7.13 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 12.83/7.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 12.83/7.13 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.83/7.13 % No SInE strategy applied
% 12.83/7.13 % Search class: FGHSM-SSLM33-MFFFFFNN
% 12.83/7.13 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 12.83/7.13 % Starting SubtermCWHack with 136s (1) cores
% 12.83/7.13 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 12.83/7.13 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 12.83/7.13 % Preprocessing time : 0.011 s
% 12.83/7.13
% 12.83/7.13 % Proof found!
% 12.83/7.13 % SZS status Unsatisfiable
% 12.83/7.13 % SZS output start CNFRefutation
% See solution above
% 12.83/7.13 % Parsed axioms : 1367
% 12.83/7.13 % Removed by relevancy pruning/SinE : 0
% 12.83/7.13 % Initial clauses : 1367
% 12.83/7.13 % Removed in clause preprocessing : 1
% 12.83/7.13 % Initial clauses in saturation : 1366
% 12.83/7.13 % Processed clauses : 7455
% 12.83/7.13 % ...of these trivial : 482
% 12.83/7.13 % ...subsumed : 2560
% 12.83/7.13 % ...remaining for further processing : 4413
% 12.83/7.13 % Other redundant clauses eliminated : 9
% 12.83/7.13 % Clauses deleted for lack of memory : 0
% 12.83/7.13 % Backward-subsumed : 138
% 12.83/7.13 % Backward-rewritten : 376
% 12.83/7.13 % Generated clauses : 51123
% 12.83/7.13 % ...of the previous two non-redundant : 43044
% 12.83/7.13 % ...aggressively subsumed : 0
% 12.83/7.13 % Contextual simplify-reflections : 2
% 12.83/7.13 % Paramodulations : 51069
% 12.83/7.13 % Factorizations : 6
% 12.83/7.13 % NegExts : 0
% 12.83/7.13 % Equation resolutions : 48
% 12.83/7.13 % Disequality decompositions : 0
% 12.83/7.13 % Total rewrite steps : 19796
% 12.83/7.13 % ...of those cached : 16805
% 12.83/7.13 % Propositional unsat checks : 0
% 12.83/7.13 % Propositional check models : 0
% 12.83/7.13 % Propositional check unsatisfiable : 0
% 12.83/7.13 % Propositional clauses : 0
% 12.83/7.13 % Propositional clauses after purity: 0
% 12.83/7.13 % Propositional unsat core size : 0
% 12.83/7.13 % Propositional preprocessing time : 0.000
% 12.83/7.13 % Propositional encoding time : 0.000
% 12.83/7.13 % Propositional solver time : 0.000
% 12.83/7.13 % Success case prop preproc time : 0.000
% 12.83/7.13 % Success case prop encoding time : 0.000
% 12.83/7.13 % Success case prop solver time : 0.000
% 12.83/7.13 % Current number of processed clauses : 3899
% 12.83/7.13 % Positive orientable unit clauses : 708
% 12.83/7.13 % Positive unorientable unit clauses: 1
% 12.83/7.13 % Negative unit clauses : 773
% 12.83/7.13 % Non-unit-clauses : 2417
% 12.83/7.13 % Current number of unprocessed clauses: 36376
% 12.83/7.13 % ...number of literals in the above : 66120
% 12.83/7.13 % Current number of archived formulas : 0
% 12.83/7.13 % Current number of archived clauses : 514
% 12.83/7.13 % Clause-clause subsumption calls (NU) : 1286665
% 12.83/7.13 % Rec. Clause-clause subsumption calls : 1234658
% 12.83/7.13 % Non-unit clause-clause subsumptions : 1329
% 12.83/7.13 % Unit Clause-clause subsumption calls : 127052
% 12.83/7.13 % Rewrite failures with RHS unbound : 0
% 12.83/7.13 % BW rewrite match attempts : 635
% 12.83/7.13 % BW rewrite match successes : 155
% 12.83/7.13 % Condensation attempts : 0
% 12.83/7.13 % Condensation successes : 0
% 12.83/7.13 % Termbank termtop insertions : 1154575
% 12.83/7.13 % Search garbage collected termcells : 1608
% 12.83/7.13
% 12.83/7.13 % -------------------------------------------------
% 12.83/7.13 % User time : 1.553 s
% 12.83/7.13 % System time : 0.084 s
% 12.83/7.13 % Total time : 1.637 s
% 12.83/7.13 % Maximum resident set size: 5632 pages
% 12.83/7.13
% 12.83/7.13 % -------------------------------------------------
% 12.83/7.13 % User time : 7.831 s
% 12.83/7.13 % System time : 0.362 s
% 12.83/7.13 % Total time : 8.193 s
% 12.83/7.13 % Maximum resident set size: 5632 pages
% 12.83/7.13 % E exiting
%------------------------------------------------------------------------------