%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEV258^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 : 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:36:22 AM UTC 2026
% Result : Theorem 0.21s 0.27s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 331 ( 72 equ; 0 cnn)
% Maximal formula atoms : 156 ( 55 avg)
% Number of connectives : 436 ( 141 ~; 123 |; 82 &; 75 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 14 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 112 ( 72 ^; 25 !; 15 ?; 112 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(decl_25,type,
epred3_0: ( a > $o ) > $o ).
thf(decl_26,type,
epred4_0: a > $o ).
thf(decl_27,type,
epred5_0: a > $o ).
thf(decl_28,type,
epred6_0: a > $o ).
thf(decl_29,type,
epred7_0: a > $o ).
thf(cDISCRETE_TOPOLOGY_pme,conjecture,
( ! [X1: a > $o] :
( ( X1
= ( ^ [X2: a] : ~ $true ) )
=> $true )
& ! [X1: a > $o] :
( ( X1
= ( ^ [X2: a] :
~ ~ $true ) )
=> $true )
& ! [X3: ( a > $o ) > $o,X1: a > $o] :
( ( ! [X4: a > $o] :
( ( X3 @ X4 )
=> $true )
& ( X1
= ( ^ [X2: a] :
? [X5: a > $o] :
( ( X3 @ X5 )
& ( X5 @ X2 ) ) ) ) )
=> $true )
& ! [X6: a > $o,X7: a > $o,X5: a > $o] :
( ( $true
& $true
& ( X5
= ( ^ [X2: a] :
( ( X6 @ X2 )
& ( X7 @ X2 ) ) ) ) )
=> $true ) ),
file('/export/starexec/sandbox2/tmp/tmp.HXQBz61R4n/E---3.1_1429902.p',cDISCRETE_TOPOLOGY_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a > $o] :
( ( X1
= ( ^ [X2: a] : ~ $true ) )
=> $true )
& ! [X1: a > $o] :
( ( X1
= ( ^ [X2: a] :
~ ~ $true ) )
=> $true )
& ! [X3: ( a > $o ) > $o,X1: a > $o] :
( ( ! [X4: a > $o] :
( ( X3 @ X4 )
=> $true )
& ( X1
= ( ^ [X2: a] :
? [X5: a > $o] :
( ( X3 @ X5 )
& ( X5 @ X2 ) ) ) ) )
=> $true )
& ! [X6: a > $o,X7: a > $o,X5: a > $o] :
( ( $true
& $true
& ( X5
= ( ^ [X2: a] :
( ( X6 @ X2 )
& ( X7 @ X2 ) ) ) ) )
=> $true ) ),
inference(assume_negation,[status(cth)],[cDISCRETE_TOPOLOGY_pme]) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X1: a > $o] :
( ( X1
= ( ^ [Z0: a] : ~ $true ) )
=> $true )
& ! [X1: a > $o] :
( ( X1
= ( ^ [Z0: a] :
~ ~ $true ) )
=> $true )
& ! [X3: ( a > $o ) > $o,X1: a > $o] :
( ( ! [X4: a > $o] :
( ( X3 @ X4 )
=> $true )
& ( X1
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( X3 @ X5 )
& ( X5 @ Z0 ) ) ) ) )
=> $true )
& ! [X6: a > $o,X7: a > $o,X5: a > $o] :
( ( $true
& ( X5
= ( ^ [Z0: a] :
( ( X6 @ Z0 )
& ( X7 @ Z0 ) ) ) ) )
=> $true ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X20: a > $o] :
( ( $true
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ~ $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( ~ $true
| ~ $true
| ~ $true
| ( epred1_0
= ( ^ [Z0: a] : ~ $true ) ) )
& ( $true
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ~ $true
| ~ ( epred3_0 @ X20 )
| $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ~ $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( $true
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( ~ $true
| ~ $true
| ( epred2_0
= ( ^ [Z0: a] :
~ ~ $true ) )
| ~ $true )
& ( $true
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ~ $true )
& ( ~ $true
| ~ ( epred3_0 @ X20 )
| $true
| ~ $true
| ~ $true )
& ( $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ~ $true )
& ( ~ $true
| ( epred4_0
= ( ^ [Z0: a] :
? [X5: a > $o] :
( ( epred3_0 @ X5 )
& ( X5 @ Z0 ) ) ) )
| ~ $true
| ~ $true )
& ( $true
| ~ $true
| ~ $true
| ~ $true )
& ( ( epred7_0
= ( ^ [Z0: a] :
( ( epred5_0 @ Z0 )
& ( epred6_0 @ Z0 ) ) ) )
| ~ $true
| ~ $true
| ~ $true )
& ( ~ $true
| ~ $true
| ~ $true
| ~ $true ) ),
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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
( ~ $true
| ~ $true
| ~ $true
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
$false,
inference(cn,[status(thm)],[c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV258^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n002.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:30:52 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 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.HXQBz61R4n/E---3.1_1429902.p
% 0.21/0.27 % Version: 3.5.1-ho
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.27 % Starting ehoh_best3_rw with 300s (1) cores
% 0.21/0.27 % full_lambda_6 with pid 1429917 completed with status 0
% 0.21/0.27 % Result found by full_lambda_6
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.21/0.27 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.27 % Search class: HGHPF-FFSM00-MHHFFFNN
% 0.21/0.27 % partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % SubtermCWHack with pid 1429920 completed with status 0
% 0.21/0.27 % Result found by SubtermCWHack
% 0.21/0.27 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.21/0.27 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27 % Starting sh2lt with 1200s (4) cores
% 0.21/0.27 % Starting new_ho_10_unif with 300s (1) cores
% 0.21/0.27 % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.21/0.27 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.21/0.27 % Search class: HGHPF-FFSM00-MHHFFFNN
% 0.21/0.27 % partial match(3): HUHPF-FFSF00-SHHFFFNN
% 0.21/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27 % Preprocessing time : 0.001 s
% 0.21/0.27
% 0.21/0.27 % Proof found!
% 0.21/0.27 % SZS status Theorem
% 0.21/0.27 % SZS output start CNFRefutation
% See solution above
% 0.21/0.27 % Parsed axioms : 2
% 0.21/0.27 % Removed by relevancy pruning/SinE : 1
% 0.21/0.27 % Initial clauses : 36
% 0.21/0.27 % Removed in clause preprocessing : 20
% 0.21/0.27 % Initial clauses in saturation : 16
% 0.21/0.27 % Processed clauses : 1
% 0.21/0.27 % ...of these trivial : 0
% 0.21/0.27 % ...subsumed : 0
% 0.21/0.27 % ...remaining for further processing : 0
% 0.21/0.27 % Other redundant clauses eliminated : 0
% 0.21/0.27 % Clauses deleted for lack of memory : 0
% 0.21/0.27 % Backward-subsumed : 0
% 0.21/0.27 % Backward-rewritten : 0
% 0.21/0.27 % Generated clauses : 0
% 0.21/0.27 % ...of the previous two non-redundant : 0
% 0.21/0.27 % ...aggressively subsumed : 0
% 0.21/0.27 % Contextual simplify-reflections : 0
% 0.21/0.27 % Paramodulations : 0
% 0.21/0.27 % Factorizations : 0
% 0.21/0.27 % NegExts : 0
% 0.21/0.27 % Equation resolutions : 0
% 0.21/0.27 % Disequality decompositions : 0
% 0.21/0.27 % Total rewrite steps : 0
% 0.21/0.27 % ...of those cached : 0
% 0.21/0.27 % Propositional unsat checks : 0
% 0.21/0.27 % Propositional check models : 0
% 0.21/0.27 % Propositional check unsatisfiable : 0
% 0.21/0.27 % Propositional clauses : 0
% 0.21/0.27 % Propositional clauses after purity: 0
% 0.21/0.27 % Propositional unsat core size : 0
% 0.21/0.27 % Propositional preprocessing time : 0.000
% 0.21/0.27 % Propositional encoding time : 0.000
% 0.21/0.27 % Propositional solver time : 0.000
% 0.21/0.27 % Success case prop preproc time : 0.000
% 0.21/0.27 % Success case prop encoding time : 0.000
% 0.21/0.27 % Success case prop solver time : 0.000
% 0.21/0.27 % Current number of processed clauses : 0
% 0.21/0.27 % Positive orientable unit clauses : 0
% 0.21/0.27 % Positive unorientable unit clauses: 0
% 0.21/0.27 % Negative unit clauses : 0
% 0.21/0.27 % Non-unit-clauses : 0
% 0.21/0.27 % Current number of unprocessed clauses: 15
% 0.21/0.27 % ...number of literals in the above : 32
% 0.21/0.27 % Current number of archived formulas : 0
% 0.21/0.27 % Current number of archived clauses : 0
% 0.21/0.27 % Clause-clause subsumption calls (NU) : 0
% 0.21/0.27 % Rec. Clause-clause subsumption calls : 0
% 0.21/0.27 % Non-unit clause-clause subsumptions : 0
% 0.21/0.27 % Unit Clause-clause subsumption calls : 0
% 0.21/0.27 % Rewrite failures with RHS unbound : 0
% 0.21/0.27 % BW rewrite match attempts : 0
% 0.21/0.27 % BW rewrite match successes : 0
% 0.21/0.27 % Condensation attempts : 0
% 0.21/0.27 % Condensation successes : 0
% 0.21/0.27 % Termbank termtop insertions : 1513
% 0.21/0.27 % Search garbage collected termcells : 332
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.004 s
% 0.21/0.27 % System time : 0.001 s
% 0.21/0.27 % Total time : 0.006 s
% 0.21/0.27 % Maximum resident set size: 3636 pages
% 0.21/0.27
% 0.21/0.27 % -------------------------------------------------
% 0.21/0.27 % User time : 0.006 s
% 0.21/0.27 % System time : 0.005 s
% 0.21/0.27 % Total time : 0.011 s
% 0.21/0.27 % Maximum resident set size: 4608 pages
% 0.21/0.27 % E exiting
%------------------------------------------------------------------------------