%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR133^2 : 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:37 AM UTC 2026
% Result : Theorem 0.33s 0.28s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 15 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 262 ( 43 ~; 36 |; 20 &; 163 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 28 ( 4 ^; 15 !; 9 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_34,type,
lAnna_THFTYPE_i: $i ).
thf(decl_38,type,
lBill_THFTYPE_i: $i ).
thf(decl_43,type,
lMary_THFTYPE_i: $i ).
thf(decl_47,type,
lSue_THFTYPE_i: $i ).
thf(decl_54,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_55,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_59,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X36: $i > $i > $o,X37: $i > $i > $o,X2: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ER9y5RYR2M/E---3.1_949981.p',con) ).
thf(ax_028,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.ER9y5RYR2M/E---3.1_949981.p',ax_028) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.ER9y5RYR2M/E---3.1_949981.p',ax_003) ).
thf(c_0_3,negated_conjecture,
~ ? [X36: $i > $i > $o,X37: $i > $i > $o,X2: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_4,negated_conjecture,
~ ? [X36: $i > $i > $o,X37: $i > $i > $o,X2: $i] :
( ( ~ ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X37 @ X2 @ lBill_THFTYPE_i )
& ( X36 @ X2 @ lAnna_THFTYPE_i )
& ( X37 != X36 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_3])]) ).
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_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_028])]) ).
thf(c_0_6,negated_conjecture,
! [X143: $i > $i > $o,X144: $i > $i > $o,X145: $i] :
( ( ~ ( X144 @ X145 @ lBill_THFTYPE_i )
| ~ ( X143 @ X145 @ lAnna_THFTYPE_i )
| ( X144 = X143 )
| ( X144 @ X145 @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X144 @ X145 @ lBill_THFTYPE_i ) )
& ( ~ ( X144 @ X145 @ lBill_THFTYPE_i )
| ~ ( X143 @ X145 @ lAnna_THFTYPE_i )
| ( X144 = X143 )
| ( X143 @ X145 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X143 @ X145 @ lAnna_THFTYPE_i ) )
& ( ~ ( X144 @ X145 @ lBill_THFTYPE_i )
| ~ ( X143 @ X145 @ lAnna_THFTYPE_i )
| ( X144 = X143 )
| ( X144 != X143 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X144 != X143 ) )
& ( ~ ( X144 @ X145 @ lBill_THFTYPE_i )
| ~ ( X143 @ X145 @ lAnna_THFTYPE_i )
| ( X144 = X143 )
| ~ ( 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,
( ( ( 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_5]) ).
thf(c_0_8,negated_conjecture,
! [X36: $i > $i > $o,X37: $i > $i > $o] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ( X36 != X37 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,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_7]) ).
thf(c_0_10,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(er,[status(thm)],[c_0_8]) ).
thf(c_0_11,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_7]) ).
thf(c_0_12,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(sr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( 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_003]) ).
thf(c_0_14,negated_conjecture,
! [X37: $i > $i > $o,X36: $i > $i > $o,X1: $i] :
( ( X36 = X37 )
| ~ ( X36 @ X1 @ lBill_THFTYPE_i )
| ~ ( X37 @ X1 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_15,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X37: $i > $i > $o,X36: $i > $i > $o,X1: $i] :
( ( X36 = X37 )
| ~ ( X37 @ X1 @ lAnna_THFTYPE_i )
| ~ ( X36 @ X1 @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_18,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_16]) ).
thf(c_0_19,negated_conjecture,
! [X36: $i > $i > $o,X1: $i] :
( ( X36
= ( ^ [Z0: $i,Z1: $i] : $true ) )
| ~ ( X36 @ X1 @ lBill_THFTYPE_i ) ),
inference(primitive_enumeration,[status(thm)],[c_0_17]) ).
thf(c_0_20,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_18,c_0_10]) ).
thf(c_0_21,negated_conjecture,
( ( ^ [Z0: $i,Z1: $i] : $true )
= likes_THFTYPE_IiioI ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i] : ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(arg_cong,[status(thm)],[c_0_21]) ).
thf(c_0_23,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR133^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 17:58:42 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 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.ER9y5RYR2M/E---3.1_949981.p
% 0.33/0.28 % Version: 3.5.1-ho
% 0.33/0.28 % Preprocessing class: HSLSSMSMSSSNSSA.
% 0.33/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.28 % Starting new_ho_10_unif with 1500s (5) cores
% 0.33/0.28 % Starting sh3l with 300s (1) cores
% 0.33/0.28 % Starting new_ho_6 with 300s (1) cores
% 0.33/0.28 % Starting lpo6_lambda_fix with 300s (1) cores
% 0.33/0.28 % new_ho_10_unif with pid 950015 completed with status 0
% 0.33/0.28 % Result found by new_ho_10_unif
% 0.33/0.28 % Preprocessing class: HSLSSMSMSSSNSSA.
% 0.33/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.28 % Starting new_ho_10_unif with 1500s (5) cores
% 0.33/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.28 % No SInE strategy applied
% 0.33/0.28 % Search class: HGHSF-FFMM11-SSSFFFBN
% 0.33/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.28 % Starting new_ho_10_unif with 151s (1) cores
% 0.33/0.28 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.33/0.28 % Starting sh5l with 136s (1) cores
% 0.33/0.28 % Starting new_bool_3 with 136s (1) cores
% 0.33/0.28 % ehoh_best_sine_rwall with pid 950026 completed with status 0
% 0.33/0.28 % Result found by ehoh_best_sine_rwall
% 0.33/0.28 % Preprocessing class: HSLSSMSMSSSNSSA.
% 0.33/0.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.28 % Starting new_ho_10_unif with 1500s (5) cores
% 0.33/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.33/0.28 % No SInE strategy applied
% 0.33/0.28 % Search class: HGHSF-FFMM11-SSSFFFBN
% 0.33/0.28 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.33/0.28 % Starting SubtermCWHack with 136s (1) cores
% 0.33/0.28 % Starting new_ho_10_unif with 151s (1) cores
% 0.33/0.28 % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.33/0.28 % Preprocessing time : 0.002 s
% 0.33/0.28 % Presaturation interreduction done
% 0.33/0.28
% 0.33/0.28 % Proof found!
% 0.33/0.28 % SZS status Theorem
% 0.33/0.28 % SZS output start CNFRefutation
% See solution above
% 0.33/0.28 % Parsed axioms : 128
% 0.33/0.28 % Removed by relevancy pruning/SinE : 0
% 0.33/0.28 % Initial clauses : 161
% 0.33/0.28 % Removed in clause preprocessing : 56
% 0.33/0.28 % Initial clauses in saturation : 105
% 0.33/0.28 % Processed clauses : 175
% 0.33/0.28 % ...of these trivial : 12
% 0.33/0.28 % ...subsumed : 17
% 0.33/0.28 % ...remaining for further processing : 146
% 0.33/0.28 % Other redundant clauses eliminated : 5
% 0.33/0.28 % Clauses deleted for lack of memory : 0
% 0.33/0.28 % Backward-subsumed : 1
% 0.33/0.28 % Backward-rewritten : 12
% 0.33/0.28 % Generated clauses : 50
% 0.33/0.28 % ...of the previous two non-redundant : 37
% 0.33/0.28 % ...aggressively subsumed : 0
% 0.33/0.28 % Contextual simplify-reflections : 0
% 0.33/0.28 % Paramodulations : 13
% 0.33/0.28 % Factorizations : 0
% 0.33/0.28 % NegExts : 0
% 0.33/0.28 % Equation resolutions : 5
% 0.33/0.28 % Disequality decompositions : 0
% 0.33/0.28 % Total rewrite steps : 25
% 0.33/0.28 % ...of those cached : 12
% 0.33/0.28 % Propositional unsat checks : 0
% 0.33/0.28 % Propositional check models : 0
% 0.33/0.28 % Propositional check unsatisfiable : 0
% 0.33/0.28 % Propositional clauses : 0
% 0.33/0.28 % Propositional clauses after purity: 0
% 0.33/0.28 % Propositional unsat core size : 0
% 0.33/0.28 % Propositional preprocessing time : 0.000
% 0.33/0.28 % Propositional encoding time : 0.000
% 0.33/0.28 % Propositional solver time : 0.000
% 0.33/0.28 % Success case prop preproc time : 0.000
% 0.33/0.28 % Success case prop encoding time : 0.000
% 0.33/0.28 % Success case prop solver time : 0.000
% 0.33/0.28 % Current number of processed clauses : 62
% 0.33/0.28 % Positive orientable unit clauses : 48
% 0.33/0.28 % Positive unorientable unit clauses: 0
% 0.33/0.28 % Negative unit clauses : 3
% 0.33/0.28 % Non-unit-clauses : 11
% 0.33/0.28 % Current number of unprocessed clauses: 35
% 0.33/0.28 % ...number of literals in the above : 89
% 0.33/0.28 % Current number of archived formulas : 0
% 0.33/0.28 % Current number of archived clauses : 83
% 0.33/0.28 % Clause-clause subsumption calls (NU) : 231
% 0.33/0.28 % Rec. Clause-clause subsumption calls : 167
% 0.33/0.28 % Non-unit clause-clause subsumptions : 13
% 0.33/0.28 % Unit Clause-clause subsumption calls : 11
% 0.33/0.28 % Rewrite failures with RHS unbound : 0
% 0.33/0.28 % BW rewrite match attempts : 8
% 0.33/0.28 % BW rewrite match successes : 6
% 0.33/0.28 % Condensation attempts : 0
% 0.33/0.28 % Condensation successes : 0
% 0.33/0.28 % Termbank termtop insertions : 7842
% 0.33/0.28 % Search garbage collected termcells : 810
% 0.33/0.28
% 0.33/0.28 % -------------------------------------------------
% 0.33/0.28 % User time : 0.010 s
% 0.33/0.28 % System time : 0.005 s
% 0.33/0.28 % Total time : 0.015 s
% 0.33/0.28 % Maximum resident set size: 3944 pages
% 0.33/0.28
% 0.33/0.28 % -------------------------------------------------
% 0.33/0.28 % User time : 0.042 s
% 0.33/0.28 % System time : 0.015 s
% 0.33/0.28 % Total time : 0.057 s
% 0.33/0.28 % Maximum resident set size: 4864 pages
% 0.33/0.28 % E exiting
%------------------------------------------------------------------------------