%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET834-1 : 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 : n020.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:39 PM UTC 2026
% Result : Unsatisfiable 4.99s 1.38s
% Output : CNFRefutation 4.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 37 ( 12 unt; 6 nHn; 27 RR)
% Number of literals : 72 ( 0 equ; 35 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-3 aty)
% Number of variables : 83 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).
cnf(cls_Set_OUnCI_0,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).
cnf(cls_Set_OUnCI_1,axiom,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).
cnf(cls_conjecture_5,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).
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/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).
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/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(cls_Set_OUnE_0,axiom,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_x,v_X,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(c_0_10,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_11,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).
cnf(c_0_12,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3)
| c_lessequals(X1,X2,tc_set(X3)) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X4,X2,X3),X3) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).
cnf(c_0_15,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_16,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,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_18,plain,
( ~ c_in(X1,X2,X3)
| c_in(X1,c_union(X2,X4,X3),X3) ),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( ~ c_lessequals(v_Y,X1,tc_set(t_a))
| ~ c_lessequals(v_Z,X1,tc_set(t_a))
| c_lessequals(v_X,X1,tc_set(t_a)) ),
c_0_15 ).
cnf(c_0_20,plain,
c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4)
| c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,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_23,negated_conjecture,
( ~ c_lessequals(v_Y,c_union(X1,v_Z,t_a),tc_set(t_a))
| c_lessequals(v_X,c_union(X1,v_Z,t_a),tc_set(t_a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_25,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).
cnf(c_0_26,plain,
( ~ c_lessequals(X2,X4,tc_set(X3))
| ~ c_in(X1,X2,X3)
| c_in(X1,X4,X3) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
c_lessequals(v_X,c_union(v_Y,v_Z,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ c_in(X1,c_union(X2,X3,X4),X4)
| c_in(X1,X2,X4)
| c_in(X1,X3,X4) ),
c_0_25 ).
cnf(c_0_29,negated_conjecture,
( ~ c_in(X1,v_X,t_a)
| c_in(X1,c_union(v_Y,v_Z,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_31,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_32,negated_conjecture,
( ~ c_in(X1,v_X,t_a)
| c_in(X1,v_Z,t_a)
| c_in(X1,v_Y,t_a) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
c_in(v_x,v_X,t_a),
cls_conjecture_2 ).
cnf(c_0_34,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET834-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n020.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 05:41:33 UTC 2026
% 0.19/0.41 % CPUTime :
% 0.19/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 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
% 4.99/1.38 % Version: 3.5.1
% 4.99/1.38 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.99/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.99/1.38 % Starting new_bool_3 with 300s (1) cores
% 4.99/1.38 % Starting new_bool_1 with 300s (1) cores
% 4.99/1.38 % Starting sh5l with 300s (1) cores
% 4.99/1.38 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2119007 completed with status 0
% 4.99/1.38 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.99/1.38 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.99/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.99/1.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/1.38 % No SInE strategy applied
% 4.99/1.38 % Search class: FGHSM-SSLM33-MFFFFFNN
% 4.99/1.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/1.38 % Starting SubtermCWHack with 136s (1) cores
% 4.99/1.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.99/1.38 % Starting G-E--_200_B02_F1_AE_CS_SP_PI_S2k with 136s (1) cores
% 4.99/1.38 % Starting new_bool_3 with 136s (1) cores
% 4.99/1.38 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 4.99/1.38 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2119014 completed with status 0
% 4.99/1.38 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.99/1.38 % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.99/1.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.99/1.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.99/1.38 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.99/1.38 % No SInE strategy applied
% 4.99/1.38 % Search class: FGHSM-SSLM33-MFFFFFNN
% 4.99/1.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.99/1.38 % Starting SubtermCWHack with 136s (1) cores
% 4.99/1.38 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.99/1.38 % Preprocessing time : 0.019 s
% 4.99/1.38 % Presaturation interreduction done
% 4.99/1.38
% 4.99/1.38 % Proof found!
% 4.99/1.38 % SZS status Unsatisfiable
% 4.99/1.38 % SZS output start CNFRefutation
% See solution above
% 4.99/1.38 % Parsed axioms : 1363
% 4.99/1.38 % Removed by relevancy pruning/SinE : 0
% 4.99/1.38 % Initial clauses : 1363
% 4.99/1.38 % Removed in clause preprocessing : 1
% 4.99/1.38 % Initial clauses in saturation : 1362
% 4.99/1.38 % Processed clauses : 5944
% 4.99/1.38 % ...of these trivial : 20
% 4.99/1.38 % ...subsumed : 2883
% 4.99/1.38 % ...remaining for further processing : 3041
% 4.99/1.38 % Other redundant clauses eliminated : 31
% 4.99/1.38 % Clauses deleted for lack of memory : 0
% 4.99/1.38 % Backward-subsumed : 6
% 4.99/1.38 % Backward-rewritten : 66
% 4.99/1.38 % Generated clauses : 6723
% 4.99/1.38 % ...of the previous two non-redundant : 5595
% 4.99/1.38 % ...aggressively subsumed : 0
% 4.99/1.38 % Contextual simplify-reflections : 0
% 4.99/1.38 % Paramodulations : 6662
% 4.99/1.38 % Factorizations : 0
% 4.99/1.38 % NegExts : 0
% 4.99/1.38 % Equation resolutions : 61
% 4.99/1.38 % Disequality decompositions : 0
% 4.99/1.38 % Total rewrite steps : 1449
% 4.99/1.38 % ...of those cached : 1139
% 4.99/1.38 % Propositional unsat checks : 0
% 4.99/1.38 % Propositional check models : 0
% 4.99/1.38 % Propositional check unsatisfiable : 0
% 4.99/1.38 % Propositional clauses : 0
% 4.99/1.38 % Propositional clauses after purity: 0
% 4.99/1.38 % Propositional unsat core size : 0
% 4.99/1.38 % Propositional preprocessing time : 0.000
% 4.99/1.38 % Propositional encoding time : 0.000
% 4.99/1.38 % Propositional solver time : 0.000
% 4.99/1.38 % Success case prop preproc time : 0.000
% 4.99/1.38 % Success case prop encoding time : 0.000
% 4.99/1.38 % Success case prop solver time : 0.000
% 4.99/1.38 % Current number of processed clauses : 1643
% 4.99/1.38 % Positive orientable unit clauses : 231
% 4.99/1.38 % Positive unorientable unit clauses: 0
% 4.99/1.38 % Negative unit clauses : 79
% 4.99/1.38 % Non-unit-clauses : 1333
% 4.99/1.38 % Current number of unprocessed clauses: 2260
% 4.99/1.38 % ...number of literals in the above : 5047
% 4.99/1.38 % Current number of archived formulas : 0
% 4.99/1.38 % Current number of archived clauses : 1398
% 4.99/1.38 % Clause-clause subsumption calls (NU) : 1391559
% 4.99/1.38 % Rec. Clause-clause subsumption calls : 1278877
% 4.99/1.38 % Non-unit clause-clause subsumptions : 2813
% 4.99/1.38 % Unit Clause-clause subsumption calls : 33948
% 4.99/1.38 % Rewrite failures with RHS unbound : 0
% 4.99/1.38 % BW rewrite match attempts : 164
% 4.99/1.38 % BW rewrite match successes : 50
% 4.99/1.38 % Condensation attempts : 0
% 4.99/1.38 % Condensation successes : 0
% 4.99/1.38 % Termbank termtop insertions : 111129
% 4.99/1.38 % Search garbage collected termcells : 1597
% 4.99/1.38
% 4.99/1.38 % -------------------------------------------------
% 4.99/1.38 % User time : 0.668 s
% 4.99/1.38 % System time : 0.028 s
% 4.99/1.38 % Total time : 0.696 s
% 4.99/1.38 % Maximum resident set size: 5372 pages
% 4.99/1.38
% 4.99/1.38 % -------------------------------------------------
% 4.99/1.38 % User time : 3.179 s
% 4.99/1.38 % System time : 0.178 s
% 4.99/1.38 % Total time : 3.357 s
% 4.99/1.38 % Maximum resident set size: 5376 pages
% 4.99/1.38 % E exiting
%------------------------------------------------------------------------------