%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP010^5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:04:01 AM UTC 2026
% Result : Theorem 6.14s 5.06s
% Output : CNFRefutation 6.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 13 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 63 ( 8 ~; 0 |; 0 &; 48 @)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
del: $tType ).
thf(decl_23,type,
bool: del ).
thf(decl_25,type,
arr: del > del > del ).
thf(decl_26,type,
mem: $i > del > $o ).
thf(decl_27,type,
ap: $i > $i > $i ).
thf(decl_29,type,
p: $i > $o ).
thf(decl_1132,type,
c_2Ecardinal_2Ecardleq: del > del > $i ).
thf(conj_thm_2Ecardinal_2ECARD__NOT__LE,conjecture,
! [X13: del,X20: del,X197: $i] :
( ( mem @ X197 @ ( arr @ X13 @ bool ) )
=> ! [X55: $i] :
( ( mem @ X55 @ ( arr @ X20 @ bool ) )
=> ( ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X20 ) @ X197 ) @ X55 ) )
<=> ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X20 ) @ X197 ) @ X55 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.dCUj9QG6nW/E---3.1_1052389.p',conj_thm_2Ecardinal_2ECARD__NOT__LE) ).
thf(c_0_1,negated_conjecture,
~ ! [X13: del,X20: del,X197: $i] :
( ( mem @ X197 @ ( arr @ X13 @ bool ) )
=> ! [X55: $i] :
( ( mem @ X55 @ ( arr @ X20 @ bool ) )
=> ( ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X20 ) @ X197 ) @ X55 ) )
<=> ~ ( p @ ( ap @ ( ap @ ( c_2Ecardinal_2Ecardleq @ X13 @ X20 ) @ X197 ) @ X55 ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Ecardinal_2ECARD__NOT__LE]) ).
thf(c_0_2,negated_conjecture,
~ ! [X13: del,X20: del,X197: $i] :
( ( mem @ X197 @ ( arr @ X13 @ bool ) )
=> ! [X55: $i] : $true ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
~ $true,
inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])]) ).
thf(c_0_4,negated_conjecture,
~ $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 : ITP010^5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n026.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 19:28:13 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 3.75/3.84 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.dCUj9QG6nW/E---3.1_1052389.p
% 6.14/5.06 % Version: 3.5.1-ho
% 6.14/5.06 % Preprocessing class: HMLLSMLLSSLNSFA.
% 6.14/5.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/5.06 % Starting new_bool_8 with 1200s (4) cores
% 6.14/5.06 % Starting post_as_ho5 with 600s (2) cores
% 6.14/5.06 % Starting new_bool_9 with 300s (1) cores
% 6.14/5.06 % Starting new_bool_3 with 300s (1) cores
% 6.14/5.06 % post_as_ho5 with pid 1052530 completed with status 0
% 6.14/5.06 % Result found by post_as_ho5
% 6.14/5.06 % Preprocessing class: HMLLSMLLSSLNSFA.
% 6.14/5.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/5.06 % Starting new_bool_8 with 1200s (4) cores
% 6.14/5.06 % Starting post_as_ho5 with 600s (2) cores
% 6.14/5.06 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 6.14/5.06 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 6.14/5.06 % Search class: HGHSM-SMLM33-DSFFFFNN
% 6.14/5.06 % partial match(2): FGHSM-SMLM33-DFFFFFNN
% 6.14/5.06 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 6.14/5.06 % Starting SubtermCWHack with 55s (1) cores
% 6.14/5.06 % Starting post_as_ho5 with 61s (1) cores
% 6.14/5.06 % post_as_ho5 with pid 1052540 completed with status 0
% 6.14/5.06 % Result found by post_as_ho5
% 6.14/5.06 % Preprocessing class: HMLLSMLLSSLNSFA.
% 6.14/5.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.14/5.06 % Starting new_bool_8 with 1200s (4) cores
% 6.14/5.06 % Starting post_as_ho5 with 600s (2) cores
% 6.14/5.06 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true))
% 6.14/5.06 % SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
% 6.14/5.06 % Search class: HGHSM-SMLM33-DSFFFFNN
% 6.14/5.06 % partial match(2): FGHSM-SMLM33-DFFFFFNN
% 6.14/5.06 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 6.14/5.06 % Starting SubtermCWHack with 55s (1) cores
% 6.14/5.06 % Starting post_as_ho5 with 61s (1) cores
% 6.14/5.06 % Preprocessing time : 0.051 s
% 6.14/5.06 % Presaturation interreduction done
% 6.14/5.06
% 6.14/5.06 % Proof found!
% 6.14/5.06 % SZS status Theorem
% 6.14/5.06 % SZS output start CNFRefutation
% See solution above
% 6.14/5.06 % Parsed axioms : 8027
% 6.14/5.06 % Removed by relevancy pruning/SinE : 7595
% 6.14/5.06 % Initial clauses : 2219
% 6.14/5.06 % Removed in clause preprocessing : 1003
% 6.14/5.06 % Initial clauses in saturation : 1216
% 6.14/5.06 % Processed clauses : 1
% 6.14/5.06 % ...of these trivial : 0
% 6.14/5.06 % ...subsumed : 0
% 6.14/5.06 % ...remaining for further processing : 0
% 6.14/5.06 % Other redundant clauses eliminated : 0
% 6.14/5.06 % Clauses deleted for lack of memory : 0
% 6.14/5.06 % Backward-subsumed : 0
% 6.14/5.06 % Backward-rewritten : 0
% 6.14/5.06 % Generated clauses : 0
% 6.14/5.06 % ...of the previous two non-redundant : 0
% 6.14/5.06 % ...aggressively subsumed : 0
% 6.14/5.06 % Contextual simplify-reflections : 0
% 6.14/5.06 % Paramodulations : 0
% 6.14/5.06 % Factorizations : 0
% 6.14/5.06 % NegExts : 0
% 6.14/5.06 % Equation resolutions : 0
% 6.14/5.06 % Disequality decompositions : 0
% 6.14/5.06 % Total rewrite steps : 0
% 6.14/5.06 % ...of those cached : 0
% 6.14/5.06 % Propositional unsat checks : 0
% 6.14/5.06 % Propositional check models : 0
% 6.14/5.06 % Propositional check unsatisfiable : 0
% 6.14/5.06 % Propositional clauses : 0
% 6.14/5.06 % Propositional clauses after purity: 0
% 6.14/5.06 % Propositional unsat core size : 0
% 6.14/5.06 % Propositional preprocessing time : 0.000
% 6.14/5.06 % Propositional encoding time : 0.000
% 6.14/5.06 % Propositional solver time : 0.000
% 6.14/5.06 % Success case prop preproc time : 0.000
% 6.14/5.06 % Success case prop encoding time : 0.000
% 6.14/5.06 % Success case prop solver time : 0.000
% 6.14/5.06 % Current number of processed clauses : 0
% 6.14/5.06 % Positive orientable unit clauses : 0
% 6.14/5.06 % Positive unorientable unit clauses: 0
% 6.14/5.06 % Negative unit clauses : 0
% 6.14/5.06 % Non-unit-clauses : 0
% 6.14/5.06 % Current number of unprocessed clauses: 1215
% 6.14/5.06 % ...number of literals in the above : 6249
% 6.14/5.06 % Current number of archived formulas : 0
% 6.14/5.06 % Current number of archived clauses : 0
% 6.14/5.06 % Clause-clause subsumption calls (NU) : 0
% 6.14/5.06 % Rec. Clause-clause subsumption calls : 0
% 6.14/5.06 % Non-unit clause-clause subsumptions : 0
% 6.14/5.06 % Unit Clause-clause subsumption calls : 0
% 6.14/5.06 % Rewrite failures with RHS unbound : 0
% 6.14/5.06 % BW rewrite match attempts : 0
% 6.14/5.06 % BW rewrite match successes : 0
% 6.14/5.06 % Condensation attempts : 0
% 6.14/5.06 % Condensation successes : 0
% 6.14/5.06 % Termbank termtop insertions : 853805
% 6.14/5.06 % Search garbage collected termcells : 253377
% 6.14/5.06
% 6.14/5.06 % -------------------------------------------------
% 6.14/5.06 % User time : 0.415 s
% 6.14/5.06 % System time : 0.096 s
% 6.14/5.06 % Total time : 0.511 s
% 6.14/5.06 % Maximum resident set size: 47108 pages
% 6.14/5.06
% 6.14/5.06 % -------------------------------------------------
% 6.14/5.06 % User time : 1.073 s
% 6.14/5.06 % System time : 0.170 s
% 6.14/5.06 % Total time : 1.243 s
% 6.14/5.06 % Maximum resident set size: 43008 pages
% 6.14/5.06 % E exiting
%------------------------------------------------------------------------------