%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET840-2 : 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 : n012.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 0.09s 0.42s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 41 ( 9 unt; 8 nHn; 27 RR)
% Number of literals : 84 ( 12 equ; 37 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 111 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OinsertE_0,axiom,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).
cnf(cls_Set_OUnionI_0,axiom,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnionI_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/theBenchmark.p',cls_Set_OsubsetI_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/theBenchmark.p',cls_Set_OsubsetI_0) ).
cnf(cls_Set_OinsertCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_0) ).
cnf(cls_Set_OinsertCI_1,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OinsertCI_1) ).
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/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_b))
| c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(c_0_9,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertE_0]) ).
cnf(c_0_10,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnionI_0]) ).
cnf(c_0_11,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_12,plain,
( ~ c_in(X1,c_insert(X2,X3,X4),X4)
| X1 = X2
| c_in(X1,X3,X4) ),
c_0_9 ).
cnf(c_0_13,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_14,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OinsertCI_0]) ).
cnf(c_0_15,plain,
( ~ c_in(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,c_Union(X4,X3),X3) ),
c_0_10 ).
cnf(c_0_16,axiom,
c_in(X1,c_insert(X1,X2,X3),X3),
cls_Set_OinsertCI_1 ).
cnf(c_0_17,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_11 ).
cnf(c_0_18,plain,
( c_lessequals(c_insert(X1,X2,X3),X4,tc_set(X3))
| c_in(c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3),X2,X3)
| c_Main_OsubsetI__1(c_insert(X1,X2,X3),X4,X3) = X1 ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_insert(X4,X2,X3),X3) ),
c_0_14 ).
cnf(c_0_20,plain,
( ~ c_in(X1,X2,X4)
| c_in(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),X4) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,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_22,plain,
( c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3))
| c_Main_OsubsetI__1(c_insert(X1,X2,X3),X2,X3) = X1 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_insert(X2,X3,X4),X4),X3,X4)
| c_lessequals(X1,c_insert(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_b))
| c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_25,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),X4),X2,X4)
| c_lessequals(X1,c_Union(c_insert(X2,X3,tc_set(X4)),X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_26,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_21 ).
cnf(c_0_27,plain,
( ~ c_in(X1,X2,X3)
| c_lessequals(c_insert(X1,X2,X3),X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_28,plain,
c_lessequals(X1,c_insert(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_b))
| c_lessequals(c_Union(v_S,t_b),X1,tc_set(t_b)) ),
c_0_24 ).
cnf(c_0_30,plain,
c_lessequals(X1,c_Union(c_insert(X1,X2,tc_set(X3)),X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
( ~ c_in(X1,X2,X3)
| c_insert(X1,X2,X3) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( ~ c_lessequals(X1,c_Union(v_S,t_b),tc_set(t_b))
| ~ c_in(X1,v_S,tc_set(t_b))
| X1 = c_Union(v_S,t_b) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_33,plain,
( ~ c_in(X1,X2,tc_set(X3))
| c_lessequals(X1,c_Union(X2,X3),tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_b))
| X1 = c_Union(v_S,t_b) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( c_lessequals(v_S,X1,tc_set(tc_set(t_b)))
| c_Main_OsubsetI__1(v_S,X1,tc_set(t_b)) = c_Union(v_S,t_b) ),
inference(spm,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_36,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_37,negated_conjecture,
( ~ c_in(c_Union(v_S,t_b),X1,tc_set(t_b))
| c_lessequals(v_S,X1,tc_set(tc_set(t_b))) ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_b)),tc_set(tc_set(t_b))),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
c_lessequals(v_S,c_insert(c_Union(v_S,t_b),X1,tc_set(t_b)),tc_set(tc_set(t_b))),
inference(spm,[status(thm)],[c_0_37,c_0_16]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET840-2 : 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/0.35 % Computer : n012.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:40:38 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.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.42 % Version: 3.5.1
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % sh5l with pid 1663149 completed with status 0
% 0.09/0.42 % Result found by sh5l
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.42 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % SubtermCWHack with pid 1663156 completed with status 0
% 0.09/0.42 % Result found by SubtermCWHack
% 0.09/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.42 % Starting sh5l with 300s (1) cores
% 0.09/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.09/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.42 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.09/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.42 % Preprocessing time : 0.001 s
% 0.09/0.42
% 0.09/0.42 % Proof found!
% 0.09/0.42 % SZS status Unsatisfiable
% 0.09/0.42 % SZS output start CNFRefutation
% See solution above
% 0.09/0.42 % Parsed axioms : 9
% 0.09/0.42 % Removed by relevancy pruning/SinE : 0
% 0.09/0.42 % Initial clauses : 9
% 0.09/0.42 % Removed in clause preprocessing : 0
% 0.09/0.42 % Initial clauses in saturation : 9
% 0.09/0.42 % Processed clauses : 63
% 0.09/0.42 % ...of these trivial : 0
% 0.09/0.42 % ...subsumed : 15
% 0.09/0.42 % ...remaining for further processing : 48
% 0.09/0.42 % Other redundant clauses eliminated : 0
% 0.09/0.42 % Clauses deleted for lack of memory : 0
% 0.09/0.42 % Backward-subsumed : 4
% 0.09/0.42 % Backward-rewritten : 2
% 0.09/0.42 % Generated clauses : 204
% 0.09/0.42 % ...of the previous two non-redundant : 178
% 0.09/0.42 % ...aggressively subsumed : 0
% 0.09/0.42 % Contextual simplify-reflections : 0
% 0.09/0.42 % Paramodulations : 204
% 0.09/0.42 % Factorizations : 0
% 0.09/0.42 % NegExts : 0
% 0.09/0.42 % Equation resolutions : 0
% 0.09/0.42 % Disequality decompositions : 0
% 0.09/0.42 % Total rewrite steps : 18
% 0.09/0.42 % ...of those cached : 6
% 0.09/0.42 % Propositional unsat checks : 0
% 0.09/0.42 % Propositional check models : 0
% 0.09/0.42 % Propositional check unsatisfiable : 0
% 0.09/0.42 % Propositional clauses : 0
% 0.09/0.42 % Propositional clauses after purity: 0
% 0.09/0.42 % Propositional unsat core size : 0
% 0.09/0.42 % Propositional preprocessing time : 0.000
% 0.09/0.42 % Propositional encoding time : 0.000
% 0.09/0.42 % Propositional solver time : 0.000
% 0.09/0.42 % Success case prop preproc time : 0.000
% 0.09/0.42 % Success case prop encoding time : 0.000
% 0.09/0.42 % Success case prop solver time : 0.000
% 0.09/0.42 % Current number of processed clauses : 42
% 0.09/0.42 % Positive orientable unit clauses : 8
% 0.09/0.42 % Positive unorientable unit clauses: 0
% 0.09/0.42 % Negative unit clauses : 1
% 0.09/0.42 % Non-unit-clauses : 33
% 0.09/0.42 % Current number of unprocessed clauses: 123
% 0.09/0.42 % ...number of literals in the above : 325
% 0.09/0.42 % Current number of archived formulas : 0
% 0.09/0.42 % Current number of archived clauses : 6
% 0.09/0.42 % Clause-clause subsumption calls (NU) : 188
% 0.09/0.42 % Rec. Clause-clause subsumption calls : 183
% 0.09/0.42 % Non-unit clause-clause subsumptions : 18
% 0.09/0.42 % Unit Clause-clause subsumption calls : 13
% 0.09/0.42 % Rewrite failures with RHS unbound : 0
% 0.09/0.42 % BW rewrite match attempts : 10
% 0.09/0.42 % BW rewrite match successes : 2
% 0.09/0.42 % Condensation attempts : 0
% 0.09/0.42 % Condensation successes : 0
% 0.09/0.42 % Termbank termtop insertions : 3784
% 0.09/0.42 % Search garbage collected termcells : 23
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.006 s
% 0.09/0.42 % System time : 0.002 s
% 0.09/0.42 % Total time : 0.008 s
% 0.09/0.42 % Maximum resident set size: 3636 pages
% 0.09/0.42
% 0.09/0.42 % -------------------------------------------------
% 0.09/0.42 % User time : 0.009 s
% 0.09/0.42 % System time : 0.005 s
% 0.09/0.42 % Total time : 0.013 s
% 0.09/0.42 % Maximum resident set size: 4864 pages
% 0.09/0.42 % E exiting
%------------------------------------------------------------------------------