%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL591^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:12:57 AM UTC 2026
% Result : Theorem 0.26s 0.37s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 38 ( 4 ~; 0 |; 2 &; 26 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 23 ( 8 ^; 15 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_34,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_42,type,
epred1_0: $i > $i > $o ).
thf(decl_43,type,
epred2_0: $i > $o ).
thf(decl_44,type,
esk1_0: $i ).
thf(decl_45,type,
esk2_0: $i ).
thf(thm,conjecture,
! [X10: $i > $i > $o,X19: $i > $o] :
( ( mvalid @ X19 )
=> ( mvalid @ ( mbox @ X10 @ X19 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xo7PjnFBQF/E---3.1_1029040.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/sandbox/tmp/tmp.xo7PjnFBQF/E---3.1_1029040.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.xo7PjnFBQF/E---3.1_1029040.p',mvalid) ).
thf(c_0_3,negated_conjecture,
~ ! [X10: $i > $i > $o,X19: $i > $o] :
( ( mvalid @ X19 )
=> ( mvalid @ ( mbox @ X10 @ X19 ) ) ),
inference(assume_negation,[status(cth)],[thm]) ).
thf(c_0_4,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_5,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_6,negated_conjecture,
~ ! [X10: $i > $i > $o,X19: $i > $o] :
( ! [X22: $i] : ( X19 @ X22 )
=> ! [X24: $i,X23: $i] :
( ( X10 @ X24 @ X23 )
=> ( X19 @ X23 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X27: $i] :
( ( epred2_0 @ X27 )
& ( epred1_0 @ esk1_0 @ esk2_0 )
& ~ ( epred2_0 @ 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_6])])])])]) ).
thf(c_0_8,negated_conjecture,
~ ( epred2_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] : ( epred2_0 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL591^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n004.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 09:06:22 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.32 Running higher-order theorem proving
% 0.26/0.34 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.xo7PjnFBQF/E---3.1_1029040.p
% 0.26/0.37 % Version: 3.5.1-ho
% 0.26/0.37 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.37 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.37 % Starting sh1l with 300s (1) cores
% 0.26/0.37 % Starting post_as_ho10 with 300s (1) cores
% 0.26/0.37 % post_as_ho1 with pid 1029054 completed with status 0
% 0.26/0.37 % Result found by post_as_ho1
% 0.26/0.37 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.37 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.37 % No SInE strategy applied
% 0.26/0.37 % Search class: HUUNF-FFSF00-SHSSMFNN
% 0.26/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.37 % SubtermCWHack with pid 1029057 completed with status 0
% 0.26/0.37 % Result found by SubtermCWHack
% 0.26/0.37 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.26/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.37 % Starting new_ho_9 with 1500s (5) cores
% 0.26/0.37 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.37 % No SInE strategy applied
% 0.26/0.37 % Search class: HUUNF-FFSF00-SHSSMFNN
% 0.26/0.37 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.37 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.37 % Preprocessing time : 0.002 s
% 0.26/0.37
% 0.26/0.37 % Proof found!
% 0.26/0.37 % SZS status Theorem
% 0.26/0.37 % SZS output start CNFRefutation
% See solution above
% 0.26/0.37 % Parsed axioms : 36
% 0.26/0.37 % Removed by relevancy pruning/SinE : 0
% 0.26/0.37 % Initial clauses : 23
% 0.26/0.37 % Removed in clause preprocessing : 20
% 0.26/0.37 % Initial clauses in saturation : 3
% 0.26/0.37 % Processed clauses : 2
% 0.26/0.37 % ...of these trivial : 0
% 0.26/0.37 % ...subsumed : 0
% 0.26/0.37 % ...remaining for further processing : 1
% 0.26/0.37 % Other redundant clauses eliminated : 0
% 0.26/0.37 % Clauses deleted for lack of memory : 0
% 0.26/0.37 % Backward-subsumed : 0
% 0.26/0.37 % Backward-rewritten : 0
% 0.26/0.37 % Generated clauses : 0
% 0.26/0.37 % ...of the previous two non-redundant : 0
% 0.26/0.37 % ...aggressively subsumed : 0
% 0.26/0.37 % Contextual simplify-reflections : 0
% 0.26/0.37 % Paramodulations : 0
% 0.26/0.37 % Factorizations : 0
% 0.26/0.37 % NegExts : 0
% 0.26/0.37 % Equation resolutions : 0
% 0.26/0.37 % Disequality decompositions : 0
% 0.26/0.37 % Total rewrite steps : 1
% 0.26/0.37 % ...of those cached : 0
% 0.26/0.37 % Propositional unsat checks : 0
% 0.26/0.37 % Propositional check models : 0
% 0.26/0.37 % Propositional check unsatisfiable : 0
% 0.26/0.37 % Propositional clauses : 0
% 0.26/0.37 % Propositional clauses after purity: 0
% 0.26/0.37 % Propositional unsat core size : 0
% 0.26/0.37 % Propositional preprocessing time : 0.000
% 0.26/0.37 % Propositional encoding time : 0.000
% 0.26/0.37 % Propositional solver time : 0.000
% 0.26/0.37 % Success case prop preproc time : 0.000
% 0.26/0.37 % Success case prop encoding time : 0.000
% 0.26/0.37 % Success case prop solver time : 0.000
% 0.26/0.37 % Current number of processed clauses : 1
% 0.26/0.37 % Positive orientable unit clauses : 1
% 0.26/0.37 % Positive unorientable unit clauses: 0
% 0.26/0.37 % Negative unit clauses : 0
% 0.26/0.37 % Non-unit-clauses : 0
% 0.26/0.37 % Current number of unprocessed clauses: 1
% 0.26/0.37 % ...number of literals in the above : 1
% 0.26/0.37 % Current number of archived formulas : 0
% 0.26/0.37 % Current number of archived clauses : 0
% 0.26/0.37 % Clause-clause subsumption calls (NU) : 0
% 0.26/0.37 % Rec. Clause-clause subsumption calls : 0
% 0.26/0.37 % Non-unit clause-clause subsumptions : 0
% 0.26/0.37 % Unit Clause-clause subsumption calls : 0
% 0.26/0.37 % Rewrite failures with RHS unbound : 0
% 0.26/0.37 % BW rewrite match attempts : 0
% 0.26/0.37 % BW rewrite match successes : 0
% 0.26/0.37 % Condensation attempts : 0
% 0.26/0.37 % Condensation successes : 0
% 0.26/0.37 % Termbank termtop insertions : 911
% 0.26/0.37 % Search garbage collected termcells : 161
% 0.26/0.37
% 0.26/0.37 % -------------------------------------------------
% 0.26/0.37 % User time : 0.006 s
% 0.26/0.37 % System time : 0.001 s
% 0.26/0.37 % Total time : 0.007 s
% 0.26/0.37 % Maximum resident set size: 3664 pages
% 0.26/0.37
% 0.26/0.37 % -------------------------------------------------
% 0.26/0.37 % User time : 0.007 s
% 0.26/0.37 % System time : 0.006 s
% 0.26/0.37 % Total time : 0.013 s
% 0.26/0.37 % Maximum resident set size: 4864 pages
% 0.26/0.37 % E exiting
%------------------------------------------------------------------------------