%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP117^1 : TPTP v9.3.1. Released v7.5.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:05:34 AM UTC 2026
% Result : Theorem 0.22s 0.32s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 10 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 84 ( 4 ~; 0 |; 0 &; 80 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 5 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 4 ^; 6 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
extend1728876344nnreal: $tType ).
thf(decl_sort2,type,
set_Fi1058188332real_n: $tType ).
thf(decl_sort3,type,
sigma_1466784463real_n: $tType ).
thf(decl_sort4,type,
nat: $tType ).
thf(decl_sort5,type,
finite964658038_int_n: $tType ).
thf(decl_32,type,
comple230862828real_n: sigma_1466784463real_n > sigma_1466784463real_n ).
thf(decl_49,type,
lebesg260170249real_n: sigma_1466784463real_n ).
thf(decl_119,type,
sigma_1536574303real_n: sigma_1466784463real_n > set_Fi1058188332real_n > extend1728876344nnreal ).
thf(decl_135,type,
t: finite964658038_int_n > set_Fi1058188332real_n ).
thf(decl_136,type,
t2: finite964658038_int_n > set_Fi1058188332real_n ).
thf(decl_137,type,
f: nat > finite964658038_int_n ).
thf(decl_138,type,
esk1_0: nat ).
thf(decl_143,type,
esk6_0: nat > set_Fi1058188332real_n ).
thf(conj_0,conjecture,
( ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ X2 ) ) ) )
= ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ydjw8vWhmJ/E---3.1_566144.p',conj_0) ).
thf(fact_0_emeasure__T_H,axiom,
! [X1: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X1 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ydjw8vWhmJ/E---3.1_566144.p',fact_0_emeasure__T_H) ).
thf(c_0_2,negated_conjecture,
( ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ X2 ) ) ) )
!= ( ^ [X2: nat] : ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_3,negated_conjecture,
~ ! [X964: nat] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ X964 ) ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ X964 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])]) ).
thf(c_0_4,negated_conjecture,
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ esk1_0 ) ) )
!= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ esk1_0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_5,plain,
! [X1122: nat] :
( ( esk6_0 @ X1122 )
= ( t2 @ ( f @ X1122 ) ) ),
inference(variable_rename,[status(thm)],[]) ).
thf(c_0_6,plain,
! [X971: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X971 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X971 ) ) ),
inference(variable_rename,[status(thm)],[fact_0_emeasure__T_H]) ).
thf(c_0_7,negated_conjecture,
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ ( f @ esk1_0 ) ) )
!= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ ( f @ esk1_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,plain,
! [X2: nat] :
( ( esk6_0 @ X2 )
= ( t2 @ ( f @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1: finite964658038_int_n] :
( ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t @ X1 ) )
= ( sigma_1536574303real_n @ ( comple230862828real_n @ lebesg260170249real_n ) @ ( t2 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP117^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.16 % Computer : n018.cluster.edu
% 0.10/0.16 % Model : x86_64 x86_64
% 0.10/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16 % Memory : 8046.5625MB
% 0.10/0.16 % OS : Linux 6.8.0-71-generic
% 0.10/0.16 % CPULimit : 300
% 0.10/0.16 % WCLimit : 300
% 0.10/0.16 % DateTime : Tue Sep 29 19:58:26 UTC 2026
% 0.10/0.16 % CPUTime :
% 0.10/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 Running higher-order theorem proving
% 0.22/0.26 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.ydjw8vWhmJ/E---3.1_566144.p
% 0.22/0.32 % Version: 3.5.1-ho
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSLNHSA.
% 0.22/0.32 % Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting new_bool_8 with 600s (2) cores
% 0.22/0.32 % Starting new_ho_3 with 300s (1) cores
% 0.22/0.32 % Starting additional_ho_3 with 300s (1) cores
% 0.22/0.32 % Starting full_lambda_10 with 300s (1) cores
% 0.22/0.32 % Starting ehoh_best with 300s (1) cores
% 0.22/0.32 % Starting sh2lt with 300s (1) cores
% 0.22/0.32 % Starting full_lambda_4 with 300s (1) cores
% 0.22/0.32 % new_bool_8 with pid 566157 completed with status 0
% 0.22/0.32 % Result found by new_bool_8
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSLNHSA.
% 0.22/0.32 % Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting new_bool_8 with 600s (2) cores
% 0.22/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.22/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.32 % Search class: HGUSM-FFMF21-MHSFFSNN
% 0.22/0.32 % partial match(4): FGUSM-FFMF21-MFFFFFNN
% 0.22/0.32 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.22/0.32 % Starting SubtermCWHack with 55s (1) cores
% 0.22/0.32 % Starting new_bool_8 with 61s (1) cores
% 0.22/0.32 % SubtermCWHack with pid 566164 completed with status 0
% 0.22/0.32 % Result found by SubtermCWHack
% 0.22/0.32 % Preprocessing class: HSLMSMSMSSLNHSA.
% 0.22/0.32 % Scheduled 7 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.32 % Starting new_bool_8 with 600s (2) cores
% 0.22/0.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,1,,2,20000,1.0))
% 0.22/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.22/0.32 % Search class: HGUSM-FFMF21-MHSFFSNN
% 0.22/0.32 % partial match(4): FGUSM-FFMF21-MFFFFFNN
% 0.22/0.32 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.22/0.32 % Starting SubtermCWHack with 55s (1) cores
% 0.22/0.32 % Preprocessing time : 0.004 s
% 0.22/0.32
% 0.22/0.32 % Proof found!
% 0.22/0.32 % SZS status Theorem
% 0.22/0.32 % SZS output start CNFRefutation
% See solution above
% 0.22/0.32 % Parsed axioms : 487
% 0.22/0.32 % Removed by relevancy pruning/SinE : 446
% 0.22/0.32 % Initial clauses : 56
% 0.22/0.32 % Removed in clause preprocessing : 0
% 0.22/0.32 % Initial clauses in saturation : 56
% 0.22/0.32 % Processed clauses : 99
% 0.22/0.32 % ...of these trivial : 1
% 0.22/0.32 % ...subsumed : 45
% 0.22/0.32 % ...remaining for further processing : 52
% 0.22/0.32 % Other redundant clauses eliminated : 2
% 0.22/0.32 % Clauses deleted for lack of memory : 0
% 0.22/0.32 % Backward-subsumed : 0
% 0.22/0.32 % Backward-rewritten : 0
% 0.22/0.32 % Generated clauses : 208
% 0.22/0.32 % ...of the previous two non-redundant : 170
% 0.22/0.32 % ...aggressively subsumed : 0
% 0.22/0.32 % Contextual simplify-reflections : 0
% 0.22/0.32 % Paramodulations : 206
% 0.22/0.32 % Factorizations : 0
% 0.22/0.32 % NegExts : 0
% 0.22/0.32 % Equation resolutions : 2
% 0.22/0.32 % Disequality decompositions : 0
% 0.22/0.32 % Total rewrite steps : 79
% 0.22/0.32 % ...of those cached : 44
% 0.22/0.32 % Propositional unsat checks : 0
% 0.22/0.32 % Propositional check models : 0
% 0.22/0.32 % Propositional check unsatisfiable : 0
% 0.22/0.32 % Propositional clauses : 0
% 0.22/0.32 % Propositional clauses after purity: 0
% 0.22/0.32 % Propositional unsat core size : 0
% 0.22/0.32 % Propositional preprocessing time : 0.000
% 0.22/0.32 % Propositional encoding time : 0.000
% 0.22/0.32 % Propositional solver time : 0.000
% 0.22/0.32 % Success case prop preproc time : 0.000
% 0.22/0.32 % Success case prop encoding time : 0.000
% 0.22/0.32 % Success case prop solver time : 0.000
% 0.22/0.32 % Current number of processed clauses : 50
% 0.22/0.32 % Positive orientable unit clauses : 37
% 0.22/0.32 % Positive unorientable unit clauses: 2
% 0.22/0.32 % Negative unit clauses : 0
% 0.22/0.32 % Non-unit-clauses : 11
% 0.22/0.32 % Current number of unprocessed clauses: 127
% 0.22/0.32 % ...number of literals in the above : 184
% 0.22/0.32 % Current number of archived formulas : 0
% 0.22/0.32 % Current number of archived clauses : 0
% 0.22/0.32 % Clause-clause subsumption calls (NU) : 177
% 0.22/0.32 % Rec. Clause-clause subsumption calls : 150
% 0.22/0.32 % Non-unit clause-clause subsumptions : 45
% 0.22/0.32 % Unit Clause-clause subsumption calls : 14
% 0.22/0.32 % Rewrite failures with RHS unbound : 0
% 0.22/0.32 % BW rewrite match attempts : 12
% 0.22/0.32 % BW rewrite match successes : 6
% 0.22/0.32 % Condensation attempts : 0
% 0.22/0.32 % Condensation successes : 0
% 0.22/0.32 % Termbank termtop insertions : 11502
% 0.22/0.32 % Search garbage collected termcells : 4536
% 0.22/0.32
% 0.22/0.32 % -------------------------------------------------
% 0.22/0.32 % User time : 0.015 s
% 0.22/0.32 % System time : 0.006 s
% 0.22/0.32 % Total time : 0.021 s
% 0.22/0.32 % Maximum resident set size: 5036 pages
% 0.22/0.32
% 0.22/0.32 % -------------------------------------------------
% 0.22/0.32 % User time : 0.035 s
% 0.22/0.32 % System time : 0.015 s
% 0.22/0.32 % Total time : 0.050 s
% 0.22/0.32 % Maximum resident set size: 5632 pages
% 0.22/0.32 % E exiting
%------------------------------------------------------------------------------