%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU156+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 : 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:24:01 PM UTC 2026
% Result : Theorem 0.14s 0.61s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 19 unt; 0 def)
% Number of atoms : 100 ( 99 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 79 ( 31 ~; 37 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 85 ( 10 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(t69_enumset1,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(t10_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t10_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(t9_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X2 = X4
& X1 = X3 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_8,plain,
! [X7,X8] : ordered_pair(X7,X8) = unordered_pair(unordered_pair(X7,X8),singleton(X7)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X22] : unordered_pair(X22,X22) = singleton(X22),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_10,negated_conjecture,
( ( esk4_0 != esk6_0
| esk3_0 != esk5_0 )
& ordered_pair(esk3_0,esk4_0) = ordered_pair(esk5_0,esk6_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_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X1,X2,X3,X4] :
~ ( X1 != X4
& X1 != X3
& unordered_pair(X1,X2) = unordered_pair(X3,X4) ),
inference(fof_simplification,[status(thm)],[t10_zfmisc_1]) ).
cnf(c_0_14,negated_conjecture,
ordered_pair(esk3_0,esk4_0) = ordered_pair(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_16,plain,
! [X5,X6] : unordered_pair(X5,X6) = unordered_pair(X6,X5),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_17,plain,
! [X14,X15,X16,X17] :
( X14 = X17
| X14 = X16
| unordered_pair(X14,X15) != unordered_pair(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(unordered_pair(esk5_0,esk6_0),unordered_pair(esk5_0,esk5_0)) = unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_19,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X28,X29,X30] :
( X29 = X30
| singleton(X28) != unordered_pair(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])])]) ).
cnf(c_0_21,plain,
( unordered_pair(X1,X2) != unordered_pair(X3,X4)
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk3_0),unordered_pair(esk3_0,esk4_0)) = unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))
| X1 = unordered_pair(esk3_0,esk4_0)
| X1 = unordered_pair(esk3_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_25,plain,
! [X25,X26,X27] :
( X25 = X26
| singleton(X25) != unordered_pair(X26,X27) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])]) ).
cnf(c_0_26,plain,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X2 = X3 ),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_27,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( unordered_pair(X1,X1) != unordered_pair(esk5_0,esk5_0)
| esk4_0 = esk3_0
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( unordered_pair(X1,X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
( esk4_0 = esk3_0
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_32,plain,
( unordered_pair(X4,X1) != unordered_pair(X2,X3)
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( unordered_pair(esk5_0,esk5_0) != unordered_pair(X1,X2)
| esk3_0 = X1
| esk4_0 = esk3_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
( unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0)) != unordered_pair(X2,X1)
| unordered_pair(esk3_0,esk4_0) = X2
| unordered_pair(esk3_0,esk4_0) = X1 ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( esk4_0 = esk3_0
| esk3_0 = esk5_0 ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
( unordered_pair(X1,X1) != unordered_pair(X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_37,negated_conjecture,
( unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk5_0) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
esk3_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( unordered_pair(X2,X1) != unordered_pair(unordered_pair(esk5_0,esk5_0),unordered_pair(esk5_0,esk6_0))
| X1 = unordered_pair(esk3_0,esk3_0)
| X1 = unordered_pair(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( esk4_0 != esk6_0
| esk3_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_42,negated_conjecture,
( unordered_pair(esk3_0,esk4_0) = unordered_pair(esk5_0,esk6_0)
| unordered_pair(esk3_0,esk3_0) = unordered_pair(esk5_0,esk6_0) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( unordered_pair(X2,X1) != unordered_pair(esk5_0,esk6_0)
| X1 = esk5_0
| X1 = esk4_0
| unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
esk4_0 != esk6_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_38])]) ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(esk5_0,esk6_0) = unordered_pair(esk5_0,esk5_0)
| unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk6_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_38]),c_0_38]),c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( esk6_0 = esk5_0
| unordered_pair(esk5_0,esk4_0) = unordered_pair(esk5_0,esk5_0) ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_43]),c_0_44]) ).
cnf(c_0_47,negated_conjecture,
esk6_0 = esk5_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_36]) ).
cnf(c_0_48,negated_conjecture,
( unordered_pair(X1,X1) != unordered_pair(esk5_0,esk6_0)
| esk4_0 = esk5_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_36]) ).
cnf(c_0_49,negated_conjecture,
esk4_0 != esk5_0,
inference(rw,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
unordered_pair(X1,X1) != unordered_pair(esk5_0,esk5_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU156+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.54 % Computer : n011.cluster.edu
% 0.10/0.54 % Model : x86_64 x86_64
% 0.10/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.54 % Memory : 8046.5625MB
% 0.10/0.54 % OS : Linux 6.8.0-71-generic
% 0.10/0.54 % CPULimit : 300
% 0.10/0.54 % WCLimit : 300
% 0.10/0.55 % DateTime : Mon Sep 21 05:53:40 UTC 2026
% 0.10/0.55 % CPUTime :
% 0.10/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.59 Running first-order theorem proving
% 0.14/0.59 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.61 % Version: 3.5.1
% 0.14/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.61 % Starting sh5l with 300s (1) cores
% 0.14/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1114268 completed with status 0
% 0.14/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.61 % No SInE strategy applied
% 0.14/0.61 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.61 % Starting G----_0010_evo with 136s (1) cores
% 0.14/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.61 % new_bool_1 with pid 1114276 completed with status 0
% 0.14/0.61 % Result found by new_bool_1
% 0.14/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.61 % No SInE strategy applied
% 0.14/0.61 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.61 % Starting G----_0010_evo with 136s (1) cores
% 0.14/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.61 % Preprocessing time : 0.001 s
% 0.14/0.61 % Presaturation interreduction done
% 0.14/0.61
% 0.14/0.61 % Proof found!
% 0.14/0.61 % SZS status Theorem
% 0.14/0.61 % SZS output start CNFRefutation
% See solution above
% 0.14/0.61 % Parsed axioms : 15
% 0.14/0.61 % Removed by relevancy pruning/SinE : 0
% 0.14/0.61 % Initial clauses : 16
% 0.14/0.61 % Removed in clause preprocessing : 5
% 0.14/0.61 % Initial clauses in saturation : 11
% 0.14/0.61 % Processed clauses : 238
% 0.14/0.61 % ...of these trivial : 2
% 0.14/0.61 % ...subsumed : 154
% 0.14/0.61 % ...remaining for further processing : 82
% 0.14/0.61 % Other redundant clauses eliminated : 0
% 0.14/0.61 % Clauses deleted for lack of memory : 0
% 0.14/0.61 % Backward-subsumed : 2
% 0.14/0.61 % Backward-rewritten : 46
% 0.14/0.61 % Generated clauses : 458
% 0.14/0.61 % ...of the previous two non-redundant : 466
% 0.14/0.61 % ...aggressively subsumed : 0
% 0.14/0.61 % Contextual simplify-reflections : 3
% 0.14/0.61 % Paramodulations : 439
% 0.14/0.61 % Factorizations : 3
% 0.14/0.61 % NegExts : 0
% 0.14/0.61 % Equation resolutions : 16
% 0.14/0.61 % Disequality decompositions : 0
% 0.14/0.61 % Total rewrite steps : 150
% 0.14/0.61 % ...of those cached : 133
% 0.14/0.61 % Propositional unsat checks : 0
% 0.14/0.61 % Propositional check models : 0
% 0.14/0.61 % Propositional check unsatisfiable : 0
% 0.14/0.61 % Propositional clauses : 0
% 0.14/0.61 % Propositional clauses after purity: 0
% 0.14/0.61 % Propositional unsat core size : 0
% 0.14/0.61 % Propositional preprocessing time : 0.000
% 0.14/0.61 % Propositional encoding time : 0.000
% 0.14/0.61 % Propositional solver time : 0.000
% 0.14/0.61 % Success case prop preproc time : 0.000
% 0.14/0.61 % Success case prop encoding time : 0.000
% 0.14/0.61 % Success case prop solver time : 0.000
% 0.14/0.61 % Current number of processed clauses : 23
% 0.14/0.61 % Positive orientable unit clauses : 6
% 0.14/0.61 % Positive unorientable unit clauses: 1
% 0.14/0.61 % Negative unit clauses : 10
% 0.14/0.61 % Non-unit-clauses : 6
% 0.14/0.61 % Current number of unprocessed clauses: 102
% 0.14/0.61 % ...number of literals in the above : 299
% 0.14/0.61 % Current number of archived formulas : 0
% 0.14/0.61 % Current number of archived clauses : 61
% 0.14/0.61 % Clause-clause subsumption calls (NU) : 802
% 0.14/0.61 % Rec. Clause-clause subsumption calls : 784
% 0.14/0.61 % Non-unit clause-clause subsumptions : 97
% 0.14/0.61 % Unit Clause-clause subsumption calls : 61
% 0.14/0.61 % Rewrite failures with RHS unbound : 0
% 0.14/0.61 % BW rewrite match attempts : 28
% 0.14/0.61 % BW rewrite match successes : 28
% 0.14/0.61 % Condensation attempts : 0
% 0.14/0.61 % Condensation successes : 0
% 0.14/0.61 % Termbank termtop insertions : 6681
% 0.14/0.61 % Search garbage collected termcells : 123
% 0.14/0.61
% 0.14/0.61 % -------------------------------------------------
% 0.14/0.61 % User time : 0.008 s
% 0.14/0.61 % System time : 0.002 s
% 0.14/0.61 % Total time : 0.010 s
% 0.14/0.61 % Maximum resident set size: 3636 pages
% 0.14/0.61
% 0.14/0.61 % -------------------------------------------------
% 0.14/0.61 % User time : 0.042 s
% 0.14/0.61 % System time : 0.009 s
% 0.14/0.61 % Total time : 0.051 s
% 0.14/0.61 % Maximum resident set size: 4864 pages
% 0.14/0.61 % E exiting
%------------------------------------------------------------------------------