%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL623^1 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:13:00 AM UTC 2026
% Result : Theorem 0.09s 0.26s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 98 ( 11 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 275 ( 31 ~; 41 |; 5 &; 190 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 33 ( 33 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 66 ( 26 ^; 40 !; 0 ?; 66 :)
% 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,
r: $i > $i > $o ).
thf(decl_43,type,
esk1_2: ( $i > $o ) > $i > $i ).
thf(decl_44,type,
epred1_0: $i > $o ).
thf(decl_45,type,
esk2_0: $i ).
thf(decl_46,type,
esk3_1: $i > $i ).
thf(decl_47,type,
esk4_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',mor) ).
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.jsZKUbCOj4/E---3.1_1007784.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',mvalid) ).
thf(loeb,conjecture,
! [X11: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X11 ) @ X11 ) ) @ ( mbox @ r @ X11 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',loeb) ).
thf(gl,axiom,
! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X19 ) @ X19 ) ) @ ( mbox @ r @ X19 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jsZKUbCOj4/E---3.1_1007784.p',gl) ).
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,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_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,
~ ! [X11: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ r @ ( mimpl @ ( mbox @ r @ X11 ) @ X11 ) ) @ ( mbox @ r @ X11 ) ) ),
inference(assume_negation,[status(cth)],[loeb]) ).
thf(c_0_14,plain,
! [X19: $i > $o,X25: $i] :
( ~ ! [X23: $i] :
( ( r @ X25 @ X23 )
=> ( ~ ! [X22: $i] :
( ( r @ X23 @ X22 )
=> ( X19 @ X22 ) )
| ( X19 @ X23 ) ) )
| ! [X24: $i] :
( ( r @ X25 @ X24 )
=> ( X19 @ X24 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[gl,c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_15,negated_conjecture,
~ ! [X11: $i > $o,X29: $i] :
( ~ ! [X27: $i] :
( ( r @ X29 @ X27 )
=> ( ~ ! [X26: $i] :
( ( r @ X27 @ X26 )
=> ( X11 @ X26 ) )
| ( X11 @ X27 ) ) )
| ! [X28: $i] :
( ( r @ X29 @ X28 )
=> ( X11 @ X28 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_10]),c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
! [X30: $i > $o,X31: $i,X33: $i,X34: $i] :
( ( ( r @ X31 @ ( esk1_2 @ X30 @ X31 ) )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) )
& ( ~ ( r @ ( esk1_2 @ X30 @ X31 ) @ X33 )
| ( X30 @ X33 )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) )
& ( ~ ( X30 @ ( esk1_2 @ X30 @ X31 ) )
| ~ ( r @ X31 @ X34 )
| ( X30 @ X34 ) ) ),
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_14])])])])])]) ).
thf(c_0_17,negated_conjecture,
! [X37: $i] :
( ( ( r @ X37 @ ( esk3_1 @ X37 ) )
| ( epred1_0 @ X37 )
| ~ ( r @ esk2_0 @ X37 ) )
& ( ~ ( epred1_0 @ ( esk3_1 @ X37 ) )
| ( epred1_0 @ X37 )
| ~ ( r @ esk2_0 @ X37 ) )
& ( r @ esk2_0 @ esk4_0 )
& ~ ( epred1_0 @ esk4_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_15])])])])])]) ).
thf(c_0_18,plain,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( r @ X1 @ ( esk1_2 @ X2 @ X1 ) )
| ( X2 @ X3 )
| ~ ( r @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
r @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i] :
( ( r @ X1 @ ( esk3_1 @ X1 ) )
| ( epred1_0 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i > $o] :
( ( r @ esk2_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,plain,
! [X1: $i,X3: $i,X2: $i > $o,X12: $i] :
( ( X2 @ X3 )
| ( X2 @ X12 )
| ~ ( r @ ( esk1_2 @ X2 @ X1 ) @ X3 )
| ~ ( r @ X1 @ X12 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i > $o] :
( ( r @ ( esk1_2 @ X2 @ esk2_0 ) @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i > $o,X1: $i] :
( ( X2 @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 )
| ( X2 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( epred1_0 @ ( esk3_1 @ X1 ) )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_26,negated_conjecture,
! [X2: $i > $o] :
( ( X2 @ ( esk3_1 @ ( esk1_2 @ X2 @ esk2_0 ) ) )
| ( epred1_0 @ ( esk1_2 @ X2 @ esk2_0 ) )
| ( X2 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
thf(c_0_27,negated_conjecture,
~ ( epred1_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_28,negated_conjecture,
( ( epred1_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ) )
| ~ ( r @ esk2_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
thf(c_0_29,plain,
! [X1: $i,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
| ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) )
| ~ ( r @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_30,negated_conjecture,
epred1_0 @ ( esk1_2 @ epred1_0 @ esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( r @ esk2_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL623^1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n001.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Tue Sep 29 09:34:35 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/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.jsZKUbCOj4/E---3.1_1007784.p
% 0.09/0.26 % Version: 3.5.1-ho
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.26 % Starting sh1l with 300s (1) cores
% 0.09/0.26 % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.26 % new_ho_9 with pid 1007797 completed with status 0
% 0.09/0.26 % Result found by new_ho_9
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGUNF-FFSF21-SHSSMSBN
% 0.09/0.26 % partial match(2): HGHNF-FFMF21-SHSSMSBN
% 0.09/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.26 % Starting new_ho_9 with 901s (1) cores
% 0.09/0.26 % Starting post_as_ho11 with 151s (1) cores
% 0.09/0.26 % Starting pre_casc_8 with 151s (1) cores
% 0.09/0.26 % Starting post_as_ho2 with 146s (1) cores
% 0.09/0.26 % new_ho_9 with pid 1007804 completed with status 0
% 0.09/0.26 % Result found by new_ho_9
% 0.09/0.26 % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.26 % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.26 % No SInE strategy applied
% 0.09/0.26 % Search class: HGUNF-FFSF21-SHSSMSBN
% 0.09/0.26 % partial match(2): HGHNF-FFMF21-SHSSMSBN
% 0.09/0.26 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.26 % Starting SubtermCWHack with 151s (1) cores
% 0.09/0.26 % Starting new_ho_9 with 901s (1) cores
% 0.09/0.26 % Preprocessing time : 0.001 s
% 0.09/0.26 % Presaturation interreduction done
% 0.09/0.26
% 0.09/0.26 % Proof found!
% 0.09/0.26 % SZS status Theorem
% 0.09/0.26 % SZS output start CNFRefutation
% See solution above
% 0.09/0.26 % Parsed axioms : 38
% 0.09/0.26 % Removed by relevancy pruning/SinE : 0
% 0.09/0.26 % Initial clauses : 28
% 0.09/0.26 % Removed in clause preprocessing : 21
% 0.09/0.26 % Initial clauses in saturation : 7
% 0.09/0.26 % Processed clauses : 29
% 0.09/0.26 % ...of these trivial : 0
% 0.09/0.26 % ...subsumed : 3
% 0.09/0.26 % ...remaining for further processing : 26
% 0.09/0.26 % Other redundant clauses eliminated : 0
% 0.09/0.26 % Clauses deleted for lack of memory : 0
% 0.09/0.26 % Backward-subsumed : 3
% 0.09/0.26 % Backward-rewritten : 1
% 0.09/0.26 % Generated clauses : 58
% 0.09/0.26 % ...of the previous two non-redundant : 45
% 0.09/0.26 % ...aggressively subsumed : 0
% 0.09/0.26 % Contextual simplify-reflections : 0
% 0.09/0.26 % Paramodulations : 54
% 0.09/0.26 % Factorizations : 4
% 0.09/0.26 % NegExts : 0
% 0.09/0.26 % Equation resolutions : 0
% 0.09/0.26 % Disequality decompositions : 0
% 0.09/0.26 % Total rewrite steps : 9
% 0.09/0.26 % ...of those cached : 6
% 0.09/0.26 % Propositional unsat checks : 0
% 0.09/0.26 % Propositional check models : 0
% 0.09/0.26 % Propositional check unsatisfiable : 0
% 0.09/0.26 % Propositional clauses : 0
% 0.09/0.26 % Propositional clauses after purity: 0
% 0.09/0.26 % Propositional unsat core size : 0
% 0.09/0.26 % Propositional preprocessing time : 0.000
% 0.09/0.26 % Propositional encoding time : 0.000
% 0.09/0.26 % Propositional solver time : 0.000
% 0.09/0.26 % Success case prop preproc time : 0.000
% 0.09/0.26 % Success case prop encoding time : 0.000
% 0.09/0.26 % Success case prop solver time : 0.000
% 0.09/0.26 % Current number of processed clauses : 15
% 0.30/0.26 % Positive orientable unit clauses : 3
% 0.30/0.26 % Positive unorientable unit clauses: 0
% 0.30/0.26 % Negative unit clauses : 1
% 0.30/0.26 % Non-unit-clauses : 11
% 0.30/0.26 % Current number of unprocessed clauses: 28
% 0.30/0.26 % ...number of literals in the above : 137
% 0.30/0.26 % Current number of archived formulas : 0
% 0.30/0.26 % Current number of archived clauses : 11
% 0.30/0.26 % Clause-clause subsumption calls (NU) : 56
% 0.30/0.26 % Rec. Clause-clause subsumption calls : 28
% 0.30/0.26 % Non-unit clause-clause subsumptions : 6
% 0.30/0.26 % Unit Clause-clause subsumption calls : 0
% 0.30/0.26 % Rewrite failures with RHS unbound : 0
% 0.30/0.26 % BW rewrite match attempts : 1
% 0.30/0.26 % BW rewrite match successes : 1
% 0.30/0.26 % Condensation attempts : 29
% 0.30/0.26 % Condensation successes : 0
% 0.30/0.26 % Termbank termtop insertions : 3167
% 0.30/0.26 % Search garbage collected termcells : 482
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.005 s
% 0.30/0.26 % System time : 0.006 s
% 0.30/0.26 % Total time : 0.011 s
% 0.30/0.26 % Maximum resident set size: 3668 pages
% 0.30/0.26
% 0.30/0.26 % -------------------------------------------------
% 0.30/0.26 % User time : 0.016 s
% 0.30/0.26 % System time : 0.019 s
% 0.30/0.26 % Total time : 0.034 s
% 0.30/0.26 % Maximum resident set size: 4608 pages
% 0.30/0.26 % E exiting
%------------------------------------------------------------------------------