%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : DAT334^12 : 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 : n005.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:47:36 AM UTC 2026
% Result : Theorem 0.06s 0.24s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 8 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 177 ( 14 ~; 9 |; 14 &; 136 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 40 ( 19 ^; 17 !; 4 ?; 40 :)
% 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_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,
cs: $i ).
thf(decl_37,type,
sue: $i ).
thf(decl_38,type,
mary: $i ).
thf(decl_39,type,
john: $i ).
thf(decl_40,type,
math: $i ).
thf(decl_41,type,
psych: $i ).
thf(decl_42,type,
teach: $i > $i > mworld > $o ).
thf(decl_44,type,
esk2_1: mworld > $i ).
thf(decl_45,type,
esk3_0: mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.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.ye2SnbyPWO/E---3.1_2030076.p',mand_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ X3 )
& ( X8 @ X6 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.p',mexists_di_def) ).
thf(query,conjecture,
( mlocal
@ ( mbox
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.p',query) ).
thf(db,axiom,
( mlocal
@ ( mbox
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.p',db) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox2/tmp/tmp.ye2SnbyPWO/E---3.1_2030076.p',mrel_universal) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_9,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_10,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ Z1 )
& ( Z0 @ X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_11,negated_conjecture,
~ ( mlocal
@ ( mbox
@ ( mexists_di
@ ^ [X6: $i] : ( teach @ X6 @ cs ) ) ) ),
inference(assume_negation,[status(cth)],[query]) ).
thf(c_0_12,plain,
! [X14: mworld] :
( ( mrel @ mactual @ X14 )
=> ( ( teach @ john @ math @ X14 )
& ? [X13: $i] :
( ( eiw_di @ X13 @ X14 )
& ( teach @ X13 @ cs @ X14 ) )
& ( teach @ mary @ psych @ X14 )
& ( teach @ sue @ psych @ X14 ) ) ),
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)],[db]),c_0_7]),c_0_8]),c_0_9]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
~ ! [X16: mworld] :
( ( mrel @ mactual @ X16 )
=> ? [X15: $i] :
( ( eiw_di @ X15 @ X16 )
& ( teach @ X15 @ cs @ X16 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_11]),c_0_7]),c_0_9]),c_0_10]) ).
thf(c_0_14,plain,
! [X21: mworld] :
( ( ( teach @ john @ math @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( eiw_di @ ( esk2_1 @ X21 ) @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ ( esk2_1 @ X21 ) @ cs @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ mary @ psych @ X21 )
| ~ ( mrel @ mactual @ X21 ) )
& ( ( teach @ sue @ psych @ X21 )
| ~ ( mrel @ mactual @ X21 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
thf(c_0_15,plain,
! [X17: mworld,X18: mworld] : ( mrel @ X17 @ X18 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_16,negated_conjecture,
! [X24: $i] :
( ( mrel @ mactual @ esk3_0 )
& ( ~ ( eiw_di @ X24 @ esk3_0 )
| ~ ( teach @ X24 @ cs @ esk3_0 ) ) ),
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_17,plain,
! [X3: mworld] :
( ( eiw_di @ ( esk2_1 @ X3 ) @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X6: $i] :
( ~ ( eiw_di @ X6 @ esk3_0 )
| ~ ( teach @ X6 @ cs @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
! [X3: mworld] : ( eiw_di @ ( esk2_1 @ X3 ) @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_21,plain,
! [X3: mworld] :
( ( teach @ ( esk2_1 @ X3 ) @ cs @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_22,negated_conjecture,
~ ( teach @ ( esk2_1 @ esk3_0 ) @ cs @ esk3_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,plain,
! [X3: mworld] : ( teach @ ( esk2_1 @ X3 ) @ cs @ X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_18])]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT334^12 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n005.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 18:28:00 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running higher-order theorem proving
% 0.06/0.23 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.ye2SnbyPWO/E---3.1_2030076.p
% 0.06/0.24 % Version: 3.5.1-ho
% 0.06/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.24 % Starting almost_fo_3_lam with 300s (1) cores
% 0.06/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.06/0.24 % ehoh_best2_full_lfho with pid 2030090 completed with status 0
% 0.06/0.24 % Result found by ehoh_best2_full_lfho
% 0.06/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.24 % No SInE strategy applied
% 0.06/0.24 % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.06/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.24 % SubtermCWHack with pid 2030094 completed with status 0
% 0.06/0.24 % Result found by SubtermCWHack
% 0.06/0.24 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.06/0.24 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.06/0.24 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.24 % No SInE strategy applied
% 0.06/0.24 % Search class: HHHNS-FFSF11-SHSSMFNN
% 0.06/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.06/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.06/0.24 % Preprocessing time : 0.001 s
% 0.06/0.24
% 0.06/0.24 % Proof found!
% 0.06/0.24 % SZS status Theorem
% 0.06/0.24 % SZS output start CNFRefutation
% See solution above
% 0.06/0.24 % Parsed axioms : 35
% 0.06/0.24 % Removed by relevancy pruning/SinE : 0
% 0.06/0.24 % Initial clauses : 30
% 0.06/0.24 % Removed in clause preprocessing : 21
% 0.06/0.24 % Initial clauses in saturation : 9
% 0.06/0.24 % Processed clauses : 11
% 0.06/0.24 % ...of these trivial : 0
% 0.06/0.24 % ...subsumed : 0
% 0.06/0.24 % ...remaining for further processing : 11
% 0.06/0.24 % Other redundant clauses eliminated : 0
% 0.06/0.24 % Clauses deleted for lack of memory : 0
% 0.06/0.24 % Backward-subsumed : 0
% 0.06/0.24 % Backward-rewritten : 2
% 0.06/0.24 % Generated clauses : 2
% 0.06/0.24 % ...of the previous two non-redundant : 2
% 0.06/0.24 % ...aggressively subsumed : 0
% 0.06/0.24 % Contextual simplify-reflections : 0
% 0.06/0.24 % Paramodulations : 2
% 0.06/0.24 % Factorizations : 0
% 0.06/0.24 % NegExts : 0
% 0.06/0.24 % Equation resolutions : 0
% 0.06/0.24 % Disequality decompositions : 0
% 0.06/0.24 % Total rewrite steps : 7
% 0.06/0.24 % ...of those cached : 4
% 0.06/0.24 % Propositional unsat checks : 0
% 0.06/0.24 % Propositional check models : 0
% 0.06/0.24 % Propositional check unsatisfiable : 0
% 0.06/0.24 % Propositional clauses : 0
% 0.06/0.24 % Propositional clauses after purity: 0
% 0.06/0.24 % Propositional unsat core size : 0
% 0.06/0.24 % Propositional preprocessing time : 0.000
% 0.06/0.24 % Propositional encoding time : 0.000
% 0.06/0.24 % Propositional solver time : 0.000
% 0.06/0.24 % Success case prop preproc time : 0.000
% 0.06/0.24 % Success case prop encoding time : 0.000
% 0.06/0.24 % Success case prop solver time : 0.000
% 0.06/0.24 % Current number of processed clauses : 9
% 0.06/0.24 % Positive orientable unit clauses : 7
% 0.06/0.24 % Positive unorientable unit clauses: 0
% 0.06/0.24 % Negative unit clauses : 1
% 0.06/0.24 % Non-unit-clauses : 1
% 0.06/0.24 % Current number of unprocessed clauses: 0
% 0.06/0.24 % ...number of literals in the above : 0
% 0.06/0.24 % Current number of archived formulas : 0
% 0.06/0.24 % Current number of archived clauses : 2
% 0.06/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.06/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.06/0.24 % Non-unit clause-clause subsumptions : 0
% 0.06/0.24 % Unit Clause-clause subsumption calls : 3
% 0.06/0.24 % Rewrite failures with RHS unbound : 0
% 0.06/0.24 % BW rewrite match attempts : 2
% 0.06/0.24 % BW rewrite match successes : 2
% 0.06/0.24 % Condensation attempts : 0
% 0.06/0.24 % Condensation successes : 0
% 0.06/0.24 % Termbank termtop insertions : 1244
% 0.06/0.24 % Search garbage collected termcells : 225
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.004 s
% 0.06/0.24 % System time : 0.002 s
% 0.06/0.24 % Total time : 0.006 s
% 0.06/0.24 % Maximum resident set size: 3660 pages
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.005 s
% 0.06/0.24 % System time : 0.005 s
% 0.06/0.24 % Total time : 0.010 s
% 0.06/0.24 % Maximum resident set size: 4864 pages
% 0.06/0.24 % E exiting
%------------------------------------------------------------------------------