%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR128^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:35 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 96 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 226 ( 30 ~; 28 |; 9 &; 156 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 18 !; 6 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_38,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_50,type,
lBill_THFTYPE_i: $i ).
thf(decl_61,type,
lMary_THFTYPE_i: $i ).
thf(decl_73,type,
lSue_THFTYPE_i: $i ).
thf(decl_84,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_88,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_94,type,
n2009_THFTYPE_i: $i ).
thf(con,conjecture,
? [X44: $i,X7: $i] : ( holdsDuring_THFTYPE_IiooI @ X44 @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 ) ),
file('/export/starexec/sandbox/tmp/tmp.nkm3dc0SpM/E---3.1_674740.p',con) ).
thf(ax_005,axiom,
! [X5: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.nkm3dc0SpM/E---3.1_674740.p',ax_005) ).
thf(ax_035,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.nkm3dc0SpM/E---3.1_674740.p',ax_035) ).
thf(c_0_3,negated_conjecture,
~ ? [X44: $i,X7: $i] : ( holdsDuring_THFTYPE_IiooI @ X44 @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_4,negated_conjecture,
~ ? [X44: $i,X7: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 )
| ( holdsDuring_THFTYPE_IiooI @ X44 @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X7 )
| ( holdsDuring_THFTYPE_IiooI @ X44 @ $false ) ) ),
inference(fool_unroll,[status(thm)],[c_0_3]) ).
thf(c_0_5,axiom,
! [X5: $i] :
( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
=> ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_005]) ).
thf(c_0_6,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_035]) ).
thf(c_0_7,negated_conjecture,
! [X132: $i,X133: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X133 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X133 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X132 @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X133 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X133 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X132 @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X132 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X132 @ $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_8,plain,
! [X134: $i] :
( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X134 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X134 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X134 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X134 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
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_9,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_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_10,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X2 @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i,X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X2 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_18,negated_conjecture,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(ef,[status(thm)],[c_0_16]) ).
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_17,c_0_18])]) ).
thf(c_0_20,plain,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_19]) ).
thf(c_0_22,plain,
! [X1: $i] :
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
inference(sr,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_24,negated_conjecture,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true,
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR128^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n017.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % 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:50:52 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.20/0.26 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.nkm3dc0SpM/E---3.1_674740.p
% 0.20/0.29 % Version: 3.5.1-ho
% 0.20/0.29 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_6 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.29 % full_lambda_9 with pid 674778 completed with status 0
% 0.20/0.29 % Result found by full_lambda_9
% 0.20/0.29 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_6 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.29 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.20/0.29 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.20/0.29 % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.20/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.29 % SubtermCWHack with pid 674782 completed with status 0
% 0.20/0.29 % Result found by SubtermCWHack
% 0.20/0.29 % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_6 with 300s (1) cores
% 0.20/0.29 % Starting full_lambda_9 with 300s (1) cores
% 0.20/0.29 % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.20/0.29 % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.20/0.29 % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.20/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.29 % Preprocessing time : 0.003 s
% 0.20/0.29
% 0.20/0.29 % Proof found!
% 0.20/0.29 % SZS status Theorem
% 0.20/0.29 % SZS output start CNFRefutation
% See solution above
% 0.20/0.29 % Parsed axioms : 280
% 0.20/0.29 % Removed by relevancy pruning/SinE : 163
% 0.20/0.29 % Initial clauses : 135
% 0.20/0.29 % Removed in clause preprocessing : 6
% 0.20/0.29 % Initial clauses in saturation : 129
% 0.20/0.29 % Processed clauses : 133
% 0.20/0.29 % ...of these trivial : 14
% 0.20/0.29 % ...subsumed : 3
% 0.20/0.29 % ...remaining for further processing : 116
% 0.20/0.29 % Other redundant clauses eliminated : 0
% 0.20/0.29 % Clauses deleted for lack of memory : 0
% 0.20/0.29 % Backward-subsumed : 4
% 0.20/0.29 % Backward-rewritten : 3
% 0.20/0.29 % Generated clauses : 35
% 0.20/0.29 % ...of the previous two non-redundant : 32
% 0.20/0.29 % ...aggressively subsumed : 0
% 0.20/0.29 % Contextual simplify-reflections : 0
% 0.20/0.29 % Paramodulations : 33
% 0.20/0.29 % Factorizations : 2
% 0.20/0.29 % NegExts : 0
% 0.20/0.29 % Equation resolutions : 0
% 0.20/0.29 % Disequality decompositions : 0
% 0.20/0.29 % Total rewrite steps : 20
% 0.20/0.29 % ...of those cached : 12
% 0.20/0.29 % Propositional unsat checks : 0
% 0.20/0.29 % Propositional check models : 0
% 0.20/0.29 % Propositional check unsatisfiable : 0
% 0.20/0.29 % Propositional clauses : 0
% 0.20/0.29 % Propositional clauses after purity: 0
% 0.20/0.29 % Propositional unsat core size : 0
% 0.20/0.29 % Propositional preprocessing time : 0.000
% 0.20/0.29 % Propositional encoding time : 0.000
% 0.20/0.29 % Propositional solver time : 0.000
% 0.20/0.29 % Success case prop preproc time : 0.000
% 0.20/0.29 % Success case prop encoding time : 0.000
% 0.20/0.29 % Success case prop solver time : 0.000
% 0.20/0.29 % Current number of processed clauses : 109
% 0.20/0.29 % Positive orientable unit clauses : 100
% 0.20/0.29 % Positive unorientable unit clauses: 0
% 0.20/0.29 % Negative unit clauses : 2
% 0.20/0.29 % Non-unit-clauses : 7
% 0.20/0.29 % Current number of unprocessed clauses: 27
% 0.20/0.29 % ...number of literals in the above : 84
% 0.20/0.29 % Current number of archived formulas : 0
% 0.20/0.29 % Current number of archived clauses : 7
% 0.20/0.29 % Clause-clause subsumption calls (NU) : 39
% 0.20/0.29 % Rec. Clause-clause subsumption calls : 35
% 0.20/0.29 % Non-unit clause-clause subsumptions : 3
% 0.20/0.29 % Unit Clause-clause subsumption calls : 49
% 0.20/0.29 % Rewrite failures with RHS unbound : 0
% 0.20/0.29 % BW rewrite match attempts : 3
% 0.20/0.29 % BW rewrite match successes : 3
% 0.20/0.29 % Condensation attempts : 0
% 0.20/0.29 % Condensation successes : 0
% 0.20/0.29 % Termbank termtop insertions : 7458
% 0.20/0.29 % Search garbage collected termcells : 1396
% 0.20/0.29
% 0.20/0.29 % -------------------------------------------------
% 0.20/0.29 % User time : 0.015 s
% 0.20/0.29 % System time : 0.001 s
% 0.20/0.29 % Total time : 0.015 s
% 0.20/0.29 % Maximum resident set size: 4100 pages
% 0.20/0.29
% 0.20/0.29 % -------------------------------------------------
% 0.20/0.29 % User time : 0.016 s
% 0.20/0.29 % System time : 0.005 s
% 0.20/0.29 % Total time : 0.021 s
% 0.20/0.29 % Maximum resident set size: 5120 pages
% 0.20/0.29 % E exiting
%------------------------------------------------------------------------------