%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET931+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:15:48 PM UTC 2026
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 14 unt; 0 def)
% Number of atoms : 120 ( 96 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 137 ( 57 ~; 50 |; 24 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 17 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t75_zfmisc_1,conjecture,
! [X1,X2,X3] :
( set_difference(X1,unordered_pair(X2,X3)) = empty_set
<=> ~ ( X1 != unordered_pair(X2,X3)
& X1 != singleton(X3)
& X1 != singleton(X2)
& X1 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t75_zfmisc_1) ).
fof(l46_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != unordered_pair(X2,X3)
& X1 != singleton(X3)
& X1 != singleton(X2)
& X1 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l46_zfmisc_1) ).
fof(t37_xboole_1,axiom,
! [X1,X2] :
( set_difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(X1,unordered_pair(X2,X3)) = empty_set
<=> ~ ( X1 != unordered_pair(X2,X3)
& X1 != singleton(X3)
& X1 != singleton(X2)
& X1 != empty_set ) ),
inference(assume_negation,[status(cth)],[t75_zfmisc_1]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( subset(X1,unordered_pair(X2,X3))
<=> ~ ( X1 != unordered_pair(X2,X3)
& X1 != singleton(X3)
& X1 != singleton(X2)
& X1 != empty_set ) ),
inference(fof_simplification,[status(thm)],[l46_zfmisc_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( set_difference(X1,unordered_pair(X2,X3)) = empty_set
<=> ~ ( X1 != unordered_pair(X2,X3)
& X1 != singleton(X3)
& X1 != singleton(X2)
& X1 != empty_set ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,plain,
! [X6,X7,X8] :
( ( subset(X6,unordered_pair(X7,X8))
| X6 != unordered_pair(X7,X8) )
& ( subset(X6,unordered_pair(X7,X8))
| X6 != singleton(X8) )
& ( subset(X6,unordered_pair(X7,X8))
| X6 != singleton(X7) )
& ( subset(X6,unordered_pair(X7,X8))
| X6 != empty_set )
& ( X6 = unordered_pair(X7,X8)
| X6 = singleton(X8)
| X6 = singleton(X7)
| X6 = empty_set
| ~ subset(X6,unordered_pair(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ( set_difference(X12,X13) = empty_set
| ~ subset(X12,X13) )
& ( subset(X12,X13)
| set_difference(X12,X13) != empty_set ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_xboole_1])])]) ).
fof(c_0_9,negated_conjecture,
( ( esk3_0 = unordered_pair(esk4_0,esk5_0)
| esk3_0 = singleton(esk5_0)
| esk3_0 = singleton(esk4_0)
| esk3_0 = empty_set
| set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) = empty_set )
& ( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != unordered_pair(esk4_0,esk5_0) )
& ( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != singleton(esk5_0) )
& ( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != singleton(esk4_0) )
& ( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_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_6])])])])]) ).
cnf(c_0_10,plain,
( X1 != singleton(X2)
| subset(X1,unordered_pair(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( set_difference(X1,X2) != empty_set
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( esk3_0 = unordered_pair(esk4_0,esk5_0)
| esk3_0 = singleton(esk5_0)
| esk3_0 = singleton(esk4_0)
| esk3_0 = empty_set
| set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ subset(X1,X2)
| set_difference(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
subset(singleton(X1),unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ subset(X1,unordered_pair(X2,X3))
| X1 = unordered_pair(X2,X3)
| X1 = singleton(X3)
| X1 = singleton(X2)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( subset(esk3_0,unordered_pair(esk4_0,esk5_0))
| empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| singleton(esk5_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( X1 != singleton(X2)
| subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
set_difference(singleton(X1),unordered_pair(X2,X1)) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( empty_set = esk3_0
| singleton(esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
subset(singleton(X1),unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != singleton(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0
| set_difference(esk3_0,unordered_pair(X1,esk5_0)) = empty_set ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_19]) ).
fof(c_0_25,plain,
! [X11] : subset(X11,X11),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_26,negated_conjecture,
( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != singleton(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( empty_set = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0
| set_difference(esk3_0,unordered_pair(esk4_0,X1)) = empty_set ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( X1 != empty_set
| subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != unordered_pair(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( empty_set = esk3_0
| unordered_pair(esk4_0,esk5_0) = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24]) ).
cnf(c_0_32,plain,
set_difference(X1,X1) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_33,plain,
subset(empty_set,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set
| esk3_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
empty_set = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
set_difference(empty_set,unordered_pair(X1,X2)) = empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35])]) ).
cnf(c_0_38,plain,
set_difference(esk3_0,unordered_pair(X1,X2)) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_35]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET931+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:44:25 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.42 % Version: 3.5.1
% 0.14/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.42 % Starting sh5l with 300s (1) cores
% 0.14/0.42 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 143543 completed with status 0
% 0.14/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % new_bool_1 with pid 143551 completed with status 0
% 0.14/0.42 % Result found by new_bool_1
% 0.14/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.42 % No SInE strategy applied
% 0.14/0.42 % Search class: FGHSS-FFSS21-SFFFFFNN
% 0.14/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.42 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.42 % Preprocessing time : 0.001 s
% 0.14/0.42 % Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 % Proof found!
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 % SZS output start CNFRefutation
% See solution above
% 0.14/0.42 % Parsed axioms : 8
% 0.14/0.42 % Removed by relevancy pruning/SinE : 0
% 0.14/0.42 % Initial clauses : 17
% 0.14/0.42 % Removed in clause preprocessing : 0
% 0.14/0.42 % Initial clauses in saturation : 17
% 0.14/0.42 % Processed clauses : 59
% 0.14/0.42 % ...of these trivial : 2
% 0.14/0.42 % ...subsumed : 4
% 0.14/0.42 % ...remaining for further processing : 53
% 0.14/0.42 % Other redundant clauses eliminated : 4
% 0.14/0.42 % Clauses deleted for lack of memory : 0
% 0.14/0.42 % Backward-subsumed : 7
% 0.14/0.42 % Backward-rewritten : 15
% 0.14/0.42 % Generated clauses : 73
% 0.14/0.42 % ...of the previous two non-redundant : 57
% 0.14/0.42 % ...aggressively subsumed : 0
% 0.14/0.42 % Contextual simplify-reflections : 2
% 0.14/0.42 % Paramodulations : 69
% 0.14/0.42 % Factorizations : 0
% 0.14/0.42 % NegExts : 0
% 0.14/0.42 % Equation resolutions : 4
% 0.14/0.42 % Disequality decompositions : 0
% 0.14/0.42 % Total rewrite steps : 39
% 0.14/0.42 % ...of those cached : 27
% 0.14/0.42 % Propositional unsat checks : 0
% 0.14/0.42 % Propositional check models : 0
% 0.14/0.42 % Propositional check unsatisfiable : 0
% 0.14/0.42 % Propositional clauses : 0
% 0.14/0.42 % Propositional clauses after purity: 0
% 0.14/0.42 % Propositional unsat core size : 0
% 0.14/0.42 % Propositional preprocessing time : 0.000
% 0.14/0.42 % Propositional encoding time : 0.000
% 0.14/0.42 % Propositional solver time : 0.000
% 0.14/0.42 % Success case prop preproc time : 0.000
% 0.14/0.42 % Success case prop encoding time : 0.000
% 0.14/0.42 % Success case prop solver time : 0.000
% 0.14/0.42 % Current number of processed clauses : 11
% 0.14/0.42 % Positive orientable unit clauses : 8
% 0.14/0.42 % Positive unorientable unit clauses: 1
% 0.14/0.42 % Negative unit clauses : 1
% 0.14/0.42 % Non-unit-clauses : 1
% 0.14/0.42 % Current number of unprocessed clauses: 14
% 0.14/0.42 % ...number of literals in the above : 45
% 0.14/0.42 % Current number of archived formulas : 0
% 0.14/0.42 % Current number of archived clauses : 38
% 0.14/0.42 % Clause-clause subsumption calls (NU) : 53
% 0.14/0.42 % Rec. Clause-clause subsumption calls : 20
% 0.14/0.42 % Non-unit clause-clause subsumptions : 10
% 0.14/0.42 % Unit Clause-clause subsumption calls : 12
% 0.14/0.42 % Rewrite failures with RHS unbound : 0
% 0.14/0.42 % BW rewrite match attempts : 19
% 0.14/0.42 % BW rewrite match successes : 12
% 0.14/0.42 % Condensation attempts : 0
% 0.14/0.42 % Condensation successes : 0
% 0.14/0.42 % Termbank termtop insertions : 1599
% 0.14/0.42 % Search garbage collected termcells : 206
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.002 s
% 0.14/0.42 % System time : 0.004 s
% 0.14/0.42 % Total time : 0.005 s
% 0.14/0.42 % Maximum resident set size: 3632 pages
% 0.14/0.42
% 0.14/0.42 % -------------------------------------------------
% 0.14/0.42 % User time : 0.013 s
% 0.14/0.42 % System time : 0.014 s
% 0.14/0.42 % Total time : 0.027 s
% 0.14/0.42 % Maximum resident set size: 4608 pages
% 0.14/0.42 % E exiting
%------------------------------------------------------------------------------