%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO458^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 : n001.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:05 AM UTC 2026
% Result : Theorem 0.25s 0.32s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 17 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 187 ( 47 ~; 31 |; 6 &; 103 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 40 ^; 12 !; 0 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $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_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(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mequiv) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mand @ ( mbox_m @ p ) @ ( mbox_m @ q ) ) @ ( mbox_m @ ( mequiv @ p @ q ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',prove) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fxwI22nHUb/E---3.1_1519860.p',mvalid) ).
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.fxwI22nHUb/E---3.1_1519860.p',mbox_m) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
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,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_12,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_13,plain,
( mand
= ( ^ [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,
( 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_11,c_0_9]),c_0_10]) ).
thf(c_0_15,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mand @ ( mbox_m @ p ) @ ( mbox_m @ q ) ) @ ( mbox_m @ ( mequiv @ p @ q ) ) ) ),
inference(assume_negation,[status(cth)],[prove]) ).
thf(c_0_16,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_17,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_18,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_19,negated_conjecture,
~ ! [X26: $i] :
( ~ ~ ( ~ ! [X23: $i] :
( ~ ( rel_m @ X26 @ X23 )
| ( p @ X23 ) )
| ~ ! [X24: $i] :
( ~ ( rel_m @ X26 @ X24 )
| ( q @ X24 ) ) )
| ! [X25: $i] :
( ~ ( rel_m @ X26 @ X25 )
| ~ ( ~ ( ~ ( p @ X25 )
| ( q @ 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)],[inference(apply_def,[status(thm)],[c_0_15,c_0_13]),c_0_14]),c_0_16]),c_0_17]),c_0_18])]) ).
thf(c_0_20,negated_conjecture,
! [X29: $i,X30: $i] :
( ( ~ ( rel_m @ esk1_0 @ X29 )
| ( p @ X29 ) )
& ( ~ ( rel_m @ esk1_0 @ X30 )
| ( q @ X30 ) )
& ( rel_m @ esk1_0 @ esk2_0 )
& ( ( q @ esk2_0 )
| ( p @ esk2_0 ) )
& ( ~ ( p @ esk2_0 )
| ( p @ esk2_0 ) )
& ( ( q @ esk2_0 )
| ~ ( q @ esk2_0 ) )
& ( ~ ( p @ esk2_0 )
| ~ ( q @ esk2_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_19])])])])])]) ).
thf(c_0_21,negated_conjecture,
( ~ ( p @ esk2_0 )
| ~ ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_m @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
rel_m @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
~ ( p @ esk2_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_m @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO458^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.08/0.22 % Computer : n001.cluster.edu
% 0.08/0.22 % Model : x86_64 x86_64
% 0.08/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.22 % Memory : 8046.5625MB
% 0.08/0.22 % OS : Linux 6.8.0-71-generic
% 0.08/0.22 % CPULimit : 300
% 0.08/0.22 % WCLimit : 300
% 0.08/0.22 % DateTime : Tue Sep 29 17:03:35 UTC 2026
% 0.08/0.22 % CPUTime :
% 0.08/0.22 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.28 Running higher-order theorem proving
% 0.25/0.30 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.fxwI22nHUb/E---3.1_1519860.p
% 0.25/0.32 % Version: 3.5.1-ho
% 0.25/0.32 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.25/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.32 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.32 % Starting almost_fo_3_lam with 300s (1) cores
% 0.25/0.32 % Starting post_as_ho1 with 300s (1) cores
% 0.25/0.32 % ehoh_best2_full_lfho with pid 1519874 completed with status 0
% 0.25/0.32 % Result found by ehoh_best2_full_lfho
% 0.25/0.32 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.25/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.32 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.32 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.32 % No SInE strategy applied
% 0.25/0.32 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.25/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.32 % SubtermCWHack with pid 1519877 completed with status 0
% 0.25/0.32 % Result found by SubtermCWHack
% 0.25/0.32 % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.25/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.32 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.25/0.32 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.25/0.32 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.32 % No SInE strategy applied
% 0.25/0.32 % Search class: HGHNF-FFSF00-SHSSMFNN
% 0.25/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.32 % Preprocessing time : 0.001 s
% 0.25/0.32
% 0.25/0.32 % Proof found!
% 0.25/0.32 % SZS status Theorem
% 0.25/0.32 % SZS output start CNFRefutation
% See solution above
% 0.25/0.32 % Parsed axioms : 72
% 0.25/0.32 % Removed by relevancy pruning/SinE : 0
% 0.25/0.32 % Initial clauses : 45
% 0.25/0.32 % Removed in clause preprocessing : 39
% 0.25/0.32 % Initial clauses in saturation : 6
% 0.25/0.32 % Processed clauses : 7
% 0.25/0.32 % ...of these trivial : 0
% 0.25/0.32 % ...subsumed : 0
% 0.25/0.32 % ...remaining for further processing : 7
% 0.25/0.32 % Other redundant clauses eliminated : 0
% 0.25/0.32 % Clauses deleted for lack of memory : 0
% 0.25/0.32 % Backward-subsumed : 1
% 0.25/0.32 % Backward-rewritten : 0
% 0.25/0.32 % Generated clauses : 4
% 0.25/0.32 % ...of the previous two non-redundant : 2
% 0.25/0.32 % ...aggressively subsumed : 0
% 0.25/0.32 % Contextual simplify-reflections : 0
% 0.25/0.32 % Paramodulations : 3
% 0.25/0.32 % Factorizations : 0
% 0.25/0.32 % NegExts : 0
% 0.25/0.32 % Equation resolutions : 0
% 0.25/0.32 % Disequality decompositions : 0
% 0.25/0.32 % Total rewrite steps : 2
% 0.25/0.32 % ...of those cached : 1
% 0.25/0.32 % Propositional unsat checks : 0
% 0.25/0.32 % Propositional check models : 0
% 0.25/0.32 % Propositional check unsatisfiable : 0
% 0.25/0.32 % Propositional clauses : 0
% 0.25/0.32 % Propositional clauses after purity: 0
% 0.25/0.32 % Propositional unsat core size : 0
% 0.25/0.32 % Propositional preprocessing time : 0.000
% 0.25/0.32 % Propositional encoding time : 0.000
% 0.25/0.32 % Propositional solver time : 0.000
% 0.25/0.32 % Success case prop preproc time : 0.000
% 0.25/0.32 % Success case prop encoding time : 0.000
% 0.25/0.32 % Success case prop solver time : 0.000
% 0.25/0.32 % Current number of processed clauses : 5
% 0.25/0.32 % Positive orientable unit clauses : 2
% 0.25/0.32 % Positive unorientable unit clauses: 0
% 0.25/0.32 % Negative unit clauses : 1
% 0.25/0.32 % Non-unit-clauses : 2
% 0.25/0.32 % Current number of unprocessed clauses: 0
% 0.25/0.32 % ...number of literals in the above : 0
% 0.25/0.32 % Current number of archived formulas : 0
% 0.25/0.32 % Current number of archived clauses : 2
% 0.25/0.32 % Clause-clause subsumption calls (NU) : 0
% 0.25/0.32 % Rec. Clause-clause subsumption calls : 0
% 0.25/0.32 % Non-unit clause-clause subsumptions : 0
% 0.25/0.32 % Unit Clause-clause subsumption calls : 1
% 0.25/0.32 % Rewrite failures with RHS unbound : 0
% 0.25/0.32 % BW rewrite match attempts : 1
% 0.25/0.32 % BW rewrite match successes : 0
% 0.25/0.32 % Condensation attempts : 0
% 0.25/0.32 % Condensation successes : 0
% 0.25/0.32 % Termbank termtop insertions : 2490
% 0.25/0.32 % Search garbage collected termcells : 504
% 0.25/0.32
% 0.25/0.32 % -------------------------------------------------
% 0.25/0.32 % User time : 0.005 s
% 0.25/0.32 % System time : 0.003 s
% 0.25/0.32 % Total time : 0.008 s
% 0.25/0.32 % Maximum resident set size: 3900 pages
% 0.25/0.32
% 0.25/0.32 % -------------------------------------------------
% 0.25/0.32 % User time : 0.008 s
% 0.25/0.32 % System time : 0.008 s
% 0.25/0.32 % Total time : 0.015 s
% 0.25/0.32 % Maximum resident set size: 4864 pages
% 0.25/0.32 % E exiting
%------------------------------------------------------------------------------