%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 03:24:00 PM UTC 2026
% Result : Theorem 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 1
% Syntax : Number of formulae : 56 ( 8 unt; 0 def)
% Number of atoms : 213 ( 63 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 251 ( 94 ~; 136 |; 15 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 75 ( 14 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kalish317,conjecture,
( ( ! [X2,X3] :
( ( f(X3)
& f(X2) )
=> X2 = X3 )
& ? [X1] : f(X1) )
<=> ? [X4] :
( ! [X5] :
( f(X5)
=> X4 = X5 )
& f(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish317) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X2,X3] :
( ( f(X3)
& f(X2) )
=> X2 = X3 )
& ? [X1] : f(X1) )
<=> ? [X4] :
( ! [X5] :
( f(X5)
=> X4 = X5 )
& f(X4) ) ),
inference(assume_negation,[status(cth)],[kalish317]) ).
fof(c_0_2,negated_conjecture,
! [X6,X9,X12,X13,X15] :
( ( X12 = X13
| ~ f(X13)
| ~ f(X12)
| esk5_0 = X15
| ~ f(X15) )
& ( X12 = X13
| ~ f(X13)
| ~ f(X12)
| f(esk5_0) )
& ( f(esk4_0)
| esk5_0 = X15
| ~ f(X15) )
& ( f(esk4_0)
| f(esk5_0) )
& ( ~ f(X6)
| esk1_0 != esk2_0
| ~ f(X9)
| X9 != esk3_1(X9) )
& ( ~ f(X6)
| esk1_0 != esk2_0
| ~ f(X9)
| f(esk3_1(X9)) )
& ( ~ f(X6)
| f(esk2_0)
| ~ f(X9)
| X9 != esk3_1(X9) )
& ( ~ f(X6)
| f(esk2_0)
| ~ f(X9)
| f(esk3_1(X9)) )
& ( ~ f(X6)
| f(esk1_0)
| ~ f(X9)
| X9 != esk3_1(X9) )
& ( ~ f(X6)
| f(esk1_0)
| ~ f(X9)
| f(esk3_1(X9)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).
cnf(c_0_3,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| X1 = X2
| f(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( f(esk4_0)
| f(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| f(esk1_0)
| f(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| X1 = esk4_0 ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ f(X1)
| f(esk1_0)
| f(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| f(esk2_0)
| f(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| X1 != esk3_1(X1)
| f(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| f(esk1_0)
| esk3_1(X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ f(X1)
| f(esk2_0)
| f(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_4]),c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ f(X1)
| f(esk1_0)
| f(esk5_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10])]),c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| X1 != esk3_1(X1)
| f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| f(esk2_0)
| esk3_1(X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( f(esk5_0)
| f(esk1_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_16,negated_conjecture,
( ~ f(X1)
| f(esk2_0)
| f(esk5_0) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]),c_0_4]) ).
cnf(c_0_17,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( f(esk5_0)
| f(esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( ~ f(X2)
| esk1_0 != esk2_0
| ~ f(X1)
| f(esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
( f(esk5_0)
| esk2_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| f(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_4]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( ~ f(X2)
| esk1_0 != esk2_0
| ~ f(X1)
| X1 != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_23,negated_conjecture,
( ~ f(X1)
| f(esk5_0)
| esk3_1(X1) = esk4_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ f(X3)
| ~ f(X2)
| ~ f(X1)
| X2 = X3
| esk5_0 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_25,negated_conjecture,
( ~ f(X1)
| f(esk5_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_4]),c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ f(X2)
| ~ f(X3)
| ~ f(X1)
| f(esk2_0)
| esk5_0 = X3
| X1 = esk3_1(X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_27,negated_conjecture,
f(esk5_0),
inference(spm,[status(thm)],[c_0_25,c_0_4]) ).
cnf(c_0_28,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| f(esk2_0)
| esk5_0 = X2
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( ~ f(X2)
| ~ f(X1)
| esk5_0 = X2
| X1 = esk5_0 ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| f(esk2_0)
| esk3_1(X2) = esk5_0
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_31,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| f(esk1_0)
| esk5_0 = X2
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_32,negated_conjecture,
( ~ f(X1)
| f(esk2_0)
| esk3_1(X1) = esk5_0
| esk3_1(esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| f(esk1_0)
| esk3_1(X2) = esk5_0
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_7]) ).
cnf(c_0_34,negated_conjecture,
( f(esk2_0)
| esk3_1(esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[c_0_32,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( ~ f(X1)
| f(esk1_0)
| esk3_1(X1) = esk5_0
| esk3_1(esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( ~ f(X1)
| f(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_34]),c_0_27])]) ).
cnf(c_0_37,negated_conjecture,
( f(esk1_0)
| esk3_1(esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
f(esk2_0),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( ~ f(X1)
| f(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_37]),c_0_27])]) ).
cnf(c_0_40,negated_conjecture,
( ~ f(X1)
| esk5_0 = X1
| esk2_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
f(esk1_0),
inference(spm,[status(thm)],[c_0_39,c_0_27]) ).
cnf(c_0_42,negated_conjecture,
( ~ f(X1)
| esk2_0 != esk1_0
| f(esk3_1(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_43,negated_conjecture,
esk2_0 = esk5_0,
inference(spm,[status(thm)],[c_0_40,c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( ~ f(X1)
| esk5_0 = X1
| esk1_0 = esk5_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( ~ f(X1)
| esk1_0 != esk5_0
| f(esk3_1(X1)) ),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
esk1_0 = esk5_0,
inference(spm,[status(thm)],[c_0_44,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( ~ f(X1)
| f(esk3_1(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_48,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| esk5_0 = X2
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_29,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| esk3_1(X2) = esk5_0
| esk3_1(X1) = esk5_0 ),
inference(spm,[status(thm)],[c_0_48,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| esk1_0 != esk5_0
| esk3_1(X1) != X1 ),
inference(rw,[status(thm)],[c_0_22,c_0_43]) ).
cnf(c_0_51,negated_conjecture,
( ~ f(X1)
| esk3_1(X1) = esk5_0
| esk3_1(esk5_0) = esk5_0 ),
inference(spm,[status(thm)],[c_0_49,c_0_27]) ).
cnf(c_0_52,negated_conjecture,
( ~ f(X1)
| ~ f(X2)
| esk3_1(X1) != X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_46])]) ).
cnf(c_0_53,negated_conjecture,
esk3_1(esk5_0) = esk5_0,
inference(spm,[status(thm)],[c_0_51,c_0_27]) ).
cnf(c_0_54,negated_conjecture,
~ f(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_27])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN415+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:54:19 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % new_bool_3 with pid 2391070 completed with status 0
% 0.15/0.45 % Result found by new_bool_3
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % SubtermCWHack with pid 2391076 completed with status 0
% 0.15/0.45 % Result found by SubtermCWHack
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.45 % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.15/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Theorem
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 1
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 10
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 10
% 0.15/0.45 % Processed clauses : 213
% 0.15/0.45 % ...of these trivial : 0
% 0.15/0.45 % ...subsumed : 113
% 0.15/0.45 % ...remaining for further processing : 100
% 0.15/0.45 % Other redundant clauses eliminated : 24
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 62
% 0.15/0.45 % Backward-rewritten : 32
% 0.15/0.45 % Generated clauses : 527
% 0.15/0.45 % ...of the previous two non-redundant : 485
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 11
% 0.15/0.45 % Paramodulations : 502
% 0.15/0.45 % Factorizations : 0
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 24
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 76
% 0.15/0.45 % ...of those cached : 69
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 5
% 0.15/0.45 % Positive orientable unit clauses : 4
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 1
% 0.15/0.45 % Non-unit-clauses : 0
% 0.15/0.45 % Current number of unprocessed clauses: 17
% 0.15/0.45 % ...number of literals in the above : 91
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 95
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 540
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 308
% 0.15/0.45 % Non-unit clause-clause subsumptions : 175
% 0.15/0.45 % Unit Clause-clause subsumption calls : 14
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 7
% 0.15/0.45 % BW rewrite match successes : 7
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 6308
% 0.15/0.45 % Search garbage collected termcells : 213
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.008 s
% 0.15/0.45 % System time : 0.001 s
% 0.15/0.45 % Total time : 0.009 s
% 0.15/0.45 % Maximum resident set size: 3628 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.010 s
% 0.15/0.45 % System time : 0.005 s
% 0.15/0.45 % Total time : 0.015 s
% 0.15/0.45 % Maximum resident set size: 4864 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------