%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU151+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:00 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 14 unt; 0 def)
% Number of atoms : 73 ( 57 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 80 ( 36 ~; 28 |; 13 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 60 ( 7 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t10_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_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/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
inference(assume_negation,[status(cth)],[t10_zfmisc_1]) ).
fof(c_0_5,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( ( X42 = unordered_pair(X40,X41)
| esk4_3(X40,X41,X42) = X41
| esk4_3(X40,X41,X42) = X40
| in(esk4_3(X40,X41,X42),X42) )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X41 )
& ( X42 = unordered_pair(X40,X41)
| ~ in(esk4_3(X40,X41,X42),X42)
| esk4_3(X40,X41,X42) != X40 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X36 )
& ( X37 != unordered_pair(X35,X36)
| in(X39,X37)
| X39 != X35 )
& ( X37 != unordered_pair(X35,X36)
| X38 = X36
| X38 = X35
| ~ in(X38,X37) ) ),
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_6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X3 != unordered_pair(X4,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,negated_conjecture,
( esk11_0 != esk14_0
& esk11_0 != esk13_0
& unordered_pair(esk11_0,esk12_0) = unordered_pair(esk13_0,esk14_0) ),
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_9,plain,
( X3 != unordered_pair(X2,X4)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( X2 != unordered_pair(X3,X4)
| ~ in(X1,X2)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])]) ).
cnf(c_0_12,negated_conjecture,
unordered_pair(esk11_0,esk12_0) = unordered_pair(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
( ~ in(X1,unordered_pair(X3,X2))
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
in(esk14_0,unordered_pair(esk11_0,esk12_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
esk11_0 != esk14_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_17,lemma,
! [X178,X179,X180] :
( X178 = X179
| singleton(X178) != unordered_pair(X179,X180) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])]) ).
fof(c_0_18,lemma,
! [X163] : unordered_pair(X163,X163) = singleton(X163),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
cnf(c_0_19,negated_conjecture,
in(esk13_0,unordered_pair(esk11_0,esk12_0)),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
esk11_0 != esk13_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
esk12_0 = esk14_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_22,lemma,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
esk14_0 = esk13_0,
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_25,lemma,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
unordered_pair(esk13_0,esk13_0) = unordered_pair(esk11_0,esk13_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_21]),c_0_24]),c_0_24]) ).
cnf(c_0_27,lemma,
( unordered_pair(esk11_0,esk13_0) != unordered_pair(X1,X2)
| esk13_0 = X1 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,lemma,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_27]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU151+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n020.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 05:54:03 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2147343 completed with status 0
% 0.13/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 2147358 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.13/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.44 % Preprocessing time : 0.002 s
% 0.13/0.44 % Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 74
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 120
% 0.13/0.44 % Removed in clause preprocessing : 9
% 0.13/0.44 % Initial clauses in saturation : 111
% 0.13/0.44 % Processed clauses : 434
% 0.13/0.44 % ...of these trivial : 10
% 0.13/0.44 % ...subsumed : 181
% 0.13/0.44 % ...remaining for further processing : 243
% 0.13/0.44 % Other redundant clauses eliminated : 35
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 0
% 0.13/0.44 % Backward-rewritten : 11
% 0.13/0.44 % Generated clauses : 566
% 0.13/0.44 % ...of the previous two non-redundant : 446
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 530
% 0.13/0.44 % Factorizations : 0
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 39
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 229
% 0.13/0.44 % ...of those cached : 177
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 111
% 0.13/0.44 % Positive orientable unit clauses : 30
% 0.13/0.44 % Positive unorientable unit clauses: 3
% 0.13/0.44 % Negative unit clauses : 22
% 0.13/0.44 % Non-unit-clauses : 56
% 0.13/0.44 % Current number of unprocessed clauses: 219
% 0.13/0.44 % ...number of literals in the above : 448
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 112
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 1252
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 999
% 0.13/0.44 % Non-unit clause-clause subsumptions : 56
% 0.13/0.44 % Unit Clause-clause subsumption calls : 242
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 65
% 0.13/0.44 % BW rewrite match successes : 45
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 10710
% 0.13/0.44 % Search garbage collected termcells : 1668
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.019 s
% 0.13/0.44 % System time : 0.003 s
% 0.13/0.44 % Total time : 0.022 s
% 0.13/0.44 % Maximum resident set size: 3948 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.062 s
% 0.13/0.44 % System time : 0.018 s
% 0.13/0.44 % Total time : 0.080 s
% 0.13/0.44 % Maximum resident set size: 4864 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------