%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET834-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 : n019.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:31 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.43s
% Output : CNFRefutation 0.12s
% 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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',cls_Set_OUnE_0) ).
cnf(cls_conjecture_4,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_in(v_x,v_Z,t_a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_2,negated_conjecture,
c_in(v_x,v_X,t_a),
file('/export/starexec/sandbox2/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_Z,c_union(X1,v_Y,t_a),tc_set(t_a))
| c_lessequals(v_X,c_union(X1,v_Y,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_Z,v_Y,t_a),tc_set(t_a)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ c_in(v_x,v_Y,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_29,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_30,negated_conjecture,
( ~ c_in(X1,v_X,t_a)
| c_in(X1,c_union(v_Z,v_Y,t_a),t_a) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
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(v_x,v_Y,t_a),
c_0_28 ).
cnf(c_0_33,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_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
c_in(v_x,v_X,t_a),
cls_conjecture_2 ).
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(cn,[status(thm)],[inference(rw,[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-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:40:50 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.12/0.43 % Version: 3.5.1
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % sh5l with pid 1796953 completed with status 0
% 0.12/0.43 % Result found by sh5l
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.43 % Search class: FGUNF-FFSF32-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % SubtermCWHack with pid 1796959 completed with status 0
% 0.12/0.43 % Result found by SubtermCWHack
% 0.12/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43 % Starting sh5l with 300s (1) cores
% 0.12/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.12/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.12/0.43 % Search class: FGUNF-FFSF32-SFFFFFNN
% 0.12/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43 % Preprocessing time : 0.001 s
% 0.12/0.43
% 0.12/0.43 % Proof found!
% 0.12/0.43 % SZS status Unsatisfiable
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.43 % Parsed axioms : 10
% 0.12/0.43 % Removed by relevancy pruning/SinE : 0
% 0.12/0.43 % Initial clauses : 10
% 0.12/0.43 % Removed in clause preprocessing : 0
% 0.12/0.43 % Initial clauses in saturation : 10
% 0.12/0.43 % Processed clauses : 23
% 0.12/0.43 % ...of these trivial : 0
% 0.12/0.43 % ...subsumed : 2
% 0.12/0.43 % ...remaining for further processing : 21
% 0.12/0.43 % Other redundant clauses eliminated : 0
% 0.12/0.43 % Clauses deleted for lack of memory : 0
% 0.12/0.43 % Backward-subsumed : 0
% 0.12/0.43 % Backward-rewritten : 0
% 0.12/0.43 % Generated clauses : 38
% 0.12/0.43 % ...of the previous two non-redundant : 31
% 0.12/0.43 % ...aggressively subsumed : 0
% 0.12/0.43 % Contextual simplify-reflections : 0
% 0.12/0.43 % Paramodulations : 36
% 0.12/0.43 % Factorizations : 2
% 0.12/0.43 % NegExts : 0
% 0.12/0.43 % Equation resolutions : 0
% 0.12/0.43 % Disequality decompositions : 0
% 0.12/0.43 % Total rewrite steps : 1
% 0.12/0.43 % ...of those cached : 0
% 0.12/0.43 % Propositional unsat checks : 0
% 0.12/0.43 % Propositional check models : 0
% 0.12/0.43 % Propositional check unsatisfiable : 0
% 0.12/0.43 % Propositional clauses : 0
% 0.12/0.43 % Propositional clauses after purity: 0
% 0.12/0.43 % Propositional unsat core size : 0
% 0.12/0.43 % Propositional preprocessing time : 0.000
% 0.12/0.43 % Propositional encoding time : 0.000
% 0.12/0.43 % Propositional solver time : 0.000
% 0.12/0.43 % Success case prop preproc time : 0.000
% 0.12/0.43 % Success case prop encoding time : 0.000
% 0.12/0.43 % Success case prop solver time : 0.000
% 0.12/0.43 % Current number of processed clauses : 21
% 0.12/0.43 % Positive orientable unit clauses : 5
% 0.12/0.43 % Positive unorientable unit clauses: 0
% 0.12/0.43 % Negative unit clauses : 2
% 0.12/0.43 % Non-unit-clauses : 14
% 0.12/0.43 % Current number of unprocessed clauses: 18
% 0.12/0.43 % ...number of literals in the above : 40
% 0.12/0.43 % Current number of archived formulas : 0
% 0.12/0.43 % Current number of archived clauses : 0
% 0.12/0.43 % Clause-clause subsumption calls (NU) : 32
% 0.12/0.43 % Rec. Clause-clause subsumption calls : 31
% 0.12/0.43 % Non-unit clause-clause subsumptions : 2
% 0.12/0.43 % Unit Clause-clause subsumption calls : 7
% 0.12/0.43 % Rewrite failures with RHS unbound : 0
% 0.12/0.43 % BW rewrite match attempts : 6
% 0.12/0.43 % BW rewrite match successes : 0
% 0.12/0.43 % Condensation attempts : 0
% 0.12/0.43 % Condensation successes : 0
% 0.12/0.43 % Termbank termtop insertions : 868
% 0.12/0.43 % Search garbage collected termcells : 24
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.002 s
% 0.12/0.43 % System time : 0.004 s
% 0.12/0.43 % Total time : 0.006 s
% 0.12/0.43 % Maximum resident set size: 3636 pages
% 0.12/0.43
% 0.12/0.43 % -------------------------------------------------
% 0.12/0.43 % User time : 0.003 s
% 0.12/0.43 % System time : 0.007 s
% 0.12/0.43 % Total time : 0.010 s
% 0.12/0.43 % Maximum resident set size: 4608 pages
% 0.12/0.43 % E exiting
%------------------------------------------------------------------------------