%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP079^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 : n004.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:18 AM UTC 2026
% Result : Theorem 0.21s 0.32s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 24 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 7 ~; 7 |; 1 &; 56 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 ^; 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_val: $tType ).
thf(decl_sort2,type,
val: $tType ).
thf(decl_38,type,
ord_less_eq_set_val: set_val > set_val > $o ).
thf(decl_93,type,
member_val: val > set_val > $o ).
thf(decl_94,type,
p: set_val ).
thf(decl_95,type,
scc: set_val ).
thf(decl_104,type,
esk9_2: set_val > set_val > val ).
thf(fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062,axiom,
! [X1: val] :
( ( member_val @ X1 @ scc )
=> ( member_val @ X1 @ p ) ),
file('/export/starexec/sandbox2/tmp/tmp.3l4zb36oti/E---3.1_1749309.p',fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062) ).
thf(fact_2_subsetI,axiom,
! [X5: set_val,X6: set_val] :
( ! [X7: val] :
( ( member_val @ X7 @ X5 )
=> ( member_val @ X7 @ X6 ) )
=> ( ord_less_eq_set_val @ X5 @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3l4zb36oti/E---3.1_1749309.p',fact_2_subsetI) ).
thf(conj_0,conjecture,
ord_less_eq_set_val @ scc @ p,
file('/export/starexec/sandbox2/tmp/tmp.3l4zb36oti/E---3.1_1749309.p',conj_0) ).
thf(c_0_3,plain,
! [X1182: val] :
( ~ ( member_val @ X1182 @ scc )
| ( member_val @ X1182 @ p ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__092_060open_062_092_060And_062x_O_Ax_A_092_060in_062_Ascc_A_092_060Longrightarrow_062_Ax_A_092_060in_062_AP_092_060close_062])]) ).
thf(c_0_4,plain,
! [X1183: set_val,X1184: set_val] :
( ( ( member_val @ ( esk9_2 @ X1183 @ X1184 ) @ X1183 )
| ( ord_less_eq_set_val @ X1183 @ X1184 ) )
& ( ~ ( member_val @ ( esk9_2 @ X1183 @ X1184 ) @ X1184 )
| ( ord_less_eq_set_val @ X1183 @ X1184 ) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_subsetI])])])]) ).
thf(c_0_5,negated_conjecture,
~ ( ord_less_eq_set_val @ scc @ p ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_6,plain,
! [X1: val] :
( ( member_val @ X1 @ p )
| ~ ( member_val @ X1 @ scc ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_7,plain,
! [X4: set_val,X5: set_val] :
( ( member_val @ ( esk9_2 @ X4 @ X5 ) @ X4 )
| ( ord_less_eq_set_val @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
~ ( ord_less_eq_set_val @ scc @ p ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X4: set_val,X5: set_val] :
( ( ord_less_eq_set_val @ X4 @ X5 )
| ~ ( member_val @ ( esk9_2 @ X4 @ X5 ) @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,plain,
! [X4: set_val] :
( ( member_val @ ( esk9_2 @ scc @ X4 ) @ p )
| ( ord_less_eq_set_val @ scc @ X4 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
~ ( ord_less_eq_set_val @ scc @ p ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP079^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.08/0.18 % Computer : n004.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 19:48:22 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.21/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.3l4zb36oti/E---3.1_1749309.p
% 0.21/0.32 % Version: 3.5.1-ho
% 0.21/0.32 % Preprocessing class: HSLSSMSSSSMCHFA.
% 0.21/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.32 % Starting sh3 with 1500s (5) cores
% 0.21/0.32 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.32 % new_bool_2 with pid 1749325 completed with status 0
% 0.21/0.32 % Result found by new_bool_2
% 0.21/0.32 % Preprocessing class: HSLSSMSSSSMCHFA.
% 0.21/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.32 % Starting sh3 with 1500s (5) cores
% 0.21/0.32 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.32 % Search class: HGHSM-FFMM32-DHFFFFNN
% 0.21/0.32 % partial match(2): FGHSM-FFMM32-DFFFFFNN
% 0.21/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.32 % SubtermCWHack with pid 1749326 completed with status 0
% 0.21/0.32 % Result found by SubtermCWHack
% 0.21/0.32 % Preprocessing class: HSLSSMSSSSMCHFA.
% 0.21/0.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.32 % Starting sh3 with 1500s (5) cores
% 0.21/0.32 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.32 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.32 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.32 % Search class: HGHSM-FFMM32-DHFFFFNN
% 0.21/0.32 % partial match(2): FGHSM-FFMM32-DFFFFFNN
% 0.21/0.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.32 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.32 % Preprocessing time : 0.003 s
% 0.21/0.32
% 0.21/0.32 % Proof found!
% 0.21/0.32 % SZS status Theorem
% 0.21/0.32 % SZS output start CNFRefutation
% See solution above
% 0.21/0.32 % Parsed axioms : 437
% 0.21/0.32 % Removed by relevancy pruning/SinE : 349
% 0.21/0.32 % Initial clauses : 112
% 0.21/0.32 % Removed in clause preprocessing : 5
% 0.21/0.32 % Initial clauses in saturation : 107
% 0.21/0.32 % Processed clauses : 54
% 0.21/0.32 % ...of these trivial : 2
% 0.21/0.32 % ...subsumed : 16
% 0.21/0.32 % ...remaining for further processing : 36
% 0.21/0.32 % Other redundant clauses eliminated : 7
% 0.21/0.32 % Clauses deleted for lack of memory : 0
% 0.21/0.32 % Backward-subsumed : 0
% 0.21/0.32 % Backward-rewritten : 0
% 0.21/0.32 % Generated clauses : 76
% 0.21/0.32 % ...of the previous two non-redundant : 44
% 0.21/0.32 % ...aggressively subsumed : 0
% 0.21/0.32 % Contextual simplify-reflections : 1
% 0.21/0.32 % Paramodulations : 60
% 0.21/0.32 % Factorizations : 0
% 0.21/0.32 % NegExts : 0
% 0.21/0.32 % Equation resolutions : 7
% 0.21/0.32 % Disequality decompositions : 0
% 0.21/0.32 % Total rewrite steps : 23
% 0.21/0.32 % ...of those cached : 18
% 0.21/0.32 % Propositional unsat checks : 0
% 0.21/0.32 % Propositional check models : 0
% 0.21/0.32 % Propositional check unsatisfiable : 0
% 0.21/0.32 % Propositional clauses : 0
% 0.21/0.32 % Propositional clauses after purity: 0
% 0.21/0.32 % Propositional unsat core size : 0
% 0.21/0.32 % Propositional preprocessing time : 0.000
% 0.21/0.32 % Propositional encoding time : 0.000
% 0.21/0.32 % Propositional solver time : 0.000
% 0.21/0.32 % Success case prop preproc time : 0.000
% 0.21/0.32 % Success case prop encoding time : 0.000
% 0.21/0.32 % Success case prop solver time : 0.000
% 0.21/0.32 % Current number of processed clauses : 30
% 0.21/0.32 % Positive orientable unit clauses : 13
% 0.21/0.32 % Positive unorientable unit clauses: 0
% 0.21/0.32 % Negative unit clauses : 1
% 0.21/0.32 % Non-unit-clauses : 16
% 0.21/0.32 % Current number of unprocessed clauses: 97
% 0.21/0.32 % ...number of literals in the above : 232
% 0.21/0.32 % Current number of archived formulas : 0
% 0.21/0.32 % Current number of archived clauses : 0
% 0.21/0.32 % Clause-clause subsumption calls (NU) : 42
% 0.21/0.32 % Rec. Clause-clause subsumption calls : 42
% 0.21/0.32 % Non-unit clause-clause subsumptions : 17
% 0.21/0.32 % Unit Clause-clause subsumption calls : 0
% 0.21/0.32 % Rewrite failures with RHS unbound : 0
% 0.21/0.32 % BW rewrite match attempts : 9
% 0.21/0.32 % BW rewrite match successes : 0
% 0.21/0.32 % Condensation attempts : 0
% 0.21/0.32 % Condensation successes : 0
% 0.21/0.32 % Termbank termtop insertions : 12697
% 0.21/0.32 % Search garbage collected termcells : 5459
% 0.21/0.32
% 0.21/0.32 % -------------------------------------------------
% 0.21/0.32 % User time : 0.006 s
% 0.21/0.32 % System time : 0.008 s
% 0.21/0.32 % Total time : 0.013 s
% 0.21/0.32 % Maximum resident set size: 5024 pages
% 0.21/0.32
% 0.21/0.32 % -------------------------------------------------
% 0.21/0.32 % User time : 0.020 s
% 0.21/0.32 % System time : 0.014 s
% 0.21/0.32 % Total time : 0.034 s
% 0.21/0.32 % Maximum resident set size: 5888 pages
% 0.21/0.32 % E exiting
%------------------------------------------------------------------------------