%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL595^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:11:58 AM UTC 2026
% Result : Theorem 0.32s 0.39s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 68 ( 13 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 152 ( 19 ~; 23 |; 3 &; 101 @)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 58 ( 28 ^; 30 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_29,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_30,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_50,type,
reflexive: ( $i > $i > $o ) > $o ).
thf(decl_63,type,
r: $i > $i > $o ).
thf(decl_64,type,
epred1_0: $i > $o ).
thf(decl_65,type,
esk1_0: $i ).
thf(decl_66,type,
esk2_0: $i ).
thf(decl_67,type,
esk3_2: ( $i > $o ) > $i > $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',mor) ).
thf(thm,conjecture,
( ! [X28: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ X28 ) @ X28 ) )
<=> ( reflexive @ r ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',thm) ).
thf(mbox,axiom,
( mbox
= ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
! [X12: $i] :
( ( X10 @ X1 @ X12 )
=> ( X11 @ X12 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',mvalid) ).
thf(reflexive,axiom,
( reflexive
= ( ^ [X10: $i > $i > $o] :
! [X1: $i] : ( X10 @ X1 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.1tvjXi2RuP/E---3.1_2597204.p',reflexive) ).
thf(c_0_7,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_8,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_9,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_10,negated_conjecture,
~ ( ! [X28: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ X28 ) @ X28 ) )
<=> ( reflexive @ r ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_11,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X12: $i] :
( ( Z0 @ Z2 @ X12 )
=> ( Z1 @ X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_13,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_14,plain,
( reflexive
= ( ^ [Z0: $i > $i > $o] :
! [X1: $i] : ( Z0 @ X1 @ X1 ) ) ),
inference(fof_simplification,[status(thm)],[reflexive]) ).
thf(c_0_15,negated_conjecture,
~ ( ! [X28: $i > $o,X57: $i] :
( ~ ! [X56: $i] :
( ( r @ X57 @ X56 )
=> ( X28 @ X56 ) )
| ( X28 @ X57 ) )
<=> ! [X58: $i] : ( r @ X58 @ X58 ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X61: $i,X63: $i > $o,X64: $i,X66: $i] :
( ( ~ ( r @ esk1_0 @ X61 )
| ( epred1_0 @ X61 )
| ~ ( r @ esk2_0 @ esk2_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( r @ esk2_0 @ esk2_0 ) )
& ( ( r @ X64 @ ( esk3_2 @ X63 @ X64 ) )
| ( X63 @ X64 )
| ( r @ X66 @ X66 ) )
& ( ~ ( X63 @ ( esk3_2 @ X63 @ X64 ) )
| ( X63 @ X64 )
| ( r @ X66 @ X66 ) ) ),
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_15])])])])])]) ).
thf(c_0_17,negated_conjecture,
! [X3: $i,X2: $i > $o,X1: $i] :
( ( X2 @ X1 )
| ( r @ X3 @ X3 )
| ~ ( X2 @ ( esk3_2 @ X2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( r @ X1 @ ( esk3_2 @ X2 @ X1 ) )
| ( X2 @ X1 )
| ( r @ X3 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i,X12: $i] :
( ( r @ X1 @ X1 )
| ( r @ X3 @ X3 )
| ( r @ X12 @ X12 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X3: $i] :
( ( r @ X1 @ X1 )
| ( r @ X3 @ X3 ) ),
inference(ef,[status(thm)],[c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( r @ esk1_0 @ X1 )
| ~ ( r @ esk2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] : ( r @ X1 @ X1 ),
inference(ef,[status(thm)],[c_0_20]) ).
thf(c_0_23,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( r @ esk2_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_24,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
thf(c_0_25,negated_conjecture,
~ ( epred1_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL595^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.28 % Computer : n010.cluster.edu
% 0.23/0.28 % Model : x86_64 x86_64
% 0.23/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.28 % Memory : 8046.5625MB
% 0.23/0.28 % OS : Linux 6.8.0-71-generic
% 0.23/0.28 % CPULimit : 300
% 0.23/0.28 % WCLimit : 300
% 0.23/0.28 % DateTime : Tue Sep 29 09:15:32 UTC 2026
% 0.23/0.28 % CPUTime :
% 0.23/0.28 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.33 Running higher-order theorem proving
% 0.23/0.36 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.1tvjXi2RuP/E---3.1_2597204.p
% 0.32/0.39 % Version: 3.5.1-ho
% 0.32/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.32/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.32/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.32/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.32/0.39 % Starting full_lambda_8 with 300s (1) cores
% 0.32/0.39 % post_as_ho11 with pid 2597220 completed with status 0
% 0.32/0.39 % Result found by post_as_ho11
% 0.32/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.32/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.32/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.32/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.32/0.39 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.39 % No SInE strategy applied
% 0.32/0.39 % Search class: HGHNF-FFSF22-SHSSMMBN
% 0.32/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.39 % SubtermCWHack with pid 2597223 completed with status 0
% 0.32/0.39 % Result found by SubtermCWHack
% 0.32/0.39 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.32/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.39 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.32/0.39 % Starting post_as_ho3 with 300s (1) cores
% 0.32/0.39 % Starting post_as_ho11 with 300s (1) cores
% 0.32/0.39 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.39 % No SInE strategy applied
% 0.32/0.39 % Search class: HGHNF-FFSF22-SHSSMMBN
% 0.32/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.32/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.32/0.39 % Preprocessing time : 0.002 s
% 0.32/0.39
% 0.32/0.39 % Proof found!
% 0.32/0.39 % SZS status Theorem
% 0.32/0.39 % SZS output start CNFRefutation
% See solution above
% 0.32/0.39 % Parsed axioms : 79
% 0.32/0.39 % Removed by relevancy pruning/SinE : 0
% 0.32/0.39 % Initial clauses : 46
% 0.32/0.39 % Removed in clause preprocessing : 42
% 0.32/0.39 % Initial clauses in saturation : 4
% 0.32/0.39 % Processed clauses : 9
% 0.32/0.39 % ...of these trivial : 0
% 0.32/0.39 % ...subsumed : 0
% 0.32/0.39 % ...remaining for further processing : 9
% 0.32/0.39 % Other redundant clauses eliminated : 0
% 0.32/0.39 % Clauses deleted for lack of memory : 0
% 0.32/0.39 % Backward-subsumed : 3
% 0.32/0.39 % Backward-rewritten : 3
% 0.32/0.39 % Generated clauses : 21
% 0.32/0.39 % ...of the previous two non-redundant : 22
% 0.32/0.39 % ...aggressively subsumed : 0
% 0.32/0.39 % Contextual simplify-reflections : 0
% 0.32/0.39 % Paramodulations : 13
% 0.32/0.39 % Factorizations : 8
% 0.32/0.39 % NegExts : 0
% 0.32/0.39 % Equation resolutions : 0
% 0.32/0.39 % Disequality decompositions : 0
% 0.32/0.39 % Total rewrite steps : 3
% 0.32/0.39 % ...of those cached : 0
% 0.32/0.39 % Propositional unsat checks : 0
% 0.32/0.39 % Propositional check models : 0
% 0.32/0.39 % Propositional check unsatisfiable : 0
% 0.32/0.39 % Propositional clauses : 0
% 0.32/0.39 % Propositional clauses after purity: 0
% 0.32/0.39 % Propositional unsat core size : 0
% 0.32/0.39 % Propositional preprocessing time : 0.000
% 0.32/0.39 % Propositional encoding time : 0.000
% 0.32/0.39 % Propositional solver time : 0.000
% 0.32/0.39 % Success case prop preproc time : 0.000
% 0.32/0.39 % Success case prop encoding time : 0.000
% 0.32/0.39 % Success case prop solver time : 0.000
% 0.32/0.39 % Current number of processed clauses : 3
% 0.32/0.39 % Positive orientable unit clauses : 1
% 0.32/0.39 % Positive unorientable unit clauses: 0
% 0.32/0.39 % Negative unit clauses : 1
% 0.32/0.39 % Non-unit-clauses : 1
% 0.32/0.39 % Current number of unprocessed clauses: 14
% 0.32/0.39 % ...number of literals in the above : 41
% 0.32/0.39 % Current number of archived formulas : 0
% 0.32/0.39 % Current number of archived clauses : 6
% 0.32/0.39 % Clause-clause subsumption calls (NU) : 4
% 0.32/0.39 % Rec. Clause-clause subsumption calls : 3
% 0.32/0.39 % Non-unit clause-clause subsumptions : 1
% 0.32/0.39 % Unit Clause-clause subsumption calls : 2
% 0.32/0.39 % Rewrite failures with RHS unbound : 0
% 0.32/0.39 % BW rewrite match attempts : 5
% 0.32/0.39 % BW rewrite match successes : 3
% 0.32/0.39 % Condensation attempts : 0
% 0.32/0.39 % Condensation successes : 0
% 0.32/0.39 % Termbank termtop insertions : 2446
% 0.32/0.39 % Search garbage collected termcells : 282
% 0.32/0.39
% 0.32/0.39 % -------------------------------------------------
% 0.32/0.39 % User time : 0.008 s
% 0.32/0.39 % System time : 0.003 s
% 0.32/0.39 % Total time : 0.011 s
% 0.32/0.39 % Maximum resident set size: 3720 pages
% 0.32/0.39
% 0.32/0.39 % -------------------------------------------------
% 0.32/0.39 % User time : 0.012 s
% 0.32/0.39 % System time : 0.009 s
% 0.32/0.39 % Total time : 0.021 s
% 0.32/0.39 % Maximum resident set size: 4864 pages
% 0.32/0.39 % E exiting
%------------------------------------------------------------------------------