%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET839-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:18:41 PM UTC 2026
% Result : Unsatisfiable 36.41s 10.78s
% Output : CNFRefutation 36.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 7 unt; 6 nHn; 15 RR)
% Number of literals : 49 ( 6 equ; 22 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__antisym_0,axiom,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| c_lessequals(X1,X2,tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_OsubsetI_0,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OsubsetI_1,axiom,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OinsertCI_1) ).
cnf(c_0_6,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_7,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| c_lessequals(X1,X2,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_8,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_6 ).
cnf(c_0_9,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| ~ c_in(X2,v_S,tc_set(t_a))
| c_lessequals(X1,X2,tc_set(t_a)) ),
c_0_7 ).
cnf(c_0_10,negated_conjecture,
( ~ c_in(X2,v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a))
| X1 = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,axiom,
( c_lessequals(X1,X2,tc_set(X3))
| c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3) ),
cls_Set_OsubsetI_0 ).
cnf(c_0_12,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).
cnf(c_0_13,negated_conjecture,
( ~ c_in(X2,v_S,tc_set(t_a))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X2,tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_17,negated_conjecture,
( ~ c_in(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_19,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
| c_lessequals(v_S,c_insert(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
c_lessequals(v_S,X1,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET839-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.12/5.37 % Computer : n010.cluster.edu
% 0.12/5.37 % Model : x86_64 x86_64
% 0.12/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.37 % Memory : 8046.5625MB
% 0.12/5.37 % OS : Linux 6.8.0-71-generic
% 0.12/5.38 % CPULimit : 300
% 0.12/5.38 % WCLimit : 300
% 0.12/5.38 % DateTime : Mon Sep 21 05:41:16 UTC 2026
% 0.12/5.38 % CPUTime :
% 0.12/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/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
% 36.41/10.78 % Version: 3.5.1
% 36.41/10.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 36.41/10.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.41/10.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.41/10.78 % Starting new_bool_3 with 300s (1) cores
% 36.41/10.78 % Starting new_bool_1 with 300s (1) cores
% 36.41/10.78 % Starting sh5l with 300s (1) cores
% 36.41/10.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 134378 completed with status 0
% 36.41/10.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 36.41/10.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 36.41/10.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.41/10.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.41/10.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.41/10.78 % No SInE strategy applied
% 36.41/10.78 % Search class: FGHSM-SSLM33-MFFFFFNN
% 36.41/10.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 36.41/10.78 % Starting SubtermCWHack with 136s (1) cores
% 36.41/10.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.41/10.78 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 36.41/10.78 % Starting new_bool_3 with 136s (1) cores
% 36.41/10.78 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 36.41/10.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 134385 completed with status 0
% 36.41/10.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 36.41/10.78 % Preprocessing class: FMLMSMSMSSSNFFN.
% 36.41/10.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.41/10.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 36.41/10.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 36.41/10.78 % No SInE strategy applied
% 36.41/10.78 % Search class: FGHSM-SSLM33-MFFFFFNN
% 36.41/10.78 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 36.41/10.78 % Starting SubtermCWHack with 136s (1) cores
% 36.41/10.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 36.41/10.78 % Preprocessing time : 0.012 s
% 36.41/10.78 % Presaturation interreduction done
% 36.41/10.78
% 36.41/10.78 % Proof found!
% 36.41/10.78 % SZS status Unsatisfiable
% 36.41/10.78 % SZS output start CNFRefutation
% See solution above
% 36.41/10.78 % Parsed axioms : 1359
% 36.41/10.78 % Removed by relevancy pruning/SinE : 0
% 36.41/10.78 % Initial clauses : 1359
% 36.41/10.78 % Removed in clause preprocessing : 1
% 36.41/10.78 % Initial clauses in saturation : 1358
% 36.41/10.78 % Processed clauses : 14810
% 36.41/10.78 % ...of these trivial : 195
% 36.41/10.78 % ...subsumed : 9552
% 36.41/10.78 % ...remaining for further processing : 5063
% 36.41/10.78 % Other redundant clauses eliminated : 123
% 36.41/10.78 % Clauses deleted for lack of memory : 0
% 36.41/10.78 % Backward-subsumed : 298
% 36.41/10.78 % Backward-rewritten : 260
% 36.41/10.78 % Generated clauses : 100005
% 36.41/10.78 % ...of the previous two non-redundant : 96151
% 36.41/10.78 % ...aggressively subsumed : 0
% 36.41/10.78 % Contextual simplify-reflections : 22
% 36.41/10.78 % Paramodulations : 99840
% 36.41/10.78 % Factorizations : 4
% 36.41/10.78 % NegExts : 0
% 36.41/10.78 % Equation resolutions : 161
% 36.41/10.78 % Disequality decompositions : 0
% 36.41/10.78 % Total rewrite steps : 28556
% 36.41/10.78 % ...of those cached : 24996
% 36.41/10.78 % Propositional unsat checks : 1
% 36.41/10.78 % Propositional check models : 0
% 36.41/10.78 % Propositional check unsatisfiable : 0
% 36.41/10.78 % Propositional clauses : 0
% 36.41/10.78 % Propositional clauses after purity: 0
% 36.41/10.78 % Propositional unsat core size : 0
% 36.41/10.78 % Propositional preprocessing time : 0.000
% 36.41/10.78 % Propositional encoding time : 0.580
% 36.41/10.78 % Propositional solver time : 0.297
% 36.41/10.78 % Success case prop preproc time : 0.000
% 36.41/10.78 % Success case prop encoding time : 0.000
% 36.41/10.78 % Success case prop solver time : 0.000
% 36.41/10.78 % Current number of processed clauses : 3183
% 36.41/10.78 % Positive orientable unit clauses : 329
% 36.41/10.78 % Positive unorientable unit clauses: 0
% 36.41/10.78 % Negative unit clauses : 142
% 36.41/10.78 % Non-unit-clauses : 2712
% 36.41/10.78 % Current number of unprocessed clauses: 82758
% 36.41/10.78 % ...number of literals in the above : 241437
% 36.41/10.78 % Current number of archived formulas : 0
% 36.41/10.78 % Current number of archived clauses : 1880
% 36.41/10.78 % Clause-clause subsumption calls (NU) : 4372490
% 36.41/10.78 % Rec. Clause-clause subsumption calls : 3468018
% 36.41/10.78 % Non-unit clause-clause subsumptions : 5867
% 36.41/10.78 % Unit Clause-clause subsumption calls : 65360
% 36.41/10.78 % Rewrite failures with RHS unbound : 0
% 36.41/10.78 % BW rewrite match attempts : 334
% 36.41/10.78 % BW rewrite match successes : 173
% 36.41/10.78 % Condensation attempts : 0
% 36.41/10.78 % Condensation successes : 0
% 36.41/10.78 % Termbank termtop insertions : 7103667
% 36.41/10.78 % Search garbage collected termcells : 1595
% 36.41/10.78
% 36.41/10.78 % -------------------------------------------------
% 36.41/10.78 % User time : 5.007 s
% 36.41/10.78 % System time : 0.172 s
% 36.41/10.78 % Total time : 5.179 s
% 36.41/10.78 % Maximum resident set size: 5584 pages
% 36.41/10.78
% 36.41/10.78 % -------------------------------------------------
% 36.41/10.78 % User time : 25.081 s
% 36.41/10.78 % System time : 0.979 s
% 36.41/10.78 % Total time : 26.060 s
% 36.41/10.78 % Maximum resident set size: 5376 pages
% 36.41/10.78 % E exiting
%------------------------------------------------------------------------------