%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN015-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:21:56 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 58 ( 11 unt; 22 nHn; 56 RR)
% Number of literals : 158 ( 0 equ; 71 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivityish,axiom,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivityish) ).
cnf(c_17,negated_conjecture,
( ~ element(X1,k)
| equalish(X1,k)
| equalish(X1,m)
| equalish(X1,n) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_17) ).
cnf(c_23,negated_conjecture,
equalish(m,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_23) ).
cnf(element_substitutionish1,axiom,
( ~ element(X3,X1)
| ~ equalish(X1,X2)
| element(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitutionish1) ).
cnf(c_9,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| equalish(X2,m)
| element(X2,m)
| equalish(X1,m)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_9) ).
cnf(c_8,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(f(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_8) ).
cnf(c_7,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(X1,f(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_7) ).
cnf(element_substitutionish2,axiom,
( ~ equalish(X1,X3)
| ~ element(X1,X2)
| element(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_substitutionish2) ).
cnf(c_5,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),m)
| equalish(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_5) ).
cnf(symmetryish,axiom,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetryish) ).
cnf(c_20,negated_conjecture,
~ equalish(n,k),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_20) ).
cnf(c_6,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),X1)
| equalish(X1,m) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_6) ).
cnf(c_16,negated_conjecture,
( ~ equalish(X1,n)
| equalish(X1,k)
| element(X1,k) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_16) ).
cnf(reflexivityish,axiom,
equalish(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivityish) ).
cnf(c_0_14,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivityish]) ).
cnf(c_0_15,negated_conjecture,
( ~ element(X1,k)
| equalish(X1,k)
| equalish(X1,m)
| equalish(X1,n) ),
inference(fof_simplification,[status(thm)],[c_17]) ).
cnf(c_0_16,plain,
( ~ equalish(X2,X3)
| ~ equalish(X1,X2)
| equalish(X1,X3) ),
c_0_14 ).
cnf(c_0_17,negated_conjecture,
equalish(m,k),
c_23 ).
cnf(c_0_18,plain,
( ~ element(X3,X1)
| ~ equalish(X1,X2)
| element(X3,X2) ),
inference(fof_simplification,[status(thm)],[element_substitutionish1]) ).
cnf(c_0_19,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| equalish(X2,m)
| element(X2,m)
| equalish(X1,m)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[c_9]) ).
cnf(c_0_20,negated_conjecture,
( ~ element(X1,k)
| equalish(X1,k)
| equalish(X1,m)
| equalish(X1,n) ),
c_0_15 ).
cnf(c_0_21,negated_conjecture,
( ~ equalish(X1,m)
| equalish(X1,k) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( ~ element(X3,X1)
| ~ equalish(X1,X2)
| element(X3,X2) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| equalish(X2,m)
| element(X2,m)
| equalish(X1,m)
| equalish(X1,X2) ),
c_0_19 ).
cnf(c_0_24,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(f(X1),X1) ),
inference(fof_simplification,[status(thm)],[c_8]) ).
cnf(c_0_25,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(X1,f(X1)) ),
inference(fof_simplification,[status(thm)],[c_7]) ).
cnf(c_0_26,plain,
( ~ equalish(X1,X3)
| ~ element(X1,X2)
| element(X3,X2) ),
inference(fof_simplification,[status(thm)],[element_substitutionish2]) ).
cnf(c_0_27,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),m)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_5]) ).
cnf(c_0_28,negated_conjecture,
( ~ element(X1,k)
| equalish(X1,k)
| equalish(X1,n) ),
inference(csr,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ element(X1,m)
| element(X1,k) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_30,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| equalish(X2,X1)
| equalish(X1,m)
| element(X1,m) ),
inference(csr,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(f(X1),X1) ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(X1,f(X1)) ),
c_0_25 ).
cnf(c_0_33,plain,
( ~ equalish(X1,X3)
| ~ element(X1,X2)
| element(X3,X2) ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),m)
| equalish(X1,m) ),
c_0_27 ).
cnf(c_0_35,plain,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetryish]) ).
cnf(c_0_36,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,n)
| equalish(X1,k) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| element(f(X1),m) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
~ equalish(n,k),
inference(fof_simplification,[status(thm)],[c_20]) ).
cnf(c_0_39,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),X1)
| equalish(X1,m) ),
inference(fof_simplification,[status(thm)],[c_6]) ).
cnf(c_0_40,plain,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
c_0_35 ).
cnf(c_0_41,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| equalish(f(X1),k)
| equalish(f(X1),n) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ equalish(n,k),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
( ~ element(X1,m)
| ~ equalish(f(X1),X1)
| equalish(X1,m) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( ~ element(X1,m)
| equalish(X1,m)
| equalish(k,f(X1))
| equalish(f(X1),n) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ equalish(n,m),
inference(spm,[status(thm)],[c_0_42,c_0_21]) ).
cnf(c_0_46,negated_conjecture,
equalish(k,m),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( ~ element(n,m)
| equalish(k,f(n)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
( ~ equalish(X1,k)
| equalish(X1,m) ),
inference(spm,[status(thm)],[c_0_16,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( ~ element(n,m)
| equalish(f(n),k) ),
inference(spm,[status(thm)],[c_0_40,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
( ~ equalish(X1,n)
| equalish(X1,k)
| element(X1,k) ),
inference(fof_simplification,[status(thm)],[c_16]) ).
cnf(c_0_51,negated_conjecture,
( ~ element(n,m)
| equalish(f(n),m) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
( ~ element(X1,k)
| element(X1,m) ),
inference(spm,[status(thm)],[c_0_22,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
( ~ equalish(X1,n)
| equalish(X1,k)
| element(X1,k) ),
c_0_50 ).
cnf(c_0_54,negated_conjecture,
~ element(n,m),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_51]),c_0_45]) ).
cnf(c_0_55,negated_conjecture,
( ~ equalish(X1,n)
| equalish(X1,k)
| element(X1,m) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,axiom,
equalish(X1,X1),
reflexivityish ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN015-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 10:42:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_1 with pid 1259941 completed with status 0
% 0.10/0.44 % Result found by new_bool_1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1259949 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGUNF-FFMF11-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Unsatisfiable
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 26
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 26
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 26
% 0.10/0.44 % Processed clauses : 215
% 0.10/0.44 % ...of these trivial : 2
% 0.10/0.44 % ...subsumed : 103
% 0.10/0.44 % ...remaining for further processing : 110
% 0.10/0.44 % Other redundant clauses eliminated : 0
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 31
% 0.10/0.44 % Backward-rewritten : 7
% 0.10/0.44 % Generated clauses : 468
% 0.10/0.44 % ...of the previous two non-redundant : 356
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 14
% 0.10/0.44 % Paramodulations : 468
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 0
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 163
% 0.10/0.44 % ...of those cached : 152
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 72
% 0.10/0.44 % Positive orientable unit clauses : 7
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 7
% 0.10/0.44 % Non-unit-clauses : 58
% 0.10/0.44 % Current number of unprocessed clauses: 111
% 0.10/0.44 % ...number of literals in the above : 567
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 38
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 1059
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 684
% 0.10/0.44 % Non-unit clause-clause subsumptions : 137
% 0.10/0.44 % Unit Clause-clause subsumption calls : 6
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 3
% 0.10/0.44 % BW rewrite match successes : 2
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 7208
% 0.10/0.44 % Search garbage collected termcells : 62
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.009 s
% 0.10/0.44 % System time : 0.001 s
% 0.10/0.44 % Total time : 0.010 s
% 0.10/0.44 % Maximum resident set size: 3648 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.011 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.016 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------