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