%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : DAT333^3 : TPTP v9.3.1. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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.23s 0.27s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 58 ( 8 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 129 ( 9 ~; 5 |; 9 &; 102 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 32 ( 19 ^; 9 !; 4 ?; 32 :)
% 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_34,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
cs: $i ).
thf(decl_36,type,
sue: $i ).
thf(decl_37,type,
mary: $i ).
thf(decl_38,type,
john: $i ).
thf(decl_39,type,
math: $i ).
thf(decl_40,type,
psych: $i ).
thf(decl_41,type,
teach: $i > $i > mworld > $o ).
thf(decl_43,type,
esk2_1: mworld > $i ).
thf(decl_44,type,
esk3_1: $i > mworld ).
thf(query,conjecture,
( mlocal
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( teach @ john @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',query) ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',mlocal_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',mbox_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X7: $i] : ( X8 @ X7 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',mexists_di_def) ).
thf(mand_def,axiom,
( mand
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
& ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',mand_def) ).
thf(db,axiom,
( mlocal
@ ( mbox
@ ( mand @ ( teach @ john @ math )
@ ( mand
@ ( mexists_di
@ ^ [X7: $i] : ( teach @ X7 @ cs ) )
@ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.10NJ9JTF6m/E---3.1_987003.p',db) ).
thf(c_0_6,negated_conjecture,
~ ( mlocal
@ ( mexists_di
@ ^ [X7: $i] : ( mbox @ ( teach @ john @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[query]) ).
thf(c_0_7,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_8,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_9,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X7: $i] : ( Z0 @ X7 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand_def]) ).
thf(c_0_11,negated_conjecture,
~ ? [X14: $i] :
! [X13: mworld] :
( ( mrel @ mactual @ X13 )
=> ( teach @ john @ X14 @ X13 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_6]),c_0_7]),c_0_8]),c_0_9]) ).
thf(c_0_12,plain,
! [X12: mworld] :
( ( mrel @ mactual @ X12 )
=> ( ( teach @ john @ math @ X12 )
& ? [X11: $i] : ( teach @ X11 @ cs @ X12 )
& ( teach @ mary @ psych @ X12 )
& ( teach @ sue @ psych @ X12 ) ) ),
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_10]),c_0_8]),c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X19: $i] :
( ( mrel @ mactual @ ( esk3_1 @ X19 ) )
& ~ ( teach @ john @ X19 @ ( esk3_1 @ X19 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
thf(c_0_14,plain,
! [X17: mworld] :
( ( ( teach @ john @ math @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ ( esk2_1 @ X17 ) @ cs @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ mary @ psych @ X17 )
| ~ ( mrel @ mactual @ X17 ) )
& ( ( teach @ sue @ psych @ X17 )
| ~ ( mrel @ mactual @ X17 ) ) ),
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,negated_conjecture,
! [X7: $i] :
~ ( teach @ john @ X7 @ ( esk3_1 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,plain,
! [X3: mworld] :
( ( teach @ john @ math @ X3 )
| ~ ( mrel @ mactual @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X7: $i] : ( mrel @ mactual @ ( esk3_1 @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT333^3 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19 % Computer : n026.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.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Tue Sep 29 18:30:42 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24 Running higher-order theorem proving
% 0.07/0.25 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.10NJ9JTF6m/E---3.1_987003.p
% 0.23/0.27 % Version: 3.5.1-ho
% 0.23/0.27 % Preprocessing class: HSSSSMSSMLMNHSN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % Starting sh5l with 300s (1) cores
% 0.23/0.27 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.27 % Starting new_bool_2 with 300s (1) cores
% 0.23/0.27 % new_ho_10 with pid 987035 completed with status 0
% 0.23/0.27 % Result found by new_ho_10
% 0.23/0.27 % Preprocessing class: HSSSSMSSMLMNHSN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HHUNS-FFSF11-SHSSMFNN
% 0.23/0.27 % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.27 % Starting sh5l with 151s (1) cores
% 0.23/0.27 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.23/0.27 % Starting lpo1_def_fix with 146s (1) cores
% 0.23/0.27 % sh5l with pid 987042 completed with status 0
% 0.23/0.27 % Result found by sh5l
% 0.23/0.27 % Preprocessing class: HSSSSMSSMLMNHSN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HHUNS-FFSF11-SHSSMFNN
% 0.23/0.27 % partial match(1): HHHNS-FFSF11-SHSSMFNN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Starting new_ho_10 with 901s (1) cores
% 0.23/0.27 % Starting sh5l with 151s (1) cores
% 0.23/0.27 % Preprocessing time : 0.001 s
% 0.23/0.27 % Presaturation interreduction done
% 0.23/0.27
% 0.23/0.27 % Proof found!
% 0.23/0.27 % SZS status Theorem
% 0.23/0.27 % SZS output start CNFRefutation
% See solution above
% 0.23/0.27 % Parsed axioms : 33
% 0.23/0.27 % Removed by relevancy pruning/SinE : 0
% 0.23/0.27 % Initial clauses : 27
% 0.23/0.27 % Removed in clause preprocessing : 20
% 0.23/0.27 % Initial clauses in saturation : 7
% 0.23/0.27 % Processed clauses : 11
% 0.23/0.27 % ...of these trivial : 0
% 0.23/0.27 % ...subsumed : 0
% 0.23/0.27 % ...remaining for further processing : 11
% 0.23/0.27 % Other redundant clauses eliminated : 0
% 0.23/0.27 % Clauses deleted for lack of memory : 0
% 0.23/0.27 % Backward-subsumed : 0
% 0.23/0.27 % Backward-rewritten : 0
% 0.23/0.27 % Generated clauses : 1
% 0.23/0.27 % ...of the previous two non-redundant : 0
% 0.23/0.27 % ...aggressively subsumed : 0
% 0.23/0.27 % Contextual simplify-reflections : 0
% 0.23/0.27 % Paramodulations : 1
% 0.23/0.27 % Factorizations : 0
% 0.23/0.27 % NegExts : 0
% 0.23/0.27 % Equation resolutions : 0
% 0.23/0.27 % Disequality decompositions : 0
% 0.23/0.27 % Total rewrite steps : 1
% 0.23/0.27 % ...of those cached : 0
% 0.23/0.27 % Propositional unsat checks : 0
% 0.23/0.27 % Propositional check models : 0
% 0.23/0.27 % Propositional check unsatisfiable : 0
% 0.23/0.27 % Propositional clauses : 0
% 0.23/0.27 % Propositional clauses after purity: 0
% 0.23/0.27 % Propositional unsat core size : 0
% 0.23/0.27 % Propositional preprocessing time : 0.000
% 0.23/0.27 % Propositional encoding time : 0.000
% 0.23/0.27 % Propositional solver time : 0.000
% 0.23/0.27 % Success case prop preproc time : 0.000
% 0.23/0.27 % Success case prop encoding time : 0.000
% 0.23/0.27 % Success case prop solver time : 0.000
% 0.23/0.27 % Current number of processed clauses : 4
% 0.23/0.27 % Positive orientable unit clauses : 2
% 0.23/0.27 % Positive unorientable unit clauses: 0
% 0.23/0.27 % Negative unit clauses : 1
% 0.23/0.27 % Non-unit-clauses : 1
% 0.23/0.27 % Current number of unprocessed clauses: 3
% 0.23/0.27 % ...number of literals in the above : 6
% 0.23/0.27 % Current number of archived formulas : 0
% 0.23/0.27 % Current number of archived clauses : 7
% 0.23/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.23/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.23/0.27 % Non-unit clause-clause subsumptions : 0
% 0.23/0.27 % Unit Clause-clause subsumption calls : 0
% 0.23/0.27 % Rewrite failures with RHS unbound : 0
% 0.23/0.27 % BW rewrite match attempts : 0
% 0.23/0.27 % BW rewrite match successes : 0
% 0.23/0.27 % Condensation attempts : 11
% 0.23/0.27 % Condensation successes : 0
% 0.23/0.27 % Termbank termtop insertions : 1146
% 0.23/0.27 % Search garbage collected termcells : 193
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.003 s
% 0.23/0.27 % System time : 0.002 s
% 0.23/0.27 % Total time : 0.005 s
% 0.23/0.27 % Maximum resident set size: 3656 pages
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.010 s
% 0.23/0.27 % System time : 0.009 s
% 0.23/0.27 % Total time : 0.019 s
% 0.23/0.27 % Maximum resident set size: 4864 pages
% 0.23/0.27 % E exiting
%------------------------------------------------------------------------------