%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU427+4 : 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 : n015.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 0.26s 19.59s
% Output : CNFRefutation 0.26s
% 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,
! [X203,X204,X205,X206] :
( ( ~ m1_subset_1(X205,k1_zfmisc_1(X203))
| ~ m1_subset_1(X206,k1_zfmisc_1(k2_zfmisc_1(X203,X204)))
| k4_relset_2(k1_zfmisc_1(X203),X204,k6_relset_2(X204,X203,X206),k3_pua2mss1(X205)) = k1_xboole_0
| X205 != k1_xboole_0 )
& ( ~ m1_subset_1(X205,k1_zfmisc_1(X203))
| ~ m1_subset_1(X206,k1_zfmisc_1(k2_zfmisc_1(X203,X204)))
| X205 = k1_xboole_0
| k4_relset_2(k1_zfmisc_1(X203),X204,k6_relset_2(X204,X203,X206),k3_pua2mss1(X205)) != 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,
! [X207] : k3_pua2mss1(X207) = k8_eqrel_1(X207,k6_partfun1(X207)),
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,
! [X670] : k2_xboole_0(X670,k1_xboole_0) = X670,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_16,plain,
! [X1095,X1096] : k3_tarski(k2_tarski(X1095,X1096)) = k2_xboole_0(X1095,X1096),
inference(variable_rename,[status(thm)],[t93_zfmisc_1]) ).
fof(c_0_17,plain,
! [X667,X668] : k2_xboole_0(X667,X668) = k2_xboole_0(X668,X667),
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,
! [X88,X89,X90] :
( k4_subset_1(X88,X89,X90) = k2_xboole_0(X89,X90)
| ~ m1_subset_1(X90,k1_zfmisc_1(X88))
| ~ m1_subset_1(X89,k1_zfmisc_1(X88)) ),
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,
! [X127] : m1_subset_1(k1_xboole_0,k1_zfmisc_1(X127)),
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.04 % Problem : SEU427+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 % Computer : n015.cluster.edu
% 0.16/0.46 % Model : x86_64 x86_64
% 0.16/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.46 % Memory : 8046.5625MB
% 0.16/0.46 % OS : Linux 6.8.0-71-generic
% 0.16/0.46 % CPULimit : 300
% 0.16/0.46 % WCLimit : 300
% 0.16/0.46 % DateTime : Mon Sep 21 06:31:11 UTC 2026
% 0.16/0.47 % CPUTime :
% 0.16/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.54 Running first-order theorem proving
% 0.22/0.54 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
% 0.26/19.59 % Version: 3.5.1
% 0.26/19.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.26/19.59 % Scheduled 4 strats onto 8 cores with 292 seconds (2336 total)
% 0.26/19.59 % Starting new_bool_3 with 876s (3) cores
% 0.26/19.59 % Starting new_bool_1 with 876s (3) cores
% 0.26/19.59 % Starting sh5l with 292s (1) cores
% 0.26/19.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 292s (1) cores
% 0.26/19.59 % G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 795589 completed with status 0
% 0.26/19.59 % Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 0.26/19.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.26/19.59 % Scheduled 4 strats onto 8 cores with 292 seconds (2336 total)
% 0.26/19.59 % Starting new_bool_3 with 876s (3) cores
% 0.26/19.59 % Starting new_bool_1 with 876s (3) cores
% 0.26/19.59 % Starting sh5l with 292s (1) cores
% 0.26/19.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 292s (1) cores
% 0.26/19.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/19.59 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 0.26/19.59 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.26/19.59 % Scheduled 12 strats onto 1 cores with 291 seconds (291 total)
% 0.26/19.59 % Starting SubtermCWHack with 30s (1) cores
% 0.26/19.59 % SubtermCWHack with pid 795593 completed with status 0
% 0.26/19.59 % Result found by SubtermCWHack
% 0.26/19.59 % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.26/19.59 % Scheduled 4 strats onto 8 cores with 292 seconds (2336 total)
% 0.26/19.59 % Starting new_bool_3 with 876s (3) cores
% 0.26/19.59 % Starting new_bool_1 with 876s (3) cores
% 0.26/19.59 % Starting sh5l with 292s (1) cores
% 0.26/19.59 % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 292s (1) cores
% 0.26/19.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/19.59 % SinE strategy is gf120_h_gu_RUU_F100_L01000
% 0.26/19.59 % Search class: FGHSM-SMLM32-DFFFFFNN
% 0.26/19.59 % Scheduled 12 strats onto 1 cores with 291 seconds (291 total)
% 0.26/19.59 % Starting SubtermCWHack with 30s (1) cores
% 0.26/19.59 % Preprocessing time : 0.188 s
% 0.26/19.59
% 0.26/19.59 % Proof found!
% 0.26/19.59 % SZS status Theorem
% 0.26/19.59 % SZS output start CNFRefutation
% See solution above
% 0.26/19.59 % Parsed axioms : 71108
% 0.26/19.59 % Removed by relevancy pruning/SinE : 70107
% 0.26/19.59 % Initial clauses : 2106
% 0.26/19.59 % Removed in clause preprocessing : 50
% 0.26/19.59 % Initial clauses in saturation : 2056
% 0.26/19.59 % Processed clauses : 17215
% 0.26/19.59 % ...of these trivial : 173
% 0.26/19.59 % ...subsumed : 11220
% 0.26/19.59 % ...remaining for further processing : 5822
% 0.26/19.59 % Other redundant clauses eliminated : 534
% 0.26/19.59 % Clauses deleted for lack of memory : 0
% 0.26/19.59 % Backward-subsumed : 191
% 0.26/19.59 % Backward-rewritten : 734
% 0.26/19.59 % Generated clauses : 124952
% 0.26/19.59 % ...of the previous two non-redundant : 111914
% 0.26/19.59 % ...aggressively subsumed : 0
% 0.26/19.59 % Contextual simplify-reflections : 100
% 0.26/19.59 % Paramodulations : 124377
% 0.26/19.59 % Factorizations : 26
% 0.26/19.59 % NegExts : 0
% 0.26/19.59 % Equation resolutions : 555
% 0.26/19.59 % Disequality decompositions : 0
% 0.26/19.59 % Total rewrite steps : 36542
% 0.26/19.59 % ...of those cached : 33431
% 0.26/19.59 % Propositional unsat checks : 0
% 0.26/19.59 % Propositional check models : 0
% 0.26/19.59 % Propositional check unsatisfiable : 0
% 0.26/19.59 % Propositional clauses : 0
% 0.26/19.59 % Propositional clauses after purity: 0
% 0.26/19.59 % Propositional unsat core size : 0
% 0.26/19.59 % Propositional preprocessing time : 0.000
% 0.26/19.59 % Propositional encoding time : 0.000
% 0.26/19.59 % Propositional solver time : 0.000
% 0.26/19.59 % Success case prop preproc time : 0.000
% 0.26/19.59 % Success case prop encoding time : 0.000
% 0.26/19.59 % Success case prop solver time : 0.000
% 0.26/19.59 % Current number of processed clauses : 4727
% 0.26/19.59 % Positive orientable unit clauses : 594
% 0.26/19.59 % Positive unorientable unit clauses: 6
% 0.26/19.59 % Negative unit clauses : 878
% 0.26/19.59 % Non-unit-clauses : 3249
% 0.26/19.59 % Current number of unprocessed clauses: 95925
% 0.26/19.59 % ...number of literals in the above : 431769
% 0.26/19.59 % Current number of archived formulas : 0
% 0.26/19.59 % Current number of archived clauses : 931
% 0.26/19.59 % Clause-clause subsumption calls (NU) : 2666043
% 0.26/19.59 % Rec. Clause-clause subsumption calls : 908734
% 0.26/19.59 % Non-unit clause-clause subsumptions : 5486
% 0.26/19.59 % Unit Clause-clause subsumption calls : 212348
% 0.26/19.59 % Rewrite failures with RHS unbound : 0
% 0.26/19.59 % BW rewrite match attempts : 591
% 0.26/19.59 % BW rewrite match successes : 261
% 0.26/19.59 % Condensation attempts : 0
% 0.26/19.59 % Condensation successes : 0
% 0.26/19.59 % Termbank termtop insertions : 4480480
% 0.26/19.59 % Search garbage collected termcells : 803976
% 0.26/19.59
% 0.26/19.59 % -------------------------------------------------
% 0.26/19.59 % User time : 9.217 s
% 0.26/19.59 % System time : 0.708 s
% 0.26/19.59 % Total time : 9.925 s
% 0.26/19.59 % Maximum resident set size: 148908 pages
% 0.26/19.59
% 0.26/19.59 % -------------------------------------------------
% 0.26/19.59 % User time : 17.375 s
% 0.26/19.59 % System time : 1.072 s
% 0.26/19.59 % Total time : 18.448 s
% 0.26/19.59 % Maximum resident set size: 121344 pages
% 0.26/19.59 % E exiting
%------------------------------------------------------------------------------