%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU427+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:25:07 PM UTC 2026
% Result : Theorem 8.63s 1.75s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 23 unt; 0 def)
% Number of atoms : 66 ( 34 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 52 ( 19 ~; 15 |; 6 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-4 aty)
% Number of variables : 56 ( 1 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X5),k3_pua2mss1(X3)) = k1_xboole_0
=> k8_relset_2(X1,X2,k4_subset_1(X1,X3,X4),X5) = k8_relset_2(X1,X2,X4,X5) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_relset_2) ).
fof(t23_relset_2,axiom,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X4),k3_pua2mss1(X3)) = k1_xboole_0
<=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_relset_2) ).
fof(t1_boole,axiom,
! [X1] : k2_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t1_boole) ).
fof(t93_zfmisc_1,axiom,
! [X1,X2] : k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t93_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0) ).
fof(redefinition_k4_subset_1,axiom,
! [X1,X2,X3] :
( ( m1_subset_1(X3,k1_zfmisc_1(X1))
& m1_subset_1(X2,k1_zfmisc_1(X1)) )
=> k4_subset_1(X1,X2,X3) = k2_xboole_0(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',redefinition_k4_subset_1) ).
fof(t4_subset_1,axiom,
! [X1] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+7.ax',t4_subset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X1))
=> ! [X5] :
( m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
=> ( k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X5),k3_pua2mss1(X3)) = k1_xboole_0
=> k8_relset_2(X1,X2,k4_subset_1(X1,X3,X4),X5) = k8_relset_2(X1,X2,X4,X5) ) ) ) ),
inference(assume_negation,[status(cth)],[t26_relset_2]) ).
fof(c_0_8,plain,
! [X107,X108,X109,X110] :
( ( ~ m1_subset_1(X109,k1_zfmisc_1(X107))
| ~ m1_subset_1(X110,k1_zfmisc_1(k2_zfmisc_1(X107,X108)))
| k4_relset_2(k1_zfmisc_1(X107),X108,k6_relset_2(X108,X107,X110),k3_pua2mss1(X109)) = k1_xboole_0
| X109 != k1_xboole_0 )
& ( ~ m1_subset_1(X109,k1_zfmisc_1(X107))
| ~ m1_subset_1(X110,k1_zfmisc_1(k2_zfmisc_1(X107,X108)))
| X109 = k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X107),X108,k6_relset_2(X108,X107,X110),k3_pua2mss1(X109)) != k1_xboole_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_relset_2])])])])]) ).
fof(c_0_9,negated_conjecture,
( k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,esk3_0,esk4_0),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0)
& k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k3_pua2mss1(esk3_0)) = k1_xboole_0
& m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))
& m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0))
& m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X658] : k2_xboole_0(X658,k1_xboole_0) = X658,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_11,plain,
! [X867,X868] : k3_tarski(k2_tarski(X867,X868)) = k2_xboole_0(X867,X868),
inference(variable_rename,[status(thm)],[t93_zfmisc_1]) ).
fof(c_0_12,plain,
! [X655,X656] : k2_xboole_0(X655,X656) = k2_xboole_0(X656,X655),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_13,plain,
( ~ m1_subset_1(X4,k1_zfmisc_1(X1))
| ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
| k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X3),k3_pua2mss1(X4)) != k1_xboole_0
| X4 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k3_pua2mss1(esk3_0)) = k1_xboole_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X59,X60,X61] :
( k4_subset_1(X59,X60,X61) = k2_xboole_0(X60,X61)
| ~ m1_subset_1(X61,k1_zfmisc_1(X59))
| ~ m1_subset_1(X60,k1_zfmisc_1(X59)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])])]) ).
cnf(c_0_18,plain,
k2_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,esk3_0,esk4_0),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| k4_subset_1(X2,X1,X3) = k2_xboole_0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
k3_tarski(k2_tarski(X1,k1_xboole_0)) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
k3_tarski(k2_tarski(X1,X2)) = k3_tarski(k2_tarski(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19]),c_0_19]) ).
fof(c_0_26,plain,
! [X153] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X153)),
inference(variable_rename,[status(thm)],[t4_subset_1]) ).
cnf(c_0_27,negated_conjecture,
k8_relset_2(esk1_0,esk2_0,k4_subset_1(esk1_0,k1_xboole_0,esk4_0),esk5_0) != k8_relset_2(esk1_0,esk2_0,esk4_0,esk5_0),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2))
| k4_subset_1(X2,X1,X3) = k3_tarski(k2_tarski(X1,X3)) ),
inference(rw,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_29,plain,
k3_tarski(k2_tarski(k1_xboole_0,X1)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU427+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 06:29:29 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.43 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
% 8.63/1.75 % Version: 3.5.1
% 8.63/1.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 8.63/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.75 % Starting new_bool_3 with 900s (3) cores
% 8.63/1.75 % Starting new_bool_1 with 900s (3) cores
% 8.63/1.75 % Starting sh5l with 300s (1) cores
% 8.63/1.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 8.63/1.75 % G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 1195755 completed with status 0
% 8.63/1.75 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 8.63/1.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 8.63/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.75 % Starting new_bool_3 with 900s (3) cores
% 8.63/1.75 % Starting new_bool_1 with 900s (3) cores
% 8.63/1.75 % Starting sh5l with 300s (1) cores
% 8.63/1.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 8.63/1.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.63/1.75 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 8.63/1.75 % Search class: FGHSM-FSLM32-DFFFFFNN
% 8.63/1.75 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 8.63/1.75 % Starting SubtermCWHack with 28s (1) cores
% 8.63/1.75 % SubtermCWHack with pid 1195756 completed with status 0
% 8.63/1.75 % Result found by SubtermCWHack
% 8.63/1.75 % Preprocessing class: FMLMSMLLSSSNFFN.
% 8.63/1.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.63/1.75 % Starting new_bool_3 with 900s (3) cores
% 8.63/1.75 % Starting new_bool_1 with 900s (3) cores
% 8.63/1.75 % Starting sh5l with 300s (1) cores
% 8.63/1.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 8.63/1.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.63/1.75 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 8.63/1.75 % Search class: FGHSM-FSLM32-DFFFFFNN
% 8.63/1.75 % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 8.63/1.75 % Starting SubtermCWHack with 28s (1) cores
% 8.63/1.75 % Preprocessing time : 0.017 s
% 8.63/1.75
% 8.63/1.75 % Proof found!
% 8.63/1.75 % SZS status Theorem
% 8.63/1.75 % SZS output start CNFRefutation
% See solution above
% 8.63/1.75 % Parsed axioms : 4498
% 8.63/1.75 % Removed by relevancy pruning/SinE : 3997
% 8.63/1.75 % Initial clauses : 855
% 8.63/1.75 % Removed in clause preprocessing : 23
% 8.63/1.75 % Initial clauses in saturation : 832
% 8.63/1.75 % Processed clauses : 7271
% 8.63/1.75 % ...of these trivial : 38
% 8.63/1.75 % ...subsumed : 4597
% 8.63/1.75 % ...remaining for further processing : 2636
% 8.63/1.75 % Other redundant clauses eliminated : 184
% 8.63/1.75 % Clauses deleted for lack of memory : 0
% 8.63/1.75 % Backward-subsumed : 103
% 8.63/1.75 % Backward-rewritten : 166
% 8.63/1.75 % Generated clauses : 52194
% 8.63/1.75 % ...of the previous two non-redundant : 42280
% 8.63/1.75 % ...aggressively subsumed : 0
% 8.63/1.75 % Contextual simplify-reflections : 10
% 8.63/1.75 % Paramodulations : 51986
% 8.63/1.75 % Factorizations : 17
% 8.63/1.75 % NegExts : 0
% 8.63/1.75 % Equation resolutions : 197
% 8.63/1.75 % Disequality decompositions : 0
% 8.63/1.75 % Total rewrite steps : 24364
% 8.63/1.75 % ...of those cached : 22536
% 8.63/1.75 % Propositional unsat checks : 0
% 8.63/1.75 % Propositional check models : 0
% 8.63/1.75 % Propositional check unsatisfiable : 0
% 8.63/1.75 % Propositional clauses : 0
% 8.63/1.75 % Propositional clauses after purity: 0
% 8.63/1.75 % Propositional unsat core size : 0
% 8.63/1.75 % Propositional preprocessing time : 0.000
% 8.63/1.75 % Propositional encoding time : 0.000
% 8.63/1.75 % Propositional solver time : 0.000
% 8.63/1.75 % Success case prop preproc time : 0.000
% 8.63/1.75 % Success case prop encoding time : 0.000
% 8.63/1.75 % Success case prop solver time : 0.000
% 8.63/1.75 % Current number of processed clauses : 2285
% 8.63/1.75 % Positive orientable unit clauses : 223
% 8.63/1.75 % Positive unorientable unit clauses: 3
% 8.63/1.75 % Negative unit clauses : 272
% 8.63/1.75 % Non-unit-clauses : 1787
% 8.63/1.75 % Current number of unprocessed clauses: 35762
% 8.63/1.75 % ...number of literals in the above : 115400
% 8.63/1.75 % Current number of archived formulas : 0
% 8.63/1.75 % Current number of archived clauses : 271
% 8.63/1.75 % Clause-clause subsumption calls (NU) : 856175
% 8.63/1.75 % Rec. Clause-clause subsumption calls : 570320
% 8.63/1.75 % Non-unit clause-clause subsumptions : 2537
% 8.63/1.75 % Unit Clause-clause subsumption calls : 40459
% 8.63/1.75 % Rewrite failures with RHS unbound : 0
% 8.63/1.75 % BW rewrite match attempts : 186
% 8.63/1.75 % BW rewrite match successes : 78
% 8.63/1.75 % Condensation attempts : 0
% 8.63/1.75 % Condensation successes : 0
% 8.63/1.75 % Termbank termtop insertions : 711357
% 8.63/1.75 % Search garbage collected termcells : 45156
% 8.63/1.75
% 8.63/1.75 % -------------------------------------------------
% 8.63/1.75 % User time : 1.070 s
% 8.63/1.75 % System time : 0.063 s
% 8.63/1.75 % Total time : 1.133 s
% 8.63/1.75 % Maximum resident set size: 11728 pages
% 8.63/1.75
% 8.63/1.75 % -------------------------------------------------
% 8.63/1.75 % User time : 1.207 s
% 8.63/1.75 % System time : 0.076 s
% 8.63/1.75 % Total time : 1.282 s
% 8.63/1.75 % Maximum resident set size: 10496 pages
% 8.63/1.75 % E exiting
%------------------------------------------------------------------------------