%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR151^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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 : Wed Sep 30 07:46:41 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 17 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 80 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 211 ( 28 ~; 25 |; 16 &; 142 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_24,type,
lBill_THFTYPE_i: $i ).
thf(decl_25,type,
lMary_THFTYPE_i: $i ).
thf(decl_26,type,
lSue_THFTYPE_i: $i ).
thf(decl_27,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_28,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.e7resIWRf8/E---3.1_443931.p',con) ).
thf(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/tmp/tmp.e7resIWRf8/E---3.1_443931.p',ax) ).
thf(c_0_2,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_3,negated_conjecture,
~ ( ( ~ ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[c_0_2]) ).
thf(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]) ).
thf(c_0_5,negated_conjecture,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( 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 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ 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(fof_nnf,[status(thm)],[c_0_3])])]) ).
thf(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])])]) ).
thf(c_0_7,negated_conjecture,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,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]) ).
thf(c_0_12,negated_conjecture,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_13,negated_conjecture,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,negated_conjecture,
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_15,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_13]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR151^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n011.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 17:57:46 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/0.23 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.e7resIWRf8/E---3.1_443931.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % Starting ho_unfolding_6 with 300s (1) cores
% 0.10/0.25 % Starting sh4l with 300s (1) cores
% 0.10/0.25 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.10/0.25 % new_ho_10 with pid 443944 completed with status 0
% 0.10/0.25 % Result found by new_ho_10
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFSF11-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.10/0.25 % Starting new_ho_10 with 901s (1) cores
% 0.10/0.25 % Starting sh5l with 151s (1) cores
% 0.10/0.25 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.10/0.25 % Starting lpo1_def_fix with 146s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 443948 completed with status 0
% 0.10/0.25 % Result found by SubtermCWHack
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.10/0.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting new_ho_10 with 1500s (5) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGHNF-FFSF11-SFFFFFNN
% 0.10/0.25 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.25 % Starting SubtermCWHack with 151s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% See solution above
% 0.10/0.25 % Parsed axioms : 10
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 17
% 0.10/0.25 % Removed in clause preprocessing : 10
% 0.10/0.25 % Initial clauses in saturation : 7
% 0.10/0.25 % Processed clauses : 8
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 0
% 0.10/0.25 % ...remaining for further processing : 7
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 0
% 0.10/0.25 % Backward-rewritten : 3
% 0.10/0.25 % Generated clauses : 0
% 0.10/0.25 % ...of the previous two non-redundant : 1
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 2
% 0.10/0.25 % Paramodulations : 0
% 0.10/0.25 % Factorizations : 0
% 0.10/0.25 % NegExts : 0
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 8
% 0.10/0.25 % ...of those cached : 5
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 4
% 0.10/0.25 % Positive orientable unit clauses : 3
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 1
% 0.10/0.25 % Non-unit-clauses : 0
% 0.10/0.25 % Current number of unprocessed clauses: 0
% 0.10/0.25 % ...number of literals in the above : 0
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 3
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 4
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 4
% 0.10/0.25 % Non-unit clause-clause subsumptions : 2
% 0.10/0.25 % Unit Clause-clause subsumption calls : 0
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 3
% 0.10/0.25 % BW rewrite match successes : 3
% 0.10/0.25 % Condensation attempts : 0
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 592
% 0.10/0.25 % Search garbage collected termcells : 30
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.002 s
% 0.10/0.25 % System time : 0.003 s
% 0.10/0.25 % Total time : 0.005 s
% 0.10/0.25 % Maximum resident set size: 3624 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.009 s
% 0.10/0.25 % System time : 0.010 s
% 0.10/0.25 % Total time : 0.019 s
% 0.10/0.25 % Maximum resident set size: 4864 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------