%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV065^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 : n005.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:34:48 AM UTC 2026
% Result : Theorem 0.26s 0.27s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 67 ( 38 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 148 ( 25 ~; 33 |; 16 &; 70 @)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 15 ( 4 ^; 11 !; 0 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
esk1_0: b ).
thf(decl_24,type,
esk2_0: a ).
thf(decl_25,type,
epred1_0: b > a > $o ).
thf(decl_26,type,
esk3_0: b ).
thf(decl_27,type,
esk4_0: a ).
thf(cTHM177_pme,conjecture,
! [X1: b,X2: a,X3: b > a > $o] :
( ( X3 @ X1 @ X2 )
=> ( ( ^ [X4: b,X5: a] :
( ( ( X3 @ X4 @ X5 )
& ~ ( ( X4 = X1 )
& ( X5 = X2 ) ) )
| ( ( X4 = X1 )
& ( X5 = X2 ) ) ) )
= X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.nxnk46ZXvl/E---3.1_1778073.p',cTHM177_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: b,X2: a,X3: b > a > $o] :
( ( X3 @ X1 @ X2 )
=> ( ( ^ [X4: b,X5: a] :
( ( ( X3 @ X4 @ X5 )
& ~ ( ( X4 = X1 )
& ( X5 = X2 ) ) )
| ( ( X4 = X1 )
& ( X5 = X2 ) ) ) )
= X3 ) ),
inference(assume_negation,[status(cth)],[cTHM177_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: b,X2: a,X3: b > a > $o] :
( ( X3 @ X1 @ X2 )
=> ! [X9: b,X10: a] :
( ( ( ( X3 @ X9 @ X10 )
& ~ ( ( X9 = X1 )
& ( X10 = X2 ) ) )
| ( ( X9 = X1 )
& ( X10 = X2 ) ) )
<=> ( X3 @ X9 @ X10 ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk2_0 )
& ( ( esk3_0 = esk1_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk4_0 = esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk3_0 != esk1_0 )
| ( esk4_0 != esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk3_0 = esk1_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk4_0 = esk2_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk3_0 = esk1_0 )
| ( esk3_0 != esk1_0 )
| ( esk4_0 != esk2_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) )
& ( ( esk4_0 = esk2_0 )
| ( esk3_0 != esk1_0 )
| ( esk4_0 != esk2_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
thf(c_0_4,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( esk3_0 = esk1_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
( ( esk4_0 = esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
( ( esk4_0 = esk2_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( esk4_0 = esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
( ( esk4_0 = esk2_0 )
| ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
epred1_0 @ esk3_0 @ esk2_0,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,negated_conjecture,
esk2_0 = esk4_0,
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,negated_conjecture,
( ( esk3_0 != esk1_0 )
| ( esk4_0 != esk2_0 )
| ~ ( epred1_0 @ esk3_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_17,negated_conjecture,
epred1_0 @ esk3_0 @ esk4_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_15]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV065^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n005.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 15:06:01 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/0.25 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.nxnk46ZXvl/E---3.1_1778073.p
% 0.26/0.27 % Version: 3.5.1-ho
% 0.26/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.26/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.26/0.27 % Starting new_bool_9 with 300s (1) cores
% 0.26/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.27 % Starting post_as_ho4 with 300s (1) cores
% 0.26/0.27 % Starting post_as_ho2 with 300s (1) cores
% 0.26/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.26/0.27 % Starting full_lambda_10 with 300s (1) cores
% 0.26/0.27 % Starting new_ho_8 with 300s (1) cores
% 0.26/0.27 % post_as_ho12 with pid 1778086 completed with status 0
% 0.26/0.27 % Result found by post_as_ho12
% 0.26/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.26/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.26/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.27 % No SInE strategy applied
% 0.26/0.27 % Search class: HGHSF-FFSS00-SSSFFFNN
% 0.26/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.27 % SubtermCWHack with pid 1778095 completed with status 0
% 0.26/0.27 % Result found by SubtermCWHack
% 0.26/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.26/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.26/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.27 % No SInE strategy applied
% 0.26/0.27 % Search class: HGHSF-FFSS00-SSSFFFNN
% 0.26/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.27 % Preprocessing time : 0.001 s
% 0.26/0.27
% 0.26/0.27 % Proof found!
% 0.26/0.27 % SZS status Theorem
% 0.26/0.27 % SZS output start CNFRefutation
% See solution above
% 0.26/0.27 % Parsed axioms : 3
% 0.26/0.27 % Removed by relevancy pruning/SinE : 0
% 0.26/0.27 % Initial clauses : 10
% 0.26/0.27 % Removed in clause preprocessing : 4
% 0.26/0.27 % Initial clauses in saturation : 6
% 0.26/0.27 % Processed clauses : 8
% 0.26/0.27 % ...of these trivial : 0
% 0.26/0.27 % ...subsumed : 0
% 0.26/0.27 % ...remaining for further processing : 7
% 0.26/0.27 % Other redundant clauses eliminated : 0
% 0.26/0.27 % Clauses deleted for lack of memory : 0
% 0.26/0.27 % Backward-subsumed : 0
% 0.26/0.27 % Backward-rewritten : 4
% 0.26/0.27 % Generated clauses : 0
% 0.26/0.27 % ...of the previous two non-redundant : 2
% 0.26/0.27 % ...aggressively subsumed : 0
% 0.26/0.27 % Contextual simplify-reflections : 2
% 0.26/0.27 % Paramodulations : 0
% 0.26/0.27 % Factorizations : 0
% 0.26/0.27 % NegExts : 0
% 0.26/0.27 % Equation resolutions : 0
% 0.26/0.27 % Disequality decompositions : 0
% 0.26/0.27 % Total rewrite steps : 7
% 0.26/0.27 % ...of those cached : 4
% 0.26/0.27 % Propositional unsat checks : 0
% 0.26/0.27 % Propositional check models : 0
% 0.26/0.27 % Propositional check unsatisfiable : 0
% 0.26/0.27 % Propositional clauses : 0
% 0.26/0.27 % Propositional clauses after purity: 0
% 0.26/0.27 % Propositional unsat core size : 0
% 0.26/0.27 % Propositional preprocessing time : 0.000
% 0.26/0.27 % Propositional encoding time : 0.000
% 0.26/0.27 % Propositional solver time : 0.000
% 0.26/0.27 % Success case prop preproc time : 0.000
% 0.26/0.27 % Success case prop encoding time : 0.000
% 0.26/0.27 % Success case prop solver time : 0.000
% 0.26/0.27 % Current number of processed clauses : 3
% 0.26/0.27 % Positive orientable unit clauses : 3
% 0.26/0.27 % Positive unorientable unit clauses: 0
% 0.26/0.27 % Negative unit clauses : 0
% 0.26/0.27 % Non-unit-clauses : 0
% 0.26/0.27 % Current number of unprocessed clauses: 0
% 0.26/0.27 % ...number of literals in the above : 0
% 0.26/0.27 % Current number of archived formulas : 0
% 0.26/0.27 % Current number of archived clauses : 4
% 0.26/0.27 % Clause-clause subsumption calls (NU) : 2
% 0.26/0.27 % Rec. Clause-clause subsumption calls : 2
% 0.26/0.27 % Non-unit clause-clause subsumptions : 2
% 0.26/0.27 % Unit Clause-clause subsumption calls : 1
% 0.26/0.27 % Rewrite failures with RHS unbound : 0
% 0.26/0.27 % BW rewrite match attempts : 2
% 0.26/0.27 % BW rewrite match successes : 2
% 0.26/0.27 % Condensation attempts : 0
% 0.26/0.27 % Condensation successes : 0
% 0.26/0.27 % Termbank termtop insertions : 625
% 0.26/0.27 % Search garbage collected termcells : 183
% 0.26/0.27
% 0.26/0.27 % -------------------------------------------------
% 0.26/0.27 % User time : 0.005 s
% 0.26/0.27 % System time : 0.000 s
% 0.26/0.27 % Total time : 0.005 s
% 0.26/0.27 % Maximum resident set size: 3580 pages
% 0.26/0.27
% 0.26/0.27 % -------------------------------------------------
% 0.26/0.27 % User time : 0.007 s
% 0.26/0.27 % System time : 0.005 s
% 0.26/0.27 % Total time : 0.011 s
% 0.26/0.27 % Maximum resident set size: 4864 pages
% 0.26/0.27 % E exiting
%------------------------------------------------------------------------------