%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU427+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 12.65s 5.52s
% Output : CNFRefutation 12.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 74 ( 40 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 58 ( 22 ~; 18 |; 6 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 6 con; 0-4 aty)
% Number of variables : 63 ( 1 sgn 38 !; 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/sandbox/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/sandbox/benchmark/theBenchmark.p',t23_relset_2) ).
fof(d2_pua2mss1,axiom,
! [X1] : k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+441.ax',d2_pua2mss1) ).
fof(t1_boole,axiom,
! [X1] : k2_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/SET007/SET007+7.ax',t4_subset_1) ).
fof(c_0_8,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_9,plain,
! [X150,X151,X152,X153] :
( ( ~ m1_subset_1(X152,k1_zfmisc_1(X150))
| ~ m1_subset_1(X153,k1_zfmisc_1(k2_zfmisc_1(X150,X151)))
| k4_relset_2(k1_zfmisc_1(X150),X151,k6_relset_2(X151,X150,X153),k3_pua2mss1(X152)) = k1_xboole_0
| X152 != k1_xboole_0 )
& ( ~ m1_subset_1(X152,k1_zfmisc_1(X150))
| ~ m1_subset_1(X153,k1_zfmisc_1(k2_zfmisc_1(X150,X151)))
| X152 = k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X150),X151,k6_relset_2(X151,X150,X153),k3_pua2mss1(X152)) != 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_10,plain,
! [X154] : k3_pua2mss1(X154) = k8_eqrel_1(X154,k6_partfun1(X154)),
inference(variable_rename,[status(thm)],[d2_pua2mss1]) ).
fof(c_0_11,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_8])])])]) ).
cnf(c_0_12,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_9]) ).
cnf(c_0_13,plain,
k3_pua2mss1(X1) = k8_eqrel_1(X1,k6_partfun1(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
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_11]) ).
fof(c_0_15,plain,
! [X758] : k2_xboole_0(X758,k1_xboole_0) = X758,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_16,plain,
! [X1171,X1172] : k3_tarski(k2_tarski(X1171,X1172)) = k2_xboole_0(X1171,X1172),
inference(variable_rename,[status(thm)],[t93_zfmisc_1]) ).
fof(c_0_17,plain,
! [X755,X756] : k2_xboole_0(X755,X756) = k2_xboole_0(X756,X755),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_18,plain,
( ~ m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))
| ~ m1_subset_1(X4,k1_zfmisc_1(X1))
| k4_relset_2(k1_zfmisc_1(X1),X2,k6_relset_2(X2,X1,X3),k8_eqrel_1(X4,k6_partfun1(X4))) != k1_xboole_0
| X4 = k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
k4_relset_2(k1_zfmisc_1(esk1_0),esk2_0,k6_relset_2(esk2_0,esk1_0,esk5_0),k8_eqrel_1(esk3_0,k6_partfun1(esk3_0))) = k1_xboole_0,
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X60,X61,X62] :
( k4_subset_1(X60,X61,X62) = k2_xboole_0(X61,X62)
| ~ m1_subset_1(X62,k1_zfmisc_1(X60))
| ~ m1_subset_1(X61,k1_zfmisc_1(X60)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_subset_1])])]) ).
cnf(c_0_23,plain,
k2_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
k3_tarski(k2_tarski(X1,X2)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,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_11]) ).
cnf(c_0_27,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_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_28,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_22]) ).
cnf(c_0_29,plain,
k3_tarski(k2_tarski(X1,k1_xboole_0)) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
k3_tarski(k2_tarski(X1,X2)) = k3_tarski(k2_tarski(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_24]),c_0_24]) ).
fof(c_0_31,plain,
! [X108] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X108)),
inference(variable_rename,[status(thm)],[t4_subset_1]) ).
cnf(c_0_32,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_26,c_0_27]) ).
cnf(c_0_33,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_28,c_0_24]) ).
cnf(c_0_34,plain,
k3_tarski(k2_tarski(k1_xboole_0,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,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_32,c_0_33]),c_0_34]),c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU427+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 % Computer : n026.cluster.edu
% 0.15/0.43 % Model : x86_64 x86_64
% 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43 % Memory : 8046.5625MB
% 0.15/0.43 % OS : Linux 6.8.0-71-generic
% 0.15/0.43 % CPULimit : 300
% 0.15/0.43 % WCLimit : 300
% 0.15/0.43 % DateTime : Mon Sep 21 06:30:38 UTC 2026
% 0.15/0.43 % CPUTime :
% 0.15/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.50 Running first-order theorem proving
% 0.15/0.50 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
% 12.65/5.52 % Version: 3.5.1
% 12.65/5.52 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.65/5.52 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.65/5.52 % Starting new_bool_3 with 897s (3) cores
% 12.65/5.52 % Starting new_bool_1 with 897s (3) cores
% 12.65/5.52 % Starting sh5l with 299s (1) cores
% 12.65/5.52 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 299s (1) cores
% 12.65/5.52 % G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 1593442 completed with status 0
% 12.65/5.52 % Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 12.65/5.52 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.65/5.52 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.65/5.52 % Starting new_bool_3 with 897s (3) cores
% 12.65/5.52 % Starting new_bool_1 with 897s (3) cores
% 12.65/5.52 % Starting sh5l with 299s (1) cores
% 12.65/5.52 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 299s (1) cores
% 12.65/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.65/5.52 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 12.65/5.52 % Search class: FGHSM-FSLM32-DFFFFFNN
% 12.65/5.52 % Scheduled 13 strats onto 1 cores with 299 seconds (299 total)
% 12.65/5.52 % Starting SubtermCWHack with 27s (1) cores
% 12.65/5.52 % SubtermCWHack with pid 1593443 completed with status 0
% 12.65/5.52 % Result found by SubtermCWHack
% 12.65/5.52 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.65/5.52 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.65/5.52 % Starting new_bool_3 with 897s (3) cores
% 12.65/5.52 % Starting new_bool_1 with 897s (3) cores
% 12.65/5.52 % Starting sh5l with 299s (1) cores
% 12.65/5.52 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 299s (1) cores
% 12.65/5.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 12.65/5.52 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 12.65/5.52 % Search class: FGHSM-FSLM32-DFFFFFNN
% 12.65/5.52 % Scheduled 13 strats onto 1 cores with 299 seconds (299 total)
% 12.65/5.52 % Starting SubtermCWHack with 27s (1) cores
% 12.65/5.52 % Preprocessing time : 0.059 s
% 12.65/5.52
% 12.65/5.52 % Proof found!
% 12.65/5.52 % SZS status Theorem
% 12.65/5.52 % SZS output start CNFRefutation
% See solution above
% 12.65/5.52 % Parsed axioms : 19097
% 12.65/5.52 % Removed by relevancy pruning/SinE : 18596
% 12.65/5.52 % Initial clauses : 946
% 12.65/5.52 % Removed in clause preprocessing : 11
% 12.65/5.52 % Initial clauses in saturation : 935
% 12.65/5.52 % Processed clauses : 8349
% 12.65/5.52 % ...of these trivial : 206
% 12.65/5.52 % ...subsumed : 5616
% 12.65/5.52 % ...remaining for further processing : 2527
% 12.65/5.52 % Other redundant clauses eliminated : 169
% 12.65/5.52 % Clauses deleted for lack of memory : 0
% 12.65/5.52 % Backward-subsumed : 130
% 12.65/5.52 % Backward-rewritten : 155
% 12.65/5.52 % Generated clauses : 41501
% 12.65/5.52 % ...of the previous two non-redundant : 35567
% 12.65/5.52 % ...aggressively subsumed : 0
% 12.65/5.52 % Contextual simplify-reflections : 24
% 12.65/5.52 % Paramodulations : 41318
% 12.65/5.52 % Factorizations : 12
% 12.65/5.52 % NegExts : 0
% 12.65/5.52 % Equation resolutions : 176
% 12.65/5.52 % Disequality decompositions : 0
% 12.65/5.52 % Total rewrite steps : 12523
% 12.65/5.52 % ...of those cached : 11291
% 12.65/5.52 % Propositional unsat checks : 0
% 12.65/5.52 % Propositional check models : 0
% 12.65/5.52 % Propositional check unsatisfiable : 0
% 12.65/5.52 % Propositional clauses : 0
% 12.65/5.52 % Propositional clauses after purity: 0
% 12.65/5.52 % Propositional unsat core size : 0
% 12.65/5.52 % Propositional preprocessing time : 0.000
% 12.65/5.52 % Propositional encoding time : 0.000
% 12.65/5.52 % Propositional solver time : 0.000
% 12.65/5.52 % Success case prop preproc time : 0.000
% 12.65/5.52 % Success case prop encoding time : 0.000
% 12.65/5.52 % Success case prop solver time : 0.000
% 12.65/5.52 % Current number of processed clauses : 2138
% 12.65/5.52 % Positive orientable unit clauses : 313
% 12.65/5.52 % Positive unorientable unit clauses: 3
% 12.65/5.52 % Negative unit clauses : 362
% 12.65/5.52 % Non-unit-clauses : 1460
% 12.65/5.52 % Current number of unprocessed clauses: 27623
% 12.65/5.52 % ...number of literals in the above : 90458
% 12.65/5.52 % Current number of archived formulas : 0
% 12.65/5.52 % Current number of archived clauses : 288
% 12.65/5.52 % Clause-clause subsumption calls (NU) : 1091147
% 12.65/5.52 % Rec. Clause-clause subsumption calls : 352685
% 12.65/5.52 % Non-unit clause-clause subsumptions : 2368
% 12.65/5.52 % Unit Clause-clause subsumption calls : 75827
% 12.65/5.52 % Rewrite failures with RHS unbound : 0
% 12.65/5.52 % BW rewrite match attempts : 284
% 12.65/5.52 % BW rewrite match successes : 104
% 12.65/5.52 % Condensation attempts : 0
% 12.65/5.52 % Condensation successes : 0
% 12.65/5.52 % Termbank termtop insertions : 1068754
% 12.65/5.52 % Search garbage collected termcells : 196179
% 12.65/5.52
% 12.65/5.52 % -------------------------------------------------
% 12.65/5.52 % User time : 2.250 s
% 12.65/5.52 % System time : 0.153 s
% 12.65/5.52 % Total time : 2.403 s
% 12.65/5.52 % Maximum resident set size: 40780 pages
% 12.65/5.52
% 12.65/5.52 % -------------------------------------------------
% 12.65/5.52 % User time : 3.856 s
% 12.65/5.52 % System time : 0.222 s
% 12.65/5.52 % Total time : 4.078 s
% 12.65/5.52 % Maximum resident set size: 32768 pages
% 12.65/5.52 % E exiting
%------------------------------------------------------------------------------