%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR152^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 : n007.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:42 AM UTC 2026
% Result : Theorem 0.06s 0.26s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 81 ( 6 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 164 ( 26 ~; 22 |; 9 &; 104 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 7 con; 0-2 aty)
% Number of variables : 6 ( 0 ^; 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
knows_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_24,type,
lBill_THFTYPE_i: $i ).
thf(decl_25,type,
lChris_THFTYPE_i: $i ).
thf(decl_26,type,
lMary_THFTYPE_i: $i ).
thf(decl_27,type,
lSue_THFTYPE_i: $i ).
thf(decl_28,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_29,type,
esk1_0: $i ).
thf(con,conjecture,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.BxdgJLE8lS/E---3.1_3721184.p',con) ).
thf(ax,axiom,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( lChris_THFTYPE_i = lChris_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.BxdgJLE8lS/E---3.1_3721184.p',ax) ).
thf(ax_002,axiom,
( knows_THFTYPE_IiooI @ lChris_THFTYPE_i
@ ! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.BxdgJLE8lS/E---3.1_3721184.p',ax_002) ).
thf(ax_001,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.BxdgJLE8lS/E---3.1_3721184.p',ax_001) ).
thf(c_0_4,negated_conjecture,
~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_5,axiom,
( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax]) ).
thf(c_0_6,negated_conjecture,
~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( ( lChris_THFTYPE_i != lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,axiom,
( ( ~ ! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_002]) ).
thf(c_0_9,negated_conjecture,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
thf(c_0_10,plain,
( ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true )
| ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X3: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ esk1_0 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ esk1_0 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X3 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X3 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).
thf(c_0_12,negated_conjecture,
( ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,plain,
knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true,
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_15,negated_conjecture,
~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ ~ $true ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_16,negated_conjecture,
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( knows_THFTYPE_IiooI @ lChris_THFTYPE_i @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_17,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_001]) ).
thf(c_0_19,negated_conjecture,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_13])]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR152^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.06/0.18 % Computer : n007.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 17:55:56 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.23 Running higher-order theorem proving
% 0.06/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.BxdgJLE8lS/E---3.1_3721184.p
% 0.06/0.26 % Version: 3.5.1-ho
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.06/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.06/0.26 % Starting ho_unfolding_6 with 300s (1) cores
% 0.06/0.26 % Starting sh4l with 300s (1) cores
% 0.06/0.26 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.06/0.26 % new_ho_10 with pid 3721213 completed with status 0
% 0.06/0.26 % Result found by new_ho_10
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.06/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.06/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.26 % No SInE strategy applied
% 0.06/0.26 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.06/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.06/0.26 % Starting new_ho_10 with 901s (1) cores
% 0.06/0.26 % Starting sh5l with 151s (1) cores
% 0.06/0.26 % Starting new_bool_1 with 151s (1) cores
% 0.06/0.26 % Starting new_bool_9 with 146s (1) cores
% 0.06/0.26 % SubtermCWHack with pid 3721217 completed with status 0
% 0.06/0.26 % Result found by SubtermCWHack
% 0.06/0.26 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.06/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.06/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.26 % No SInE strategy applied
% 0.06/0.26 % Search class: HGHNF-FFSS00-SFFFFFNN
% 0.06/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.06/0.26 % Preprocessing time : 0.001 s
% 0.06/0.26
% 0.06/0.26 % Proof found!
% 0.06/0.26 % SZS status Theorem
% 0.06/0.26 % SZS output start CNFRefutation
% See solution above
% 0.06/0.26 % Parsed axioms : 11
% 0.06/0.26 % Removed by relevancy pruning/SinE : 0
% 0.06/0.26 % Initial clauses : 17
% 0.06/0.26 % Removed in clause preprocessing : 9
% 0.06/0.26 % Initial clauses in saturation : 8
% 0.06/0.26 % Processed clauses : 8
% 0.27/0.26 % ...of these trivial : 2
% 0.27/0.26 % ...subsumed : 0
% 0.27/0.26 % ...remaining for further processing : 6
% 0.27/0.26 % Other redundant clauses eliminated : 0
% 0.27/0.26 % Clauses deleted for lack of memory : 0
% 0.27/0.26 % Backward-subsumed : 1
% 0.27/0.26 % Backward-rewritten : 0
% 0.27/0.26 % Generated clauses : 1
% 0.27/0.26 % ...of the previous two non-redundant : 0
% 0.27/0.26 % ...aggressively subsumed : 0
% 0.27/0.26 % Contextual simplify-reflections : 0
% 0.27/0.26 % Paramodulations : 1
% 0.27/0.26 % Factorizations : 0
% 0.27/0.26 % NegExts : 0
% 0.27/0.26 % Equation resolutions : 0
% 0.27/0.26 % Disequality decompositions : 0
% 0.27/0.26 % Total rewrite steps : 4
% 0.27/0.26 % ...of those cached : 3
% 0.27/0.26 % Propositional unsat checks : 0
% 0.27/0.26 % Propositional check models : 0
% 0.27/0.26 % Propositional check unsatisfiable : 0
% 0.27/0.26 % Propositional clauses : 0
% 0.27/0.26 % Propositional clauses after purity: 0
% 0.27/0.26 % Propositional unsat core size : 0
% 0.27/0.26 % Propositional preprocessing time : 0.000
% 0.27/0.26 % Propositional encoding time : 0.000
% 0.27/0.26 % Propositional solver time : 0.000
% 0.27/0.26 % Success case prop preproc time : 0.000
% 0.27/0.26 % Success case prop encoding time : 0.000
% 0.27/0.26 % Success case prop solver time : 0.000
% 0.27/0.26 % Current number of processed clauses : 5
% 0.27/0.26 % Positive orientable unit clauses : 2
% 0.27/0.26 % Positive unorientable unit clauses: 0
% 0.27/0.26 % Negative unit clauses : 2
% 0.27/0.26 % Non-unit-clauses : 1
% 0.27/0.26 % Current number of unprocessed clauses: 0
% 0.27/0.26 % ...number of literals in the above : 0
% 0.27/0.26 % Current number of archived formulas : 0
% 0.27/0.26 % Current number of archived clauses : 1
% 0.27/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.26 % Non-unit clause-clause subsumptions : 0
% 0.27/0.26 % Unit Clause-clause subsumption calls : 1
% 0.27/0.26 % Rewrite failures with RHS unbound : 0
% 0.27/0.26 % BW rewrite match attempts : 0
% 0.27/0.26 % BW rewrite match successes : 0
% 0.27/0.26 % Condensation attempts : 0
% 0.27/0.26 % Condensation successes : 0
% 0.27/0.26 % Termbank termtop insertions : 620
% 0.27/0.26 % Search garbage collected termcells : 64
% 0.27/0.26
% 0.27/0.26 % -------------------------------------------------
% 0.27/0.26 % User time : 0.003 s
% 0.27/0.26 % System time : 0.002 s
% 0.27/0.26 % Total time : 0.006 s
% 0.27/0.26 % Maximum resident set size: 3628 pages
% 0.27/0.26
% 0.27/0.26 % -------------------------------------------------
% 0.27/0.26 % User time : 0.007 s
% 0.27/0.26 % System time : 0.011 s
% 0.27/0.26 % Total time : 0.018 s
% 0.27/0.26 % Maximum resident set size: 4864 pages
% 0.27/0.26 % E exiting
%------------------------------------------------------------------------------