%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU422+2 : 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 : 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:25:05 PM UTC 2026
% Result : Theorem 64.47s 10.18s
% Output : CNFRefutation 64.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 26 unt; 0 def)
% Number of atoms : 82 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 59 ( 25 ~; 16 |; 4 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_relset_2) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+9.ax',t3_subset) ).
fof(t15_relset_2,axiom,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> X2 = k3_tarski(a_2_0_relset_2(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t15_relset_2) ).
fof(t79_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
=> r1_tarski(k1_zfmisc_1(X1),k1_zfmisc_1(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t79_zfmisc_1) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( k4_xboole_0(X1,X2) = k1_xboole_0
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t37_xboole_1) ).
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(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(t100_zfmisc_1,axiom,
! [X1] : r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+6.ax',t100_zfmisc_1) ).
fof(t42_xboole_1,axiom,
! [X1,X2,X3] : k4_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(k4_xboole_0(X1,X3),k4_xboole_0(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t42_xboole_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
=> k2_xboole_0(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t12_xboole_1) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
inference(assume_negation,[status(cth)],[t16_relset_2]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X62,X63] :
( ( m1_subset_1(X62,k1_zfmisc_1(X63))
| ~ r1_tarski(X62,X63) )
& ( r1_tarski(X62,X63)
| ~ m1_subset_1(X62,k1_zfmisc_1(X63)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_13,negated_conjecture,
( ~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))
& ~ v1_xboole_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_14,plain,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> X2 = k3_tarski(a_2_0_relset_2(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[t15_relset_2]) ).
fof(c_0_15,plain,
! [X27,X28] :
( r1_tarski(k1_zfmisc_1(X27),k1_zfmisc_1(X28))
| ~ r1_tarski(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t79_zfmisc_1])])]) ).
cnf(c_0_16,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X89,X90] :
( X90 = k3_tarski(a_2_0_relset_2(X89,X90))
| ~ m1_subset_1(X90,k1_zfmisc_1(X89))
| v1_xboole_0(X89) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_19,plain,
! [X680,X681] :
( ( k4_xboole_0(X680,X681) = k1_xboole_0
| ~ r1_tarski(X680,X681) )
& ( r1_tarski(X680,X681)
| k4_xboole_0(X680,X681) != k1_xboole_0 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).
cnf(c_0_20,plain,
( ~ r1_tarski(X1,X2)
| r1_tarski(k1_zfmisc_1(X1),k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
r1_tarski(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X1114] : k2_xboole_0(X1114,k1_xboole_0) = X1114,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_23,plain,
! [X1111,X1112] : k2_xboole_0(X1111,X1112) = k2_xboole_0(X1112,X1111),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_24,plain,
! [X490] : r1_tarski(X490,k1_zfmisc_1(k3_tarski(X490))),
inference(variable_rename,[status(thm)],[t100_zfmisc_1]) ).
cnf(c_0_25,plain,
( ~ m1_subset_1(X2,k1_zfmisc_1(X1))
| X2 = k3_tarski(a_2_0_relset_2(X1,X2))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X691,X692,X693] : k4_xboole_0(k2_xboole_0(X691,X692),X693) = k2_xboole_0(k4_xboole_0(X691,X693),k4_xboole_0(X692,X693)),
inference(variable_rename,[status(thm)],[t42_xboole_1]) ).
cnf(c_0_28,plain,
( ~ r1_tarski(X1,X2)
| k4_xboole_0(X1,X2) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
r1_tarski(k1_zfmisc_1(esk2_0),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_30,plain,
k2_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_32,plain,
! [X1137,X1138] :
( k2_xboole_0(X1137,X1138) = X1138
| ~ r1_tarski(X1137,X1138) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
cnf(c_0_33,plain,
r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
k3_tarski(a_2_0_relset_2(esk1_0,esk2_0)) = esk2_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_26]) ).
cnf(c_0_35,plain,
k4_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(k4_xboole_0(X1,X3),k4_xboole_0(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
k4_xboole_0(k1_zfmisc_1(esk2_0),k1_zfmisc_1(esk1_0)) = k1_xboole_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
k2_xboole_0(k1_xboole_0,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ r1_tarski(X1,X2)
| k2_xboole_0(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk2_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
k4_xboole_0(k2_xboole_0(k1_zfmisc_1(esk2_0),X1),k1_zfmisc_1(esk1_0)) = k4_xboole_0(X1,k1_zfmisc_1(esk1_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
k2_xboole_0(k1_zfmisc_1(esk2_0),a_2_0_relset_2(esk1_0,esk2_0)) = k1_zfmisc_1(esk2_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_31]) ).
cnf(c_0_42,plain,
( k4_xboole_0(X1,X2) != k1_xboole_0
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_43,negated_conjecture,
k4_xboole_0(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)) = k1_xboole_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_36]) ).
cnf(c_0_44,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_45,negated_conjecture,
r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU422+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n020.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 06:27:04 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 64.47/10.18 % Version: 3.5.1
% 64.47/10.18 % Preprocessing class: FMLMSMLLSSSNFFN.
% 64.47/10.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.47/10.18 % Starting new_bool_3 with 900s (3) cores
% 64.47/10.18 % Starting new_bool_1 with 900s (3) cores
% 64.47/10.18 % Starting sh5l with 300s (1) cores
% 64.47/10.18 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 64.47/10.18 % new_bool_3 with pid 2222882 completed with status 0
% 64.47/10.18 % Result found by new_bool_3
% 64.47/10.18 % Preprocessing class: FMLMSMLLSSSNFFN.
% 64.47/10.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.47/10.18 % Starting new_bool_3 with 900s (3) cores
% 64.47/10.18 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 64.47/10.18 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 64.47/10.18 % Search class: FGHSM-FSLM32-MFFFFFNN
% 64.47/10.18 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 64.47/10.18 % Starting SubtermCWHack with 82s (1) cores
% 64.47/10.18 % Starting new_bool_3 with 91s (1) cores
% 64.47/10.18 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 74s (1) cores
% 64.47/10.18 % new_bool_3 with pid 2222889 completed with status 0
% 64.47/10.18 % Result found by new_bool_3
% 64.47/10.18 % Preprocessing class: FMLMSMLLSSSNFFN.
% 64.47/10.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 64.47/10.18 % Starting new_bool_3 with 900s (3) cores
% 64.47/10.18 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 64.47/10.18 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 64.47/10.18 % Search class: FGHSM-FSLM32-MFFFFFNN
% 64.47/10.18 % Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 64.47/10.18 % Starting SubtermCWHack with 82s (1) cores
% 64.47/10.18 % Starting new_bool_3 with 91s (1) cores
% 64.47/10.18 % Preprocessing time : 0.012 s
% 64.47/10.18 % Presaturation interreduction done
% 64.47/10.18
% 64.47/10.18 % Proof found!
% 64.47/10.18 % SZS status Theorem
% 64.47/10.18 % SZS output start CNFRefutation
% See solution above
% 64.47/10.19 % Parsed axioms : 4487
% 64.47/10.19 % Removed by relevancy pruning/SinE : 3974
% 64.47/10.19 % Initial clauses : 920
% 64.47/10.19 % Removed in clause preprocessing : 25
% 64.47/10.19 % Initial clauses in saturation : 895
% 64.47/10.19 % Processed clauses : 41706
% 64.47/10.19 % ...of these trivial : 738
% 64.47/10.19 % ...subsumed : 33507
% 64.47/10.19 % ...remaining for further processing : 7461
% 64.47/10.19 % Other redundant clauses eliminated : 1656
% 64.47/10.19 % Clauses deleted for lack of memory : 0
% 64.47/10.19 % Backward-subsumed : 419
% 64.47/10.19 % Backward-rewritten : 272
% 64.47/10.19 % Generated clauses : 658878
% 64.47/10.19 % ...of the previous two non-redundant : 586585
% 64.47/10.19 % ...aggressively subsumed : 0
% 64.47/10.19 % Contextual simplify-reflections : 51
% 64.47/10.19 % Paramodulations : 657182
% 64.47/10.19 % Factorizations : 28
% 64.47/10.19 % NegExts : 0
% 64.47/10.19 % Equation resolutions : 1674
% 64.47/10.19 % Disequality decompositions : 0
% 64.47/10.19 % Total rewrite steps : 480097
% 64.47/10.19 % ...of those cached : 381352
% 64.47/10.19 % Propositional unsat checks : 1
% 64.47/10.19 % Propositional check models : 0
% 64.47/10.19 % Propositional check unsatisfiable : 0
% 64.47/10.19 % Propositional clauses : 0
% 64.47/10.19 % Propositional clauses after purity: 0
% 64.47/10.19 % Propositional unsat core size : 0
% 64.47/10.19 % Propositional preprocessing time : 0.000
% 64.47/10.19 % Propositional encoding time : 0.365
% 64.47/10.19 % Propositional solver time : 0.285
% 64.47/10.19 % Success case prop preproc time : 0.000
% 64.47/10.19 % Success case prop encoding time : 0.000
% 64.47/10.19 % Success case prop solver time : 0.000
% 64.47/10.19 % Current number of processed clauses : 5874
% 64.47/10.19 % Positive orientable unit clauses : 1468
% 64.47/10.19 % Positive unorientable unit clauses: 20
% 64.47/10.19 % Negative unit clauses : 1678
% 64.47/10.19 % Non-unit-clauses : 2708
% 64.47/10.19 % Current number of unprocessed clauses: 545967
% 64.47/10.19 % ...number of literals in the above : 1016719
% 64.47/10.19 % Current number of archived formulas : 0
% 64.47/10.19 % Current number of archived clauses : 1498
% 64.47/10.19 % Clause-clause subsumption calls (NU) : 1478997
% 64.47/10.19 % Rec. Clause-clause subsumption calls : 1096878
% 64.47/10.19 % Non-unit clause-clause subsumptions : 5458
% 64.47/10.19 % Unit Clause-clause subsumption calls : 485783
% 64.47/10.19 % Rewrite failures with RHS unbound : 0
% 64.47/10.19 % BW rewrite match attempts : 3275
% 64.47/10.19 % BW rewrite match successes : 1093
% 64.47/10.19 % Condensation attempts : 0
% 64.47/10.19 % Condensation successes : 0
% 64.47/10.19 % Termbank termtop insertions : 10455652
% 64.47/10.19 % Search garbage collected termcells : 44149
% 64.47/10.19
% 64.47/10.19 % -------------------------------------------------
% 64.47/10.19 % User time : 9.017 s
% 64.47/10.19 % System time : 0.387 s
% 64.47/10.19 % Total time : 9.404 s
% 64.47/10.19 % Maximum resident set size: 11708 pages
% 64.47/10.19
% 64.47/10.19 % -------------------------------------------------
% 64.47/10.19 % User time : 27.294 s
% 64.47/10.19 % System time : 1.037 s
% 64.47/10.19 % Total time : 28.331 s
% 64.47/10.19 % Maximum resident set size: 10240 pages
% 64.47/10.19 % E exiting
%------------------------------------------------------------------------------