%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR138^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 : n009.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:38 AM UTC 2026
% Result : Theorem 0.22s 0.32s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 4 equ; 0 cnn)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 184 ( 39 ~; 31 |; 12 &; 100 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 9 usr; 9 con; 0-2 aty)
% Number of variables : 61 ( 8 ^; 36 !; 17 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_58,type,
lAnna_THFTYPE_i: $i ).
thf(decl_63,type,
lBill_THFTYPE_i: $i ).
thf(decl_95,type,
lSue_THFTYPE_i: $i ).
thf(decl_105,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_114,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_139,type,
esk3_0: $i ).
thf(decl_140,type,
esk4_0: $i ).
thf(decl_142,type,
esk6_0: $i ).
thf(decl_143,type,
esk7_0: $i ).
thf(con,conjecture,
? [X60: $i > $i > $o,X61: $i > $i > $o,X2: $i] :
( ( X61 @ X2 @ lBill_THFTYPE_i )
& ( X60 @ X2 @ lAnna_THFTYPE_i )
& ( X61
!= ( ^ [X3: $i,X62: $i] : $true ) )
& ( X60
!= ( ^ [X3: $i,X62: $i] : $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SoUrnJAui5/E---3.1_142930.p',con) ).
thf(ax_005,axiom,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.SoUrnJAui5/E---3.1_142930.p',ax_005) ).
thf(ax_072,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.SoUrnJAui5/E---3.1_142930.p',ax_072) ).
thf(ax_027,axiom,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.SoUrnJAui5/E---3.1_142930.p',ax_027) ).
thf(ax_050,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.SoUrnJAui5/E---3.1_142930.p',ax_050) ).
thf(c_0_5,negated_conjecture,
~ ? [X60: $i > $i > $o,X61: $i > $i > $o,X2: $i] :
( ( X61 @ X2 @ lBill_THFTYPE_i )
& ( X60 @ X2 @ lAnna_THFTYPE_i )
& ( X61
!= ( ^ [X3: $i,X62: $i] : $true ) )
& ( X60
!= ( ^ [X3: $i,X62: $i] : $true ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_6,negated_conjecture,
~ ? [X60: $i > $i > $o,X61: $i > $i > $o,X2: $i] :
( ( X61 @ X2 @ lBill_THFTYPE_i )
& ( X60 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X225: $i,X226: $i] :
( ( X61 @ X225 @ X226 )
<=> $true )
& ~ ! [X227: $i,X228: $i] :
( ( X60 @ X227 @ X228 )
<=> $true ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])]) ).
thf(c_0_7,negated_conjecture,
! [X395: $i > $i > $o,X396: $i > $i > $o,X397: $i,X398: $i,X399: $i,X400: $i,X401: $i] :
( ( ~ ( X395 @ X400 @ X401 )
| $true
| ~ ( X396 @ X398 @ X399 )
| $true
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X395 @ X400 @ X401 )
| ~ ( X396 @ X398 @ X399 )
| $true
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ ( X395 @ X400 @ X401 )
| $true
| ~ $true
| ( X396 @ X398 @ X399 )
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X395 @ X400 @ X401 )
| ~ $true
| ( X396 @ X398 @ X399 )
| ~ ( X396 @ X397 @ lBill_THFTYPE_i )
| ~ ( X395 @ X397 @ lAnna_THFTYPE_i ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X60: $i > $i > $o,X35: $i > $i > $o,X5: $i] :
( ( X35 @ X1 @ X2 )
| ( X60 @ X3 @ X4 )
| ~ $true
| ~ $true
| ~ ( X60 @ X5 @ lBill_THFTYPE_i )
| ~ ( X35 @ X5 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,plain,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_005]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X60: $i > $i > $o,X35: $i > $i > $o,X5: $i] :
( ( X60 @ X3 @ X4 )
| ( X35 @ X1 @ X2 )
| ~ ( X60 @ X5 @ lBill_THFTYPE_i )
| ~ ( X35 @ X5 @ lAnna_THFTYPE_i ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_11,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_072]) ).
thf(c_0_12,plain,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_027]) ).
thf(c_0_13,plain,
~ ( likes_THFTYPE_IiioI @ esk3_0 @ esk4_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i,X35: $i > $i > $o] :
( ( likes_THFTYPE_IiioI @ X1 @ X2 )
| ( X35 @ X3 @ X4 )
| ~ ( X35 @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_050]) ).
thf(c_0_16,plain,
~ ( parent_THFTYPE_IiioI @ esk6_0 @ esk7_0 ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_12])])]) ).
thf(c_0_17,plain,
~ ( likes_THFTYPE_IiioI @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X4: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ( likes_THFTYPE_IiioI @ X3 @ X4 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,plain,
~ ( parent_THFTYPE_IiioI @ esk6_0 @ esk7_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X2: $i] : ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_21,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR138^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n009.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Tue Sep 29 17:56:15 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.22/0.27 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.SoUrnJAui5/E---3.1_142930.p
% 0.22/0.32 % Version: 3.5.1-ho
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.32 % Starting sh7 with 300s (1) cores
% 0.22/0.32 % Starting ho_unfolding_2 with 300s (1) cores
% 0.22/0.32 % Starting new_bool_12 with 300s (1) cores
% 0.22/0.32 % ho_unfolding_2 with pid 142945 completed with status 0
% 0.22/0.32 % Result found by ho_unfolding_2
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.32 % Starting sh7 with 300s (1) cores
% 0.22/0.32 % Starting ho_unfolding_2 with 300s (1) cores
% 0.22/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.32 % No SInE strategy applied
% 0.22/0.32 % Search class: HGHSF-FFMM21-SHSFFFBN
% 0.22/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.32 % SubtermCWHack with pid 142952 completed with status 0
% 0.22/0.32 % Result found by SubtermCWHack
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSSNHSA.
% 0.22/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.32 % Starting sh7 with 300s (1) cores
% 0.22/0.32 % Starting ho_unfolding_2 with 300s (1) cores
% 0.22/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.32 % No SInE strategy applied
% 0.22/0.32 % Search class: HGHSF-FFMM21-SHSFFFBN
% 0.22/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.22/0.32 % Preprocessing time : 0.004 s
% 0.22/0.32
% 0.22/0.32 % Proof found!
% 0.22/0.32 % SZS status Theorem
% 0.22/0.32 % SZS output start CNFRefutation
% See solution above
% 0.22/0.32 % Parsed axioms : 330
% 0.22/0.32 % Removed by relevancy pruning/SinE : 0
% 0.22/0.32 % Initial clauses : 349
% 0.22/0.32 % Removed in clause preprocessing : 128
% 0.22/0.32 % Initial clauses in saturation : 221
% 0.22/0.32 % Processed clauses : 343
% 0.22/0.32 % ...of these trivial : 15
% 0.22/0.32 % ...subsumed : 9
% 0.22/0.32 % ...remaining for further processing : 319
% 0.22/0.32 % Other redundant clauses eliminated : 0
% 0.22/0.32 % Clauses deleted for lack of memory : 0
% 0.22/0.32 % Backward-subsumed : 1
% 0.22/0.32 % Backward-rewritten : 12
% 0.22/0.32 % Generated clauses : 183
% 0.22/0.32 % ...of the previous two non-redundant : 157
% 0.22/0.32 % ...aggressively subsumed : 0
% 0.22/0.32 % Contextual simplify-reflections : 0
% 0.22/0.32 % Paramodulations : 182
% 0.22/0.32 % Factorizations : 0
% 0.22/0.32 % NegExts : 0
% 0.22/0.32 % Equation resolutions : 1
% 0.22/0.32 % Disequality decompositions : 0
% 0.22/0.32 % Total rewrite steps : 38
% 0.22/0.32 % ...of those cached : 7
% 0.22/0.32 % Propositional unsat checks : 0
% 0.22/0.32 % Propositional check models : 0
% 0.22/0.32 % Propositional check unsatisfiable : 0
% 0.22/0.32 % Propositional clauses : 0
% 0.22/0.32 % Propositional clauses after purity: 0
% 0.22/0.32 % Propositional unsat core size : 0
% 0.22/0.32 % Propositional preprocessing time : 0.000
% 0.22/0.32 % Propositional encoding time : 0.000
% 0.22/0.32 % Propositional solver time : 0.000
% 0.22/0.32 % Success case prop preproc time : 0.000
% 0.22/0.32 % Success case prop encoding time : 0.000
% 0.22/0.32 % Success case prop solver time : 0.000
% 0.22/0.32 % Current number of processed clauses : 306
% 0.22/0.32 % Positive orientable unit clauses : 185
% 0.22/0.32 % Positive unorientable unit clauses: 0
% 0.22/0.32 % Negative unit clauses : 4
% 0.22/0.32 % Non-unit-clauses : 117
% 0.22/0.32 % Current number of unprocessed clauses: 34
% 0.22/0.32 % ...number of literals in the above : 130
% 0.22/0.32 % Current number of archived formulas : 0
% 0.22/0.32 % Current number of archived clauses : 13
% 0.22/0.32 % Clause-clause subsumption calls (NU) : 1386
% 0.22/0.32 % Rec. Clause-clause subsumption calls : 1171
% 0.22/0.32 % Non-unit clause-clause subsumptions : 9
% 0.22/0.32 % Unit Clause-clause subsumption calls : 214
% 0.22/0.32 % Rewrite failures with RHS unbound : 0
% 0.22/0.32 % BW rewrite match attempts : 12
% 0.22/0.32 % BW rewrite match successes : 11
% 0.22/0.32 % Condensation attempts : 0
% 0.22/0.32 % Condensation successes : 0
% 0.22/0.32 % Termbank termtop insertions : 16060
% 0.22/0.32 % Search garbage collected termcells : 2183
% 0.22/0.32
% 0.22/0.32 % -------------------------------------------------
% 0.22/0.32 % User time : 0.025 s
% 0.22/0.32 % System time : 0.009 s
% 0.22/0.32 % Total time : 0.033 s
% 0.22/0.32 % Maximum resident set size: 4360 pages
% 0.22/0.32
% 0.22/0.32 % -------------------------------------------------
% 0.22/0.32 % User time : 0.028 s
% 0.22/0.32 % System time : 0.012 s
% 0.22/0.32 % Total time : 0.041 s
% 0.22/0.32 % Maximum resident set size: 5120 pages
% 0.22/0.32 % E exiting
%------------------------------------------------------------------------------