%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU146+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:28:14 PM UTC 2026
% Result : Theorem 0.22s 5.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 82 ( 32 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 75 ( 25 ~; 37 |; 7 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(l4_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(c_0_7,plain,
! [X10,X11,X12] :
( subset(X10,set_difference(X11,singleton(X12)))
| in(X12,X10)
| ~ subset(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_zfmisc_1])])]) ).
fof(c_0_8,plain,
! [X17] : subset(X17,X17),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = singleton(X2)
| X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[l4_zfmisc_1]) ).
fof(c_0_10,plain,
! [X6,X7] :
( ( X6 = X7
| ~ subset(X7,X6)
| ~ subset(X6,X7) )
& ( X6 != X7
| subset(X7,X6) )
& ( X6 != X7
| subset(X6,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_11,plain,
( ~ subset(X1,X2)
| subset(X1,set_difference(X2,singleton(X3)))
| in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_13,plain,
! [X19,X20] :
( ( set_difference(X19,X20) = empty_set
| ~ subset(X19,X20) )
& ( subset(X19,X20)
| set_difference(X19,X20) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).
fof(c_0_14,negated_conjecture,
( ( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) )
& ( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) )
& ( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_15,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(X2,X1)
| subset(X1,set_difference(X1,singleton(X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X18] : subset(empty_set,X18),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
fof(c_0_20,plain,
! [X8,X9] :
( ( subset(singleton(X8),X9)
| ~ in(X8,X9) )
& ( in(X8,X9)
| ~ subset(singleton(X8),X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])]) ).
cnf(c_0_21,plain,
( ~ subset(set_difference(X1,singleton(X2)),X1)
| in(X2,X1)
| set_difference(X1,singleton(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( esk1_0 = empty_set
| singleton(esk2_0) = esk1_0
| set_difference(esk1_0,singleton(esk2_0)) = empty_set ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( ~ in(X1,X2)
| subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( in(esk2_0,esk1_0)
| esk1_0 = empty_set
| singleton(esk2_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
( ~ subset(singleton(esk2_0),esk1_0)
| esk1_0 = empty_set
| singleton(esk2_0) = esk1_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( esk1_0 = empty_set
| singleton(esk2_0) = esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
esk1_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_12])]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_30]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU146+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/5.45 % Computer : n020.cluster.edu
% 0.17/5.45 % Model : x86_64 x86_64
% 0.17/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.45 % Memory : 8046.5625MB
% 0.17/5.45 % OS : Linux 6.8.0-71-generic
% 0.17/5.45 % CPULimit : 300
% 0.17/5.45 % WCLimit : 300
% 0.17/5.45 % DateTime : Mon Sep 21 05:53:52 UTC 2026
% 0.17/5.45 % CPUTime :
% 0.17/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/5.52 Running first-order theorem proving
% 0.22/5.52 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
% 0.22/5.55 % Version: 3.5.1
% 0.22/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.22/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.22/5.55 % Starting sh5l with 300s (1) cores
% 0.22/5.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2146530 completed with status 0
% 0.22/5.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.55 % No SInE strategy applied
% 0.22/5.55 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.22/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.22/5.55 % new_bool_1 with pid 2146538 completed with status 0
% 0.22/5.55 % Result found by new_bool_1
% 0.22/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/5.55 % No SInE strategy applied
% 0.22/5.55 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.22/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/5.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.22/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.22/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.22/5.55 % Preprocessing time : 0.001 s
% 0.22/5.55 % Presaturation interreduction done
% 0.22/5.55
% 0.22/5.55 % Proof found!
% 0.22/5.55 % SZS status Theorem
% 0.22/5.55 % SZS output start CNFRefutation
% See solution above
% 0.22/5.55 % Parsed axioms : 15
% 0.22/5.55 % Removed by relevancy pruning/SinE : 0
% 0.22/5.55 % Initial clauses : 21
% 0.22/5.55 % Removed in clause preprocessing : 3
% 0.22/5.55 % Initial clauses in saturation : 18
% 0.22/5.55 % Processed clauses : 47
% 0.22/5.55 % ...of these trivial : 0
% 0.22/5.55 % ...subsumed : 2
% 0.22/5.55 % ...remaining for further processing : 45
% 0.22/5.55 % Other redundant clauses eliminated : 2
% 0.22/5.55 % Clauses deleted for lack of memory : 0
% 0.22/5.55 % Backward-subsumed : 4
% 0.22/5.55 % Backward-rewritten : 3
% 0.22/5.55 % Generated clauses : 33
% 0.22/5.55 % ...of the previous two non-redundant : 25
% 0.22/5.55 % ...aggressively subsumed : 0
% 0.22/5.55 % Contextual simplify-reflections : 1
% 0.22/5.55 % Paramodulations : 31
% 0.22/5.55 % Factorizations : 0
% 0.22/5.55 % NegExts : 0
% 0.22/5.55 % Equation resolutions : 2
% 0.22/5.55 % Disequality decompositions : 0
% 0.22/5.55 % Total rewrite steps : 20
% 0.22/5.55 % ...of those cached : 9
% 0.22/5.55 % Propositional unsat checks : 0
% 0.22/5.55 % Propositional check models : 0
% 0.22/5.55 % Propositional check unsatisfiable : 0
% 0.22/5.55 % Propositional clauses : 0
% 0.22/5.55 % Propositional clauses after purity: 0
% 0.22/5.55 % Propositional unsat core size : 0
% 0.22/5.55 % Propositional preprocessing time : 0.000
% 0.22/5.55 % Propositional encoding time : 0.000
% 0.22/5.55 % Propositional solver time : 0.000
% 0.22/5.55 % Success case prop preproc time : 0.000
% 0.22/5.55 % Success case prop encoding time : 0.000
% 0.22/5.55 % Success case prop solver time : 0.000
% 0.22/5.55 % Current number of processed clauses : 20
% 0.22/5.55 % Positive orientable unit clauses : 8
% 0.22/5.55 % Positive unorientable unit clauses: 0
% 0.22/5.55 % Negative unit clauses : 2
% 0.22/5.55 % Non-unit-clauses : 10
% 0.22/5.55 % Current number of unprocessed clauses: 11
% 0.22/5.55 % ...number of literals in the above : 32
% 0.22/5.55 % Current number of archived formulas : 0
% 0.22/5.55 % Current number of archived clauses : 23
% 0.22/5.55 % Clause-clause subsumption calls (NU) : 29
% 0.22/5.55 % Rec. Clause-clause subsumption calls : 23
% 0.22/5.55 % Non-unit clause-clause subsumptions : 7
% 0.22/5.55 % Unit Clause-clause subsumption calls : 11
% 0.22/5.55 % Rewrite failures with RHS unbound : 0
% 0.22/5.55 % BW rewrite match attempts : 7
% 0.22/5.55 % BW rewrite match successes : 1
% 0.22/5.55 % Condensation attempts : 0
% 0.22/5.55 % Condensation successes : 0
% 0.22/5.55 % Termbank termtop insertions : 1296
% 0.22/5.55 % Search garbage collected termcells : 177
% 0.22/5.55
% 0.22/5.55 % -------------------------------------------------
% 0.22/5.55 % User time : 0.005 s
% 0.22/5.55 % System time : 0.003 s
% 0.22/5.55 % Total time : 0.008 s
% 0.22/5.55 % Maximum resident set size: 3640 pages
% 0.22/5.55
% 0.22/5.55 % -------------------------------------------------
% 0.22/5.55 % User time : 0.024 s
% 0.22/5.55 % System time : 0.014 s
% 0.22/5.55 % Total time : 0.038 s
% 0.22/5.55 % Maximum resident set size: 4608 pages
% 0.22/5.55 % E exiting
%------------------------------------------------------------------------------