%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV090^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:34:51 AM UTC 2026
% Result : Theorem 0.25s 0.39s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 5 equ; 0 cnn)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 158 ( 17 ~; 13 |; 17 &; 104 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 39 ( 39 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 0 ^; 35 !; 8 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > a > $o ).
thf(decl_24,type,
esk1_1: a > a ).
thf(decl_25,type,
epred2_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).
thf(decl_26,type,
epred3_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).
thf(decl_27,type,
epred4_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).
thf(decl_28,type,
epred5_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).
thf(decl_29,type,
epred6_1: ( ( a > $o ) > ( a > $o ) > $o ) > a > $o ).
thf(decl_34,type,
epred11_0: $o ).
thf(cTHM165_pme,conjecture,
( ? [X1: a > a > $o] :
( ! [X2: a] :
? [X3: a] : ( X1 @ X2 @ X3 )
& ! [X2: a] :
~ ( X1 @ X2 @ X2 )
& ! [X2: a,X4: a,X5: a] :
( ( ( X1 @ X2 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X2 @ X5 ) ) )
=> ? [X6: ( a > $o ) > ( a > $o ) > $o] :
( ! [X7: a > $o] :
? [X8: a > $o] : ( X6 @ X7 @ X8 )
& ! [X9: a > $o] :
~ ( X6 @ X9 @ X9 )
& ! [X10: a > $o,X11: a > $o,X12: a > $o] :
( ( ( X6 @ X10 @ X11 )
& ( X6 @ X11 @ X12 ) )
=> ( X6 @ X10 @ X12 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LPA8t6IhKh/E---3.1_1413520.p',cTHM165_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ? [X1: a > a > $o] :
( ! [X2: a] :
? [X3: a] : ( X1 @ X2 @ X3 )
& ! [X2: a] :
~ ( X1 @ X2 @ X2 )
& ! [X2: a,X4: a,X5: a] :
( ( ( X1 @ X2 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X2 @ X5 ) ) )
=> ? [X6: ( a > $o ) > ( a > $o ) > $o] :
( ! [X7: a > $o] :
? [X8: a > $o] : ( X6 @ X7 @ X8 )
& ! [X9: a > $o] :
~ ( X6 @ X9 @ X9 )
& ! [X10: a > $o,X11: a > $o,X12: a > $o] :
( ( ( X6 @ X10 @ X11 )
& ( X6 @ X11 @ X12 ) )
=> ( X6 @ X10 @ X12 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM165_pme]) ).
thf(c_0_2,negated_conjecture,
! [X28: a,X30: a,X31: a,X32: a,X33: a,X34: ( a > $o ) > ( a > $o ) > $o,X36: a > $o] :
( ( epred1_0 @ X28 @ ( esk1_1 @ X28 ) )
& ~ ( epred1_0 @ X30 @ X30 )
& ( ~ ( epred1_0 @ X31 @ X32 )
| ~ ( epred1_0 @ X32 @ X33 )
| ( epred1_0 @ X31 @ X33 ) )
& ( ( X34 @ ( epred4_1 @ X34 ) @ ( epred5_1 @ X34 ) )
| ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
| ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ X34 ) ) )
& ( ( X34 @ ( epred5_1 @ X34 ) @ ( epred6_1 @ X34 ) )
| ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
| ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ X34 ) ) )
& ( ~ ( X34 @ ( epred4_1 @ X34 ) @ ( epred6_1 @ X34 ) )
| ~ ( X34 @ ( epred2_1 @ X34 ) @ X36 )
| ( X34 @ ( epred3_1 @ X34 ) @ ( epred3_1 @ 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_1])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X6: ( a > $o ) > ( a > $o ) > $o,X7: a > $o] :
( ( X6 @ ( epred4_1 @ X6 ) @ ( epred5_1 @ X6 ) )
| ( X6 @ ( epred3_1 @ X6 ) @ ( epred3_1 @ X6 ) )
| ~ ( X6 @ ( epred2_1 @ X6 ) @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X7: a > $o] :
( ( ( epred2_1 @ $neq )
= X7 )
| ( ( epred5_1 @ $neq )
!= ( epred4_1 @ $neq ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X7: a > $o,X8: a > $o] :
( ( X7 = X8 )
| ( ( epred5_1 @ $neq )
!= ( epred4_1 @ $neq ) ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4])])]) ).
thf(c_0_6,negated_conjecture,
! [X7: a > $o,X8: a > $o,X49: a] :
( ( ( X7 @ X49 )
<=> ( X8 @ X49 ) )
| ( ( epred5_1 @ $neq )
!= ( epred4_1 @ $neq ) ) ),
inference(arg_cong,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
~ epred11_0,
inference(dynamic_cnf,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEV090^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n002.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 15:12:24 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.33 Running higher-order theorem proving
% 0.25/0.34 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.LPA8t6IhKh/E---3.1_1413520.p
% 0.25/0.39 % Version: 3.5.1-ho
% 0.25/0.39 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.25/0.39 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39 % Starting sh2lt with 1200s (4) cores
% 0.25/0.39 % Starting new_ho_10_unif with 300s (1) cores
% 0.25/0.39 % Starting full_lambda_6 with 300s (1) cores
% 0.25/0.39 % Starting post_as_ho1 with 300s (1) cores
% 0.25/0.39 % Starting ehoh_best3_rw with 300s (1) cores
% 0.25/0.39 % sh2lt with pid 1413533 completed with status 0
% 0.25/0.39 % Result found by sh2lt
% 0.25/0.39 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.25/0.39 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39 % Starting sh2lt with 1200s (4) cores
% 0.25/0.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.39 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.39 % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.25/0.39 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.25/0.39 % Starting SubtermCWHack with 109s (1) cores
% 0.25/0.39 % Starting sh2lt with 121s (1) cores
% 0.25/0.39 % Starting ehoh_best_sine_rwall with 109s (1) cores
% 0.25/0.39 % Starting sh5l with 109s (1) cores
% 0.25/0.39 % sh2lt with pid 1413539 completed with status 0
% 0.25/0.39 % Result found by sh2lt
% 0.25/0.39 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.25/0.39 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.39 % Starting sh2lt with 1200s (4) cores
% 0.25/0.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.25/0.39 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.25/0.39 % Search class: HGUNF-FFSF11-SHHFFMBN
% 0.25/0.39 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.25/0.39 % Starting SubtermCWHack with 109s (1) cores
% 0.25/0.39 % Starting sh2lt with 121s (1) cores
% 0.25/0.39 % Preprocessing time : 0.001 s
% 0.25/0.39 % Presaturation interreduction done
% 0.25/0.39
% 0.25/0.39 % Proof found!
% 0.25/0.39 % SZS status Theorem
% 0.25/0.39 % SZS output start CNFRefutation
% See solution above
% 0.25/0.39 % Parsed axioms : 2
% 0.25/0.39 % Removed by relevancy pruning/SinE : 1
% 0.25/0.39 % Initial clauses : 6
% 0.25/0.39 % Removed in clause preprocessing : 0
% 0.25/0.39 % Initial clauses in saturation : 6
% 0.25/0.39 % Processed clauses : 95
% 0.25/0.39 % ...of these trivial : 11
% 0.25/0.39 % ...subsumed : 5
% 0.25/0.39 % ...remaining for further processing : 78
% 0.25/0.39 % Other redundant clauses eliminated : 1
% 0.25/0.39 % Clauses deleted for lack of memory : 0
% 0.25/0.39 % Backward-subsumed : 3
% 0.25/0.39 % Backward-rewritten : 1
% 0.25/0.39 % Generated clauses : 178
% 0.25/0.39 % ...of the previous two non-redundant : 163
% 0.25/0.39 % ...aggressively subsumed : 0
% 0.25/0.39 % Contextual simplify-reflections : 1
% 0.25/0.39 % Paramodulations : 77
% 0.25/0.39 % Factorizations : 2
% 0.25/0.39 % NegExts : 5
% 0.25/0.39 % Equation resolutions : 1
% 0.25/0.39 % Disequality decompositions : 0
% 0.25/0.39 % Total rewrite steps : 25
% 0.25/0.39 % ...of those cached : 19
% 0.25/0.39 % Propositional unsat checks : 0
% 0.25/0.39 % Propositional check models : 0
% 0.25/0.39 % Propositional check unsatisfiable : 0
% 0.25/0.39 % Propositional clauses : 0
% 0.25/0.39 % Propositional clauses after purity: 0
% 0.25/0.39 % Propositional unsat core size : 0
% 0.25/0.39 % Propositional preprocessing time : 0.000
% 0.25/0.39 % Propositional encoding time : 0.000
% 0.25/0.39 % Propositional solver time : 0.000
% 0.25/0.39 % Success case prop preproc time : 0.000
% 0.25/0.39 % Success case prop encoding time : 0.000
% 0.25/0.39 % Success case prop solver time : 0.000
% 0.25/0.39 % Current number of processed clauses : 62
% 0.25/0.39 % Positive orientable unit clauses : 6
% 0.25/0.39 % Positive unorientable unit clauses: 0
% 0.25/0.39 % Negative unit clauses : 48
% 0.25/0.39 % Non-unit-clauses : 8
% 0.25/0.39 % Current number of unprocessed clauses: 77
% 0.25/0.39 % ...number of literals in the above : 234
% 0.25/0.39 % Current number of archived formulas : 0
% 0.25/0.39 % Current number of archived clauses : 16
% 0.25/0.39 % Clause-clause subsumption calls (NU) : 29
% 0.25/0.39 % Rec. Clause-clause subsumption calls : 28
% 0.25/0.39 % Non-unit clause-clause subsumptions : 6
% 0.25/0.39 % Unit Clause-clause subsumption calls : 1229
% 0.25/0.39 % Rewrite failures with RHS unbound : 0
% 0.25/0.39 % BW rewrite match attempts : 1
% 0.25/0.39 % BW rewrite match successes : 1
% 0.25/0.39 % Condensation attempts : 0
% 0.25/0.39 % Condensation successes : 0
% 0.25/0.39 % Termbank termtop insertions : 20130
% 0.25/0.39 % Search garbage collected termcells : 301
% 0.25/0.39
% 0.25/0.39 % -------------------------------------------------
% 0.25/0.39 % User time : 0.016 s
% 0.25/0.39 % System time : 0.004 s
% 0.25/0.39 % Total time : 0.019 s
% 0.25/0.39 % Maximum resident set size: 3640 pages
% 0.25/0.39
% 0.25/0.39 % -------------------------------------------------
% 0.25/0.39 % User time : 0.055 s
% 0.25/0.39 % System time : 0.017 s
% 0.25/0.39 % Total time : 0.071 s
% 0.25/0.39 % Maximum resident set size: 4864 pages
% 0.25/0.39 % E exiting
%------------------------------------------------------------------------------