%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL977_1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 01:24:37 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL977_1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n018.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 01:17:43 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 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.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % sh5l with pid 657548 completed with status 0
% 0.13/0.45 % Result found by sh5l
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGHSS-FFSF11-SFFFFFBN
% 0.13/0.45 % partial match(2): FGHSF-FFSF11-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % SubtermCWHack with pid 657554 completed with status 0
% 0.13/0.45 % Result found by SubtermCWHack
% 0.13/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.45 % Search class: FGHSS-FFSF11-SFFFFFBN
% 0.13/0.45 % partial match(2): FGHSF-FFSF11-SFFFFFNN
% 0.13/0.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.45 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% 0.13/0.45 tff(decl_23, type, imply: ($o * $o) > $o).
% 0.13/0.45 tff(decl_24, type, p: ($i * $i) > $o).
% 0.13/0.45 tff(decl_25, type, f: $i > $i).
% 0.13/0.45 tff(decl_26, type, esk1_0: $i).
% 0.13/0.45 tff(decl_27, type, esk2_0: $i).
% 0.13/0.45 tff(decl_28, type, esk3_0: $i).
% 0.13/0.45 fof(graph_conjecture, conjecture, ![X5, X6, X7]:(imply((p(X5,X6)&p(X5,X7)),X6=X7)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', graph_conjecture)).
% 0.13/0.45 fof(imply_definition, axiom, ![X1:$o, X2:$o]:((imply(X1,X2)<=>(~(X1)|X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', imply_definition)).
% 0.13/0.45 fof(graph_impl, axiom, ![X3, X4]:((p(X3,X4)=>f(X3)=X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', graph_impl)).
% 0.13/0.45 fof(c_0_3, negated_conjecture, ~(![X5, X6, X7]:(imply((p(X5,X6)&p(X5,X7)),X6=X7))), inference(assume_negation,[status(cth)],[graph_conjecture])).
% 0.13/0.45 fof(c_0_4, negated_conjecture, ~(![X5, X6, X7]:(((~((p(X5,X6)&p(X5,X7)))|((X6!=X7|imply($true,$true))&(X6=X7|imply($true,$false))))&((p(X5,X6)&p(X5,X7))|((X6!=X7|imply($false,$true))&(X6=X7|imply($false,$false))))))), inference(fool_unroll,[status(thm)],[c_0_3])).
% 0.13/0.45 fof(c_0_5, negated_conjecture, ((((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|p(esk1_0,esk2_0))&(((esk2_0!=esk3_0|esk2_0=esk3_0|p(esk1_0,esk2_0))&(~imply($false,$false)|esk2_0=esk3_0|p(esk1_0,esk2_0)))&((esk2_0!=esk3_0|~imply($false,$true)|p(esk1_0,esk2_0))&(~imply($false,$false)|~imply($false,$true)|p(esk1_0,esk2_0)))))&((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|p(esk1_0,esk3_0))&(((esk2_0!=esk3_0|esk2_0=esk3_0|p(esk1_0,esk3_0))&(~imply($false,$false)|esk2_0=esk3_0|p(esk1_0,esk3_0)))&((esk2_0!=esk3_0|~imply($false,$true)|p(esk1_0,esk3_0))&(~imply($false,$false)|~imply($false,$true)|p(esk1_0,esk3_0))))))&((((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|(esk2_0!=esk3_0|esk2_0=esk3_0))&(((esk2_0!=esk3_0|esk2_0=esk3_0|(esk2_0!=esk3_0|esk2_0=esk3_0))&(~imply($false,$false)|esk2_0=esk3_0|(esk2_0!=esk3_0|esk2_0=esk3_0)))&((esk2_0!=esk3_0|~imply($false,$true)|(esk2_0!=esk3_0|esk2_0=esk3_0))&(~imply($false,$false)|~imply($false,$true)|(esk2_0!=esk3_0|esk2_0=esk3_0)))))&((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|(~imply($true,$false)|esk2_0=esk3_0))&(((esk2_0!=esk3_0|esk2_0=esk3_0|(~imply($true,$false)|esk2_0=esk3_0))&(~imply($false,$false)|esk2_0=esk3_0|(~imply($true,$false)|esk2_0=esk3_0)))&((esk2_0!=esk3_0|~imply($false,$true)|(~imply($true,$false)|esk2_0=esk3_0))&(~imply($false,$false)|~imply($false,$true)|(~imply($true,$false)|esk2_0=esk3_0))))))&(((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|(esk2_0!=esk3_0|~imply($true,$true)))&(((esk2_0!=esk3_0|esk2_0=esk3_0|(esk2_0!=esk3_0|~imply($true,$true)))&(~imply($false,$false)|esk2_0=esk3_0|(esk2_0!=esk3_0|~imply($true,$true))))&((esk2_0!=esk3_0|~imply($false,$true)|(esk2_0!=esk3_0|~imply($true,$true)))&(~imply($false,$false)|~imply($false,$true)|(esk2_0!=esk3_0|~imply($true,$true))))))&((~p(esk1_0,esk2_0)|~p(esk1_0,esk3_0)|(~imply($true,$false)|~imply($true,$true)))&(((esk2_0!=esk3_0|esk2_0=esk3_0|(~imply($true,$false)|~imply($true,$true)))&(~imply($false,$false)|esk2_0=esk3_0|(~imply($true,$false)|~imply($true,$true))))&((esk2_0!=esk3_0|~imply($false,$true)|(~imply($true,$false)|~imply($true,$true)))&(~imply($false,$false)|~imply($false,$true)|(~imply($true,$false)|~imply($true,$true))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])).
% 0.13/0.45 fof(c_0_6, plain, ![X1:$o, X2:$o]:((imply(X1,X2)<=>(~X1|X2))), inference(fof_simplification,[status(thm)],[imply_definition])).
% 0.13/0.45 cnf(c_0_7, negated_conjecture, (esk2_0!=esk3_0|~imply($false,$true)|esk2_0!=esk3_0|~imply($true,$true)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.13/0.45 fof(c_0_8, plain, ![X11:$o, X12:$o]:(((~imply(X11,X12)|(~X11|X12))&((X11|imply(X11,X12))&(~X12|imply(X11,X12))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
% 0.13/0.45 cnf(c_0_9, negated_conjecture, (esk3_0!=esk2_0|~imply($true,$true)|~imply($false,$true)), inference(cn,[status(thm)],[c_0_7])).
% 0.13/0.45 cnf(c_0_10, plain, (imply(X2,$true)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])])).
% 0.13/0.45 fof(c_0_11, plain, ![X13, X14]:((~p(X13,X14)|f(X13)=X14)), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[graph_impl])])])).
% 0.13/0.45 cnf(c_0_12, negated_conjecture, (esk2_0!=esk3_0|~imply($true,$true)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.13/0.45 cnf(c_0_13, plain, (f(X3)=X4|~p(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_11])).
% 0.13/0.45 cnf(c_0_14, negated_conjecture, (esk2_0=esk3_0|p(esk1_0,esk2_0)|~imply($false,$false)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.13/0.45 cnf(c_0_15, negated_conjecture, (esk2_0!=esk3_0), inference(spm,[status(thm)],[c_0_12, c_0_10])).
% 0.13/0.45 cnf(c_0_16, negated_conjecture, (esk2_0=esk3_0|p(esk1_0,esk3_0)|~imply($false,$false)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.13/0.45 cnf(c_0_17, negated_conjecture, (f(esk1_0)=esk2_0|~imply($false,$false)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
% 0.13/0.45 cnf(c_0_18, negated_conjecture, (f(esk1_0)=esk3_0|~imply($false,$false)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_16]), c_0_15])).
% 0.13/0.45 cnf(c_0_19, negated_conjecture, (~imply($false,$false)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_15])).
% 0.13/0.45 cnf(c_0_20, plain, (imply($false,X2)), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_8])])])).
% 0.13/0.45 cnf(c_0_21, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_19, c_0_20]), ['proof']).
% 0.13/0.45 % SZS output end CNFRefutation
% 0.13/0.45 % Parsed axioms : 5
% 0.13/0.45 % Removed by relevancy pruning/SinE : 2
% 0.13/0.45 % Initial clauses : 34
% 0.13/0.45 % Removed in clause preprocessing : 14
% 0.13/0.45 % Initial clauses in saturation : 20
% 0.13/0.45 % Processed clauses : 17
% 0.13/0.45 % ...of these trivial : 0
% 0.13/0.45 % ...subsumed : 1
% 0.13/0.45 % ...remaining for further processing : 16
% 0.13/0.45 % Other redundant clauses eliminated : 0
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 10
% 0.13/0.45 % Backward-rewritten : 0
% 0.13/0.45 % Generated clauses : 11
% 0.13/0.45 % ...of the previous two non-redundant : 10
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 11
% 0.13/0.45 % Factorizations : 0
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 0
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 0
% 0.13/0.45 % ...of those cached : 0
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 6
% 0.13/0.45 % Positive orientable unit clauses : 2
% 0.13/0.45 % Positive unorientable unit clauses: 0
% 0.13/0.45 % Negative unit clauses : 3
% 0.13/0.45 % Non-unit-clauses : 1
% 0.13/0.45 % Current number of unprocessed clauses: 12
% 0.13/0.45 % ...number of literals in the above : 44
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 10
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 1
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 1
% 0.13/0.45 % Non-unit clause-clause subsumptions : 1
% 0.13/0.45 % Unit Clause-clause subsumption calls : 9
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 0
% 0.13/0.45 % BW rewrite match successes : 0
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 1242
% 0.13/0.45 % Search garbage collected termcells : 205
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.004 s
% 0.13/0.45 % System time : 0.002 s
% 0.13/0.45 % Total time : 0.007 s
% 0.13/0.45 % Maximum resident set size: 3632 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.005 s
% 0.13/0.45 % System time : 0.008 s
% 0.13/0.45 % Total time : 0.013 s
% 0.13/0.45 % Maximum resident set size: 4864 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------