%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET185^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 : n008.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:21:56 AM UTC 2026
% Result : Theorem 0.10s 0.25s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 40 ( 5 ~; 6 |; 2 &; 21 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 0 ^; 10 !; 0 ?; 10 :)
% 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,
esk1_0: a ).
thf(cBOOL_PROP_35_pme,conjecture,
! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( ( X1 @ X3 )
| ( X2 @ X3 ) )
=> ( X2 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Cdjtt3VtJO/E---3.1_3160169.p',cBOOL_PROP_35_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o,X2: a > $o] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X2 @ X3 ) )
=> ! [X3: a] :
( ( ( X1 @ X3 )
| ( X2 @ X3 ) )
=> ( X2 @ X3 ) ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_35_pme]) ).
thf(c_0_2,negated_conjecture,
! [X10: a] :
( ( ~ ( epred1_0 @ X10 )
| ( epred2_0 @ X10 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ~ ( epred2_0 @ esk1_0 ) ),
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_1])])])])]) ).
thf(c_0_3,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a] :
( ( epred2_0 @ X3 )
| ~ ( epred1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
epred1_0 @ esk1_0,
inference(sr,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET185^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.18 % Computer : n008.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 13:37:54 UTC 2026
% 0.10/0.18 % CPUTime :
% 0.10/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/0.23 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.Cdjtt3VtJO/E---3.1_3160169.p
% 0.10/0.25 % Version: 3.5.1-ho
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.10/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.10/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho4 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho2 with 300s (1) cores
% 0.10/0.25 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.10/0.25 % Starting full_lambda_10 with 300s (1) cores
% 0.10/0.25 % Starting new_ho_8 with 300s (1) cores
% 0.10/0.25 % post_as_ho1 with pid 3160196 completed with status 0
% 0.10/0.25 % Result found by post_as_ho1
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.10/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.10/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.10/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25 % SubtermCWHack with pid 3160205 completed with status 0
% 0.10/0.25 % Result found by SubtermCWHack
% 0.10/0.25 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.10/0.25 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.25 % Starting post_as_ho12 with 300s (1) cores
% 0.10/0.25 % Starting new_bool_9 with 300s (1) cores
% 0.10/0.25 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.25 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.25 % No SInE strategy applied
% 0.10/0.25 % Search class: HGUNF-FFSF00-SSSFFFNN
% 0.10/0.25 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.25 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.25 % Preprocessing time : 0.001 s
% 0.10/0.25
% 0.10/0.25 % Proof found!
% 0.10/0.25 % SZS status Theorem
% 0.10/0.25 % SZS output start CNFRefutation
% See solution above
% 0.10/0.25 % Parsed axioms : 2
% 0.10/0.25 % Removed by relevancy pruning/SinE : 0
% 0.10/0.25 % Initial clauses : 4
% 0.10/0.25 % Removed in clause preprocessing : 1
% 0.10/0.25 % Initial clauses in saturation : 3
% 0.10/0.25 % Processed clauses : 3
% 0.10/0.25 % ...of these trivial : 0
% 0.10/0.25 % ...subsumed : 0
% 0.10/0.25 % ...remaining for further processing : 3
% 0.10/0.25 % Other redundant clauses eliminated : 0
% 0.10/0.25 % Clauses deleted for lack of memory : 0
% 0.10/0.25 % Backward-subsumed : 0
% 0.10/0.25 % Backward-rewritten : 0
% 0.10/0.25 % Generated clauses : 1
% 0.10/0.25 % ...of the previous two non-redundant : 0
% 0.10/0.25 % ...aggressively subsumed : 0
% 0.10/0.25 % Contextual simplify-reflections : 0
% 0.10/0.25 % Paramodulations : 1
% 0.10/0.25 % Factorizations : 0
% 0.10/0.25 % NegExts : 0
% 0.10/0.25 % Equation resolutions : 0
% 0.10/0.25 % Disequality decompositions : 0
% 0.10/0.25 % Total rewrite steps : 0
% 0.10/0.25 % ...of those cached : 0
% 0.10/0.25 % Propositional unsat checks : 0
% 0.10/0.25 % Propositional check models : 0
% 0.10/0.25 % Propositional check unsatisfiable : 0
% 0.10/0.25 % Propositional clauses : 0
% 0.10/0.25 % Propositional clauses after purity: 0
% 0.10/0.25 % Propositional unsat core size : 0
% 0.10/0.25 % Propositional preprocessing time : 0.000
% 0.10/0.25 % Propositional encoding time : 0.000
% 0.10/0.25 % Propositional solver time : 0.000
% 0.10/0.25 % Success case prop preproc time : 0.000
% 0.10/0.25 % Success case prop encoding time : 0.000
% 0.10/0.25 % Success case prop solver time : 0.000
% 0.10/0.25 % Current number of processed clauses : 3
% 0.10/0.25 % Positive orientable unit clauses : 1
% 0.10/0.25 % Positive unorientable unit clauses: 0
% 0.10/0.25 % Negative unit clauses : 1
% 0.10/0.25 % Non-unit-clauses : 1
% 0.10/0.25 % Current number of unprocessed clauses: 0
% 0.10/0.25 % ...number of literals in the above : 0
% 0.10/0.25 % Current number of archived formulas : 0
% 0.10/0.25 % Current number of archived clauses : 0
% 0.10/0.25 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.25 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.25 % Non-unit clause-clause subsumptions : 0
% 0.10/0.25 % Unit Clause-clause subsumption calls : 0
% 0.10/0.25 % Rewrite failures with RHS unbound : 0
% 0.10/0.25 % BW rewrite match attempts : 0
% 0.10/0.25 % BW rewrite match successes : 0
% 0.10/0.25 % Condensation attempts : 0
% 0.10/0.25 % Condensation successes : 0
% 0.10/0.25 % Termbank termtop insertions : 279
% 0.10/0.25 % Search garbage collected termcells : 96
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.004 s
% 0.10/0.25 % System time : 0.000 s
% 0.10/0.25 % Total time : 0.004 s
% 0.10/0.25 % Maximum resident set size: 3576 pages
% 0.10/0.25
% 0.10/0.25 % -------------------------------------------------
% 0.10/0.25 % User time : 0.005 s
% 0.10/0.25 % System time : 0.003 s
% 0.10/0.25 % Total time : 0.008 s
% 0.10/0.25 % Maximum resident set size: 4864 pages
% 0.10/0.25 % E exiting
%------------------------------------------------------------------------------