%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU422+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 : n013.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:29:21 PM UTC 2026
% Result : Theorem 73.05s 12.04s
% Output : CNFRefutation 73.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 26 unt; 0 def)
% Number of atoms : 72 ( 18 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 49 ( 21 ~; 12 |; 3 &)
% ( 1 <=>; 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 2 sgn 40 !; 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(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(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(t4_xboole_1,axiom,
! [X1,X2,X3] : k2_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(X1,k2_xboole_0(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t4_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : r1_tarski(X1,k2_xboole_0(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+4.ax',t7_xboole_1) ).
fof(c_0_9,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_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(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X350,X351] :
( ( m1_subset_1(X350,k1_zfmisc_1(X351))
| ~ r1_tarski(X350,X351) )
& ( r1_tarski(X350,X351)
| ~ m1_subset_1(X350,k1_zfmisc_1(X351)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_12,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_10])])])]) ).
fof(c_0_13,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_14,plain,
! [X340,X341] :
( r1_tarski(k1_zfmisc_1(X340),k1_zfmisc_1(X341))
| ~ r1_tarski(X340,X341) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t79_zfmisc_1])])]) ).
cnf(c_0_15,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X46,X47] :
( X47 = k3_tarski(a_2_0_relset_2(X46,X47))
| ~ m1_subset_1(X47,k1_zfmisc_1(X46))
| v1_xboole_0(X46) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_18,plain,
! [X991,X992] :
( k2_xboole_0(X991,X992) = X992
| ~ r1_tarski(X991,X992) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
cnf(c_0_19,plain,
( ~ r1_tarski(X1,X2)
| r1_tarski(k1_zfmisc_1(X1),k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
r1_tarski(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,plain,
! [X965,X966] : k2_xboole_0(X965,X966) = k2_xboole_0(X966,X965),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_22,plain,
! [X208] : r1_tarski(X208,k1_zfmisc_1(k3_tarski(X208))),
inference(variable_rename,[status(thm)],[t100_zfmisc_1]) ).
cnf(c_0_23,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_17]) ).
cnf(c_0_24,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_25,plain,
! [X969,X970,X971] : k2_xboole_0(k2_xboole_0(X969,X970),X971) = k2_xboole_0(X969,k2_xboole_0(X970,X971)),
inference(variable_rename,[status(thm)],[t4_xboole_1]) ).
cnf(c_0_26,plain,
( ~ r1_tarski(X1,X2)
| k2_xboole_0(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,negated_conjecture,
r1_tarski(k1_zfmisc_1(esk2_0),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,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_23,c_0_16]),c_0_24]) ).
fof(c_0_31,plain,
! [X977,X978] : r1_tarski(X977,k2_xboole_0(X977,X978)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_32,plain,
k2_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(X1,k2_xboole_0(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
k2_xboole_0(k1_zfmisc_1(esk1_0),k1_zfmisc_1(esk2_0)) = k1_zfmisc_1(esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk2_0)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
r1_tarski(X1,k2_xboole_0(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
k2_xboole_0(k1_zfmisc_1(esk1_0),k2_xboole_0(k1_zfmisc_1(esk2_0),X1)) = k2_xboole_0(k1_zfmisc_1(esk1_0),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,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_26,c_0_34]),c_0_28]) ).
cnf(c_0_38,plain,
r1_tarski(X1,k2_xboole_0(X2,X1)),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_39,negated_conjecture,
k2_xboole_0(k1_zfmisc_1(esk1_0),a_2_0_relset_2(esk1_0,esk2_0)) = k1_zfmisc_1(esk1_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_33]) ).
cnf(c_0_40,plain,
( ~ r1_tarski(X1,X2)
| m1_subset_1(X1,k1_zfmisc_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_41,negated_conjecture,
r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,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_12]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU422+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 06:26:11 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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
% 73.05/12.04 % Version: 3.5.1
% 73.05/12.04 % Preprocessing class: FMLLMMLLSSSNFFN.
% 73.05/12.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 73.05/12.04 % Starting new_bool_3 with 900s (3) cores
% 73.05/12.04 % Starting new_bool_1 with 900s (3) cores
% 73.05/12.04 % Starting sh5l with 300s (1) cores
% 73.05/12.04 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 73.05/12.04 % new_bool_3 with pid 143265 completed with status 0
% 73.05/12.04 % Result found by new_bool_3
% 73.05/12.04 % Preprocessing class: FMLLMMLLSSSNFFN.
% 73.05/12.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 73.05/12.04 % Starting new_bool_3 with 900s (3) cores
% 73.05/12.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 73.05/12.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 73.05/12.04 % Search class: FGHSM-SSLM32-MFFFFFNN
% 73.05/12.04 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 73.05/12.04 % Starting SubtermCWHack with 82s (1) cores
% 73.05/12.04 % Starting new_bool_3 with 91s (1) cores
% 73.05/12.04 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 82s (1) cores
% 73.05/12.04 % new_bool_3 with pid 143272 completed with status 0
% 73.05/12.04 % Result found by new_bool_3
% 73.05/12.04 % Preprocessing class: FMLLMMLLSSSNFFN.
% 73.05/12.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 73.05/12.04 % Starting new_bool_3 with 900s (3) cores
% 73.05/12.04 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 73.05/12.04 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 73.05/12.04 % Search class: FGHSM-SSLM32-MFFFFFNN
% 73.05/12.04 % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 73.05/12.04 % Starting SubtermCWHack with 82s (1) cores
% 73.05/12.04 % Starting new_bool_3 with 91s (1) cores
% 73.05/12.04 % Preprocessing time : 0.049 s
% 73.05/12.04 % Presaturation interreduction done
% 73.05/12.04
% 73.05/12.04 % Proof found!
% 73.05/12.04 % SZS status Theorem
% 73.05/12.04 % SZS output start CNFRefutation
% See solution above
% 73.05/12.04 % Parsed axioms : 19086
% 73.05/12.04 % Removed by relevancy pruning/SinE : 18530
% 73.05/12.04 % Initial clauses : 1120
% 73.05/12.04 % Removed in clause preprocessing : 38
% 73.05/12.04 % Initial clauses in saturation : 1082
% 73.05/12.04 % Processed clauses : 39172
% 73.05/12.04 % ...of these trivial : 429
% 73.05/12.04 % ...subsumed : 31988
% 73.05/12.04 % ...remaining for further processing : 6755
% 73.05/12.04 % Other redundant clauses eliminated : 1270
% 73.05/12.04 % Clauses deleted for lack of memory : 0
% 73.05/12.04 % Backward-subsumed : 332
% 73.05/12.04 % Backward-rewritten : 390
% 73.05/12.04 % Generated clauses : 515937
% 73.05/12.04 % ...of the previous two non-redundant : 467683
% 73.05/12.04 % ...aggressively subsumed : 0
% 73.05/12.04 % Contextual simplify-reflections : 45
% 73.05/12.04 % Paramodulations : 514633
% 73.05/12.04 % Factorizations : 26
% 73.05/12.04 % NegExts : 0
% 73.05/12.04 % Equation resolutions : 1284
% 73.05/12.04 % Disequality decompositions : 0
% 73.05/12.04 % Total rewrite steps : 334320
% 73.05/12.04 % ...of those cached : 267600
% 73.05/12.04 % Propositional unsat checks : 1
% 73.05/12.04 % Propositional check models : 0
% 73.05/12.04 % Propositional check unsatisfiable : 0
% 73.05/12.04 % Propositional clauses : 0
% 73.05/12.04 % Propositional clauses after purity: 0
% 73.05/12.04 % Propositional unsat core size : 0
% 73.05/12.04 % Propositional preprocessing time : 0.000
% 73.05/12.04 % Propositional encoding time : 0.418
% 73.05/12.04 % Propositional solver time : 0.227
% 73.05/12.04 % Success case prop preproc time : 0.000
% 73.05/12.04 % Success case prop encoding time : 0.000
% 73.05/12.04 % Success case prop solver time : 0.000
% 73.05/12.04 % Current number of processed clauses : 4989
% 73.05/12.04 % Positive orientable unit clauses : 1084
% 73.05/12.04 % Positive unorientable unit clauses: 18
% 73.05/12.04 % Negative unit clauses : 1310
% 73.05/12.04 % Non-unit-clauses : 2577
% 73.05/12.04 % Current number of unprocessed clauses: 429314
% 73.05/12.04 % ...number of literals in the above : 910990
% 73.05/12.04 % Current number of archived formulas : 0
% 73.05/12.04 % Current number of archived clauses : 1680
% 73.05/12.04 % Clause-clause subsumption calls (NU) : 1470145
% 73.05/12.04 % Rec. Clause-clause subsumption calls : 692901
% 73.05/12.04 % Non-unit clause-clause subsumptions : 7446
% 73.05/12.04 % Unit Clause-clause subsumption calls : 335365
% 73.05/12.04 % Rewrite failures with RHS unbound : 0
% 73.05/12.04 % BW rewrite match attempts : 3070
% 73.05/12.04 % BW rewrite match successes : 1201
% 73.05/12.04 % Condensation attempts : 0
% 73.05/12.04 % Condensation successes : 0
% 73.05/12.04 % Termbank termtop insertions : 8744843
% 73.05/12.04 % Search garbage collected termcells : 195934
% 73.05/12.04
% 73.05/12.04 % -------------------------------------------------
% 73.05/12.04 % User time : 9.789 s
% 73.05/12.04 % System time : 0.450 s
% 73.05/12.04 % Total time : 10.239 s
% 73.05/12.04 % Maximum resident set size: 40812 pages
% 73.05/12.04
% 73.05/12.04 % -------------------------------------------------
% 73.05/12.04 % User time : 30.403 s
% 73.05/12.04 % System time : 1.193 s
% 73.05/12.04 % Total time : 31.596 s
% 73.05/12.04 % Maximum resident set size: 33024 pages
% 73.05/12.04 % E exiting
%------------------------------------------------------------------------------