%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:35:05 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV434_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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 07:21:28 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN 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 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1207323 completed with status 0
% 0.10/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUSF-FFSF11-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.10/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1207329 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.44 % No SInE strategy applied
% 0.10/0.44 % Search class: FGUSF-FFSF11-SFFFFFNN
% 0.10/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.44 % Starting SubtermCWHack with 136s (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 Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% 0.10/0.44 tff(decl_23, type, f: $o > $i).
% 0.10/0.44 tff(decl_24, type, epred1_1: $i > $o).
% 0.10/0.44 tff(decl_25, type, esk1_0: $i).
% 0.10/0.44 tff(decl_26, type, esk2_0: $i).
% 0.10/0.44 tff(decl_27, type, esk3_0: $i).
% 0.10/0.44 fof(fsurj, axiom, ![X1]:(?[X2:$o]:(f(X2)=X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fsurj)).
% 0.10/0.44 fof(less3, conjecture, ![X3, X1, X4]:((X3=X1|X3=X4|X1=X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', less3)).
% 0.10/0.44 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.10/0.44 cnf(c_0_3, plain, (f($true)=X1|~epred1_1(X1)), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.10/0.44 cnf(c_0_4, plain, (epred1_1(X1)|f($false)=X1), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.10/0.44 cnf(c_0_5, plain, (f($false)=X1|f($true)=X1), inference(spm,[status(thm)],[c_0_3, c_0_4])).
% 0.10/0.44 fof(c_0_6, negated_conjecture, ~(![X3, X1, X4]:((X3=X1|X3=X4|X1=X4))), inference(assume_negation,[status(cth)],[less3])).
% 0.10/0.44 cnf(c_0_7, plain, (f($true)=X1|f($true)=X3|X1=X3), inference(spm,[status(thm)],[c_0_5, c_0_5])).
% 0.10/0.44 fof(c_0_8, 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_6])])])])).
% 0.10/0.44 cnf(c_0_9, plain, (f($true)=X1|X1=X3|X4=X5|X3=X5|X3=X4), inference(spm,[status(thm)],[c_0_7, c_0_7])).
% 0.10/0.44 cnf(c_0_10, negated_conjecture, (esk1_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.10/0.44 cnf(c_0_11, plain, (f($true)=X1|X3=X4|X3=X1|X4=X1), inference(ef,[status(thm)],[c_0_9])).
% 0.10/0.44 cnf(c_0_12, negated_conjecture, (esk2_0!=esk3_0), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.10/0.44 cnf(c_0_13, negated_conjecture, (f($true)=esk3_0|X1=esk3_0|X1=esk1_0), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11])])).
% 0.10/0.44 cnf(c_0_14, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.10/0.44 cnf(c_0_15, negated_conjecture, (f($true)=esk3_0), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13])]), c_0_14])).
% 0.10/0.44 cnf(c_0_16, plain, (esk3_0=X1|esk3_0=X3|X3=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_15]), c_0_15])).
% 0.10/0.44 cnf(c_0_17, negated_conjecture, (esk1_0=X1|esk3_0=X1), inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_16])])).
% 0.10/0.44 cnf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_17])]), c_0_14]), ['proof']).
% 0.10/0.44 % SZS output end CNFRefutation
% 0.10/0.44 % Parsed axioms : 3
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 6
% 0.10/0.44 % Removed in clause preprocessing : 1
% 0.10/0.44 % Initial clauses in saturation : 5
% 0.10/0.44 % Processed clauses : 51
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 33
% 0.10/0.44 % ...remaining for further processing : 18
% 0.10/0.44 % Other redundant clauses eliminated : 127
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 1
% 0.10/0.44 % Backward-rewritten : 6
% 0.10/0.44 % Generated clauses : 612
% 0.10/0.44 % ...of the previous two non-redundant : 276
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 218
% 0.10/0.44 % Factorizations : 267
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 127
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 21
% 0.10/0.44 % ...of those cached : 20
% 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 : 11
% 0.10/0.44 % Positive orientable unit clauses : 1
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 3
% 0.10/0.44 % Non-unit-clauses : 7
% 0.10/0.44 % Current number of unprocessed clauses: 103
% 0.10/0.44 % ...number of literals in the above : 458
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 7
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 45
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 37
% 0.10/0.44 % Non-unit clause-clause subsumptions : 29
% 0.10/0.44 % Unit Clause-clause subsumption calls : 2
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 1
% 0.10/0.44 % BW rewrite match successes : 1
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 734
% 0.10/0.44 % Search garbage collected termcells : 44
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.008 s
% 0.10/0.44 % System time : 0.002 s
% 0.10/0.44 % Total time : 0.009 s
% 0.10/0.44 % Maximum resident set size: 3628 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.025 s
% 0.10/0.44 % System time : 0.011 s
% 0.10/0.44 % Total time : 0.036 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------