%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL701^1 : TPTP v9.3.1. Bugfixed v5.0.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:12:02 AM UTC 2026
% Result : Theorem 0.08s 0.15s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 27 ( 21 unt; 0 typ; 0 def)
% Number of atoms : 65 ( 18 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 131 ( 26 ~; 15 |; 2 &; 85 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 50 ( 50 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 2 con; 0-3 aty)
% Number of variables : 70 ( 42 ^; 25 !; 3 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_42,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
epred1_0: $i > $i > $o ).
thf(decl_55,type,
esk1_1: $i > $i ).
thf(decl_56,type,
esk2_0: $i ).
thf(decl_57,type,
epred2_0: $i > $o ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mdia) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mnot) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mbox) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mimplies) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mor) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mserial @ X13 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ X18 ) @ ( mdia @ X13 @ X18 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',conj) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mserial) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mforall_prop) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jX25bAA9W0/E---3.1_4064937.p',mvalid) ).
thf(c_0_9,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X21: $i] :
( ~ ( Z0 @ Z2 @ X21 )
| ~ ( Z1 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ( mserial @ X13 )
=> ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ X18 ) @ ( mdia @ X13 @ X18 ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_15,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_16,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X21: $i] :
( ~ ( Z0 @ Z2 @ X21 )
| ~ ( Z1 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
thf(c_0_18,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_19,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_20,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X22: $i] :
? [X23: $i] : ( X13 @ X22 @ X23 )
=> ! [X27: $i,X26: $i > $o] :
( ~ ! [X24: $i] :
( ~ ( X13 @ X27 @ X24 )
| ( X26 @ X24 ) )
| ~ ! [X25: $i] :
( ~ ( X13 @ X27 @ X25 )
| ~ ( X26 @ X25 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_14]),c_0_15]),c_0_11]),c_0_16]),c_0_17]),c_0_18]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X29: $i,X33: $i,X34: $i] :
( ( epred1_0 @ X29 @ ( esk1_1 @ X29 ) )
& ( ~ ( epred1_0 @ esk2_0 @ X33 )
| ( epred2_0 @ X33 ) )
& ( ~ ( epred1_0 @ esk2_0 @ X34 )
| ~ ( epred2_0 @ X34 ) ) ),
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_20])])])])]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ~ ( epred1_0 @ esk2_0 @ X3 )
| ~ ( epred2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X3: $i] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
~ ( epred1_0 @ esk2_0 @ X3 ),
inference(csr,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] : ( epred1_0 @ X3 @ ( esk1_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL701^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 09:40:48 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.13 Running higher-order theorem proving
% 0.08/0.14 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.jX25bAA9W0/E---3.1_4064937.p
% 0.08/0.15 % Version: 3.5.1-ho
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.08/0.15 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.08/0.15 % Starting sh5l with 300s (1) cores
% 0.08/0.15 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.15 % lpo9_lambda_fix with pid 4064951 completed with status 0
% 0.08/0.15 % Result found by lpo9_lambda_fix
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.08/0.15 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.08/0.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.15 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.15 % Search class: HHHNF-FFSF11-SHHSMFNN
% 0.08/0.15 % partial match(1): HHHNF-FFSF11-SHSSMFNN
% 0.08/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.15 % SubtermCWHack with pid 4064954 completed with status 0
% 0.08/0.15 % Result found by SubtermCWHack
% 0.08/0.15 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.08/0.15 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.15 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.08/0.15 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.08/0.15 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.15 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.15 % Search class: HHHNF-FFSF11-SHHSMFNN
% 0.08/0.15 % partial match(1): HHHNF-FFSF11-SHSSMFNN
% 0.08/0.15 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.15 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.15 % Preprocessing time : 0.001 s
% 0.08/0.15
% 0.08/0.15 % Proof found!
% 0.08/0.15 % SZS status Theorem
% 0.08/0.15 % SZS output start CNFRefutation
% See solution above
% 0.08/0.15 % Parsed axioms : 64
% 0.08/0.15 % Removed by relevancy pruning/SinE : 50
% 0.08/0.15 % Initial clauses : 3
% 0.08/0.15 % Removed in clause preprocessing : 0
% 0.08/0.15 % Initial clauses in saturation : 3
% 0.08/0.15 % Processed clauses : 4
% 0.08/0.15 % ...of these trivial : 0
% 0.08/0.15 % ...subsumed : 0
% 0.08/0.15 % ...remaining for further processing : 4
% 0.08/0.15 % Other redundant clauses eliminated : 0
% 0.08/0.15 % Clauses deleted for lack of memory : 0
% 0.08/0.15 % Backward-subsumed : 1
% 0.08/0.15 % Backward-rewritten : 0
% 0.08/0.15 % Generated clauses : 2
% 0.08/0.15 % ...of the previous two non-redundant : 1
% 0.08/0.15 % ...aggressively subsumed : 0
% 0.08/0.15 % Contextual simplify-reflections : 1
% 0.08/0.15 % Paramodulations : 2
% 0.08/0.15 % Factorizations : 0
% 0.08/0.15 % NegExts : 0
% 0.08/0.15 % Equation resolutions : 0
% 0.08/0.15 % Disequality decompositions : 0
% 0.08/0.15 % Total rewrite steps : 0
% 0.08/0.15 % ...of those cached : 0
% 0.08/0.15 % Propositional unsat checks : 0
% 0.08/0.15 % Propositional check models : 0
% 0.08/0.15 % Propositional check unsatisfiable : 0
% 0.08/0.15 % Propositional clauses : 0
% 0.08/0.15 % Propositional clauses after purity: 0
% 0.08/0.15 % Propositional unsat core size : 0
% 0.08/0.15 % Propositional preprocessing time : 0.000
% 0.08/0.15 % Propositional encoding time : 0.000
% 0.08/0.15 % Propositional solver time : 0.000
% 0.08/0.15 % Success case prop preproc time : 0.000
% 0.08/0.15 % Success case prop encoding time : 0.000
% 0.08/0.15 % Success case prop solver time : 0.000
% 0.08/0.15 % Current number of processed clauses : 3
% 0.08/0.15 % Positive orientable unit clauses : 2
% 0.08/0.15 % Positive unorientable unit clauses: 0
% 0.08/0.15 % Negative unit clauses : 1
% 0.08/0.15 % Non-unit-clauses : 0
% 0.08/0.15 % Current number of unprocessed clauses: 0
% 0.08/0.15 % ...number of literals in the above : 0
% 0.08/0.15 % Current number of archived formulas : 0
% 0.08/0.15 % Current number of archived clauses : 1
% 0.08/0.15 % Clause-clause subsumption calls (NU) : 1
% 0.08/0.15 % Rec. Clause-clause subsumption calls : 1
% 0.08/0.15 % Non-unit clause-clause subsumptions : 1
% 0.08/0.15 % Unit Clause-clause subsumption calls : 1
% 0.08/0.15 % Rewrite failures with RHS unbound : 0
% 0.08/0.15 % BW rewrite match attempts : 0
% 0.08/0.15 % BW rewrite match successes : 0
% 0.08/0.15 % Condensation attempts : 0
% 0.08/0.15 % Condensation successes : 0
% 0.08/0.15 % Termbank termtop insertions : 1385
% 0.08/0.15 % Search garbage collected termcells : 580
% 0.08/0.15
% 0.08/0.15 % -------------------------------------------------
% 0.08/0.15 % User time : 0.003 s
% 0.08/0.15 % System time : 0.001 s
% 0.08/0.15 % Total time : 0.003 s
% 0.08/0.15 % Maximum resident set size: 3692 pages
% 0.08/0.15
% 0.08/0.15 % -------------------------------------------------
% 0.08/0.15 % User time : 0.003 s
% 0.08/0.15 % System time : 0.004 s
% 0.08/0.15 % Total time : 0.007 s
% 0.08/0.15 % Maximum resident set size: 4864 pages
% 0.08/0.15 % E exiting
%------------------------------------------------------------------------------