%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR119_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 12:17:29 PM UTC 2026
% Result : Theorem 0.11s 0.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR119_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n001.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 15:16:29 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43 % Version: 3.5.1
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % sh5l with pid 3433400 completed with status 0
% 0.11/0.43 % Result found by sh5l
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % SubtermCWHack with pid 3433401 completed with status 0
% 0.11/0.43 % Result found by SubtermCWHack
% 0.11/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.43 % Starting sh5l with 300s (1) cores
% 0.11/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.11/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.11/0.43 % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.43 % Preprocessing time : 0.001 s
% 0.11/0.43
% 0.11/0.43 % Proof found!
% 0.11/0.43 % SZS status Theorem
% 0.11/0.43 % SZS output start CNFRefutation
% 0.11/0.43 tff(decl_23, type, holdsDuring_THFTYPE_IiooI: ($i * $o) > $o).
% 0.11/0.43 tff(decl_24, type, lBill_THFTYPE_i: $i).
% 0.11/0.43 tff(decl_25, type, lMary_THFTYPE_i: $i).
% 0.11/0.43 tff(decl_26, type, lSue_THFTYPE_i: $i).
% 0.11/0.43 tff(decl_27, type, lYearFn_THFTYPE_IiiI: $i > $i).
% 0.11/0.43 tff(decl_28, type, likes_THFTYPE_IiioI: ($i * $i) > $o).
% 0.11/0.43 tff(decl_29, type, n2009_THFTYPE_i: $i).
% 0.11/0.43 fof(con, conjecture, ?[X1]:(holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', con)).
% 0.11/0.43 fof(ax, axiom, holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),(likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax)).
% 0.11/0.43 fof(c_0_2, negated_conjecture, ~(?[X1]:(holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i)))), inference(assume_negation,[status(cth)],[con])).
% 0.11/0.43 fof(c_0_3, negated_conjecture, ~(?[X1]:(((~likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false))))), inference(fool_unroll,[status(thm)],[c_0_2])).
% 0.11/0.43 fof(c_0_4, axiom, ((~((likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)))|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&((likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)&likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i))|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false))), inference(fool_unroll,[status(thm)],[ax])).
% 0.11/0.43 fof(c_0_5, negated_conjecture, ![X2]:((((~likes_THFTYPE_IiioI(X2,lBill_THFTYPE_i)|likes_THFTYPE_IiioI(X2,lBill_THFTYPE_i))&(~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|likes_THFTYPE_IiioI(X2,lBill_THFTYPE_i)))&((~likes_THFTYPE_IiioI(X2,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&(~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
% 0.11/0.43 fof(c_0_6, plain, ((~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true))&((likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false))&(likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
% 0.11/0.43 cnf(c_0_7, negated_conjecture, (~likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.11/0.43 cnf(c_0_8, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.11/0.43 cnf(c_0_9, negated_conjecture, (~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.11/0.43 cnf(c_0_10, plain, (holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)|~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.11/0.43 cnf(c_0_11, negated_conjecture, (~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$true)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
% 0.11/0.43 cnf(c_0_12, plain, (~likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|~likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(sr,[status(thm)],[c_0_10, c_0_11])).
% 0.11/0.43 cnf(c_0_13, negated_conjecture, (likes_THFTYPE_IiioI(X1,lBill_THFTYPE_i)|~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_5])).
% 0.11/0.43 cnf(c_0_14, plain, (likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)|holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(split_conjunct,[status(thm)],[c_0_6])).
% 0.11/0.43 cnf(c_0_15, negated_conjecture, (~holdsDuring_THFTYPE_IiooI(lYearFn_THFTYPE_IiiI(n2009_THFTYPE_i),$false)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_13])).
% 0.11/0.43 cnf(c_0_16, plain, (likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)), inference(sr,[status(thm)],[c_0_14, c_0_15])).
% 0.11/0.43 cnf(c_0_17, plain, (likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)), inference(sr,[status(thm)],[c_0_8, c_0_15])).
% 0.11/0.43 cnf(c_0_18, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12, c_0_16])]), c_0_17])]), ['proof']).
% 0.11/0.43 % SZS output end CNFRefutation
% 0.11/0.43 % Parsed axioms : 10
% 0.11/0.43 % Removed by relevancy pruning/SinE : 8
% 0.11/0.43 % Initial clauses : 7
% 0.11/0.43 % Removed in clause preprocessing : 1
% 0.11/0.43 % Initial clauses in saturation : 6
% 0.11/0.43 % Processed clauses : 11
% 0.11/0.43 % ...of these trivial : 0
% 0.11/0.43 % ...subsumed : 0
% 0.11/0.43 % ...remaining for further processing : 10
% 0.11/0.43 % Other redundant clauses eliminated : 0
% 0.11/0.43 % Clauses deleted for lack of memory : 0
% 0.11/0.43 % Backward-subsumed : 3
% 0.11/0.43 % Backward-rewritten : 1
% 0.11/0.43 % Generated clauses : 7
% 0.11/0.43 % ...of the previous two non-redundant : 8
% 0.11/0.43 % ...aggressively subsumed : 0
% 0.11/0.43 % Contextual simplify-reflections : 2
% 0.11/0.43 % Paramodulations : 5
% 0.11/0.43 % Factorizations : 0
% 0.11/0.43 % NegExts : 0
% 0.11/0.43 % Equation resolutions : 0
% 0.11/0.43 % Disequality decompositions : 0
% 0.11/0.43 % Total rewrite steps : 2
% 0.11/0.43 % ...of those cached : 0
% 0.11/0.43 % Propositional unsat checks : 0
% 0.11/0.43 % Propositional check models : 0
% 0.11/0.43 % Propositional check unsatisfiable : 0
% 0.11/0.43 % Propositional clauses : 0
% 0.11/0.43 % Propositional clauses after purity: 0
% 0.11/0.43 % Propositional unsat core size : 0
% 0.11/0.43 % Propositional preprocessing time : 0.000
% 0.11/0.43 % Propositional encoding time : 0.000
% 0.11/0.43 % Propositional solver time : 0.000
% 0.11/0.43 % Success case prop preproc time : 0.000
% 0.11/0.43 % Success case prop encoding time : 0.000
% 0.11/0.43 % Success case prop solver time : 0.000
% 0.11/0.43 % Current number of processed clauses : 4
% 0.11/0.43 % Positive orientable unit clauses : 2
% 0.11/0.43 % Positive unorientable unit clauses: 0
% 0.11/0.43 % Negative unit clauses : 2
% 0.11/0.43 % Non-unit-clauses : 0
% 0.11/0.43 % Current number of unprocessed clauses: 0
% 0.11/0.43 % ...number of literals in the above : 0
% 0.11/0.43 % Current number of archived formulas : 0
% 0.11/0.43 % Current number of archived clauses : 6
% 0.11/0.43 % Clause-clause subsumption calls (NU) : 4
% 0.11/0.43 % Rec. Clause-clause subsumption calls : 3
% 0.11/0.43 % Non-unit clause-clause subsumptions : 2
% 0.11/0.43 % Unit Clause-clause subsumption calls : 3
% 0.11/0.43 % Rewrite failures with RHS unbound : 0
% 0.11/0.43 % BW rewrite match attempts : 1
% 0.11/0.43 % BW rewrite match successes : 1
% 0.11/0.43 % Condensation attempts : 0
% 0.11/0.43 % Condensation successes : 0
% 0.11/0.43 % Termbank termtop insertions : 400
% 0.11/0.43 % Search garbage collected termcells : 34
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.002 s
% 0.11/0.43 % System time : 0.002 s
% 0.11/0.43 % Total time : 0.004 s
% 0.11/0.43 % Maximum resident set size: 3576 pages
% 0.11/0.43
% 0.11/0.43 % -------------------------------------------------
% 0.11/0.43 % User time : 0.004 s
% 0.11/0.43 % System time : 0.006 s
% 0.11/0.43 % Total time : 0.009 s
% 0.11/0.43 % Maximum resident set size: 4608 pages
% 0.11/0.43 % E exiting
%------------------------------------------------------------------------------