%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR134^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 : n013.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.09s 0.26s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 27 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 0 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 278 ( 39 ~; 32 |; 16 &; 191 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 23 ( 0 ^; 14 !; 9 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_24,type,
lAnna_THFTYPE_i: $i ).
thf(decl_26,type,
lBill_THFTYPE_i: $i ).
thf(decl_27,type,
lBob_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(decl_33,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(con,conjecture,
? [X1: $i > $i > $o,X2: $i,X3: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ X2 @ lAnna_THFTYPE_i )
& ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.C9XufKYvqJ/E---3.1_2442467.p',con) ).
thf(ax_004,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.C9XufKYvqJ/E---3.1_2442467.p',ax_004) ).
thf(ax_007,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.C9XufKYvqJ/E---3.1_2442467.p',ax_007) ).
thf(ax_002,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.C9XufKYvqJ/E---3.1_2442467.p',ax_002) ).
thf(c_0_4,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i,X3: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X1 @ X2 @ lAnna_THFTYPE_i )
& ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_5,negated_conjecture,
~ ? [X1: $i > $i > $o,X2: $i,X3: $i] :
( ( ~ ( ( X1 @ X2 @ lAnna_THFTYPE_i )
& ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X1 @ X2 @ lAnna_THFTYPE_i )
& ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[c_0_4]) ).
thf(c_0_6,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_004]) ).
thf(c_0_7,negated_conjecture,
! [X7: $i > $i > $o,X8: $i,X9: $i] :
( ( ~ ( X7 @ X8 @ lAnna_THFTYPE_i )
| ( X7 @ X9 @ lAnna_THFTYPE_i )
| ( X7 @ X8 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X7 @ X8 @ lAnna_THFTYPE_i ) )
& ( ~ ( X7 @ X8 @ lAnna_THFTYPE_i )
| ( X7 @ X9 @ lAnna_THFTYPE_i )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X7 @ X9 @ lAnna_THFTYPE_i ) )
& ( ~ ( X7 @ X8 @ lAnna_THFTYPE_i )
| ( X7 @ X9 @ lAnna_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_5])])])]) ).
thf(c_0_8,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i > $i > $o,X2: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( X1 @ X2 @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i > $i > $o,X2: $i] :
( ( X1 @ X2 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
( ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,axiom,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_007]) ).
thf(c_0_14,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_15,plain,
likes_THFTYPE_IiioI @ lBob_THFTYPE_i @ lBill_THFTYPE_i,
inference(sr,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,plain,
( ( ~ ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_002])]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i > $i > $o,X3: $i,X2: $i] :
( ( X1 @ X3 @ lAnna_THFTYPE_i )
| ~ ( X1 @ X2 @ lAnna_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_19,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
thf(c_0_20,plain,
( ( parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,plain,
( ( ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i > $i > $o,X2: $i,X3: $i] :
( ( X1 @ X2 @ lAnna_THFTYPE_i )
| ~ ( X1 @ X3 @ lAnna_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
thf(c_0_23,plain,
parent_THFTYPE_IiioI @ lSue_THFTYPE_i @ lAnna_THFTYPE_i,
inference(sr,[status(thm)],[c_0_20,c_0_12]) ).
thf(c_0_24,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( parent_THFTYPE_IiioI @ lBob_THFTYPE_i @ lAnna_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X2: $i] : ( parent_THFTYPE_IiioI @ X2 @ lAnna_THFTYPE_i ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR134^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.09/0.18 % Computer : n013.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 17:55:21 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running higher-order theorem proving
% 0.09/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.C9XufKYvqJ/E---3.1_2442467.p
% 0.09/0.26 % Version: 3.5.1-ho
% 0.09/0.26 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.26 % Starting sh5l with 300s (1) cores
% 0.09/0.26 % Starting new_ho_9 with 300s (1) cores
% 0.09/0.26 % Starting ho_unfolding_4 with 300s (1) cores
% 0.09/0.26 % new_ho_9 with pid 2442482 completed with status 0
% 0.09/0.26 % Result found by new_ho_9
% 0.09/0.26 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.26 % Starting sh5l with 300s (1) cores
% 0.09/0.26 % Starting new_ho_9 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % SubtermCWHack with pid 2442484 completed with status 0
% 0.09/0.26 % Result found by SubtermCWHack
% 0.09/0.26 % Preprocessing class: HSMSSMSSSSSNSSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_11 with 1500s (5) cores
% 0.09/0.26 % Starting sh5l with 300s (1) cores
% 0.09/0.26 % Starting new_ho_9 with 300s (1) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGHNF-FFSM11-SSSFFSBN
% 0.09/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.26 % Preprocessing time : 0.001 s
% 0.09/0.26
% 0.09/0.26 % Proof found!
% 0.09/0.26 % SZS status Theorem
% 0.09/0.26 % SZS output start CNFRefutation
% See solution above
% 0.27/0.26 % Parsed axioms : 23
% 0.27/0.26 % Removed by relevancy pruning/SinE : 0
% 0.27/0.26 % Initial clauses : 38
% 0.27/0.26 % Removed in clause preprocessing : 14
% 0.27/0.26 % Initial clauses in saturation : 24
% 0.27/0.26 % Processed clauses : 34
% 0.27/0.26 % ...of these trivial : 1
% 0.27/0.26 % ...subsumed : 0
% 0.27/0.26 % ...remaining for further processing : 33
% 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 : 2
% 0.27/0.26 % Backward-rewritten : 13
% 0.27/0.26 % Generated clauses : 20
% 0.27/0.26 % ...of the previous two non-redundant : 26
% 0.27/0.26 % ...aggressively subsumed : 0
% 0.27/0.26 % Contextual simplify-reflections : 1
% 0.27/0.26 % Paramodulations : 13
% 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 : 13
% 0.27/0.26 % ...of those cached : 2
% 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 : 11
% 0.27/0.26 % Positive orientable unit clauses : 7
% 0.27/0.26 % Positive unorientable unit clauses: 0
% 0.27/0.26 % Negative unit clauses : 1
% 0.27/0.26 % Non-unit-clauses : 3
% 0.27/0.26 % Current number of unprocessed clauses: 16
% 0.27/0.26 % ...number of literals in the above : 26
% 0.27/0.26 % Current number of archived formulas : 0
% 0.27/0.26 % Current number of archived clauses : 22
% 0.27/0.26 % Clause-clause subsumption calls (NU) : 59
% 0.27/0.26 % Rec. Clause-clause subsumption calls : 58
% 0.27/0.26 % Non-unit clause-clause subsumptions : 1
% 0.27/0.26 % Unit Clause-clause subsumption calls : 16
% 0.27/0.26 % Rewrite failures with RHS unbound : 0
% 0.27/0.26 % BW rewrite match attempts : 11
% 0.27/0.26 % BW rewrite match successes : 11
% 0.27/0.26 % Condensation attempts : 0
% 0.27/0.26 % Condensation successes : 0
% 0.27/0.26 % Termbank termtop insertions : 1815
% 0.27/0.26 % Search garbage collected termcells : 120
% 0.27/0.26
% 0.27/0.26 % -------------------------------------------------
% 0.27/0.26 % User time : 0.004 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: 3640 pages
% 0.27/0.26
% 0.27/0.26 % -------------------------------------------------
% 0.27/0.26 % User time : 0.005 s
% 0.27/0.26 % System time : 0.008 s
% 0.27/0.26 % Total time : 0.013 s
% 0.27/0.26 % Maximum resident set size: 4864 pages
% 0.27/0.26 % E exiting
%------------------------------------------------------------------------------