%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET918+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 : 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:18:54 PM UTC 2026
% Result : Theorem 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 13 unt; 0 def)
% Number of atoms : 109 ( 58 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 129 ( 50 ~; 51 |; 22 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 76 ( 3 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t59_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( X1 != X2
& in(X2,X3)
& set_intersection2(unordered_pair(X1,X2),X3) = singleton(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t59_zfmisc_1) ).
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(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(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_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(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(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( X1 != X2
& in(X2,X3)
& set_intersection2(unordered_pair(X1,X2),X3) = singleton(X1) ),
inference(assume_negation,[status(cth)],[t59_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( X1 != X2
& in(X2,X3)
& set_intersection2(unordered_pair(X1,X2),X3) = singleton(X1) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( X17 = set_intersection2(X15,X16)
| in(esk4_3(X15,X16,X17),X17)
| in(esk4_3(X15,X16,X17),X16) )
& ( X17 = set_intersection2(X15,X16)
| in(esk4_3(X15,X16,X17),X17)
| in(esk4_3(X15,X16,X17),X15) )
& ( X17 = set_intersection2(X15,X16)
| ~ in(esk4_3(X15,X16,X17),X16)
| ~ in(esk4_3(X15,X16,X17),X15)
| ~ in(esk4_3(X15,X16,X17),X17) )
& ( X12 != set_intersection2(X10,X11)
| in(X14,X12)
| ~ in(X14,X11)
| ~ in(X14,X10) )
& ( X12 != set_intersection2(X10,X11)
| ~ in(X13,X12)
| in(X13,X11) )
& ( X12 != set_intersection2(X10,X11)
| ~ in(X13,X12)
| in(X13,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)],[d3_xboole_0])])])])])])]) ).
fof(c_0_9,negated_conjecture,
( esk1_0 != esk2_0
& in(esk2_0,esk3_0)
& set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X29,X30] : unordered_pair(X29,X30) = unordered_pair(X30,X29),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_11,plain,
! [X26,X27] : set_intersection2(X26,X27) = set_intersection2(X27,X26),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_12,plain,
! [X19,X20,X21,X22,X23,X24] :
( ( X24 = singleton(X23)
| esk5_2(X23,X24) = X23
| in(esk5_2(X23,X24),X24) )
& ( X24 = singleton(X23)
| esk5_2(X23,X24) != X23
| ~ in(esk5_2(X23,X24),X24) )
& ( X20 != singleton(X19)
| in(X22,X20)
| X22 != X19 )
& ( X20 != singleton(X19)
| X21 = X19
| ~ in(X21,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)],[d1_tarski])])])])])])]) ).
cnf(c_0_13,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( X38 = unordered_pair(X36,X37)
| esk6_3(X36,X37,X38) = X37
| esk6_3(X36,X37,X38) = X36
| in(esk6_3(X36,X37,X38),X38) )
& ( X38 = unordered_pair(X36,X37)
| ~ in(esk6_3(X36,X37,X38),X38)
| esk6_3(X36,X37,X38) != X37 )
& ( X38 = unordered_pair(X36,X37)
| ~ in(esk6_3(X36,X37,X38),X38)
| esk6_3(X36,X37,X38) != X36 )
& ( X33 != unordered_pair(X31,X32)
| in(X35,X33)
| X35 != X32 )
& ( X33 != unordered_pair(X31,X32)
| in(X35,X33)
| X35 != X31 )
& ( X33 != unordered_pair(X31,X32)
| X34 = X32
| X34 = X31
| ~ in(X34,X33) ) ),
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])])])])])])]) ).
cnf(c_0_18,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
set_intersection2(esk3_0,unordered_pair(esk2_0,esk1_0)) = singleton(esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk2_0,esk1_0))
| in(X1,singleton(esk1_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,esk3_0)
| ~ in(X1,unordered_pair(esk2_0,esk1_0))
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
in(X1,unordered_pair(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_27,negated_conjecture,
in(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET918+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.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 05:43:55 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 % new_bool_1 with pid 1093766 completed with status 0
% 0.09/0.43 % Result found by new_bool_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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 1093770 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 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.43 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.09/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.43 % Starting SubtermCWHack with 31s (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 : 10
% 0.09/0.43 % Removed by relevancy pruning/SinE : 2
% 0.09/0.43 % Initial clauses : 23
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 23
% 0.09/0.43 % Processed clauses : 54
% 0.09/0.43 % ...of these trivial : 1
% 0.09/0.43 % ...subsumed : 16
% 0.09/0.43 % ...remaining for further processing : 37
% 0.09/0.43 % Other redundant clauses eliminated : 11
% 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 : 79
% 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 : 71
% 0.09/0.43 % Factorizations : 0
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 11
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 10
% 0.09/0.43 % ...of those cached : 3
% 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 : 29
% 0.09/0.43 % Positive orientable unit clauses : 7
% 0.09/0.43 % Positive unorientable unit clauses: 2
% 0.09/0.43 % Negative unit clauses : 6
% 0.09/0.43 % Non-unit-clauses : 14
% 0.09/0.43 % Current number of unprocessed clauses: 32
% 0.09/0.43 % ...number of literals in the above : 92
% 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) : 171
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 151
% 0.09/0.43 % Non-unit clause-clause subsumptions : 11
% 0.09/0.43 % Unit Clause-clause subsumption calls : 13
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 3
% 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 : 2070
% 0.09/0.43 % Search garbage collected termcells : 478
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.005 s
% 0.09/0.43 % System time : 0.002 s
% 0.09/0.43 % Total time : 0.007 s
% 0.09/0.43 % Maximum resident set size: 3636 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.006 s
% 0.09/0.43 % System time : 0.005 s
% 0.09/0.43 % Total time : 0.011 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------