%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET839-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 : n016.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:32 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.59s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 23 ( 7 unt; 7 nHn; 15 RR)
% Number of literals : 50 ( 5 equ; 22 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 50 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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_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_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_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/theBenchmark.p',cls_Set_OinsertCI_1) ).
cnf(c_0_6,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_7,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_8,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_6 ).
cnf(c_0_9,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_10,plain,
( ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3))
| X2 = X1 ),
c_0_7 ).
cnf(c_0_11,negated_conjecture,
( ~ c_in(X1,v_S,tc_set(t_a))
| c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
| c_lessequals(X1,c_Main_OsubsetI__1(v_S,X2,tc_set(t_a)),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
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_lessequals(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a))
| ~ 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(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_9]),c_0_9]) ).
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.03 % Problem : SET839-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n016.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 05:45:37 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.54 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.26/0.59 % Version: 3.5.1
% 0.26/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59 % Starting sh5l with 300s (1) cores
% 0.26/0.59 % sh5l with pid 1678941 completed with status 0
% 0.26/0.59 % Result found by sh5l
% 0.26/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59 % Starting sh5l with 300s (1) cores
% 0.26/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.59 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.26/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.59 % SubtermCWHack with pid 1678948 completed with status 0
% 0.26/0.59 % Result found by SubtermCWHack
% 0.26/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59 % Starting sh5l with 300s (1) cores
% 0.26/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.59 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.59 % Search class: FGUSF-FFSF32-SFFFFFNN
% 0.26/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.59 % Preprocessing time : 0.002 s
% 0.26/0.59
% 0.26/0.59 % Proof found!
% 0.26/0.59 % SZS status Unsatisfiable
% 0.26/0.59 % SZS output start CNFRefutation
% See solution above
% 0.26/0.59 % Parsed axioms : 6
% 0.26/0.59 % Removed by relevancy pruning/SinE : 0
% 0.26/0.59 % Initial clauses : 6
% 0.26/0.59 % Removed in clause preprocessing : 0
% 0.26/0.59 % Initial clauses in saturation : 6
% 0.26/0.59 % Processed clauses : 14
% 0.26/0.59 % ...of these trivial : 0
% 0.26/0.59 % ...subsumed : 1
% 0.26/0.59 % ...remaining for further processing : 13
% 0.26/0.59 % Other redundant clauses eliminated : 0
% 0.26/0.59 % Clauses deleted for lack of memory : 0
% 0.26/0.59 % Backward-subsumed : 0
% 0.26/0.59 % Backward-rewritten : 6
% 0.26/0.59 % Generated clauses : 25
% 0.26/0.59 % ...of the previous two non-redundant : 23
% 0.26/0.59 % ...aggressively subsumed : 0
% 0.26/0.59 % Contextual simplify-reflections : 2
% 0.26/0.59 % Paramodulations : 25
% 0.26/0.59 % Factorizations : 0
% 0.26/0.59 % NegExts : 0
% 0.26/0.59 % Equation resolutions : 0
% 0.26/0.59 % Disequality decompositions : 0
% 0.26/0.59 % Total rewrite steps : 8
% 0.26/0.59 % ...of those cached : 3
% 0.26/0.59 % Propositional unsat checks : 0
% 0.26/0.59 % Propositional check models : 0
% 0.26/0.59 % Propositional check unsatisfiable : 0
% 0.26/0.59 % Propositional clauses : 0
% 0.26/0.59 % Propositional clauses after purity: 0
% 0.26/0.59 % Propositional unsat core size : 0
% 0.26/0.59 % Propositional preprocessing time : 0.000
% 0.26/0.59 % Propositional encoding time : 0.000
% 0.26/0.59 % Propositional solver time : 0.000
% 0.26/0.59 % Success case prop preproc time : 0.000
% 0.26/0.59 % Success case prop encoding time : 0.000
% 0.26/0.59 % Success case prop solver time : 0.000
% 0.26/0.59 % Current number of processed clauses : 7
% 0.26/0.59 % Positive orientable unit clauses : 3
% 0.26/0.59 % Positive unorientable unit clauses: 0
% 0.26/0.59 % Negative unit clauses : 0
% 0.26/0.59 % Non-unit-clauses : 4
% 0.26/0.59 % Current number of unprocessed clauses: 15
% 0.26/0.59 % ...number of literals in the above : 57
% 0.26/0.59 % Current number of archived formulas : 0
% 0.26/0.59 % Current number of archived clauses : 6
% 0.26/0.59 % Clause-clause subsumption calls (NU) : 25
% 0.26/0.59 % Rec. Clause-clause subsumption calls : 15
% 0.26/0.59 % Non-unit clause-clause subsumptions : 3
% 0.26/0.59 % Unit Clause-clause subsumption calls : 2
% 0.26/0.59 % Rewrite failures with RHS unbound : 0
% 0.26/0.59 % BW rewrite match attempts : 6
% 0.26/0.59 % BW rewrite match successes : 4
% 0.26/0.59 % Condensation attempts : 0
% 0.26/0.59 % Condensation successes : 0
% 0.26/0.59 % Termbank termtop insertions : 845
% 0.26/0.59 % Search garbage collected termcells : 16
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.004 s
% 0.26/0.59 % System time : 0.004 s
% 0.26/0.59 % Total time : 0.008 s
% 0.26/0.59 % Maximum resident set size: 3632 pages
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.005 s
% 0.26/0.59 % System time : 0.011 s
% 0.26/0.59 % Total time : 0.016 s
% 0.26/0.59 % Maximum resident set size: 4864 pages
% 0.26/0.59 % E exiting
%------------------------------------------------------------------------------