%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU162+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 : n012.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:24:03 PM UTC 2026
% Result : Theorem 0.06s 0.33s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 4 unt; 0 def)
% Number of atoms : 50 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 23 ~; 15 |; 3 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t65_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t65_zfmisc_1) ).
fof(l28_zfmisc_1,axiom,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_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(t83_xboole_1,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t83_xboole_1) ).
fof(l25_zfmisc_1,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(assume_negation,[status(cth)],[t65_zfmisc_1]) ).
fof(c_0_6,plain,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[l28_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( set_difference(X1,singleton(X2)) = X1
<=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X13,X14] :
( disjoint(X14,X13)
| ~ disjoint(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])])]) ).
fof(c_0_9,plain,
! [X9,X10] :
( disjoint(singleton(X9),X10)
| in(X9,X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X11,X12] :
( ( disjoint(X11,X12)
| set_difference(X11,X12) != X11 )
& ( set_difference(X11,X12) = X11
| ~ disjoint(X11,X12) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])]) ).
fof(c_0_11,negated_conjecture,
( ( ~ in(esk2_0,esk1_0)
| set_difference(esk1_0,singleton(esk2_0)) = esk1_0 )
& ( in(esk2_0,esk1_0)
| set_difference(esk1_0,singleton(esk2_0)) != esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ disjoint(X1,X2)
| disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( disjoint(singleton(X1),X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( set_difference(X1,X2) != X1
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(esk2_0,esk1_0)
| set_difference(esk1_0,singleton(esk2_0)) = esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( in(X2,X1)
| disjoint(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X7,X8] :
( ~ in(X7,X8)
| ~ disjoint(singleton(X7),X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l25_zfmisc_1])])]) ).
cnf(c_0_18,negated_conjecture,
disjoint(esk1_0,singleton(esk2_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ disjoint(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
disjoint(singleton(esk2_0),esk1_0),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( set_difference(esk1_0,singleton(esk2_0)) != esk1_0
| in(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( ~ disjoint(X1,X2)
| set_difference(X1,X2) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
~ in(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU162+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Mon Sep 21 05:53:51 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/0.32 Running first-order theorem proving
% 0.06/0.32 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.06/0.33 % Version: 3.5.1
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % Starting new_bool_1 with 300s (1) cores
% 0.06/0.33 % Starting sh5l with 300s (1) cores
% 0.06/0.33 % new_bool_3 with pid 1690263 completed with status 0
% 0.06/0.33 % Result found by new_bool_3
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.06/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.33 % SubtermCWHack with pid 1690268 completed with status 0
% 0.06/0.33 % Result found by SubtermCWHack
% 0.06/0.33 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.06/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.33 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.06/0.33 % Starting new_bool_3 with 300s (1) cores
% 0.06/0.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.06/0.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.06/0.33 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.06/0.33 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.33 % Starting SubtermCWHack with 31s (1) cores
% 0.06/0.33 % Preprocessing time : 0.001 s
% 0.06/0.33
% 0.06/0.33 % Proof found!
% 0.06/0.33 % SZS status Theorem
% 0.06/0.33 % SZS output start CNFRefutation
% See solution above
% 0.06/0.33 % Parsed axioms : 8
% 0.06/0.33 % Removed by relevancy pruning/SinE : 2
% 0.06/0.33 % Initial clauses : 8
% 0.06/0.33 % Removed in clause preprocessing : 0
% 0.06/0.33 % Initial clauses in saturation : 8
% 0.06/0.33 % Processed clauses : 15
% 0.06/0.33 % ...of these trivial : 0
% 0.06/0.33 % ...subsumed : 1
% 0.06/0.33 % ...remaining for further processing : 13
% 0.06/0.33 % Other redundant clauses eliminated : 0
% 0.06/0.33 % Clauses deleted for lack of memory : 0
% 0.06/0.33 % Backward-subsumed : 1
% 0.06/0.33 % Backward-rewritten : 0
% 0.06/0.33 % Generated clauses : 11
% 0.06/0.33 % ...of the previous two non-redundant : 7
% 0.06/0.33 % ...aggressively subsumed : 0
% 0.06/0.33 % Contextual simplify-reflections : 1
% 0.06/0.33 % Paramodulations : 11
% 0.06/0.33 % Factorizations : 0
% 0.06/0.33 % NegExts : 0
% 0.06/0.33 % Equation resolutions : 0
% 0.06/0.33 % Disequality decompositions : 0
% 0.06/0.33 % Total rewrite steps : 2
% 0.06/0.33 % ...of those cached : 1
% 0.06/0.33 % Propositional unsat checks : 0
% 0.06/0.33 % Propositional check models : 0
% 0.06/0.33 % Propositional check unsatisfiable : 0
% 0.06/0.33 % Propositional clauses : 0
% 0.06/0.33 % Propositional clauses after purity: 0
% 0.06/0.33 % Propositional unsat core size : 0
% 0.06/0.33 % Propositional preprocessing time : 0.000
% 0.06/0.33 % Propositional encoding time : 0.000
% 0.06/0.33 % Propositional solver time : 0.000
% 0.06/0.33 % Success case prop preproc time : 0.000
% 0.06/0.33 % Success case prop encoding time : 0.000
% 0.06/0.33 % Success case prop solver time : 0.000
% 0.06/0.33 % Current number of processed clauses : 12
% 0.06/0.33 % Positive orientable unit clauses : 2
% 0.06/0.33 % Positive unorientable unit clauses: 0
% 0.06/0.33 % Negative unit clauses : 1
% 0.06/0.33 % Non-unit-clauses : 9
% 0.06/0.33 % Current number of unprocessed clauses: 0
% 0.06/0.33 % ...number of literals in the above : 0
% 0.06/0.33 % Current number of archived formulas : 0
% 0.06/0.33 % Current number of archived clauses : 1
% 0.06/0.33 % Clause-clause subsumption calls (NU) : 6
% 0.06/0.33 % Rec. Clause-clause subsumption calls : 6
% 0.06/0.33 % Non-unit clause-clause subsumptions : 2
% 0.06/0.33 % Unit Clause-clause subsumption calls : 1
% 0.06/0.33 % Rewrite failures with RHS unbound : 0
% 0.06/0.33 % BW rewrite match attempts : 0
% 0.06/0.33 % BW rewrite match successes : 0
% 0.06/0.33 % Condensation attempts : 0
% 0.06/0.33 % Condensation successes : 0
% 0.06/0.33 % Termbank termtop insertions : 632
% 0.06/0.33 % Search garbage collected termcells : 103
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.003 s
% 0.06/0.33 % System time : 0.001 s
% 0.06/0.33 % Total time : 0.004 s
% 0.06/0.33 % Maximum resident set size: 3632 pages
% 0.06/0.33
% 0.06/0.33 % -------------------------------------------------
% 0.06/0.33 % User time : 0.003 s
% 0.06/0.33 % System time : 0.004 s
% 0.06/0.33 % Total time : 0.007 s
% 0.06/0.33 % Maximum resident set size: 4608 pages
% 0.06/0.33 % E exiting
%------------------------------------------------------------------------------