%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR129^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 : n026.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:35 AM UTC 2026
% Result : Theorem 0.09s 0.23s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 49 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 182 ( 27 ~; 21 |; 12 &; 122 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 6 ( 0 ^; 3 !; 3 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_26,type,
lBill_THFTYPE_i: $i ).
thf(decl_28,type,
lMary_THFTYPE_i: $i ).
thf(decl_29,type,
lSue_THFTYPE_i: $i ).
thf(decl_30,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_31,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_32,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X1: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.RTA5TdfctF/E---3.1_948944.p',con) ).
thf(ax_007,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.RTA5TdfctF/E---3.1_948944.p',ax_007) ).
thf(c_0_2,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_3,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_007])]) ).
thf(c_0_4,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( ( ~ ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ 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_5,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X3: $i > $i > $o] :
( ( ~ ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X3 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X3 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X3 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X3 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X3 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X3 @ 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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_7,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $i > $o] :
( ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ 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_10,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ),
inference(primitive_enumeration,[status(thm)],[c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ 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_13,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true,
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR129^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.16 % Computer : n026.cluster.edu
% 0.09/0.16 % Model : x86_64 x86_64
% 0.09/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16 % Memory : 8046.5625MB
% 0.09/0.16 % OS : Linux 6.8.0-71-generic
% 0.09/0.16 % CPULimit : 300
% 0.09/0.16 % WCLimit : 300
% 0.09/0.16 % DateTime : Tue Sep 29 17:58:27 UTC 2026
% 0.09/0.16 % CPUTime :
% 0.09/0.16 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 Running higher-order theorem proving
% 0.09/0.21 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.RTA5TdfctF/E---3.1_948944.p
% 0.09/0.23 % Version: 3.5.1-ho
% 0.09/0.23 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23 % Starting sh5l with 300s (1) cores
% 0.09/0.23 % Starting new_ho_9 with 300s (1) cores
% 0.09/0.23 % Starting ho_unfolding_4 with 300s (1) cores
% 0.09/0.23 % new_ho_11 with pid 948957 completed with status 0
% 0.09/0.23 % Result found by new_ho_11
% 0.09/0.23 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.23 % No SInE strategy applied
% 0.09/0.23 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.09/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.23 % Starting new_ho_11 with 151s (1) cores
% 0.09/0.23 % Starting sh5l with 136s (1) cores
% 0.09/0.23 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.23 % Starting new_bool_2 with 136s (1) cores
% 0.09/0.23 % new_bool_1 with pid 948964 completed with status 0
% 0.09/0.23 % Result found by new_bool_1
% 0.09/0.23 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.23 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.23 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.23 % No SInE strategy applied
% 0.09/0.23 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.09/0.23 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.23 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.23 % Starting new_ho_11 with 151s (1) cores
% 0.09/0.23 % Starting sh5l with 136s (1) cores
% 0.09/0.23 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.23 % Preprocessing time : 0.001 s
% 0.09/0.23 % Presaturation interreduction done
% 0.09/0.23
% 0.09/0.23 % Proof found!
% 0.09/0.23 % SZS status Theorem
% 0.09/0.23 % SZS output start CNFRefutation
% See solution above
% 0.09/0.23 % Parsed axioms : 21
% 0.09/0.23 % Removed by relevancy pruning/SinE : 0
% 0.09/0.23 % Initial clauses : 34
% 0.09/0.23 % Removed in clause preprocessing : 14
% 0.09/0.23 % Initial clauses in saturation : 20
% 0.09/0.23 % Processed clauses : 46
% 0.09/0.23 % ...of these trivial : 1
% 0.09/0.23 % ...subsumed : 3
% 0.09/0.23 % ...remaining for further processing : 41
% 0.09/0.23 % Other redundant clauses eliminated : 0
% 0.09/0.23 % Clauses deleted for lack of memory : 0
% 0.09/0.23 % Backward-subsumed : 2
% 0.09/0.23 % Backward-rewritten : 7
% 0.09/0.23 % Generated clauses : 74
% 0.09/0.23 % ...of the previous two non-redundant : 28
% 0.09/0.23 % ...aggressively subsumed : 0
% 0.09/0.23 % Contextual simplify-reflections : 0
% 0.09/0.23 % Paramodulations : 8
% 0.09/0.23 % Factorizations : 0
% 0.09/0.23 % NegExts : 0
% 0.09/0.23 % Equation resolutions : 0
% 0.09/0.23 % Disequality decompositions : 0
% 0.09/0.23 % Total rewrite steps : 9
% 0.09/0.23 % ...of those cached : 7
% 0.09/0.23 % Propositional unsat checks : 0
% 0.09/0.23 % Propositional check models : 0
% 0.09/0.23 % Propositional check unsatisfiable : 0
% 0.09/0.23 % Propositional clauses : 0
% 0.09/0.23 % Propositional clauses after purity: 0
% 0.09/0.23 % Propositional unsat core size : 0
% 0.09/0.23 % Propositional preprocessing time : 0.000
% 0.09/0.23 % Propositional encoding time : 0.000
% 0.09/0.23 % Propositional solver time : 0.000
% 0.09/0.23 % Success case prop preproc time : 0.000
% 0.09/0.23 % Success case prop encoding time : 0.000
% 0.09/0.23 % Success case prop solver time : 0.000
% 0.09/0.23 % Current number of processed clauses : 10
% 0.09/0.23 % Positive orientable unit clauses : 2
% 0.09/0.23 % Positive unorientable unit clauses: 0
% 0.09/0.23 % Negative unit clauses : 1
% 0.09/0.23 % Non-unit-clauses : 7
% 0.09/0.23 % Current number of unprocessed clauses: 22
% 0.09/0.23 % ...number of literals in the above : 46
% 0.09/0.23 % Current number of archived formulas : 0
% 0.09/0.23 % Current number of archived clauses : 31
% 0.09/0.23 % Clause-clause subsumption calls (NU) : 62
% 0.09/0.23 % Rec. Clause-clause subsumption calls : 54
% 0.09/0.23 % Non-unit clause-clause subsumptions : 3
% 0.09/0.23 % Unit Clause-clause subsumption calls : 2
% 0.09/0.23 % Rewrite failures with RHS unbound : 0
% 0.09/0.23 % BW rewrite match attempts : 2
% 0.09/0.23 % BW rewrite match successes : 2
% 0.09/0.23 % Condensation attempts : 0
% 0.09/0.23 % Condensation successes : 0
% 0.09/0.23 % Termbank termtop insertions : 1966
% 0.09/0.23 % Search garbage collected termcells : 89
% 0.09/0.23
% 0.09/0.23 % -------------------------------------------------
% 0.09/0.23 % User time : 0.005 s
% 0.09/0.23 % System time : 0.001 s
% 0.09/0.23 % Total time : 0.006 s
% 0.09/0.23 % Maximum resident set size: 3636 pages
% 0.09/0.23
% 0.09/0.23 % -------------------------------------------------
% 0.09/0.23 % User time : 0.018 s
% 0.09/0.23 % System time : 0.007 s
% 0.09/0.23 % Total time : 0.025 s
% 0.09/0.23 % Maximum resident set size: 4864 pages
% 0.09/0.23 % E exiting
%------------------------------------------------------------------------------