%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET864-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 : n010.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.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 6 unt; 0 nHn; 20 RR)
% Number of literals : 41 ( 9 equ; 24 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_c,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_conjecture_4,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,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/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).
cnf(c_0_6,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_7,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_6 ).
cnf(c_0_8,negated_conjecture,
c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_9,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_4]) ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_lessequals(c_Union(v_c,t_a),X1,tc_set(t_a))
| c_Union(v_c,t_a) = X1 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(X1,v_x(X1),tc_set(t_a)) ),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)),
cls_conjecture_2 ).
cnf(c_0_13,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_3]) ).
cnf(c_0_14,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a))
| v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_16,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_in(v_x(X1),v_S,tc_set(t_a)) ),
c_0_13 ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| X1 != v_x(X1) ),
c_0_14 ).
cnf(c_0_18,negated_conjecture,
v_x(c_Union(v_c,t_a)) = c_Union(v_c,t_a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_12])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET864-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.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:43:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.43 Running first-order theorem proving
% 0.09/0.43 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.19/0.59 % Version: 3.5.1
% 0.19/0.59 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.59 % Starting sh5l with 300s (1) cores
% 0.19/0.59 % new_bool_3 with pid 139541 completed with status 0
% 0.19/0.59 % Result found by new_bool_3
% 0.19/0.59 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.59 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.19/0.59 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.59 % SubtermCWHack with pid 139544 completed with status 0
% 0.19/0.59 % Result found by SubtermCWHack
% 0.19/0.59 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.19/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.19/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.59 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.19/0.59 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.59 % Starting SubtermCWHack with 28s (1) cores
% 0.19/0.59 % Preprocessing time : 0.006 s
% 0.19/0.59
% 0.19/0.59 % Proof found!
% 0.19/0.59 % SZS status Unsatisfiable
% 0.19/0.59 % SZS output start CNFRefutation
% See solution above
% 0.19/0.59 % Parsed axioms : 1366
% 0.19/0.59 % Removed by relevancy pruning/SinE : 977
% 0.19/0.59 % Initial clauses : 389
% 0.19/0.59 % Removed in clause preprocessing : 0
% 0.19/0.59 % Initial clauses in saturation : 389
% 0.19/0.59 % Processed clauses : 489
% 0.19/0.59 % ...of these trivial : 1
% 0.19/0.59 % ...subsumed : 81
% 0.19/0.59 % ...remaining for further processing : 407
% 0.19/0.59 % Other redundant clauses eliminated : 0
% 0.19/0.59 % Clauses deleted for lack of memory : 0
% 0.19/0.59 % Backward-subsumed : 3
% 0.19/0.59 % Backward-rewritten : 6
% 0.19/0.59 % Generated clauses : 200
% 0.19/0.59 % ...of the previous two non-redundant : 138
% 0.19/0.59 % ...aggressively subsumed : 0
% 0.19/0.59 % Contextual simplify-reflections : 1
% 0.19/0.59 % Paramodulations : 197
% 0.19/0.59 % Factorizations : 0
% 0.19/0.59 % NegExts : 0
% 0.19/0.59 % Equation resolutions : 3
% 0.19/0.59 % Disequality decompositions : 0
% 0.19/0.59 % Total rewrite steps : 64
% 0.19/0.59 % ...of those cached : 33
% 0.19/0.59 % Propositional unsat checks : 0
% 0.19/0.59 % Propositional check models : 0
% 0.19/0.59 % Propositional check unsatisfiable : 0
% 0.19/0.59 % Propositional clauses : 0
% 0.19/0.59 % Propositional clauses after purity: 0
% 0.19/0.59 % Propositional unsat core size : 0
% 0.19/0.59 % Propositional preprocessing time : 0.000
% 0.19/0.59 % Propositional encoding time : 0.000
% 0.19/0.59 % Propositional solver time : 0.000
% 0.19/0.59 % Success case prop preproc time : 0.000
% 0.19/0.59 % Success case prop encoding time : 0.000
% 0.19/0.59 % Success case prop solver time : 0.000
% 0.19/0.59 % Current number of processed clauses : 398
% 0.19/0.59 % Positive orientable unit clauses : 43
% 0.19/0.59 % Positive unorientable unit clauses: 0
% 0.19/0.59 % Negative unit clauses : 4
% 0.19/0.59 % Non-unit-clauses : 351
% 0.19/0.59 % Current number of unprocessed clauses: 24
% 0.19/0.59 % ...number of literals in the above : 52
% 0.19/0.59 % Current number of archived formulas : 0
% 0.19/0.59 % Current number of archived clauses : 9
% 0.19/0.59 % Clause-clause subsumption calls (NU) : 30202
% 0.19/0.59 % Rec. Clause-clause subsumption calls : 30175
% 0.19/0.59 % Non-unit clause-clause subsumptions : 81
% 0.19/0.59 % Unit Clause-clause subsumption calls : 367
% 0.19/0.59 % Rewrite failures with RHS unbound : 0
% 0.19/0.59 % BW rewrite match attempts : 9
% 0.19/0.59 % BW rewrite match successes : 6
% 0.19/0.59 % Condensation attempts : 0
% 0.19/0.59 % Condensation successes : 0
% 0.19/0.59 % Termbank termtop insertions : 16764
% 0.19/0.59 % Search garbage collected termcells : 2490
% 0.19/0.59
% 0.19/0.59 % -------------------------------------------------
% 0.19/0.59 % User time : 0.036 s
% 0.19/0.59 % System time : 0.010 s
% 0.19/0.59 % Total time : 0.046 s
% 0.19/0.59 % Maximum resident set size: 4864 pages
% 0.19/0.59
% 0.19/0.59 % -------------------------------------------------
% 0.19/0.59 % User time : 0.056 s
% 0.19/0.59 % System time : 0.015 s
% 0.19/0.59 % Total time : 0.071 s
% 0.19/0.59 % Maximum resident set size: 5632 pages
% 0.19/0.59 % E exiting
%------------------------------------------------------------------------------