%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:36:38 PM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n001.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 07:26:59 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2561807 completed with status 0
% 0.14/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2561817 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.14/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FGUSF-FFSF11-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41 % Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Theorem
% 0.14/0.41 % SZS output start CNFRefutation
% 0.14/0.41 tff(decl_23, type, f: $o > $i).
% 0.14/0.41 tff(decl_24, type, epred1_1: $i > $o).
% 0.14/0.41 tff(decl_25, type, esk1_0: $i).
% 0.14/0.41 tff(decl_26, type, esk2_0: $i).
% 0.14/0.41 tff(decl_27, type, esk3_0: $i).
% 0.14/0.41 fof(fsurj, axiom, ![X1]:(?[X2:$o]:(f(X2)=X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fsurj)).
% 0.14/0.41 fof(less3, conjecture, ![X3, X1, X4]:((X3=X1|X3=X4|X1=X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', less3)).
% 0.14/0.41 fof(c_0_2, plain, ![X5]:(((~epred1_1(X5)|f($true)=X5)&(epred1_1(X5)|f($false)=X5))), inference(fool_unroll,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[fsurj])])])).
% 0.14/0.41 cnf(c_0_3, plain, (f($true)=X1|~epred1_1(X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.14/0.41 cnf(c_0_4, plain, (epred1_1(X1)|f($false)=X1), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.14/0.41 fof(c_0_5, negated_conjecture, ~(![X3, X1, X4]:((X3=X1|X3=X4|X1=X4))), inference(assume_negation,[status(cth)],[less3])).
% 0.14/0.41 cnf(c_0_6, plain, (f($false)=X1|f($true)=X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
% 0.14/0.41 fof(c_0_7, negated_conjecture, ((esk1_0!=esk2_0&esk1_0!=esk3_0)&esk2_0!=esk3_0), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
% 0.14/0.41 cnf(c_0_8, plain, (f($true)=X1|f($true)=X3|X1=X3), inference(spm,[status(thm)],[c_0_6, c_0_6])).
% 0.14/0.41 cnf(c_0_9, negated_conjecture, (esk1_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.41 cnf(c_0_10, plain, (f($true)=X1|X1=X3|X4=X5|X3=X5|X3=X4), inference(spm,[status(thm)],[c_0_8, c_0_8])).
% 0.14/0.41 cnf(c_0_11, negated_conjecture, (f($true)=X1|esk1_0=X3|esk3_0=X3|X1=esk1_0), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10])])).
% 0.14/0.41 cnf(c_0_12, negated_conjecture, (esk2_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.41 cnf(c_0_13, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.14/0.41 cnf(c_0_14, negated_conjecture, (f($true)=esk3_0|f($true)=esk1_0), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]), c_0_9])).
% 0.14/0.41 cnf(c_0_15, negated_conjecture, (f($true)=X1|X1=esk1_0), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_11])]), c_0_13])).
% 0.14/0.41 cnf(c_0_16, negated_conjecture, (X1=esk1_0|X1=esk3_0), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.14/0.41 cnf(c_0_17, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_16])]), c_0_13]), ['proof']).
% 0.14/0.41 % SZS output end CNFRefutation
% 0.14/0.41 % Parsed axioms : 3
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 6
% 0.14/0.41 % Removed in clause preprocessing : 1
% 0.14/0.41 % Initial clauses in saturation : 5
% 0.14/0.41 % Processed clauses : 31
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 10
% 0.14/0.41 % ...remaining for further processing : 21
% 0.14/0.41 % Other redundant clauses eliminated : 84
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 4
% 0.14/0.41 % Backward-rewritten : 0
% 0.14/0.41 % Generated clauses : 369
% 0.14/0.41 % ...of the previous two non-redundant : 188
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 164
% 0.14/0.41 % Factorizations : 121
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 84
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 0
% 0.14/0.41 % ...of those cached : 0
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 12
% 0.14/0.41 % Positive orientable unit clauses : 0
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 3
% 0.14/0.41 % Non-unit-clauses : 9
% 0.14/0.41 % Current number of unprocessed clauses: 157
% 0.14/0.41 % ...number of literals in the above : 761
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 9
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 25
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 20
% 0.14/0.41 % Non-unit clause-clause subsumptions : 12
% 0.14/0.41 % Unit Clause-clause subsumption calls : 0
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 0
% 0.14/0.41 % BW rewrite match successes : 0
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 743
% 0.14/0.41 % Search garbage collected termcells : 44
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.003 s
% 0.14/0.41 % Total time : 0.007 s
% 0.14/0.41 % Maximum resident set size: 3628 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.018 s
% 0.14/0.41 % System time : 0.012 s
% 0.14/0.41 % Total time : 0.030 s
% 0.14/0.41 % Maximum resident set size: 4608 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------