%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL714^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:04 AM UTC 2026
% Result : Theorem 0.39s 0.38s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 25 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 159 ( 30 ~; 20 |; 6 &; 97 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 78 ( 42 ^; 36 !; 0 ?; 78 :)
% 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_45,type,
mpartially_functional: ( $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_0: $i ).
thf(decl_56,type,
esk2_0: $i ).
thf(decl_57,type,
esk3_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mor) ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mdia) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mbox) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mdia @ X13 @ X18 ) @ ( mbox @ X13 @ X18 ) ) ) )
=> ( mpartially_functional @ X13 ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',conj) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mforall_prop) ).
thf(mpartially_functional,axiom,
( mpartially_functional
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X15 @ X17 ) )
=> ( X16 = X17 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mpartially_functional) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6FLsXUFuSU/E---3.1_4064870.p',mvalid) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_13,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_14,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mdia @ X13 @ X18 ) @ ( mbox @ X13 @ X18 ) ) ) )
=> ( mpartially_functional @ X13 ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_15,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_9,c_0_10]),c_0_11]) ).
thf(c_0_16,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_17,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
thf(c_0_18,plain,
( mpartially_functional
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X15 @ X17 ) )
=> ( X16 = X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mpartially_functional]) ).
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] :
( ! [X26: $i,X25: $i > $o] :
( ~ ~ ! [X23: $i] :
( ~ ( X13 @ X26 @ X23 )
| ~ ( X25 @ X23 ) )
| ! [X24: $i] :
( ~ ( X13 @ X26 @ X24 )
| ( X25 @ X24 ) ) )
=> ! [X27: $i,X28: $i,X29: $i] :
( ( ( X13 @ X27 @ X28 )
& ( X13 @ X27 @ X29 ) )
=> ( X28 = X29 ) ) ),
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_16]),c_0_13]),c_0_17]),c_0_18]),c_0_19]) ).
thf(c_0_21,negated_conjecture,
! [X31: $i,X32: $i > $o,X33: $i,X34: $i] :
( ( ~ ( epred1_0 @ X31 @ X33 )
| ~ ( X32 @ X33 )
| ~ ( epred1_0 @ X31 @ X34 )
| ( X32 @ X34 ) )
& ( epred1_0 @ esk1_0 @ esk2_0 )
& ( epred1_0 @ esk1_0 @ esk3_0 )
& ( esk2_0 != esk3_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_20])])])])]) ).
thf(c_0_22,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i,X15: $i] :
( ( X4 @ X15 )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( X4 @ X14 )
| ~ ( epred1_0 @ X3 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X15: $i,X14: $i,X3: $i] :
( ( X3 = X14 )
| ~ ( epred1_0 @ X15 @ X14 )
| ~ ( epred1_0 @ X15 @ X3 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_22]) ).
thf(c_0_24,negated_conjecture,
epred1_0 @ esk1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( X3 = esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_26,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_27,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL714^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.26 % Computer : n018.cluster.edu
% 0.10/0.26 % Model : x86_64 x86_64
% 0.10/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.26 % Memory : 8046.5625MB
% 0.10/0.26 % OS : Linux 6.8.0-71-generic
% 0.10/0.26 % CPULimit : 300
% 0.10/0.26 % WCLimit : 300
% 0.10/0.26 % DateTime : Tue Sep 29 09:51:41 UTC 2026
% 0.10/0.27 % CPUTime :
% 0.10/0.27 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.33 Running higher-order theorem proving
% 0.25/0.35 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.6FLsXUFuSU/E---3.1_4064870.p
% 0.39/0.38 % Version: 3.5.1-ho
% 0.39/0.38 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.39/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.38 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.39/0.38 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.39/0.38 % Starting sh5l with 300s (1) cores
% 0.39/0.38 % Starting ho_unfolding_6 with 300s (1) cores
% 0.39/0.38 % ehoh_best2_full_lfho with pid 4064884 completed with status 0
% 0.39/0.38 % Result found by ehoh_best2_full_lfho
% 0.39/0.38 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.39/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.38 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.39/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.38 % No SInE strategy applied
% 0.39/0.38 % Search class: HHUSF-FFSF00-SHHSMSBN
% 0.39/0.38 % partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.39/0.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.38 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.38 % Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.39/0.38 % Starting sh5l with 136s (1) cores
% 0.39/0.38 % Starting new_bool_1 with 136s (1) cores
% 0.39/0.38 % Starting new_bool_2 with 136s (1) cores
% 0.39/0.38 % SubtermCWHack with pid 4064888 completed with status 10
% 0.39/0.38 % Starting new_bool_9 with 136s (1) cores
% 0.39/0.38 % ehoh_best2_full_lfho with pid 4064889 completed with status 0
% 0.39/0.38 % Result found by ehoh_best2_full_lfho
% 0.39/0.38 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.39/0.38 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.38 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.39/0.38 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.38 % No SInE strategy applied
% 0.39/0.38 % Search class: HHUSF-FFSF00-SHHSMSBN
% 0.39/0.38 % partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.39/0.38 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.38 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.38 % Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.39/0.38 % Preprocessing time : 0.002 s
% 0.39/0.38
% 0.39/0.38 % Proof found!
% 0.39/0.38 % SZS status Theorem
% 0.39/0.38 % SZS output start CNFRefutation
% See solution above
% 0.39/0.38 % Parsed axioms : 64
% 0.39/0.38 % Removed by relevancy pruning/SinE : 0
% 0.39/0.38 % Initial clauses : 36
% 0.39/0.38 % Removed in clause preprocessing : 32
% 0.39/0.38 % Initial clauses in saturation : 4
% 0.39/0.38 % Processed clauses : 9
% 0.39/0.38 % ...of these trivial : 0
% 0.39/0.38 % ...subsumed : 1
% 0.39/0.38 % ...remaining for further processing : 8
% 0.39/0.38 % Other redundant clauses eliminated : 0
% 0.39/0.38 % Clauses deleted for lack of memory : 0
% 0.39/0.38 % Backward-subsumed : 0
% 0.39/0.38 % Backward-rewritten : 0
% 0.39/0.38 % Generated clauses : 17
% 0.39/0.38 % ...of the previous two non-redundant : 10
% 0.39/0.38 % ...aggressively subsumed : 0
% 0.39/0.38 % Contextual simplify-reflections : 0
% 0.39/0.38 % Paramodulations : 9
% 0.39/0.38 % Factorizations : 0
% 0.39/0.38 % NegExts : 0
% 0.39/0.38 % Equation resolutions : 0
% 0.39/0.38 % Disequality decompositions : 0
% 0.39/0.38 % Total rewrite steps : 8
% 0.39/0.38 % ...of those cached : 6
% 0.39/0.38 % Propositional unsat checks : 0
% 0.39/0.38 % Propositional check models : 0
% 0.39/0.38 % Propositional check unsatisfiable : 0
% 0.39/0.38 % Propositional clauses : 0
% 0.39/0.38 % Propositional clauses after purity: 0
% 0.39/0.38 % Propositional unsat core size : 0
% 0.39/0.38 % Propositional preprocessing time : 0.000
% 0.39/0.38 % Propositional encoding time : 0.000
% 0.39/0.38 % Propositional solver time : 0.000
% 0.39/0.38 % Success case prop preproc time : 0.000
% 0.39/0.38 % Success case prop encoding time : 0.000
% 0.39/0.38 % Success case prop solver time : 0.000
% 0.39/0.38 % Current number of processed clauses : 8
% 0.39/0.38 % Positive orientable unit clauses : 2
% 0.39/0.38 % Positive unorientable unit clauses: 0
% 0.39/0.38 % Negative unit clauses : 1
% 0.39/0.38 % Non-unit-clauses : 5
% 0.39/0.38 % Current number of unprocessed clauses: 5
% 0.39/0.38 % ...number of literals in the above : 18
% 0.39/0.38 % Current number of archived formulas : 0
% 0.39/0.38 % Current number of archived clauses : 0
% 0.39/0.38 % Clause-clause subsumption calls (NU) : 4
% 0.39/0.38 % Rec. Clause-clause subsumption calls : 3
% 0.39/0.38 % Non-unit clause-clause subsumptions : 1
% 0.39/0.38 % Unit Clause-clause subsumption calls : 0
% 0.39/0.38 % Rewrite failures with RHS unbound : 0
% 0.39/0.38 % BW rewrite match attempts : 0
% 0.39/0.38 % BW rewrite match successes : 0
% 0.39/0.38 % Condensation attempts : 0
% 0.39/0.38 % Condensation successes : 0
% 0.39/0.38 % Termbank termtop insertions : 2521
% 0.39/0.38 % Search garbage collected termcells : 546
% 0.39/0.38
% 0.39/0.38 % -------------------------------------------------
% 0.39/0.38 % User time : 0.011 s
% 0.39/0.38 % System time : 0.002 s
% 0.39/0.38 % Total time : 0.013 s
% 0.39/0.38 % Maximum resident set size: 3948 pages
% 0.39/0.38
% 0.39/0.38 % -------------------------------------------------
% 0.39/0.38 % User time : 0.023 s
% 0.39/0.38 % System time : 0.015 s
% 0.39/0.38 % Total time : 0.038 s
% 0.39/0.38 % Maximum resident set size: 4864 pages
% 0.39/0.38 % E exiting
%------------------------------------------------------------------------------