%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU153+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:17 PM UTC 2026
% Result : Theorem 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 7 unt; 0 def)
% Number of atoms : 88 ( 30 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 100 ( 40 ~; 38 |; 14 &)
% ( 7 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 59 ( 2 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l25_zfmisc_1,conjecture,
! [X1,X2] :
~ ( in(X1,X2)
& disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
~ ( in(X1,X2)
& disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[l25_zfmisc_1]) ).
fof(c_0_7,plain,
! [X36,X37] :
( disjoint(X37,X36)
| ~ disjoint(X36,X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])])]) ).
fof(c_0_8,negated_conjecture,
( in(esk4_0,esk5_0)
& disjoint(singleton(esk4_0),esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_10,plain,
! [X20,X21,X22,X23,X24,X25,X26,X27] :
( ( X27 = set_intersection2(X25,X26)
| in(esk3_3(X25,X26,X27),X27)
| in(esk3_3(X25,X26,X27),X26) )
& ( X27 = set_intersection2(X25,X26)
| in(esk3_3(X25,X26,X27),X27)
| in(esk3_3(X25,X26,X27),X25) )
& ( X27 = set_intersection2(X25,X26)
| ~ in(esk3_3(X25,X26,X27),X26)
| ~ in(esk3_3(X25,X26,X27),X25)
| ~ in(esk3_3(X25,X26,X27),X27) )
& ( X22 != set_intersection2(X20,X21)
| in(X24,X22)
| ~ in(X24,X21)
| ~ in(X24,X20) )
& ( X22 != set_intersection2(X20,X21)
| ~ in(X23,X22)
| in(X23,X21) )
& ( X22 != set_intersection2(X20,X21)
| ~ in(X23,X22)
| in(X23,X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])])]) ).
fof(c_0_11,plain,
! [X29,X30] :
( ( disjoint(X29,X30)
| set_intersection2(X29,X30) != empty_set )
& ( set_intersection2(X29,X30) = empty_set
| ~ disjoint(X29,X30) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_12,plain,
( ~ disjoint(X1,X2)
| disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
disjoint(singleton(esk4_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X16,X17,X18] :
( ( X18 = empty_set
| in(esk2_1(X18),X18) )
& ( ~ in(X17,X16)
| X16 != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_15,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
disjoint(esk5_0,singleton(esk4_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ in(X2,X1)
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( X14 = singleton(X13)
| esk1_2(X13,X14) = X13
| in(esk1_2(X13,X14),X14) )
& ( X14 = singleton(X13)
| esk1_2(X13,X14) != X13
| ~ in(esk1_2(X13,X14),X14) )
& ( X10 != singleton(X9)
| in(X12,X10)
| X12 != X9 )
& ( X10 != singleton(X9)
| X11 = X9
| ~ in(X11,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).
cnf(c_0_20,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk5_0,singleton(esk4_0)) = empty_set,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
( X3 != singleton(X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,esk5_0)
| ~ in(X1,singleton(esk4_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
in(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU153+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n011.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 05:53:25 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 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
% 0.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1113462 completed with status 0
% 0.09/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 1113469 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSS-FFMS31-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Theorem
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 15
% 0.09/0.43 % Removed by relevancy pruning/SinE : 0
% 0.09/0.43 % Initial clauses : 26
% 0.09/0.43 % Removed in clause preprocessing : 3
% 0.09/0.43 % Initial clauses in saturation : 23
% 0.09/0.43 % Processed clauses : 60
% 0.09/0.43 % ...of these trivial : 3
% 0.09/0.43 % ...subsumed : 16
% 0.09/0.43 % ...remaining for further processing : 41
% 0.09/0.43 % Other redundant clauses eliminated : 7
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 0
% 0.09/0.43 % Backward-rewritten : 0
% 0.09/0.43 % Generated clauses : 88
% 0.09/0.43 % ...of the previous two non-redundant : 64
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 0
% 0.09/0.43 % Paramodulations : 82
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 7
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 16
% 0.09/0.43 % ...of those cached : 8
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 35
% 0.09/0.43 % Positive orientable unit clauses : 10
% 0.09/0.43 % Positive unorientable unit clauses: 1
% 0.09/0.43 % Negative unit clauses : 4
% 0.09/0.43 % Non-unit-clauses : 20
% 0.09/0.43 % Current number of unprocessed clauses: 23
% 0.09/0.43 % ...number of literals in the above : 59
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 0
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 83
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 79
% 0.09/0.43 % Non-unit clause-clause subsumptions : 10
% 0.09/0.43 % Unit Clause-clause subsumption calls : 6
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 2
% 0.09/0.43 % BW rewrite match successes : 2
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 2004
% 0.09/0.43 % Search garbage collected termcells : 375
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.007 s
% 0.09/0.43 % System time : 0.002 s
% 0.09/0.43 % Total time : 0.009 s
% 0.09/0.43 % Maximum resident set size: 3640 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.014 s
% 0.09/0.43 % System time : 0.010 s
% 0.09/0.43 % Total time : 0.025 s
% 0.09/0.43 % Maximum resident set size: 4608 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------