%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV126^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:35:04 AM UTC 2026
% Result : Theorem 0.10s 0.24s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 15 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 0 equ; 0 cnn)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 266 ( 20 ~; 32 |; 17 &; 179 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 60 ( 0 ^; 60 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: ( a > a > $o ) > $o ).
thf(decl_24,type,
epred2_0: a > a > $o ).
thf(decl_25,type,
epred3_0: a > a > $o ).
thf(decl_26,type,
esk1_0: a ).
thf(decl_27,type,
esk2_0: a ).
thf(decl_28,type,
esk3_1: ( a > a > $o ) > a ).
thf(decl_29,type,
esk4_1: ( a > a > $o ) > a ).
thf(decl_30,type,
epred4_0: a > a > $o ).
thf(decl_31,type,
epred5_2: a > a > a > a > $o ).
thf(decl_32,type,
epred6_2: a > a > a > a > $o ).
thf(cTHM252B_pme,conjecture,
! [X1: ( a > a > $o ) > $o,X2: a > a > $o,X3: a > a > $o,X4: a,X5: a] :
( ! [X6: a > a > $o] :
( ( ! [X7: a,X8: a] :
( ( ( X2 @ X7 @ X8 )
| ( X3 @ X7 @ X8 ) )
=> ( X6 @ X7 @ X8 ) )
& ( X1 @ X6 ) )
=> ( X6 @ X4 @ X5 ) )
=> ! [X6: a > a > $o] :
( ( ! [X7: a,X8: a] :
( ( ! [X9: a > a > $o] :
( ( ! [X10: a,X11: a] :
( ( X2 @ X10 @ X11 )
=> ( X9 @ X10 @ X11 ) )
& ( X1 @ X9 ) )
=> ( X9 @ X7 @ X8 ) )
| ! [X9: a > a > $o] :
( ( ! [X10: a,X11: a] :
( ( X3 @ X10 @ X11 )
=> ( X9 @ X10 @ X11 ) )
& ( X1 @ X9 ) )
=> ( X9 @ X7 @ X8 ) ) )
=> ( X6 @ X7 @ X8 ) )
& ( X1 @ X6 ) )
=> ( X6 @ X4 @ X5 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KRdKTsyWoz/E---3.1_1783550.p',cTHM252B_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( a > a > $o ) > $o,X2: a > a > $o,X3: a > a > $o,X4: a,X5: a] :
( ! [X6: a > a > $o] :
( ( ! [X7: a,X8: a] :
( ( ( X2 @ X7 @ X8 )
| ( X3 @ X7 @ X8 ) )
=> ( X6 @ X7 @ X8 ) )
& ( X1 @ X6 ) )
=> ( X6 @ X4 @ X5 ) )
=> ! [X6: a > a > $o] :
( ( ! [X7: a,X8: a] :
( ( ! [X9: a > a > $o] :
( ( ! [X10: a,X11: a] :
( ( X2 @ X10 @ X11 )
=> ( X9 @ X10 @ X11 ) )
& ( X1 @ X9 ) )
=> ( X9 @ X7 @ X8 ) )
| ! [X9: a > a > $o] :
( ( ! [X10: a,X11: a] :
( ( X3 @ X10 @ X11 )
=> ( X9 @ X10 @ X11 ) )
& ( X1 @ X9 ) )
=> ( X9 @ X7 @ X8 ) ) )
=> ( X6 @ X7 @ X8 ) )
& ( X1 @ X6 ) )
=> ( X6 @ X4 @ X5 ) ) ),
inference(assume_negation,[status(cth)],[cTHM252B_pme]) ).
thf(c_0_2,negated_conjecture,
! [X34: a > a > $o,X38: a,X39: a,X41: a,X42: a,X44: a,X45: a] :
( ( ( epred2_0 @ ( esk3_1 @ X34 ) @ ( esk4_1 @ X34 ) )
| ( epred3_0 @ ( esk3_1 @ X34 ) @ ( esk4_1 @ X34 ) )
| ~ ( epred1_0 @ X34 )
| ( X34 @ esk1_0 @ esk2_0 ) )
& ( ~ ( X34 @ ( esk3_1 @ X34 ) @ ( esk4_1 @ X34 ) )
| ~ ( epred1_0 @ X34 )
| ( X34 @ esk1_0 @ esk2_0 ) )
& ( ~ ( epred2_0 @ X41 @ X42 )
| ( epred5_2 @ X38 @ X39 @ X41 @ X42 )
| ( epred4_0 @ X38 @ X39 ) )
& ( ( epred1_0 @ ( epred5_2 @ X38 @ X39 ) )
| ( epred4_0 @ X38 @ X39 ) )
& ( ~ ( epred5_2 @ X38 @ X39 @ X38 @ X39 )
| ( epred4_0 @ X38 @ X39 ) )
& ( ~ ( epred3_0 @ X44 @ X45 )
| ( epred6_2 @ X38 @ X39 @ X44 @ X45 )
| ( epred4_0 @ X38 @ X39 ) )
& ( ( epred1_0 @ ( epred6_2 @ X38 @ X39 ) )
| ( epred4_0 @ X38 @ X39 ) )
& ( ~ ( epred6_2 @ X38 @ X39 @ X38 @ X39 )
| ( epred4_0 @ X38 @ X39 ) )
& ( epred1_0 @ epred4_0 )
& ~ ( epred4_0 @ esk1_0 @ esk2_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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X4: a,X5: a] :
( ( epred4_0 @ X4 @ X5 )
| ~ ( epred6_2 @ X4 @ X5 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X4: a,X8: a,X7: a,X5: a] :
( ( epred6_2 @ X7 @ X8 @ X4 @ X5 )
| ( epred4_0 @ X7 @ X8 )
| ~ ( epred3_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X4: a,X5: a] :
( ( epred4_0 @ X4 @ X5 )
| ~ ( epred5_2 @ X4 @ X5 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X4: a,X8: a,X7: a,X5: a] :
( ( epred5_2 @ X7 @ X8 @ X4 @ X5 )
| ( epred4_0 @ X7 @ X8 )
| ~ ( epred2_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: a,X5: a] :
( ( epred4_0 @ X4 @ X5 )
| ~ ( epred3_0 @ X4 @ X5 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > a > $o] :
( ( epred2_0 @ ( esk3_1 @ X2 ) @ ( esk4_1 @ X2 ) )
| ( epred3_0 @ ( esk3_1 @ X2 ) @ ( esk4_1 @ X2 ) )
| ( X2 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X4: a,X5: a] :
( ( epred4_0 @ X4 @ X5 )
| ~ ( epred2_0 @ X4 @ X5 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X2: a > a > $o] :
( ( X2 @ esk1_0 @ esk2_0 )
| ~ ( X2 @ ( esk3_1 @ X2 ) @ ( esk4_1 @ X2 ) )
| ~ ( epred1_0 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X2: a > a > $o] :
( ( epred4_0 @ ( esk3_1 @ X2 ) @ ( esk4_1 @ X2 ) )
| ( X2 @ esk1_0 @ esk2_0 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
epred1_0 @ epred4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
~ ( epred4_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV126^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.17 % Computer : n005.cluster.edu
% 0.10/0.17 % Model : x86_64 x86_64
% 0.10/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17 % Memory : 8046.5625MB
% 0.10/0.17 % OS : Linux 6.8.0-71-generic
% 0.10/0.17 % CPULimit : 300
% 0.10/0.17 % WCLimit : 300
% 0.10/0.17 % DateTime : Tue Sep 29 15:12:15 UTC 2026
% 0.10/0.17 % CPUTime :
% 0.10/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.21 Running higher-order theorem proving
% 0.10/0.22 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.KRdKTsyWoz/E---3.1_1783550.p
% 0.10/0.24 % Version: 3.5.1-ho
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.24 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting sh2lt with 1200s (4) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.24 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.24 % Starting ehoh_best3_rw with 300s (1) cores
% 0.10/0.24 % full_lambda_6 with pid 1783565 completed with status 0
% 0.10/0.24 % Result found by full_lambda_6
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.24 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting sh2lt with 1200s (4) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.10/0.24 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.10/0.24 % Search class: HGUNF-FFSF11-SHHFFSBN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % SubtermCWHack with pid 1783570 completed with status 0
% 0.10/0.24 % Result found by SubtermCWHack
% 0.10/0.24 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.24 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.24 % Starting sh2lt with 1200s (4) cores
% 0.10/0.24 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.24 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.10/0.24 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.10/0.24 % Search class: HGUNF-FFSF11-SHHFFSBN
% 0.10/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.24 % Preprocessing time : 0.001 s
% 0.10/0.24
% 0.10/0.24 % Proof found!
% 0.10/0.24 % SZS status Theorem
% 0.10/0.24 % SZS output start CNFRefutation
% See solution above
% 0.10/0.24 % Parsed axioms : 2
% 0.10/0.24 % Removed by relevancy pruning/SinE : 1
% 0.10/0.24 % Initial clauses : 10
% 0.10/0.24 % Removed in clause preprocessing : 0
% 0.10/0.24 % Initial clauses in saturation : 10
% 0.10/0.24 % Processed clauses : 15
% 0.10/0.24 % ...of these trivial : 0
% 0.10/0.24 % ...subsumed : 0
% 0.10/0.24 % ...remaining for further processing : 15
% 0.10/0.24 % Other redundant clauses eliminated : 0
% 0.10/0.24 % Clauses deleted for lack of memory : 0
% 0.10/0.24 % Backward-subsumed : 1
% 0.10/0.24 % Backward-rewritten : 0
% 0.10/0.24 % Generated clauses : 8
% 0.10/0.24 % ...of the previous two non-redundant : 7
% 0.10/0.24 % ...aggressively subsumed : 0
% 0.10/0.24 % Contextual simplify-reflections : 1
% 0.10/0.24 % Paramodulations : 8
% 0.10/0.24 % Factorizations : 0
% 0.10/0.24 % NegExts : 0
% 0.10/0.24 % Equation resolutions : 0
% 0.10/0.24 % Disequality decompositions : 0
% 0.10/0.24 % Total rewrite steps : 1
% 0.10/0.24 % ...of those cached : 0
% 0.10/0.24 % Propositional unsat checks : 0
% 0.10/0.24 % Propositional check models : 0
% 0.10/0.24 % Propositional check unsatisfiable : 0
% 0.10/0.24 % Propositional clauses : 0
% 0.10/0.24 % Propositional clauses after purity: 0
% 0.10/0.24 % Propositional unsat core size : 0
% 0.10/0.24 % Propositional preprocessing time : 0.000
% 0.10/0.24 % Propositional encoding time : 0.000
% 0.10/0.24 % Propositional solver time : 0.000
% 0.10/0.24 % Success case prop preproc time : 0.000
% 0.10/0.24 % Success case prop encoding time : 0.000
% 0.10/0.24 % Success case prop solver time : 0.000
% 0.10/0.24 % Current number of processed clauses : 14
% 0.10/0.24 % Positive orientable unit clauses : 1
% 0.10/0.24 % Positive unorientable unit clauses: 0
% 0.10/0.24 % Negative unit clauses : 1
% 0.10/0.24 % Non-unit-clauses : 12
% 0.10/0.24 % Current number of unprocessed clauses: 2
% 0.10/0.24 % ...number of literals in the above : 8
% 0.10/0.24 % Current number of archived formulas : 0
% 0.10/0.24 % Current number of archived clauses : 1
% 0.10/0.24 % Clause-clause subsumption calls (NU) : 36
% 0.10/0.24 % Rec. Clause-clause subsumption calls : 30
% 0.10/0.24 % Non-unit clause-clause subsumptions : 2
% 0.10/0.24 % Unit Clause-clause subsumption calls : 0
% 0.10/0.24 % Rewrite failures with RHS unbound : 0
% 0.10/0.24 % BW rewrite match attempts : 0
% 0.10/0.24 % BW rewrite match successes : 0
% 0.10/0.24 % Condensation attempts : 0
% 0.10/0.24 % Condensation successes : 0
% 0.10/0.24 % Termbank termtop insertions : 1419
% 0.10/0.24 % Search garbage collected termcells : 485
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.002 s
% 0.10/0.24 % System time : 0.005 s
% 0.10/0.24 % Total time : 0.007 s
% 0.10/0.24 % Maximum resident set size: 3896 pages
% 0.10/0.24
% 0.10/0.24 % -------------------------------------------------
% 0.10/0.24 % User time : 0.002 s
% 0.10/0.24 % System time : 0.009 s
% 0.10/0.24 % Total time : 0.011 s
% 0.10/0.24 % Maximum resident set size: 4864 pages
% 0.10/0.24 % E exiting
%------------------------------------------------------------------------------