%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO457^3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:43:04 AM UTC 2026
% Result : Theorem 0.26s 0.27s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 85 ( 16 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 143 ( 32 ~; 19 |; 3 &; 89 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 31 ^; 20 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
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_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_m: $i > $i > $o ).
thf(decl_55,type,
mbox_m: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
mdia_m: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
p: $i > $o ).
thf(decl_58,type,
q: $i > $o ).
thf(decl_59,type,
esk1_0: $i ).
thf(decl_60,type,
esk2_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mor) ).
thf(mdia_m,axiom,
( mdia_m
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_m @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mdia_m) ).
thf(mbox_m,axiom,
( mbox_m
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_m @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mbox_m) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',prove) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',mreflexive) ).
thf(a1,axiom,
mreflexive @ rel_m,
file('/export/starexec/sandbox/tmp/tmp.9kKUz5C7A4/E---3.1_2932175.p',a1) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mdia_m
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_m @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_m]) ).
thf(c_0_13,plain,
( mbox_m
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_m @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_m]) ).
thf(c_0_14,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mdia_m @ ( mbox_m @ p ) ) @ ( mdia_m @ ( mimplies @ q @ p ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_15,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_9,c_0_10]),c_0_11]) ).
thf(c_0_16,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_17,plain,
( mdia_m
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_m @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
thf(c_0_18,negated_conjecture,
~ ! [X26: $i] :
( ~ ~ ! [X24: $i] :
( ~ ( rel_m @ X26 @ X24 )
| ~ ! [X23: $i] :
( ~ ( rel_m @ X24 @ X23 )
| ( p @ X23 ) ) )
| ~ ! [X25: $i] :
( ~ ( rel_m @ X26 @ X25 )
| ~ ( ~ ( q @ X25 )
| ( p @ X25 ) ) ) ),
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)],[c_0_14,c_0_15]),c_0_16]),c_0_13]),c_0_17])]) ).
thf(c_0_19,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_20,negated_conjecture,
! [X30: $i,X31: $i] :
( ( rel_m @ esk1_0 @ esk2_0 )
& ( ~ ( rel_m @ esk2_0 @ X30 )
| ( p @ X30 ) )
& ( ( q @ X31 )
| ~ ( rel_m @ esk1_0 @ X31 ) )
& ( ~ ( p @ X31 )
| ~ ( rel_m @ esk1_0 @ X31 ) ) ),
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_18])])])])])]) ).
thf(c_0_21,plain,
! [X22: $i] : ( rel_m @ X22 @ X22 ),
inference(apply_def,[status(thm)],[a1,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ~ ( p @ X3 )
| ~ ( rel_m @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_m @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,plain,
! [X27: $i] : ( rel_m @ X27 @ X27 ),
inference(variable_rename,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ~ ( rel_m @ esk1_0 @ X3 )
| ~ ( rel_m @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,plain,
! [X3: $i] : ( rel_m @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_27,negated_conjecture,
rel_m @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO457^3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.18 % Computer : n014.cluster.edu
% 0.06/0.18 % Model : x86_64 x86_64
% 0.06/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18 % Memory : 8046.5625MB
% 0.06/0.18 % OS : Linux 6.8.0-71-generic
% 0.06/0.18 % CPULimit : 300
% 0.06/0.18 % WCLimit : 300
% 0.06/0.18 % DateTime : Tue Sep 29 16:57:29 UTC 2026
% 0.06/0.19 % CPUTime :
% 0.06/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.23 Running higher-order theorem proving
% 0.06/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.9kKUz5C7A4/E---3.1_2932175.p
% 0.26/0.27 % Version: 3.5.1-ho
% 0.26/0.27 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.26/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.26/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.26/0.27 % Starting almost_fo_3_lam with 300s (1) cores
% 0.26/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.27 % ehoh_best2_full_lfho with pid 2932217 completed with status 0
% 0.26/0.27 % Result found by ehoh_best2_full_lfho
% 0.26/0.27 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.26/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.26/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.26/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.27 % No SInE strategy applied
% 0.26/0.27 % Search class: HHHNF-FFSF00-SHSSMFNN
% 0.26/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.27 % SubtermCWHack with pid 2932221 completed with status 0
% 0.26/0.27 % Result found by SubtermCWHack
% 0.26/0.27 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.26/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.26/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.26/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.27 % No SInE strategy applied
% 0.26/0.27 % Search class: HHHNF-FFSF00-SHSSMFNN
% 0.26/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.27 % Preprocessing time : 0.001 s
% 0.26/0.27
% 0.26/0.27 % Proof found!
% 0.26/0.27 % SZS status Theorem
% 0.26/0.27 % SZS output start CNFRefutation
% See solution above
% 0.26/0.27 % Parsed axioms : 72
% 0.26/0.27 % Removed by relevancy pruning/SinE : 0
% 0.26/0.27 % Initial clauses : 42
% 0.26/0.27 % Removed in clause preprocessing : 37
% 0.26/0.27 % Initial clauses in saturation : 5
% 0.26/0.27 % Processed clauses : 6
% 0.26/0.27 % ...of these trivial : 0
% 0.26/0.27 % ...subsumed : 0
% 0.26/0.27 % ...remaining for further processing : 6
% 0.26/0.27 % Other redundant clauses eliminated : 0
% 0.26/0.27 % Clauses deleted for lack of memory : 0
% 0.26/0.27 % Backward-subsumed : 0
% 0.26/0.27 % Backward-rewritten : 0
% 0.26/0.27 % Generated clauses : 2
% 0.26/0.27 % ...of the previous two non-redundant : 1
% 0.26/0.27 % ...aggressively subsumed : 0
% 0.26/0.27 % Contextual simplify-reflections : 0
% 0.26/0.27 % Paramodulations : 2
% 0.26/0.27 % Factorizations : 0
% 0.26/0.27 % NegExts : 0
% 0.26/0.27 % Equation resolutions : 0
% 0.26/0.27 % Disequality decompositions : 0
% 0.26/0.27 % Total rewrite steps : 1
% 0.26/0.27 % ...of those cached : 0
% 0.26/0.27 % Propositional unsat checks : 0
% 0.26/0.27 % Propositional check models : 0
% 0.26/0.27 % Propositional check unsatisfiable : 0
% 0.26/0.27 % Propositional clauses : 0
% 0.26/0.27 % Propositional clauses after purity: 0
% 0.26/0.27 % Propositional unsat core size : 0
% 0.26/0.27 % Propositional preprocessing time : 0.000
% 0.26/0.27 % Propositional encoding time : 0.000
% 0.26/0.27 % Propositional solver time : 0.000
% 0.26/0.27 % Success case prop preproc time : 0.000
% 0.26/0.27 % Success case prop encoding time : 0.000
% 0.26/0.27 % Success case prop solver time : 0.000
% 0.26/0.27 % Current number of processed clauses : 6
% 0.26/0.27 % Positive orientable unit clauses : 2
% 0.26/0.27 % Positive unorientable unit clauses: 0
% 0.26/0.27 % Negative unit clauses : 0
% 0.26/0.27 % Non-unit-clauses : 4
% 0.26/0.27 % Current number of unprocessed clauses: 0
% 0.26/0.27 % ...number of literals in the above : 0
% 0.26/0.27 % Current number of archived formulas : 0
% 0.26/0.27 % Current number of archived clauses : 0
% 0.26/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.27 % Non-unit clause-clause subsumptions : 0
% 0.26/0.27 % Unit Clause-clause subsumption calls : 0
% 0.26/0.27 % Rewrite failures with RHS unbound : 0
% 0.26/0.27 % BW rewrite match attempts : 1
% 0.26/0.27 % BW rewrite match successes : 0
% 0.26/0.27 % Condensation attempts : 0
% 0.26/0.27 % Condensation successes : 0
% 0.26/0.27 % Termbank termtop insertions : 2364
% 0.26/0.27 % Search garbage collected termcells : 457
% 0.26/0.27
% 0.26/0.27 % -------------------------------------------------
% 0.26/0.27 % User time : 0.005 s
% 0.26/0.27 % System time : 0.003 s
% 0.26/0.27 % Total time : 0.007 s
% 0.26/0.27 % Maximum resident set size: 3696 pages
% 0.26/0.27
% 0.26/0.27 % -------------------------------------------------
% 0.26/0.27 % User time : 0.007 s
% 0.26/0.27 % System time : 0.008 s
% 0.26/0.27 % Total time : 0.015 s
% 0.26/0.27 % Maximum resident set size: 4864 pages
% 0.26/0.27 % E exiting
%------------------------------------------------------------------------------