%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO890^16 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 08:44:56 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 78 ( 10 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 159 ( 15 ~; 10 |; 12 &; 114 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 48 ( 26 ^; 18 !; 4 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_23,type,
mrel: mworld > mworld > $o ).
thf(decl_24,type,
mactual: mworld ).
thf(decl_25,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_27,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_29,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_31,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_33,type,
eiw_di: $i > mworld > $o ).
thf(decl_35,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_36,type,
e: $i > mworld > $o ).
thf(decl_37,type,
f: $i > mworld > $o ).
thf(decl_39,type,
esk2_0: $i ).
thf(decl_40,type,
esk3_0: mworld ).
thf(con,conjecture,
( mlocal
@ ( mimplies
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( mand @ ( e @ X7 ) @ ( f @ X7 ) ) ) )
@ ( mbox
@ ( mexists_di
@ ^ [X7: $i] : ( f @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',con) ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',mlocal_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',mand_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X9: $i > mworld > $o,X3: mworld] :
? [X7: $i] :
( ( eiw_di @ X7 @ X3 )
& ( X9 @ X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',mexists_di_def) ).
thf(eiw_di_cumul,axiom,
! [X3: mworld,X5: mworld,X7: $i] :
( ( ( eiw_di @ X7 @ X3 )
& ( mrel @ X3 @ X5 ) )
=> ( eiw_di @ X7 @ X5 ) ),
file('/export/starexec/sandbox2/tmp/tmp.es8K38IaBm/E---3.1_2959543.p',eiw_di_cumul) ).
thf(c_0_7,negated_conjecture,
~ ( mlocal
@ ( mimplies
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( mand @ ( e @ X7 ) @ ( f @ X7 ) ) ) )
@ ( mbox
@ ( mexists_di
@ ^ [X7: $i] : ( f @ X7 ) ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_8,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_9,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_12,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X7: $i] :
( ( eiw_di @ X7 @ Z1 )
& ( Z0 @ X7 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_13,negated_conjecture,
~ ( ? [X20: $i] :
( ( eiw_di @ X20 @ mactual )
& ! [X19: mworld] :
( ( mrel @ mactual @ X19 )
=> ( ( e @ X20 @ X19 )
& ( f @ X20 @ X19 ) ) ) )
=> ! [X22: mworld] :
( ( mrel @ mactual @ X22 )
=> ? [X21: $i] :
( ( eiw_di @ X21 @ X22 )
& ( f @ X21 @ X22 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7]),c_0_8]),c_0_9]),c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X33: mworld,X35: $i] :
( ( eiw_di @ esk2_0 @ mactual )
& ( ( e @ esk2_0 @ X33 )
| ~ ( mrel @ mactual @ X33 ) )
& ( ( f @ esk2_0 @ X33 )
| ~ ( mrel @ mactual @ X33 ) )
& ( mrel @ mactual @ esk3_0 )
& ( ~ ( eiw_di @ X35 @ esk3_0 )
| ~ ( f @ X35 @ esk3_0 ) ) ),
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_13])])])])])]) ).
thf(c_0_15,plain,
! [X29: mworld,X30: mworld,X31: $i] :
( ~ ( eiw_di @ X31 @ X29 )
| ~ ( mrel @ X29 @ X30 )
| ( eiw_di @ X31 @ X30 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[eiw_di_cumul])])]) ).
thf(c_0_16,negated_conjecture,
! [X7: $i] :
( ~ ( eiw_di @ X7 @ esk3_0 )
| ~ ( f @ X7 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X3: mworld] :
( ( f @ esk2_0 @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
mrel @ mactual @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X3: mworld,X7: $i,X5: mworld] :
( ( eiw_di @ X7 @ X5 )
| ~ ( eiw_di @ X7 @ X3 )
| ~ ( mrel @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,negated_conjecture,
~ ( eiw_di @ esk2_0 @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
thf(c_0_21,negated_conjecture,
! [X7: $i] :
( ( eiw_di @ X7 @ esk3_0 )
| ~ ( eiw_di @ X7 @ mactual ) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_22,negated_conjecture,
eiw_di @ esk2_0 @ mactual,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO890^16 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n014.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.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 17:25:44 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.22 Running higher-order theorem proving
% 0.07/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.es8K38IaBm/E---3.1_2959543.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.07/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.26 % almost_fo_3_lam with pid 2959558 completed with status 0
% 0.07/0.26 % Result found by almost_fo_3_lam
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 2959560 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26 % Starting almost_fo_3_lam with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26 % No SInE strategy applied
% 0.07/0.26 % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % Preprocessing time : 0.001 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 31
% 0.07/0.26 % Removed by relevancy pruning/SinE : 0
% 0.07/0.26 % Initial clauses : 25
% 0.07/0.26 % Removed in clause preprocessing : 16
% 0.07/0.26 % Initial clauses in saturation : 9
% 0.07/0.26 % Processed clauses : 10
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 0
% 0.07/0.26 % ...remaining for further processing : 10
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 0
% 0.07/0.26 % Generated clauses : 4
% 0.07/0.26 % ...of the previous two non-redundant : 2
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 4
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 2
% 0.07/0.26 % ...of those cached : 0
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 10
% 0.07/0.26 % Positive orientable unit clauses : 4
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 1
% 0.07/0.26 % Non-unit-clauses : 5
% 0.07/0.26 % Current number of unprocessed clauses: 1
% 0.07/0.26 % ...number of literals in the above : 3
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 0
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.26 % Non-unit clause-clause subsumptions : 0
% 0.07/0.26 % Unit Clause-clause subsumption calls : 1
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 1
% 0.07/0.26 % BW rewrite match successes : 0
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 1361
% 0.07/0.26 % Search garbage collected termcells : 335
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.004 s
% 0.07/0.26 % System time : 0.001 s
% 0.07/0.26 % Total time : 0.005 s
% 0.07/0.26 % Maximum resident set size: 3656 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.005 s
% 0.07/0.26 % System time : 0.006 s
% 0.07/0.26 % Total time : 0.012 s
% 0.07/0.26 % Maximum resident set size: 4864 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------