%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET865-2 : 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 : n018.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:39 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 6 unt; 0 nHn; 24 RR)
% Number of literals : 60 ( 7 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_conjecture_0,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Zorn_Omaxchain__subset__chain_0,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__subset__chain_0) ).
cnf(cls_Zorn_OHausdorff_0,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OHausdorff_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_9,plain,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__Zorn_0]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_11,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_8 ).
cnf(c_0_12,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
cls_Zorn_Omaxchain__subset__chain_0 ).
cnf(c_0_13,plain,
( ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,X2,tc_set(X3))
| c_Union(X4,X3) = X1 ),
c_0_9 ).
cnf(c_0_14,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
cls_Zorn_OHausdorff_0 ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_16,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
c_0_10 ).
cnf(c_0_18,plain,
( ~ c_in(X1,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( ~ c_in(X3,X1,tc_set(X2))
| ~ c_lessequals(c_Union(c_Zorn_OHausdorff__1(X1,X2),X2),X3,tc_set(X2))
| c_Union(c_Zorn_OHausdorff__1(X1,X2),X2) = X3 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
c_0_16 ).
cnf(c_0_22,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_23,negated_conjecture,
( ~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a)))
| c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(c_Union(c_Zorn_OHausdorff__1(X1,t_a),t_a),v_S,tc_set(t_a))
| ~ c_in(v_x(c_Union(c_Zorn_OHausdorff__1(X1,t_a),t_a)),X1,tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
c_0_22 ).
cnf(c_0_26,negated_conjecture,
c_in(c_Union(c_Zorn_OHausdorff__1(v_S,t_a),t_a),v_S,tc_set(t_a)),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET865-2 : 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 : n018.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:58 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
% 0.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1091974 completed with status 0
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FHHSS-FFSF21-MFFFFFNN
% 0.11/0.43 % partial match(1): FHHSM-FFSF21-MFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.11/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1091979 completed with status 0
% 0.11/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.43 % No SInE strategy applied
% 0.11/0.43 % Search class: FHHSS-FFSF21-MFFFFFNN
% 0.11/0.43 % partial match(1): FHHSM-FFSF21-MFFFFFNN
% 0.11/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43 % Presaturation interreduction done
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Unsatisfiable
% 0.11/0.43 % SZS output start CNFRefutation
% See solution above
% 0.11/0.43 % Parsed axioms : 8
% 0.11/0.43 % Removed by relevancy pruning/SinE : 0
% 0.11/0.43 % Initial clauses : 8
% 0.11/0.43 % Removed in clause preprocessing : 0
% 0.11/0.43 % Initial clauses in saturation : 8
% 0.11/0.43 % Processed clauses : 22
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 22
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 0
% 0.11/0.43 % Backward-rewritten : 0
% 0.11/0.43 % Generated clauses : 7
% 0.11/0.43 % ...of the previous two non-redundant : 6
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 1
% 0.11/0.43 % Paramodulations : 7
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 1
% 0.11/0.43 % ...of those cached : 0
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 14
% 0.11/0.43 % Positive orientable unit clauses : 3
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 0
% 0.11/0.43 % Non-unit-clauses : 11
% 0.11/0.43 % Current number of unprocessed clauses: 0
% 0.11/0.43 % ...number of literals in the above : 0
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 8
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 19
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 17
% 0.11/0.43 % Non-unit clause-clause subsumptions : 1
% 0.11/0.43 % Unit Clause-clause subsumption calls : 0
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 0
% 0.11/0.43 % BW rewrite match successes : 0
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 660
% 0.11/0.44 % Search garbage collected termcells : 25
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.003 s
% 0.11/0.44 % System time : 0.003 s
% 0.11/0.44 % Total time : 0.005 s
% 0.11/0.44 % Maximum resident set size: 3636 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.013 s
% 0.11/0.44 % System time : 0.009 s
% 0.11/0.44 % Total time : 0.022 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------