%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO481^6 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:43:13 AM UTC 2026
% Result : Theorem 0.08s 0.15s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 22 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 75 ( 12 ~; 8 |; 2 &; 53 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 48 ( 38 ^; 10 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_23,type,
meq_ind: mu > mu > $i > $o ).
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s5: $i > $i > $o ).
thf(decl_55,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
esk1_0: $i ).
thf(decl_58,type,
esk2_0: mu ).
thf(decl_59,type,
esk3_0: mu ).
thf(decl_60,type,
esk4_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mor) ).
thf(prove,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',prove) ).
thf(meq_ind,axiom,
( meq_ind
= ( ^ [X1: mu,X2: mu,X3: $i] : ( X1 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',meq_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mvalid) ).
thf(mbox_s5,axiom,
( mbox_s5
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EQkHRiS5ny/E---3.1_402457.p',mbox_s5) ).
thf(c_0_8,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_9,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_10,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_11,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_12,plain,
( meq_ind
= ( ^ [Z0: mu,Z1: mu,Z2: $i] : Z0 ) ),
inference(fof_simplification,[status(thm)],[meq_ind]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_14,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_15,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_16,plain,
( mbox_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s5]) ).
thf(c_0_17,negated_conjecture,
~ ! [X31: $i,X30: mu,X29: mu] :
( ( X30 = X29 )
| ! [X28: $i] :
( ~ ( rel_s5 @ X31 @ X28 )
| ( X30 != X29 ) ) ),
inference(fof_simplification,[status(thm)],[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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_11]),c_0_12]),c_0_9]),c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
thf(c_0_18,negated_conjecture,
( ( esk2_0 != esk3_0 )
& ( rel_s5 @ esk1_0 @ esk4_0 )
& ( esk2_0 = esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
thf(c_0_19,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_20,negated_conjecture,
esk2_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SYO481^6 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.10 % Computer : n012.cluster.edu
% 0.00/0.10 % Model : x86_64 x86_64
% 0.00/0.10 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.10 % Memory : 8046.5625MB
% 0.00/0.10 % OS : Linux 6.8.0-71-generic
% 0.00/0.10 % CPULimit : 300
% 0.00/0.10 % WCLimit : 300
% 0.00/0.10 % DateTime : Tue Sep 29 17:08:33 UTC 2026
% 0.00/0.10 % CPUTime :
% 0.00/0.10 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.13 Running higher-order theorem proving
% 0.08/0.13 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.EQkHRiS5ny/E---3.1_402457.p
% 0.08/0.15 % Version: 3.5.1-ho
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.15 % Starting almost_fo_3_lam with 300s (1) cores
% 0.08/0.15 % Starting post_as_ho1 with 300s (1) cores
% 0.08/0.15 % ehoh_best2_full_lfho with pid 402471 completed with status 0
% 0.08/0.15 % Result found by ehoh_best2_full_lfho
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.15 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.15 % No SInE strategy applied
% 0.08/0.15 % Search class: HHUSF-FFSF00-SHSSMFNN
% 0.08/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.15 % SubtermCWHack with pid 402476 completed with status 0
% 0.08/0.15 % Result found by SubtermCWHack
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.08/0.15 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.15 % No SInE strategy applied
% 0.08/0.15 % Search class: HHUSF-FFSF00-SHSSMFNN
% 0.08/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.15 % Preprocessing time : 0.001 s
% 0.08/0.15
% 0.08/0.15 % Proof found!
% 0.08/0.15 % SZS status Theorem
% 0.08/0.15 % SZS output start CNFRefutation
% See solution above
% 0.08/0.15 % Parsed axioms : 72
% 0.08/0.15 % Removed by relevancy pruning/SinE : 0
% 0.08/0.15 % Initial clauses : 41
% 0.08/0.15 % Removed in clause preprocessing : 35
% 0.08/0.15 % Initial clauses in saturation : 6
% 0.08/0.15 % Processed clauses : 2
% 0.08/0.15 % ...of these trivial : 0
% 0.08/0.15 % ...subsumed : 0
% 0.08/0.15 % ...remaining for further processing : 1
% 0.08/0.15 % Other redundant clauses eliminated : 0
% 0.08/0.15 % Clauses deleted for lack of memory : 0
% 0.08/0.15 % Backward-subsumed : 0
% 0.08/0.15 % Backward-rewritten : 0
% 0.08/0.15 % Generated clauses : 0
% 0.08/0.15 % ...of the previous two non-redundant : 0
% 0.08/0.15 % ...aggressively subsumed : 0
% 0.08/0.15 % Contextual simplify-reflections : 0
% 0.08/0.15 % Paramodulations : 0
% 0.08/0.15 % Factorizations : 0
% 0.08/0.15 % NegExts : 0
% 0.08/0.15 % Equation resolutions : 0
% 0.08/0.15 % Disequality decompositions : 0
% 0.08/0.15 % Total rewrite steps : 1
% 0.08/0.15 % ...of those cached : 0
% 0.08/0.15 % Propositional unsat checks : 0
% 0.08/0.15 % Propositional check models : 0
% 0.08/0.15 % Propositional check unsatisfiable : 0
% 0.08/0.15 % Propositional clauses : 0
% 0.08/0.15 % Propositional clauses after purity: 0
% 0.08/0.15 % Propositional unsat core size : 0
% 0.08/0.15 % Propositional preprocessing time : 0.000
% 0.08/0.15 % Propositional encoding time : 0.000
% 0.08/0.15 % Propositional solver time : 0.000
% 0.08/0.15 % Success case prop preproc time : 0.000
% 0.08/0.15 % Success case prop encoding time : 0.000
% 0.08/0.15 % Success case prop solver time : 0.000
% 0.08/0.15 % Current number of processed clauses : 1
% 0.08/0.15 % Positive orientable unit clauses : 1
% 0.08/0.15 % Positive unorientable unit clauses: 0
% 0.08/0.15 % Negative unit clauses : 0
% 0.08/0.15 % Non-unit-clauses : 0
% 0.08/0.15 % Current number of unprocessed clauses: 4
% 0.08/0.15 % ...number of literals in the above : 7
% 0.08/0.15 % Current number of archived formulas : 0
% 0.08/0.15 % Current number of archived clauses : 0
% 0.08/0.15 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.15 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.15 % Non-unit clause-clause subsumptions : 0
% 0.08/0.15 % Unit Clause-clause subsumption calls : 0
% 0.08/0.15 % Rewrite failures with RHS unbound : 0
% 0.08/0.15 % BW rewrite match attempts : 0
% 0.08/0.15 % BW rewrite match successes : 0
% 0.08/0.15 % Condensation attempts : 0
% 0.08/0.15 % Condensation successes : 0
% 0.08/0.15 % Termbank termtop insertions : 2416
% 0.08/0.15 % Search garbage collected termcells : 495
% 0.08/0.15
% 0.08/0.15 % -------------------------------------------------
% 0.08/0.15 % User time : 0.004 s
% 0.08/0.15 % System time : 0.000 s
% 0.08/0.15 % Total time : 0.004 s
% 0.08/0.15 % Maximum resident set size: 3700 pages
% 0.08/0.15
% 0.08/0.15 % -------------------------------------------------
% 0.08/0.15 % User time : 0.005 s
% 0.08/0.15 % System time : 0.003 s
% 0.08/0.15 % Total time : 0.007 s
% 0.08/0.15 % Maximum resident set size: 4864 pages
% 0.08/0.15 % E exiting
%------------------------------------------------------------------------------