%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN014-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:31:19 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 63 ( 6 unt; 50 nHn; 59 RR)
% Number of literals : 185 ( 112 equ; 53 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_4,negated_conjecture,
( ~ element(X1,j)
| X1 = k
| X1 = j ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_4) ).
cnf(c_11,negated_conjecture,
( g(X1) != X1
| element(X1,n)
| X1 = n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_11) ).
cnf(c_13,negated_conjecture,
( element(g(X1),X1)
| element(X1,n)
| X1 = n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_17,negated_conjecture,
( ~ element(X1,k)
| X1 = n
| X1 = m
| X1 = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_17) ).
cnf(c_12,negated_conjecture,
( element(X1,g(X1))
| element(X1,n)
| X1 = n ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_2,negated_conjecture,
( m = k
| n = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_2) ).
cnf(c_15,negated_conjecture,
( X1 != m
| element(X1,k)
| X1 = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_15) ).
cnf(c_8,negated_conjecture,
( ~ element(X1,m)
| element(f(X1),X1)
| X1 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_8) ).
cnf(c_1,negated_conjecture,
m != n,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_1) ).
cnf(c_3,negated_conjecture,
( X1 != k
| element(X1,j)
| X1 = j ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_3) ).
cnf(c_6,negated_conjecture,
( f(X1) != X1
| ~ element(X1,m)
| X1 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_6) ).
cnf(c_5,negated_conjecture,
( f(X1) != m
| ~ element(X1,m)
| X1 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_5) ).
cnf(c_9,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| X2 = X1
| X2 = m
| element(X1,m)
| X1 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_9) ).
cnf(c_7,negated_conjecture,
( ~ element(X1,m)
| element(X1,f(X1))
| X1 = m ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_7) ).
cnf(c_16,negated_conjecture,
( X1 != n
| element(X1,k)
| X1 = k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_16) ).
cnf(c_0_15,negated_conjecture,
( ~ element(X1,j)
| X1 = k
| X1 = j ),
inference(fof_simplification,[status(thm)],[c_4]) ).
cnf(c_0_16,negated_conjecture,
( g(X1) != X1
| element(X1,n)
| X1 = n ),
inference(fof_simplification,[status(thm)],[c_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ element(X1,j)
| X1 = k
| X1 = j ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
( element(g(X1),X1)
| element(X1,n)
| X1 = n ),
c_13 ).
cnf(c_0_19,negated_conjecture,
( g(X1) != X1
| element(X1,n)
| X1 = n ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
( ~ element(X1,k)
| X1 = n
| X1 = m
| X1 = k ),
inference(fof_simplification,[status(thm)],[c_17]) ).
cnf(c_0_21,negated_conjecture,
( element(X1,g(X1))
| element(X1,n)
| X1 = n ),
c_12 ).
cnf(c_0_22,negated_conjecture,
( element(j,n)
| j = n
| g(j) = k ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ element(X1,k)
| X1 = n
| X1 = m
| X1 = k ),
c_0_20 ).
cnf(c_0_24,negated_conjecture,
( m = k
| n = k ),
c_2 ).
cnf(c_0_25,negated_conjecture,
( element(j,k)
| element(j,n)
| j = n ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( X1 != m
| element(X1,k)
| X1 = k ),
inference(fof_simplification,[status(thm)],[c_15]) ).
cnf(c_0_27,negated_conjecture,
( ~ element(X1,m)
| element(f(X1),X1)
| X1 = m ),
inference(fof_simplification,[status(thm)],[c_8]) ).
cnf(c_0_28,negated_conjecture,
m != n,
inference(fof_simplification,[status(thm)],[c_1]) ).
cnf(c_0_29,negated_conjecture,
( X1 != k
| element(X1,j)
| X1 = j ),
inference(fof_simplification,[status(thm)],[c_3]) ).
cnf(c_0_30,negated_conjecture,
( ~ element(X1,n)
| X1 = n
| X1 = m
| k = m ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( element(j,n)
| j = n
| k = m ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( X1 != m
| element(X1,k)
| X1 = k ),
c_0_26 ).
cnf(c_0_33,negated_conjecture,
( f(X1) != X1
| ~ element(X1,m)
| X1 = m ),
inference(fof_simplification,[status(thm)],[c_6]) ).
cnf(c_0_34,negated_conjecture,
( ~ element(X1,m)
| element(f(X1),X1)
| X1 = m ),
c_0_27 ).
cnf(c_0_35,negated_conjecture,
m != n,
c_0_28 ).
cnf(c_0_36,negated_conjecture,
( X1 != k
| element(X1,j)
| X1 = j ),
c_0_29 ).
cnf(c_0_37,negated_conjecture,
( k = m
| j = m
| j = n ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( element(m,k)
| k = m ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( f(X1) != m
| ~ element(X1,m)
| X1 = m ),
inference(fof_simplification,[status(thm)],[c_5]) ).
cnf(c_0_40,negated_conjecture,
( f(X1) != X1
| ~ element(X1,m)
| X1 = m ),
c_0_33 ).
cnf(c_0_41,negated_conjecture,
( ~ element(n,m)
| k = m
| f(n) = m
| f(n) = n ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_34]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( element(k,j)
| j = k ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( ~ element(X1,n)
| X1 = n
| X1 = k
| j = m
| k = m ),
inference(spm,[status(thm)],[c_0_17,c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( element(m,n)
| k = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_24]),c_0_35]) ).
cnf(c_0_45,negated_conjecture,
( f(X1) != m
| ~ element(X1,m)
| X1 = m ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
( ~ element(n,m)
| k = m
| f(n) = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35]) ).
cnf(c_0_47,negated_conjecture,
( element(n,j)
| j = n
| k = m ),
inference(spm,[status(thm)],[c_0_42,c_0_24]) ).
cnf(c_0_48,negated_conjecture,
( k = m
| j = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_49,negated_conjecture,
( ~ element(n,m)
| k = m ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_35]) ).
cnf(c_0_50,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| X2 = X1
| X2 = m
| element(X1,m)
| X1 = m ),
inference(fof_simplification,[status(thm)],[c_9]) ).
cnf(c_0_51,negated_conjecture,
( ~ element(X1,m)
| element(X1,f(X1))
| X1 = m ),
inference(fof_simplification,[status(thm)],[c_7]) ).
cnf(c_0_52,negated_conjecture,
( X1 != n
| element(X1,k)
| X1 = k ),
inference(fof_simplification,[status(thm)],[c_16]) ).
cnf(c_0_53,negated_conjecture,
k = m,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_35]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
( ~ element(X2,X1)
| ~ element(X1,X2)
| X2 = X1
| X2 = m
| element(X1,m)
| X1 = m ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
( ~ element(X1,m)
| element(X1,f(X1))
| X1 = m ),
c_0_51 ).
cnf(c_0_56,negated_conjecture,
( X1 != n
| element(X1,k)
| X1 = k ),
c_0_52 ).
cnf(c_0_57,negated_conjecture,
( ~ element(X1,m)
| X1 = m
| X1 = n ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_53]),c_0_53])]) ).
cnf(c_0_58,negated_conjecture,
( ~ element(X1,m)
| element(f(X1),m)
| X1 = m ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_34]),c_0_40]),c_0_45]) ).
cnf(c_0_59,negated_conjecture,
( element(n,k)
| k = n ),
inference(er,[status(thm)],[c_0_56]) ).
cnf(c_0_60,negated_conjecture,
( ~ element(X1,m)
| X1 = m
| f(X1) = n ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_45]) ).
cnf(c_0_61,negated_conjecture,
element(n,m),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_53]),c_0_53]),c_0_35]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_60])]),c_0_61])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 10:40:46 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.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 % sh5l with pid 4073553 completed with status 0
% 0.13/0.42 % Result found by sh5l
% 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 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.42 % Search class: FGUSF-FFSF11-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 4073554 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 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.42 % Search class: FGUSF-FFSF11-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 Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 17
% 0.13/0.42 % Removed by relevancy pruning/SinE : 0
% 0.13/0.42 % Initial clauses : 17
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 17
% 0.13/0.42 % Processed clauses : 97
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 32
% 0.13/0.42 % ...remaining for further processing : 65
% 0.13/0.42 % Other redundant clauses eliminated : 4
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 12
% 0.13/0.42 % Backward-rewritten : 26
% 0.13/0.42 % Generated clauses : 134
% 0.13/0.42 % ...of the previous two non-redundant : 131
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 20
% 0.13/0.42 % Paramodulations : 127
% 0.13/0.42 % Factorizations : 3
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 4
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 41
% 0.13/0.42 % ...of those cached : 38
% 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 : 24
% 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 : 1
% 0.13/0.42 % Non-unit-clauses : 20
% 0.13/0.42 % Current number of unprocessed clauses: 3
% 0.13/0.42 % ...number of literals in the above : 19
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 38
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 248
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 128
% 0.13/0.42 % Non-unit clause-clause subsumptions : 60
% 0.13/0.42 % Unit Clause-clause subsumption calls : 5
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 2
% 0.13/0.42 % BW rewrite match successes : 2
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 2513
% 0.13/0.42 % Search garbage collected termcells : 38
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.005 s
% 0.13/0.42 % System time : 0.000 s
% 0.13/0.42 % Total time : 0.005 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.005 s
% 0.13/0.42 % System time : 0.005 s
% 0.13/0.42 % Total time : 0.010 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------