%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWV442^1 : TPTP v9.3.1. Released v3.7.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:39:44 AM UTC 2026
% Result : Theorem 0.24s 0.33s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 33 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 88 ( 25 equ; 0 cnn)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 134 ( 15 ~; 11 |; 3 &; 92 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 17 ( 15 usr; 4 con; 0-3 aty)
% Number of variables : 77 ( 54 ^; 23 !; 0 ?; 77 :)
% 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,
reli: $i > $i > $o ).
thf(decl_44,type,
cs4_atom: ( $i > $o ) > $i > $o ).
thf(decl_47,type,
cs4_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_54,type,
bl_atom: ( $i > $o ) > $i > $o ).
thf(decl_58,type,
bl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_63,type,
bl_valid: ( $i > $o ) > $o ).
thf(decl_71,type,
epred1_0: $i > $o ).
thf(decl_72,type,
esk7_0: $i ).
thf(decl_73,type,
esk8_0: $i ).
thf(decl_74,type,
esk9_0: $i ).
thf(mimpl,axiom,
( mimpl
= ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',mimpl) ).
thf(mnot,axiom,
( mnot
= ( ^ [X2: $i > $o,X3: $i] :
~ ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',mor) ).
thf(cs4_atom,axiom,
( cs4_atom
= ( ^ [X11: $i > $o] : ( mbox @ reli @ X11 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',cs4_atom) ).
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.NlYuRItGCl/E---3.1_1428996.p',mbox) ).
thf(cs4_impl,axiom,
( cs4_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ reli @ ( mimpl @ X19 @ X20 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',cs4_impl) ).
thf(bl_atom,axiom,
( bl_atom
= ( ^ [X11: $i > $o] : ( cs4_atom @ X11 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',bl_atom) ).
thf(bl_impl,axiom,
( bl_impl
= ( ^ [X19: $i > $o,X20: $i > $o] : ( cs4_impl @ X19 @ X20 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',bl_impl) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X11: $i > $o] :
! [X15: $i] : ( X11 @ X15 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',mvalid) ).
thf(bl_id,conjecture,
! [X19: $i > $o] : ( bl_valid @ ( bl_impl @ ( bl_atom @ X19 ) @ ( bl_atom @ X19 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',bl_id) ).
thf(bl_valid_def,axiom,
( bl_valid
= ( ^ [Z0: $i > $o] :
! [X46: $i] : ( Z0 @ X46 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.NlYuRItGCl/E---3.1_1428996.p',bl_valid_def) ).
thf(c_0_11,plain,
( mimpl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimpl]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
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,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X30: $i] :
( ( reli @ Z1 @ X30 )
=> ( Z0 @ X30 ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_atom]) ).
thf(c_0_15,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_16,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X31: $i] :
( ( reli @ Z2 @ X31 )
=> ( ~ ( Z0 @ X31 )
| ( Z1 @ X31 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[cs4_impl]) ).
thf(c_0_17,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_11,c_0_12]),c_0_13]) ).
thf(c_0_18,plain,
( bl_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X37: $i] :
( ( reli @ Z1 @ X37 )
=> ( Z0 @ X37 ) ) ) ),
inference(fof_simplification,[status(thm)],[bl_atom]) ).
thf(c_0_19,plain,
( cs4_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X30: $i] :
( ( reli @ Z1 @ X30 )
=> ( Z0 @ X30 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_20,plain,
( bl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X39: $i] :
( ( reli @ Z2 @ X39 )
=> ( ~ ( Z0 @ X39 )
| ( Z1 @ X39 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[bl_impl]) ).
thf(c_0_21,plain,
( cs4_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X31: $i] :
( ( reli @ Z2 @ X31 )
=> ( ~ ( Z0 @ X31 )
| ( Z1 @ X31 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
thf(c_0_22,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X15: $i] : ( Z0 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_23,negated_conjecture,
~ ! [X19: $i > $o] : ( bl_valid @ ( bl_impl @ ( bl_atom @ X19 ) @ ( bl_atom @ X19 ) ) ),
inference(assume_negation,[status(cth)],[bl_id]) ).
thf(c_0_24,plain,
( bl_atom
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X37: $i] :
( ( reli @ Z1 @ X37 )
=> ( Z0 @ X37 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_25,plain,
( bl_impl
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
! [X39: $i] :
( ( reli @ Z2 @ X39 )
=> ( ~ ( Z0 @ X39 )
| ( Z1 @ X39 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_26,axiom,
( bl_valid
= ( ^ [Z0: $i > $o] :
! [X46: $i] : ( Z0 @ X46 ) ) ),
inference(apply_def,[status(thm)],[bl_valid_def,c_0_22]) ).
thf(c_0_27,negated_conjecture,
~ ! [X19: $i > $o,X71: $i,X70: $i] :
( ( reli @ X71 @ X70 )
=> ( ~ ! [X68: $i] :
( ( reli @ X70 @ X68 )
=> ( X19 @ X68 ) )
| ! [X69: $i] :
( ( reli @ X70 @ X69 )
=> ( X19 @ X69 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X101: $i] :
( ( reli @ esk7_0 @ esk8_0 )
& ( ~ ( reli @ esk8_0 @ X101 )
| ( epred1_0 @ X101 ) )
& ( reli @ esk8_0 @ esk9_0 )
& ~ ( epred1_0 @ esk9_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_27])])])])]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ( epred1_0 @ X1 )
| ~ ( reli @ esk8_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_30,negated_conjecture,
reli @ esk8_0 @ esk9_0,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
~ ( epred1_0 @ esk9_0 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV442^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 % Computer : n001.cluster.edu
% 0.07/0.21 % Model : x86_64 x86_64
% 0.07/0.21 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.21 % Memory : 8046.5625MB
% 0.07/0.21 % OS : Linux 6.8.0-71-generic
% 0.07/0.21 % CPULimit : 300
% 0.07/0.21 % WCLimit : 300
% 0.07/0.21 % DateTime : Tue Sep 29 16:10:20 UTC 2026
% 0.07/0.21 % CPUTime :
% 0.07/0.21 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.28 Running higher-order theorem proving
% 0.24/0.30 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.NlYuRItGCl/E---3.1_1428996.p
% 0.24/0.33 % Version: 3.5.1-ho
% 0.24/0.33 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.33 % Starting full_lambda_8 with 300s (1) cores
% 0.24/0.33 % post_as_ho11 with pid 1429011 completed with status 0
% 0.24/0.33 % Result found by post_as_ho11
% 0.24/0.33 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HGUNF-FFSF22-SHSSMMBN
% 0.24/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.33 % SubtermCWHack with pid 1429019 completed with status 0
% 0.24/0.33 % Result found by SubtermCWHack
% 0.24/0.33 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.33 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.33 % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.33 % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.33 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.33 % No SInE strategy applied
% 0.24/0.33 % Search class: HGUNF-FFSF22-SHSSMMBN
% 0.24/0.33 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.33 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.33 % Preprocessing time : 0.002 s
% 0.24/0.33
% 0.24/0.33 % Proof found!
% 0.24/0.33 % SZS status Theorem
% 0.24/0.33 % SZS output start CNFRefutation
% See solution above
% 0.24/0.33 % Parsed axioms : 84
% 0.24/0.33 % Removed by relevancy pruning/SinE : 0
% 0.24/0.33 % Initial clauses : 59
% 0.24/0.33 % Removed in clause preprocessing : 43
% 0.24/0.33 % Initial clauses in saturation : 16
% 0.24/0.33 % Processed clauses : 4
% 0.24/0.33 % ...of these trivial : 0
% 0.24/0.33 % ...subsumed : 0
% 0.24/0.33 % ...remaining for further processing : 4
% 0.24/0.33 % Other redundant clauses eliminated : 0
% 0.24/0.33 % Clauses deleted for lack of memory : 0
% 0.24/0.33 % Backward-subsumed : 0
% 0.24/0.33 % Backward-rewritten : 0
% 0.24/0.33 % Generated clauses : 1
% 0.24/0.33 % ...of the previous two non-redundant : 0
% 0.24/0.33 % ...aggressively subsumed : 0
% 0.24/0.33 % Contextual simplify-reflections : 0
% 0.24/0.33 % Paramodulations : 1
% 0.24/0.33 % Factorizations : 0
% 0.24/0.33 % NegExts : 0
% 0.24/0.33 % Equation resolutions : 0
% 0.24/0.33 % Disequality decompositions : 0
% 0.24/0.33 % Total rewrite steps : 0
% 0.24/0.33 % ...of those cached : 0
% 0.24/0.33 % Propositional unsat checks : 0
% 0.24/0.33 % Propositional check models : 0
% 0.24/0.33 % Propositional check unsatisfiable : 0
% 0.24/0.33 % Propositional clauses : 0
% 0.24/0.33 % Propositional clauses after purity: 0
% 0.24/0.33 % Propositional unsat core size : 0
% 0.24/0.33 % Propositional preprocessing time : 0.000
% 0.24/0.33 % Propositional encoding time : 0.000
% 0.24/0.33 % Propositional solver time : 0.000
% 0.24/0.33 % Success case prop preproc time : 0.000
% 0.24/0.33 % Success case prop encoding time : 0.000
% 0.24/0.33 % Success case prop solver time : 0.000
% 0.24/0.33 % Current number of processed clauses : 4
% 0.24/0.33 % Positive orientable unit clauses : 2
% 0.24/0.33 % Positive unorientable unit clauses: 0
% 0.24/0.33 % Negative unit clauses : 1
% 0.24/0.33 % Non-unit-clauses : 1
% 0.24/0.33 % Current number of unprocessed clauses: 12
% 0.24/0.33 % ...number of literals in the above : 40
% 0.24/0.33 % Current number of archived formulas : 0
% 0.24/0.33 % Current number of archived clauses : 0
% 0.24/0.33 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.33 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.33 % Non-unit clause-clause subsumptions : 0
% 0.24/0.33 % Unit Clause-clause subsumption calls : 0
% 0.24/0.33 % Rewrite failures with RHS unbound : 0
% 0.24/0.33 % BW rewrite match attempts : 0
% 0.24/0.33 % BW rewrite match successes : 0
% 0.24/0.33 % Condensation attempts : 0
% 0.24/0.33 % Condensation successes : 0
% 0.24/0.33 % Termbank termtop insertions : 3638
% 0.24/0.33 % Search garbage collected termcells : 1295
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.008 s
% 0.24/0.33 % System time : 0.004 s
% 0.24/0.33 % Total time : 0.012 s
% 0.24/0.33 % Maximum resident set size: 3900 pages
% 0.24/0.33
% 0.24/0.33 % -------------------------------------------------
% 0.24/0.33 % User time : 0.014 s
% 0.24/0.33 % System time : 0.006 s
% 0.24/0.33 % Total time : 0.020 s
% 0.24/0.33 % Maximum resident set size: 4864 pages
% 0.24/0.33 % E exiting
%------------------------------------------------------------------------------