%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU267+1 : 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 : n019.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:30 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 52 ( 51 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 62 ( 26 ~; 24 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 10 sgn 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_second(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_mcart_1) ).
fof(t7_mcart_1,conjecture,
! [X1,X2] :
( pair_second(ordered_pair(X1,X2)) = X2
& pair_first(ordered_pair(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_mcart_1) ).
fof(d1_mcart_1,axiom,
! [X1] :
( ? [X2,X3] : X1 = ordered_pair(X2,X3)
=> ! [X2] :
( X2 = pair_first(X1)
<=> ! [X3,X4] :
( X1 = ordered_pair(X3,X4)
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_mcart_1) ).
fof(c_0_3,plain,
! [X7,X8,X9,X10,X11,X12,X13] :
( ( X7 != ordered_pair(X8,X9)
| X13 = pair_second(X7)
| X13 != esk4_2(X7,X13) )
& ( X7 != ordered_pair(X8,X9)
| X13 = pair_second(X7)
| X7 = ordered_pair(esk3_2(X7,X13),esk4_2(X7,X13)) )
& ( X7 != ordered_pair(X8,X9)
| X10 = X12
| X7 != ordered_pair(X11,X12)
| X10 != pair_second(X7) ) ),
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_mcart_1])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( pair_second(ordered_pair(X1,X2)) = X2
& pair_first(ordered_pair(X1,X2)) = X1 ),
inference(assume_negation,[status(cth)],[t7_mcart_1]) ).
cnf(c_0_5,plain,
( X2 != ordered_pair(X5,X6)
| X2 != ordered_pair(X3,X4)
| X1 != pair_second(X2)
| X1 = X4 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,plain,
! [X18,X19,X20,X21,X22,X23,X24] :
( ( X18 != ordered_pair(X19,X20)
| X24 = pair_first(X18)
| X24 != esk5_2(X18,X24) )
& ( X18 != ordered_pair(X19,X20)
| X24 = pair_first(X18)
| X18 = ordered_pair(esk5_2(X18,X24),esk6_2(X18,X24)) )
& ( X18 != ordered_pair(X19,X20)
| X21 = X22
| X18 != ordered_pair(X22,X23)
| X21 != pair_first(X18) ) ),
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_mcart_1])])])])])])]) ).
fof(c_0_7,negated_conjecture,
( pair_second(ordered_pair(esk1_0,esk2_0)) != esk2_0
| pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( ordered_pair(X1,X2) != ordered_pair(X4,X3)
| pair_second(ordered_pair(X1,X2)) = X3 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( X2 != ordered_pair(X5,X6)
| X2 != ordered_pair(X3,X4)
| X1 != pair_first(X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( pair_second(ordered_pair(esk1_0,esk2_0)) != esk2_0
| pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
pair_second(ordered_pair(X1,X2)) = X2,
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ordered_pair(X1,X2) != ordered_pair(X3,X4)
| pair_first(ordered_pair(X1,X2)) = X3 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,negated_conjecture,
pair_first(ordered_pair(esk1_0,esk2_0)) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,plain,
pair_first(ordered_pair(X1,X2)) = X1,
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU267+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n019.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 06:05:04 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.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 1843502 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 1843505 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 19
% 0.13/0.42 % Removed by relevancy pruning/SinE : 12
% 0.13/0.42 % Initial clauses : 11
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 11
% 0.13/0.42 % Processed clauses : 19
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 0
% 0.13/0.42 % ...remaining for further processing : 19
% 0.13/0.42 % Other redundant clauses eliminated : 6
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 6
% 0.13/0.42 % Generated clauses : 8
% 0.13/0.42 % ...of the previous two non-redundant : 12
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 1
% 0.13/0.42 % Factorizations : 0
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 9
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 6
% 0.13/0.42 % ...of those cached : 0
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 9
% 0.13/0.42 % Positive orientable unit clauses : 3
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 2
% 0.13/0.42 % Non-unit-clauses : 4
% 0.13/0.42 % Current number of unprocessed clauses: 2
% 0.13/0.42 % ...number of literals in the above : 6
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 6
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 12
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 10
% 0.13/0.42 % Non-unit clause-clause subsumptions : 0
% 0.13/0.42 % Unit Clause-clause subsumption calls : 0
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 6
% 0.13/0.42 % BW rewrite match successes : 6
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 904
% 0.13/0.42 % Search garbage collected termcells : 314
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.003 s
% 0.13/0.42 % System time : 0.003 s
% 0.13/0.42 % Total time : 0.006 s
% 0.13/0.42 % Maximum resident set size: 3640 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.004 s
% 0.13/0.42 % System time : 0.007 s
% 0.13/0.42 % Total time : 0.011 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------