%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR125_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 12:17:31 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 : CSR125_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 15:11:43 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 2062661 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: FGUNF-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 SAT001_CA_MinMin_p005000_rr 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 2062666 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: FGUNF-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, holdsDuring_THFTYPE_IiooI: ($i * $o) > $o).
% 0.10/0.44 tff(decl_24, type, lBill_THFTYPE_i: $i).
% 0.10/0.44 tff(decl_26, type, lSue_THFTYPE_i: $i).
% 0.10/0.44 tff(decl_27, type, lYearFn_THFTYPE_IiiI: $i > $i).
% 0.10/0.44 tff(decl_28, type, likes_THFTYPE_IiioI: ($i * $i) > $o).
% 0.10/0.44 tff(decl_29, type, n2009_THFTYPE_i: $i).
% 0.10/0.44 fof(con, conjecture, holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false), file('/export/starexec/sandbox/benchmark/theBenchmark.p', con)).
% 0.10/0.44 fof(ax_002, axiom, ![X1]:(holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),~(likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax_002)).
% 0.10/0.44 fof(ax, axiom, likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax)).
% 0.10/0.44 fof(c_0_3, negated_conjecture, ~(holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(assume_negation,[status(cth)],[con])).
% 0.10/0.44 fof(c_0_4, plain, ![X1]:(((likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(~likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_002])])).
% 0.10/0.44 fof(c_0_5, negated_conjecture, ~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false), inference(fof_simplification,[status(thm)],[c_0_3])).
% 0.10/0.44 fof(c_0_6, plain, ![X2]:(((likes_THFTYPE_IiioI(lSue_THFTYPE_i,X2)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(~likes_THFTYPE_IiioI(lSue_THFTYPE_i,X2)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])])).
% 0.10/0.44 fof(c_0_7, negated_conjecture, ~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false), inference(fof_nnf,[status(thm)],[c_0_5])).
% 0.10/0.44 cnf(c_0_8, plain, (holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.10/0.44 cnf(c_0_9, negated_conjecture, (~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.10/0.44 cnf(c_0_10, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(split_conjunct,[status(thm)],[ax])).
% 0.10/0.44 cnf(c_0_11, plain, (~likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)), inference(sr,[status(thm)],[c_0_8, c_0_9])).
% 0.10/0.44 cnf(c_0_12, plain, ($false), inference(sr,[status(thm)],[c_0_10, c_0_11]), ['proof']).
% 0.10/0.44 % SZS output end CNFRefutation
% 0.10/0.44 % Parsed axioms : 12
% 0.10/0.44 % Removed by relevancy pruning/SinE : 0
% 0.10/0.44 % Initial clauses : 13
% 0.10/0.44 % Removed in clause preprocessing : 8
% 0.10/0.44 % Initial clauses in saturation : 5
% 0.10/0.44 % Processed clauses : 5
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 0
% 0.10/0.44 % ...remaining for further processing : 5
% 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 : 0
% 0.10/0.44 % Backward-rewritten : 0
% 0.10/0.44 % Generated clauses : 2
% 0.10/0.44 % ...of the previous two non-redundant : 1
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 0
% 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 : 0
% 0.10/0.44 % ...of those cached : 0
% 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 : 3
% 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 : 2
% 0.10/0.44 % Non-unit-clauses : 0
% 0.10/0.44 % Current number of unprocessed clauses: 0
% 0.10/0.44 % ...number of literals in the above : 0
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 2
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 0
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 0
% 0.10/0.44 % BW rewrite match successes : 0
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 270
% 0.10/0.44 % Search garbage collected termcells : 11
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.000 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.005 s
% 0.10/0.44 % Maximum resident set size: 3376 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.004 s
% 0.10/0.44 % System time : 0.014 s
% 0.10/0.44 % Total time : 0.019 s
% 0.10/0.44 % Maximum resident set size: 4608 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------