%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET874+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 : n009.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:18:48 PM UTC 2026
% Result : Theorem 0.22s 0.64s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 14 unt; 0 def)
% Number of atoms : 49 ( 34 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 47 ( 19 ~; 20 |; 5 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 44 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t14_zfmisc_1,conjecture,
! [X1,X2] : set_union2(singleton(X1),unordered_pair(X1,X2)) = unordered_pair(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X2
| X4 = X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(l23_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] : set_union2(singleton(X1),unordered_pair(X1,X2)) = unordered_pair(X1,X2),
inference(assume_negation,[status(cth)],[t14_zfmisc_1]) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( X16 = unordered_pair(X14,X15)
| esk3_3(X14,X15,X16) = X15
| esk3_3(X14,X15,X16) = X14
| in(esk3_3(X14,X15,X16),X16) )
& ( X16 = unordered_pair(X14,X15)
| ~ in(esk3_3(X14,X15,X16),X16)
| esk3_3(X14,X15,X16) != X15 )
& ( X16 = unordered_pair(X14,X15)
| ~ in(esk3_3(X14,X15,X16),X16)
| esk3_3(X14,X15,X16) != X14 )
& ( X11 != unordered_pair(X9,X10)
| in(X13,X11)
| X13 != X10 )
& ( X11 != unordered_pair(X9,X10)
| in(X13,X11)
| X13 != X9 )
& ( X11 != unordered_pair(X9,X10)
| X12 = X10
| X12 = X9
| ~ in(X12,X11) ) ),
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)],[d2_tarski])])])])])])]) ).
fof(c_0_7,negated_conjecture,
set_union2(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X18,X19] : set_union2(X18,X19) = set_union2(X19,X18),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_9,plain,
! [X25,X26] :
( set_union2(singleton(X25),X26) = X26
| ~ in(X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l23_zfmisc_1])])]) ).
cnf(c_0_10,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X7,X8] : unordered_pair(X7,X8) = unordered_pair(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_12,negated_conjecture,
set_union2(singleton(esk1_0),unordered_pair(esk1_0,esk2_0)) != unordered_pair(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| set_union2(singleton(X1),X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_16,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
set_union2(unordered_pair(esk1_0,esk2_0),singleton(esk1_0)) != unordered_pair(esk1_0,esk2_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ in(X2,X1)
| set_union2(X1,singleton(X2)) = X1 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET874+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 % Computer : n009.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Mon Sep 21 05:42:42 UTC 2026
% 0.18/0.49 % CPUTime :
% 0.18/0.49 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.58 Running first-order theorem proving
% 0.22/0.58 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.22/0.63 % Version: 3.5.1
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % Starting sh5l with 300s (1) cores
% 0.22/0.63 % new_bool_1 with pid 967156 completed with status 0
% 0.22/0.63 % Result found by new_bool_1
% 0.22/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.63 % Search class: FGHSS-FFSF32-SFFFFFNN
% 0.22/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.63 % SubtermCWHack with pid 967161 completed with status 0
% 0.22/0.64 % Result found by SubtermCWHack
% 0.22/0.64 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.64 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.22/0.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.64 % Search class: FGHSS-FFSF32-SFFFFFNN
% 0.22/0.64 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.64 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.64 % Preprocessing time : 0.002 s
% 0.22/0.64
% 0.22/0.64 % Proof found!
% 0.22/0.64 % SZS status Theorem
% 0.22/0.64 % SZS output start CNFRefutation
% See solution above
% 0.22/0.64 % Parsed axioms : 11
% 0.22/0.64 % Removed by relevancy pruning/SinE : 0
% 0.22/0.64 % Initial clauses : 16
% 0.22/0.64 % Removed in clause preprocessing : 0
% 0.22/0.64 % Initial clauses in saturation : 16
% 0.22/0.64 % Processed clauses : 38
% 0.22/0.64 % ...of these trivial : 1
% 0.22/0.64 % ...subsumed : 16
% 0.22/0.64 % ...remaining for further processing : 21
% 0.22/0.64 % Other redundant clauses eliminated : 5
% 0.22/0.64 % Clauses deleted for lack of memory : 0
% 0.22/0.64 % Backward-subsumed : 0
% 0.22/0.64 % Backward-rewritten : 0
% 0.22/0.64 % Generated clauses : 37
% 0.22/0.64 % ...of the previous two non-redundant : 27
% 0.22/0.64 % ...aggressively subsumed : 0
% 0.22/0.64 % Contextual simplify-reflections : 0
% 0.22/0.64 % Paramodulations : 34
% 0.22/0.64 % Factorizations : 0
% 0.22/0.64 % NegExts : 0
% 0.22/0.64 % Equation resolutions : 5
% 0.22/0.64 % Disequality decompositions : 0
% 0.22/0.64 % Total rewrite steps : 8
% 0.22/0.64 % ...of those cached : 3
% 0.22/0.64 % Propositional unsat checks : 0
% 0.22/0.64 % Propositional check models : 0
% 0.22/0.64 % Propositional check unsatisfiable : 0
% 0.22/0.64 % Propositional clauses : 0
% 0.22/0.64 % Propositional clauses after purity: 0
% 0.22/0.64 % Propositional unsat core size : 0
% 0.22/0.64 % Propositional preprocessing time : 0.000
% 0.22/0.64 % Propositional encoding time : 0.000
% 0.22/0.64 % Propositional solver time : 0.000
% 0.22/0.64 % Success case prop preproc time : 0.000
% 0.22/0.64 % Success case prop encoding time : 0.000
% 0.22/0.64 % Success case prop solver time : 0.000
% 0.22/0.64 % Current number of processed clauses : 18
% 0.22/0.64 % Positive orientable unit clauses : 4
% 0.22/0.64 % Positive unorientable unit clauses: 2
% 0.22/0.64 % Negative unit clauses : 4
% 0.22/0.64 % Non-unit-clauses : 8
% 0.22/0.64 % Current number of unprocessed clauses: 5
% 0.22/0.64 % ...number of literals in the above : 16
% 0.22/0.64 % Current number of archived formulas : 0
% 0.22/0.64 % Current number of archived clauses : 0
% 0.22/0.64 % Clause-clause subsumption calls (NU) : 24
% 0.22/0.64 % Rec. Clause-clause subsumption calls : 24
% 0.22/0.64 % Non-unit clause-clause subsumptions : 12
% 0.22/0.64 % Unit Clause-clause subsumption calls : 1
% 0.22/0.64 % Rewrite failures with RHS unbound : 0
% 0.22/0.64 % BW rewrite match attempts : 7
% 0.22/0.64 % BW rewrite match successes : 6
% 0.22/0.64 % Condensation attempts : 0
% 0.22/0.64 % Condensation successes : 0
% 0.22/0.64 % Termbank termtop insertions : 1101
% 0.22/0.64 % Search garbage collected termcells : 221
% 0.22/0.64
% 0.22/0.64 % -------------------------------------------------
% 0.22/0.64 % User time : 0.009 s
% 0.22/0.64 % System time : 0.003 s
% 0.22/0.64 % Total time : 0.012 s
% 0.22/0.64 % Maximum resident set size: 3584 pages
% 0.22/0.64
% 0.22/0.64 % -------------------------------------------------
% 0.22/0.64 % User time : 0.011 s
% 0.22/0.64 % System time : 0.010 s
% 0.22/0.64 % Total time : 0.021 s
% 0.22/0.64 % Maximum resident set size: 4608 pages
% 0.22/0.64 % E exiting
%------------------------------------------------------------------------------