%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL587^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 : n008.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:57 AM UTC 2026
% Result : Theorem 0.26s 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 59 ( 11 equ; 0 cnn)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 86 ( 12 ~; 8 |; 3 &; 59 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 35 ( 26 ^; 9 !; 0 ?; 35 :)
% 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_42,type,
a: $i > $o ).
thf(decl_43,type,
b: $i > $o ).
thf(decl_44,type,
r: $i > $i > $o ).
thf(decl_45,type,
esk1_0: $i ).
thf(decl_46,type,
esk2_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pptcr60qhE/E---3.1_2887985.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pptcr60qhE/E---3.1_2887985.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pptcr60qhE/E---3.1_2887985.p',mor) ).
thf(thm,conjecture,
mvalid @ ( mimpl @ ( mbox @ r @ b ) @ ( mbox @ r @ ( mimpl @ a @ b ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pptcr60qhE/E---3.1_2887985.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.pptcr60qhE/E---3.1_2887985.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.pptcr60qhE/E---3.1_2887985.p',mvalid) ).
thf(c_0_6,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_9,negated_conjecture,
~ ( mvalid @ ( mimpl @ ( mbox @ r @ b ) @ ( mbox @ r @ ( mimpl @ a @ b ) ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_10,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_6,c_0_7]),c_0_8]) ).
thf(c_0_11,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_12,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_13,negated_conjecture,
~ ! [X21: $i] :
( ~ ! [X19: $i] :
( ( r @ X21 @ X19 )
=> ( b @ X19 ) )
| ! [X20: $i] :
( ( r @ X21 @ X20 )
=> ( ~ ( a @ X20 )
| ( b @ X20 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
thf(c_0_14,negated_conjecture,
! [X23: $i] :
( ( ~ ( r @ esk1_0 @ X23 )
| ( b @ X23 ) )
& ( r @ esk1_0 @ esk2_0 )
& ( a @ esk2_0 )
& ~ ( b @ esk2_0 ) ),
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_13])])])])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ( b @ X1 )
| ~ ( r @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
r @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
~ ( b @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL587^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n008.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 09:05:37 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 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.pptcr60qhE/E---3.1_2887985.p
% 0.26/0.26 % Version: 3.5.1-ho
% 0.26/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.26 % Starting sh1l with 300s (1) cores
% 0.26/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.26/0.26 % sh1l with pid 2888000 completed with status 0
% 0.26/0.26 % Result found by sh1l
% 0.26/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.26 % Starting sh1l with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.26 % No SInE strategy applied
% 0.26/0.26 % Search class: HHUNF-FFSF00-SHSSMFNN
% 0.26/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.26 % SubtermCWHack with pid 2888002 completed with status 0
% 0.26/0.26 % Result found by SubtermCWHack
% 0.26/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.26 % Starting sh1l with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.26 % No SInE strategy applied
% 0.26/0.26 % Search class: HHUNF-FFSF00-SHSSMFNN
% 0.26/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.26 % Preprocessing time : 0.001 s
% 0.26/0.26
% 0.26/0.26 % Proof found!
% 0.26/0.26 % SZS status Theorem
% 0.26/0.26 % SZS output start CNFRefutation
% See solution above
% 0.26/0.26 % Parsed axioms : 39
% 0.26/0.26 % Removed by relevancy pruning/SinE : 0
% 0.26/0.26 % Initial clauses : 27
% 0.26/0.26 % Removed in clause preprocessing : 23
% 0.26/0.26 % Initial clauses in saturation : 4
% 0.26/0.26 % Processed clauses : 4
% 0.26/0.26 % ...of these trivial : 0
% 0.26/0.26 % ...subsumed : 0
% 0.26/0.26 % ...remaining for further processing : 4
% 0.26/0.26 % Other redundant clauses eliminated : 0
% 0.26/0.26 % Clauses deleted for lack of memory : 0
% 0.26/0.26 % Backward-subsumed : 0
% 0.26/0.26 % Backward-rewritten : 0
% 0.26/0.26 % Generated clauses : 1
% 0.26/0.26 % ...of the previous two non-redundant : 0
% 0.26/0.26 % ...aggressively subsumed : 0
% 0.26/0.26 % Contextual simplify-reflections : 0
% 0.26/0.26 % Paramodulations : 1
% 0.26/0.26 % Factorizations : 0
% 0.26/0.26 % NegExts : 0
% 0.26/0.26 % Equation resolutions : 0
% 0.26/0.26 % Disequality decompositions : 0
% 0.26/0.26 % Total rewrite steps : 0
% 0.26/0.26 % ...of those cached : 0
% 0.26/0.26 % Propositional unsat checks : 0
% 0.26/0.26 % Propositional check models : 0
% 0.26/0.26 % Propositional check unsatisfiable : 0
% 0.26/0.26 % Propositional clauses : 0
% 0.26/0.26 % Propositional clauses after purity: 0
% 0.26/0.26 % Propositional unsat core size : 0
% 0.26/0.26 % Propositional preprocessing time : 0.000
% 0.26/0.26 % Propositional encoding time : 0.000
% 0.26/0.26 % Propositional solver time : 0.000
% 0.26/0.26 % Success case prop preproc time : 0.000
% 0.26/0.26 % Success case prop encoding time : 0.000
% 0.26/0.26 % Success case prop solver time : 0.000
% 0.26/0.26 % Current number of processed clauses : 4
% 0.26/0.26 % Positive orientable unit clauses : 2
% 0.26/0.26 % Positive unorientable unit clauses: 0
% 0.26/0.26 % Negative unit clauses : 1
% 0.26/0.26 % Non-unit-clauses : 1
% 0.26/0.26 % Current number of unprocessed clauses: 0
% 0.26/0.26 % ...number of literals in the above : 0
% 0.26/0.26 % Current number of archived formulas : 0
% 0.26/0.26 % Current number of archived clauses : 0
% 0.26/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.26 % Non-unit clause-clause subsumptions : 0
% 0.26/0.26 % Unit Clause-clause subsumption calls : 0
% 0.26/0.26 % Rewrite failures with RHS unbound : 0
% 0.26/0.26 % BW rewrite match attempts : 0
% 0.26/0.26 % BW rewrite match successes : 0
% 0.26/0.26 % Condensation attempts : 0
% 0.26/0.26 % Condensation successes : 0
% 0.26/0.26 % Termbank termtop insertions : 1037
% 0.26/0.26 % Search garbage collected termcells : 185
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.001 s
% 0.26/0.26 % System time : 0.004 s
% 0.26/0.26 % Total time : 0.005 s
% 0.26/0.26 % Maximum resident set size: 3616 pages
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.005 s
% 0.26/0.26 % System time : 0.007 s
% 0.26/0.26 % Total time : 0.011 s
% 0.26/0.26 % Maximum resident set size: 4864 pages
% 0.26/0.26 % E exiting
%------------------------------------------------------------------------------