%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL594^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 : n012.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.06s 0.24s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 11 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 75 ( 11 ~; 7 |; 1 &; 53 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 46 ( 28 ^; 15 !; 3 ?; 46 :)
% 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,
epred1_1: ( $i > $i > $o ) > $i > $o ).
thf(decl_43,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oPyGgyiYn6/E---3.1_4027429.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oPyGgyiYn6/E---3.1_4027429.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oPyGgyiYn6/E---3.1_4027429.p',mor) ).
thf(thm,conjecture,
? [X10: $i > $i > $o] :
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ X19 ) @ X19 ) ),
file('/export/starexec/sandbox2/tmp/tmp.oPyGgyiYn6/E---3.1_4027429.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.oPyGgyiYn6/E---3.1_4027429.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.oPyGgyiYn6/E---3.1_4027429.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,
~ ? [X10: $i > $i > $o] :
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ X10 @ X19 ) @ X19 ) ),
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,
~ ? [X10: $i > $i > $o] :
! [X19: $i > $o,X23: $i] :
( ~ ! [X22: $i] :
( ( X10 @ X23 @ X22 )
=> ( X19 @ X22 ) )
| ( X19 @ X23 ) ),
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,
! [X24: $i > $i > $o,X27: $i] :
( ( ~ ( X24 @ ( esk1_1 @ X24 ) @ X27 )
| ( epred1_1 @ X24 @ X27 ) )
& ~ ( epred1_1 @ X24 @ ( esk1_1 @ X24 ) ) ),
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,
! [X10: $i > $i > $o,X1: $i] :
( ( epred1_1 @ X10 @ X1 )
| ~ ( X10 @ ( esk1_1 @ X10 ) @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X10: $i > $i > $o] :
~ ( epred1_1 @ X10 @ ( esk1_1 @ X10 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i] :
( epred1_1
@ ^ [Z0: $i,Z1: $i] : $true
@ X1 ),
inference(primitive_enumeration,[status(thm)],[c_0_15]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_16,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL594^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n012.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Tue Sep 29 09:10:48 UTC 2026
% 0.06/0.17 % CPUTime :
% 0.06/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21 Running higher-order theorem proving
% 0.06/0.23 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.oPyGgyiYn6/E---3.1_4027429.p
% 0.06/0.24 % Version: 3.5.1-ho
% 0.06/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.06/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.06/0.24 % Starting sh1l with 300s (1) cores
% 0.06/0.24 % Starting post_as_ho10 with 300s (1) cores
% 0.06/0.24 % new_ho_9 with pid 4027442 completed with status 0
% 0.06/0.24 % Result found by new_ho_9
% 0.06/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.06/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.24 % No SInE strategy applied
% 0.06/0.24 % Search class: HHUNF-FFSF11-SHSSMMBN
% 0.06/0.24 % partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.06/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.24 % Starting new_ho_9 with 151s (1) cores
% 0.06/0.24 % Starting new_bool_3 with 136s (1) cores
% 0.06/0.24 % Starting new_bool_2 with 136s (1) cores
% 0.06/0.24 % Starting ehoh_best8_lambda with 136s (1) cores
% 0.06/0.24 % SubtermCWHack with pid 4027446 completed with status 10
% 0.06/0.24 % Starting sh1l with 136s (1) cores
% 0.06/0.24 % new_ho_9 with pid 4027448 completed with status 10
% 0.06/0.24 % Starting ehoh_best2_full_lfho with 669s (1) cores
% 0.06/0.24 % new_bool_3 with pid 4027451 completed with status 0
% 0.06/0.24 % Result found by new_bool_3
% 0.06/0.24 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.06/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.06/0.24 % Starting new_ho_9 with 1500s (5) cores
% 0.06/0.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.06/0.24 % No SInE strategy applied
% 0.06/0.24 % Search class: HHUNF-FFSF11-SHSSMMBN
% 0.06/0.24 % partial match(1): HGUNF-FFSF11-SHSSMMBN
% 0.06/0.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.06/0.24 % Starting SubtermCWHack with 136s (1) cores
% 0.06/0.24 % Starting new_ho_9 with 151s (1) cores
% 0.06/0.24 % Starting new_bool_3 with 136s (1) cores
% 0.06/0.24 % Preprocessing time : 0.001 s
% 0.06/0.24 % Presaturation interreduction done
% 0.06/0.24
% 0.06/0.24 % Proof found!
% 0.06/0.24 % SZS status Theorem
% 0.06/0.24 % SZS output start CNFRefutation
% See solution above
% 0.06/0.24 % Parsed axioms : 36
% 0.06/0.24 % Removed by relevancy pruning/SinE : 0
% 0.06/0.24 % Initial clauses : 22
% 0.06/0.24 % Removed in clause preprocessing : 20
% 0.06/0.24 % Initial clauses in saturation : 2
% 0.06/0.24 % Processed clauses : 5
% 0.06/0.24 % ...of these trivial : 0
% 0.06/0.24 % ...subsumed : 0
% 0.06/0.24 % ...remaining for further processing : 5
% 0.06/0.24 % Other redundant clauses eliminated : 0
% 0.06/0.24 % Clauses deleted for lack of memory : 0
% 0.06/0.24 % Backward-subsumed : 0
% 0.06/0.24 % Backward-rewritten : 0
% 0.06/0.24 % Generated clauses : 7
% 0.06/0.24 % ...of the previous two non-redundant : 5
% 0.06/0.24 % ...aggressively subsumed : 0
% 0.06/0.24 % Contextual simplify-reflections : 0
% 0.06/0.24 % Paramodulations : 1
% 0.06/0.24 % Factorizations : 0
% 0.06/0.24 % NegExts : 0
% 0.06/0.24 % Equation resolutions : 0
% 0.06/0.24 % Disequality decompositions : 0
% 0.06/0.24 % Total rewrite steps : 0
% 0.06/0.24 % ...of those cached : 0
% 0.06/0.24 % Propositional unsat checks : 0
% 0.06/0.24 % Propositional check models : 0
% 0.06/0.24 % Propositional check unsatisfiable : 0
% 0.06/0.24 % Propositional clauses : 0
% 0.06/0.24 % Propositional clauses after purity: 0
% 0.06/0.24 % Propositional unsat core size : 0
% 0.06/0.24 % Propositional preprocessing time : 0.000
% 0.06/0.24 % Propositional encoding time : 0.000
% 0.06/0.24 % Propositional solver time : 0.000
% 0.06/0.24 % Success case prop preproc time : 0.000
% 0.06/0.24 % Success case prop encoding time : 0.000
% 0.06/0.24 % Success case prop solver time : 0.000
% 0.06/0.24 % Current number of processed clauses : 3
% 0.06/0.24 % Positive orientable unit clauses : 1
% 0.06/0.24 % Positive unorientable unit clauses: 0
% 0.06/0.24 % Negative unit clauses : 1
% 0.06/0.24 % Non-unit-clauses : 1
% 0.06/0.24 % Current number of unprocessed clauses: 4
% 0.06/0.24 % ...number of literals in the above : 8
% 0.06/0.24 % Current number of archived formulas : 0
% 0.06/0.24 % Current number of archived clauses : 2
% 0.06/0.24 % Clause-clause subsumption calls (NU) : 0
% 0.06/0.24 % Rec. Clause-clause subsumption calls : 0
% 0.06/0.24 % Non-unit clause-clause subsumptions : 0
% 0.06/0.24 % Unit Clause-clause subsumption calls : 0
% 0.06/0.24 % Rewrite failures with RHS unbound : 0
% 0.06/0.24 % BW rewrite match attempts : 0
% 0.06/0.24 % BW rewrite match successes : 0
% 0.06/0.24 % Condensation attempts : 0
% 0.06/0.24 % Condensation successes : 0
% 0.06/0.24 % Termbank termtop insertions : 1212
% 0.06/0.24 % Search garbage collected termcells : 154
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.004 s
% 0.06/0.24 % System time : 0.005 s
% 0.06/0.24 % Total time : 0.009 s
% 0.06/0.24 % Maximum resident set size: 3664 pages
% 0.06/0.24
% 0.06/0.24 % -------------------------------------------------
% 0.06/0.24 % User time : 0.009 s
% 0.06/0.24 % System time : 0.012 s
% 0.06/0.24 % Total time : 0.021 s
% 0.06/0.24 % Maximum resident set size: 4864 pages
% 0.06/0.24 % E exiting
%------------------------------------------------------------------------------