%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR138^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 : n020.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.07s 0.27s
% Output : CNFRefutation 0.07s
% 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_23,type,
lAnna_THFTYPE_i: $i ).
thf(decl_25,type,
lBill_THFTYPE_i: $i ).
thf(decl_28,type,
lSue_THFTYPE_i: $i ).
thf(decl_29,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_30,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_31,type,
esk1_0: $i ).
thf(decl_32,type,
esk2_0: $i ).
thf(decl_33,type,
esk3_0: $i ).
thf(decl_34,type,
esk4_0: $i ).
thf(con,conjecture,
? [X3: $i > $i > $o,X4: $i > $i > $o,X2: $i] :
( ( X4 @ X2 @ lBill_THFTYPE_i )
& ( X3 @ X2 @ lAnna_THFTYPE_i )
& ( X4
!= ( ^ [X5: $i,X6: $i] : $true ) )
& ( X3
!= ( ^ [X5: $i,X6: $i] : $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iblB1BzFk9/E---3.1_1390448.p',con) ).
thf(ax_003,axiom,
? [X1: $i,X2: $i] :
~ ( likes_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.iblB1BzFk9/E---3.1_1390448.p',ax_003) ).
thf(ax,axiom,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.iblB1BzFk9/E---3.1_1390448.p',ax) ).
thf(ax_002,axiom,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
file('/export/starexec/sandbox2/tmp/tmp.iblB1BzFk9/E---3.1_1390448.p',ax_002) ).
thf(ax_007,axiom,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.iblB1BzFk9/E---3.1_1390448.p',ax_007) ).
thf(c_0_5,negated_conjecture,
~ ? [X3: $i > $i > $o,X4: $i > $i > $o,X2: $i] :
( ( X4 @ X2 @ lBill_THFTYPE_i )
& ( X3 @ X2 @ lAnna_THFTYPE_i )
& ( X4
!= ( ^ [X5: $i,X6: $i] : $true ) )
& ( X3
!= ( ^ [X5: $i,X6: $i] : $true ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_6,negated_conjecture,
~ ? [X3: $i > $i > $o,X4: $i > $i > $o,X2: $i] :
( ( X4 @ X2 @ lBill_THFTYPE_i )
& ( X3 @ X2 @ lAnna_THFTYPE_i )
& ~ ! [X14: $i,X15: $i] :
( ( X4 @ X14 @ X15 )
<=> $true )
& ~ ! [X16: $i,X17: $i] :
( ( X3 @ X16 @ X17 )
<=> $true ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5])]) ).
thf(c_0_7,negated_conjecture,
! [X22: $i > $i > $o,X23: $i > $i > $o,X24: $i,X25: $i,X26: $i,X27: $i,X28: $i] :
( ( ~ ( X22 @ X27 @ X28 )
| $true
| ~ ( X23 @ X25 @ X26 )
| $true
| ~ ( X23 @ X24 @ lBill_THFTYPE_i )
| ~ ( X22 @ X24 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X22 @ X27 @ X28 )
| ~ ( X23 @ X25 @ X26 )
| $true
| ~ ( X23 @ X24 @ lBill_THFTYPE_i )
| ~ ( X22 @ X24 @ lAnna_THFTYPE_i ) )
& ( ~ ( X22 @ X27 @ X28 )
| $true
| ~ $true
| ( X23 @ X25 @ X26 )
| ~ ( X23 @ X24 @ lBill_THFTYPE_i )
| ~ ( X22 @ X24 @ lAnna_THFTYPE_i ) )
& ( ~ $true
| ( X22 @ X27 @ X28 )
| ~ $true
| ( X23 @ X25 @ X26 )
| ~ ( X23 @ X24 @ lBill_THFTYPE_i )
| ~ ( X22 @ X24 @ 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,X5: $i,X4: $i > $i > $o,X3: $i > $i > $o,X6: $i,X7: $i] :
( ( X3 @ X1 @ X2 )
| ( X4 @ X5 @ X6 )
| ~ $true
| ~ $true
| ~ ( X4 @ X7 @ lBill_THFTYPE_i )
| ~ ( X3 @ X7 @ 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_003]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X4: $i > $i > $o,X3: $i > $i > $o,X6: $i,X7: $i] :
( ( X4 @ X5 @ X6 )
| ( X3 @ X1 @ X2 )
| ~ ( X4 @ X7 @ lBill_THFTYPE_i )
| ~ ( X3 @ X7 @ 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]) ).
thf(c_0_12,plain,
? [X1: $i,X2: $i] :
~ ( parent_THFTYPE_IiioI @ X1 @ X2 ),
inference(fof_simplification,[status(thm)],[ax_002]) ).
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,X6: $i,X5: $i,X3: $i > $i > $o] :
( ( likes_THFTYPE_IiioI @ X1 @ X2 )
| ( X3 @ X5 @ X6 )
| ~ ( X3 @ 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_007]) ).
thf(c_0_16,plain,
~ ( parent_THFTYPE_IiioI @ esk1_0 @ esk2_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,X5: $i,X6: $i] :
( ( parent_THFTYPE_IiioI @ X1 @ X2 )
| ( likes_THFTYPE_IiioI @ X5 @ X6 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_19,plain,
~ ( parent_THFTYPE_IiioI @ esk1_0 @ esk2_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^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.07/0.18 % Computer : n020.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 17:57:04 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.25 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.iblB1BzFk9/E---3.1_1390448.p
% 0.07/0.27 % Version: 3.5.1-ho
% 0.07/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.07/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.27 % Starting new_ho_3 with 300s (1) cores
% 0.07/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.27 % post_as_ho12 with pid 1390462 completed with status 0
% 0.07/0.27 % Result found by post_as_ho12
% 0.07/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.07/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.27 % No SInE strategy applied
% 0.07/0.27 % Search class: HGUNF-FFSM00-SSSFFSBN
% 0.07/0.27 % partial match(1): HGUNF-FFSF00-SSSFFSBN
% 0.07/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.27 % SubtermCWHack with pid 1390466 completed with status 0
% 0.07/0.27 % Result found by SubtermCWHack
% 0.07/0.27 % Preprocessing class: HSMSSMSSSSSNSSA.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting post_as_ho1 with 1500s (5) cores
% 0.07/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.27 % No SInE strategy applied
% 0.07/0.27 % Search class: HGUNF-FFSM00-SSSFFSBN
% 0.07/0.27 % partial match(1): HGUNF-FFSF00-SSSFFSBN
% 0.07/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.27 % Preprocessing time : 0.001 s
% 0.07/0.27
% 0.07/0.27 % Proof found!
% 0.07/0.27 % SZS status Theorem
% 0.07/0.27 % SZS output start CNFRefutation
% See solution above
% 0.07/0.27 % Parsed axioms : 19
% 0.07/0.27 % Removed by relevancy pruning/SinE : 0
% 0.07/0.27 % Initial clauses : 22
% 0.07/0.27 % Removed in clause preprocessing : 12
% 0.07/0.27 % Initial clauses in saturation : 10
% 0.07/0.27 % Processed clauses : 13
% 0.07/0.27 % ...of these trivial : 0
% 0.07/0.27 % ...subsumed : 0
% 0.07/0.27 % ...remaining for further processing : 13
% 0.07/0.27 % Other redundant clauses eliminated : 0
% 0.07/0.27 % Clauses deleted for lack of memory : 0
% 0.07/0.27 % Backward-subsumed : 1
% 0.07/0.27 % Backward-rewritten : 5
% 0.07/0.27 % Generated clauses : 10
% 0.07/0.27 % ...of the previous two non-redundant : 8
% 0.07/0.27 % ...aggressively subsumed : 0
% 0.07/0.27 % Contextual simplify-reflections : 0
% 0.07/0.27 % Paramodulations : 10
% 0.07/0.27 % Factorizations : 0
% 0.07/0.27 % NegExts : 0
% 0.07/0.27 % Equation resolutions : 0
% 0.07/0.27 % Disequality decompositions : 0
% 0.07/0.27 % Total rewrite steps : 5
% 0.07/0.27 % ...of those cached : 0
% 0.07/0.27 % Propositional unsat checks : 0
% 0.07/0.27 % Propositional check models : 0
% 0.07/0.27 % Propositional check unsatisfiable : 0
% 0.07/0.27 % Propositional clauses : 0
% 0.07/0.27 % Propositional clauses after purity: 0
% 0.07/0.27 % Propositional unsat core size : 0
% 0.07/0.27 % Propositional preprocessing time : 0.000
% 0.07/0.27 % Propositional encoding time : 0.000
% 0.07/0.27 % Propositional solver time : 0.000
% 0.07/0.27 % Success case prop preproc time : 0.000
% 0.07/0.27 % Success case prop encoding time : 0.000
% 0.07/0.27 % Success case prop solver time : 0.000
% 0.07/0.27 % Current number of processed clauses : 7
% 0.07/0.27 % Positive orientable unit clauses : 4
% 0.07/0.27 % Positive unorientable unit clauses: 0
% 0.07/0.27 % Negative unit clauses : 1
% 0.07/0.27 % Non-unit-clauses : 2
% 0.07/0.27 % Current number of unprocessed clauses: 5
% 0.07/0.27 % ...number of literals in the above : 17
% 0.07/0.27 % Current number of archived formulas : 0
% 0.07/0.27 % Current number of archived clauses : 6
% 0.07/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.27 % Non-unit clause-clause subsumptions : 0
% 0.07/0.27 % Unit Clause-clause subsumption calls : 1
% 0.07/0.27 % Rewrite failures with RHS unbound : 0
% 0.07/0.27 % BW rewrite match attempts : 6
% 0.07/0.27 % BW rewrite match successes : 6
% 0.07/0.27 % Condensation attempts : 0
% 0.07/0.27 % Condensation successes : 0
% 0.07/0.27 % Termbank termtop insertions : 1041
% 0.07/0.27 % Search garbage collected termcells : 178
% 0.07/0.27
% 0.07/0.27 % -------------------------------------------------
% 0.07/0.27 % User time : 0.004 s
% 0.07/0.27 % System time : 0.002 s
% 0.07/0.27 % Total time : 0.007 s
% 0.07/0.27 % Maximum resident set size: 3588 pages
% 0.07/0.27
% 0.07/0.27 % -------------------------------------------------
% 0.07/0.27 % User time : 0.006 s
% 0.07/0.27 % System time : 0.006 s
% 0.07/0.27 % Total time : 0.013 s
% 0.07/0.27 % Maximum resident set size: 4608 pages
% 0.07/0.27 % E exiting
%------------------------------------------------------------------------------