%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP161^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:33 AM UTC 2026
% Result : Theorem 0.24s 0.36s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 112 ( 12 ~; 8 |; 1 &; 88 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 19 ( 0 ^; 19 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_sort2,type,
refine424419629nres_a: $tType ).
thf(decl_sort3,type,
refine432681134nres_b: $tType ).
thf(decl_sort4,type,
set_a: $tType ).
thf(decl_38,type,
ord_le527798542nres_b: refine432681134nres_b > refine432681134nres_b > $o ).
thf(decl_76,type,
refine436832839nd_a_b: refine424419629nres_a > ( a > refine432681134nres_b ) > refine432681134nres_b ).
thf(decl_108,type,
refine1198353288_RES_a: set_a > refine424419629nres_a ).
thf(decl_128,type,
collect_a: ( a > $o ) > set_a ).
thf(decl_135,type,
member_a: a > set_a > $o ).
thf(decl_137,type,
phi: a > $o ).
thf(decl_138,type,
f: a > refine432681134nres_b ).
thf(decl_139,type,
m: refine432681134nres_b ).
thf(decl_140,type,
x: a ).
thf(conj_0,conjecture,
ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ),
file('/export/starexec/sandbox2/tmp/tmp.rT2RpHS6EA/E---3.1_1278604.p',conj_0) ).
thf(fact_35_RES__bind__choose,axiom,
! [X96: a,X97: set_a,X98: refine432681134nres_b,X99: a > refine432681134nres_b] :
( ( member_a @ X96 @ X97 )
=> ( ( ord_le527798542nres_b @ X98 @ ( X99 @ X96 ) )
=> ( ord_le527798542nres_b @ X98 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X97 ) @ X99 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rT2RpHS6EA/E---3.1_1278604.p',fact_35_RES__bind__choose) ).
thf(fact_1_assms_I2_J,axiom,
ord_le527798542nres_b @ m @ ( f @ x ),
file('/export/starexec/sandbox2/tmp/tmp.rT2RpHS6EA/E---3.1_1278604.p',fact_1_assms_I2_J) ).
thf(fact_107_mem__Collect__eq,axiom,
! [X266: a,X267: a > $o] :
( ( member_a @ X266 @ ( collect_a @ X267 ) )
<=> ( X267 @ X266 ) ),
file('/export/starexec/sandbox2/tmp/tmp.rT2RpHS6EA/E---3.1_1278604.p',fact_107_mem__Collect__eq) ).
thf(fact_0_assms_I1_J,axiom,
phi @ x,
file('/export/starexec/sandbox2/tmp/tmp.rT2RpHS6EA/E---3.1_1278604.p',fact_0_assms_I1_J) ).
thf(c_0_5,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,plain,
! [X1311: a,X1312: set_a,X1313: refine432681134nres_b,X1314: a > refine432681134nres_b] :
( ~ ( member_a @ X1311 @ X1312 )
| ~ ( ord_le527798542nres_b @ X1313 @ ( X1314 @ X1311 ) )
| ( ord_le527798542nres_b @ X1313 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X1312 ) @ X1314 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_35_RES__bind__choose])]) ).
thf(c_0_7,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X5: set_a,X17: refine432681134nres_b,X99: a > refine432681134nres_b,X42: a] :
( ( ord_le527798542nres_b @ X17 @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X5 ) @ X99 ) )
| ~ ( member_a @ X42 @ X5 )
| ~ ( ord_le527798542nres_b @ X17 @ ( X99 @ X42 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
ord_le527798542nres_b @ m @ ( f @ x ),
inference(split_conjunct,[status(thm)],[fact_1_assms_I2_J]) ).
thf(c_0_10,negated_conjecture,
~ ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ ( collect_a @ phi ) ) @ f ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X5: set_a] :
( ( ord_le527798542nres_b @ m @ ( refine436832839nd_a_b @ ( refine1198353288_RES_a @ X5 ) @ f ) )
| ~ ( member_a @ x @ X5 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_12,plain,
! [X1350: a,X1351: a > $o] :
( ( ~ ( member_a @ X1350 @ ( collect_a @ X1351 ) )
| ( X1351 @ X1350 ) )
& ( ~ ( X1351 @ X1350 )
| ( member_a @ X1350 @ ( collect_a @ X1351 ) ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_107_mem__Collect__eq])]) ).
thf(c_0_13,negated_conjecture,
~ ( member_a @ x @ ( collect_a @ phi ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,plain,
! [X21: a > $o,X42: a] :
( ( member_a @ X42 @ ( collect_a @ X21 ) )
| ~ ( X21 @ X42 ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_15,plain,
phi @ x,
inference(split_conjunct,[status(thm)],[fact_0_assms_I1_J]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP161^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n019.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 20:04:02 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running higher-order theorem proving
% 0.11/0.28 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.rT2RpHS6EA/E---3.1_1278604.p
% 0.24/0.36 % Version: 3.5.1-ho
% 0.24/0.36 % Preprocessing class: HSLMSMSMSSMCHSA.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.36 % Starting sh5l with 300s (1) cores
% 0.24/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.36 % Starting new_bool_2 with 300s (1) cores
% 0.24/0.36 % new_bool_2 with pid 1278620 completed with status 0
% 0.24/0.36 % Result found by new_bool_2
% 0.24/0.36 % Preprocessing class: HSLMSMSMSSMCHSA.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.36 % Starting sh5l with 300s (1) cores
% 0.24/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.36 % Starting new_bool_2 with 300s (1) cores
% 0.24/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.36 % Search class: HGUSM-FSLM32-DHSFFSBN
% 0.24/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.36 % SubtermCWHack with pid 1278622 completed with status 0
% 0.24/0.36 % Result found by SubtermCWHack
% 0.24/0.36 % Preprocessing class: HSLMSMSMSSMCHSA.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.36 % Starting sh5l with 300s (1) cores
% 0.24/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.36 % Starting new_bool_2 with 300s (1) cores
% 0.24/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.36 % Search class: HGUSM-FSLM32-DHSFFSBN
% 0.24/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.36 % Preprocessing time : 0.003 s
% 0.24/0.36
% 0.24/0.36 % Proof found!
% 0.24/0.36 % SZS status Theorem
% 0.24/0.36 % SZS output start CNFRefutation
% See solution above
% 0.24/0.36 % Parsed axioms : 503
% 0.24/0.36 % Removed by relevancy pruning/SinE : 388
% 0.24/0.36 % Initial clauses : 238
% 0.24/0.36 % Removed in clause preprocessing : 43
% 0.24/0.36 % Initial clauses in saturation : 195
% 0.24/0.36 % Processed clauses : 581
% 0.24/0.36 % ...of these trivial : 11
% 0.24/0.36 % ...subsumed : 335
% 0.24/0.36 % ...remaining for further processing : 235
% 0.24/0.36 % Other redundant clauses eliminated : 67
% 0.24/0.36 % Clauses deleted for lack of memory : 0
% 0.24/0.36 % Backward-subsumed : 1
% 0.24/0.36 % Backward-rewritten : 5
% 0.24/0.36 % Generated clauses : 2507
% 0.24/0.36 % ...of the previous two non-redundant : 1443
% 0.24/0.36 % ...aggressively subsumed : 0
% 0.24/0.36 % Contextual simplify-reflections : 4
% 0.24/0.36 % Paramodulations : 2403
% 0.24/0.36 % Factorizations : 9
% 0.24/0.36 % NegExts : 0
% 0.24/0.36 % Equation resolutions : 69
% 0.24/0.36 % Disequality decompositions : 0
% 0.24/0.36 % Total rewrite steps : 1231
% 0.24/0.36 % ...of those cached : 1103
% 0.24/0.36 % Propositional unsat checks : 0
% 0.24/0.36 % Propositional check models : 0
% 0.24/0.36 % Propositional check unsatisfiable : 0
% 0.24/0.36 % Propositional clauses : 0
% 0.24/0.36 % Propositional clauses after purity: 0
% 0.24/0.36 % Propositional unsat core size : 0
% 0.24/0.36 % Propositional preprocessing time : 0.000
% 0.24/0.36 % Propositional encoding time : 0.000
% 0.24/0.36 % Propositional solver time : 0.000
% 0.24/0.36 % Success case prop preproc time : 0.000
% 0.24/0.36 % Success case prop encoding time : 0.000
% 0.24/0.36 % Success case prop solver time : 0.000
% 0.24/0.36 % Current number of processed clauses : 221
% 0.24/0.36 % Positive orientable unit clauses : 40
% 0.24/0.36 % Positive unorientable unit clauses: 0
% 0.24/0.36 % Negative unit clauses : 7
% 0.24/0.36 % Non-unit-clauses : 174
% 0.24/0.36 % Current number of unprocessed clauses: 1038
% 0.24/0.36 % ...number of literals in the above : 3357
% 0.24/0.36 % Current number of archived formulas : 0
% 0.24/0.36 % Current number of archived clauses : 11
% 0.24/0.36 % Clause-clause subsumption calls (NU) : 5633
% 0.24/0.36 % Rec. Clause-clause subsumption calls : 4436
% 0.24/0.36 % Non-unit clause-clause subsumptions : 333
% 0.24/0.36 % Unit Clause-clause subsumption calls : 125
% 0.24/0.36 % Rewrite failures with RHS unbound : 0
% 0.24/0.36 % BW rewrite match attempts : 12
% 0.24/0.36 % BW rewrite match successes : 3
% 0.24/0.36 % Condensation attempts : 0
% 0.24/0.36 % Condensation successes : 0
% 0.24/0.36 % Termbank termtop insertions : 43239
% 0.24/0.36 % Search garbage collected termcells : 7722
% 0.24/0.36
% 0.24/0.36 % -------------------------------------------------
% 0.24/0.36 % User time : 0.041 s
% 0.24/0.36 % System time : 0.007 s
% 0.24/0.36 % Total time : 0.048 s
% 0.24/0.36 % Maximum resident set size: 5828 pages
% 0.24/0.36
% 0.24/0.36 % -------------------------------------------------
% 0.24/0.36 % User time : 0.058 s
% 0.24/0.36 % System time : 0.012 s
% 0.24/0.36 % Total time : 0.070 s
% 0.24/0.36 % Maximum resident set size: 5632 pages
% 0.24/0.36 % E exiting
%------------------------------------------------------------------------------