%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU899^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 : n020.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:25:54 AM UTC 2026
% Result : Theorem 0.07s 0.27s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 159 ( 68 equ; 0 cnn)
% Maximal formula atoms : 44 ( 4 avg)
% Number of connectives : 335 ( 55 ~; 103 |; 17 &; 158 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 ^; 21 !; 6 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_sort2,type,
a: $tType ).
thf(decl_23,type,
cF: b > a ).
thf(decl_24,type,
cS: b > $o ).
thf(decl_25,type,
cR: b > $o ).
thf(decl_26,type,
esk1_0: a ).
thf(decl_27,type,
esk2_0: b ).
thf(decl_28,type,
esk3_0: b ).
thf(decl_29,type,
esk4_0: b ).
thf(cTHM34_pme,conjecture,
! [X1: a] :
( ? [X2: b] :
( ( ( cR @ X2 )
| ( cS @ X2 ) )
& ( X1
= ( cF @ X2 ) ) )
<=> ( ? [X2: b] :
( ( cR @ X2 )
& ( X1
= ( cF @ X2 ) ) )
| ? [X2: b] :
( ( cS @ X2 )
& ( X1
= ( cF @ X2 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bqNQKQUNHp/E---3.1_1146832.p',cTHM34_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a] :
( ? [X2: b] :
( ( ( cR @ X2 )
| ( cS @ X2 ) )
& ( X1
= ( cF @ X2 ) ) )
<=> ( ? [X2: b] :
( ( cR @ X2 )
& ( X1
= ( cF @ X2 ) ) )
| ? [X2: b] :
( ( cS @ X2 )
& ( X1
= ( cF @ X2 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM34_pme]) ).
thf(c_0_2,negated_conjecture,
! [X8: b,X9: b,X10: b] :
( ( ~ ( cR @ X9 )
| ( esk1_0
!= ( cF @ X9 ) )
| ~ ( cR @ X8 )
| ( esk1_0
!= ( cF @ X8 ) ) )
& ( ~ ( cS @ X10 )
| ( esk1_0
!= ( cF @ X10 ) )
| ~ ( cR @ X8 )
| ( esk1_0
!= ( cF @ X8 ) ) )
& ( ~ ( cR @ X9 )
| ( esk1_0
!= ( cF @ X9 ) )
| ~ ( cS @ X8 )
| ( esk1_0
!= ( cF @ X8 ) ) )
& ( ~ ( cS @ X10 )
| ( esk1_0
!= ( cF @ X10 ) )
| ~ ( cS @ X8 )
| ( esk1_0
!= ( cF @ X8 ) ) )
& ( ( cS @ esk4_0 )
| ( cR @ esk3_0 )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) )
& ( ( esk1_0
= ( cF @ esk4_0 ) )
| ( cR @ esk3_0 )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) )
& ( ( cS @ esk4_0 )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) )
& ( ( esk1_0
= ( cF @ esk4_0 ) )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) )
& ( ( cS @ esk4_0 )
| ( cR @ esk3_0 )
| ( esk1_0
= ( cF @ esk2_0 ) ) )
& ( ( esk1_0
= ( cF @ esk4_0 ) )
| ( cR @ esk3_0 )
| ( esk1_0
= ( cF @ esk2_0 ) ) )
& ( ( cS @ esk4_0 )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( esk1_0
= ( cF @ esk2_0 ) ) )
& ( ( esk1_0
= ( cF @ esk4_0 ) )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( esk1_0
= ( cF @ esk2_0 ) ) ) ),
inference(distribute,[status(thm)],[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,
! [X2: b,X4: b] :
( ~ ( cR @ X2 )
| ( esk1_0
!= ( cF @ X2 ) )
| ~ ( cR @ X4 )
| ( esk1_0
!= ( cF @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( cS @ esk4_0 )
| ( cR @ esk3_0 )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( cS @ esk4_0 )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: b] :
( ( cS @ esk2_0 )
| ( cS @ esk4_0 )
| ( cR @ esk2_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( cR @ esk2_0 )
| ( cS @ esk4_0 )
| ( cS @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X2: b,X4: b] :
( ~ ( cR @ X2 )
| ( esk1_0
!= ( cF @ X2 ) )
| ~ ( cS @ X4 )
| ( esk1_0
!= ( cF @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ( cS @ esk4_0 )
| ( cR @ esk3_0 )
| ( esk1_0
= ( cF @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
( ( cS @ esk4_0 )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( esk1_0
= ( cF @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X2: b] :
( ( cS @ esk4_0 )
| ( ( cF @ esk2_0 )
!= esk1_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_7]),c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( esk1_0
= ( cF @ esk4_0 ) )
| ( cR @ esk3_0 )
| ( esk1_0
= ( cF @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( esk1_0
= ( cF @ esk4_0 ) )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( esk1_0
= ( cF @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_14,negated_conjecture,
! [X2: b] :
( ( cS @ esk4_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X2: b] :
( ( ( cF @ esk2_0 )
= esk1_0 )
| ( ( cF @ esk4_0 )
= esk1_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_12]),c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X2: b,X4: b] :
( ~ ( cS @ X2 )
| ( esk1_0
!= ( cF @ X2 ) )
| ~ ( cS @ X4 )
| ( esk1_0
!= ( cF @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_17,negated_conjecture,
( ( ( cF @ esk2_0 )
= esk1_0 )
| ( cS @ esk4_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_9]),c_0_10]) ).
thf(c_0_18,negated_conjecture,
( ( ( cF @ esk4_0 )
= esk1_0 )
| ( ( cF @ esk2_0 )
= esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13]) ).
thf(c_0_19,negated_conjecture,
! [X2: b] :
( ( ( cF @ esk2_0 )
= esk1_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cS @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
thf(c_0_20,negated_conjecture,
( ( cS @ esk2_0 )
| ( cS @ esk4_0 )
| ( ( cF @ esk2_0 )
!= esk1_0 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
thf(c_0_21,negated_conjecture,
( ( cF @ esk2_0 )
= esk1_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
( ( cS @ esk4_0 )
| ( cS @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_23,negated_conjecture,
! [X2: b] :
( ( cS @ esk2_0 )
| ( ( cF @ esk4_0 )
!= esk1_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cS @ X2 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
thf(c_0_24,negated_conjecture,
( ( cS @ esk2_0 )
| ( ( cF @ esk4_0 )
!= esk1_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X2: b] :
( ( ( cF @ esk4_0 )
!= esk1_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cS @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_24]),c_0_21])]) ).
thf(c_0_26,negated_conjecture,
( ( esk1_0
= ( cF @ esk4_0 ) )
| ( cR @ esk3_0 )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_27,negated_conjecture,
( ( esk1_0
= ( cF @ esk4_0 ) )
| ( esk1_0
= ( cF @ esk3_0 ) )
| ( cR @ esk2_0 )
| ( cS @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_28,negated_conjecture,
( ( cF @ esk4_0 )
!= esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_21])]) ).
thf(c_0_29,negated_conjecture,
! [X2: b] :
( ( cS @ esk2_0 )
| ( cR @ esk2_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_26]),c_0_27]),c_0_24]) ).
thf(c_0_30,negated_conjecture,
( ( cS @ esk2_0 )
| ( cR @ esk2_0 )
| ( cR @ esk3_0 ) ),
inference(sr,[status(thm)],[c_0_26,c_0_28]) ).
thf(c_0_31,negated_conjecture,
( ( ( cF @ esk3_0 )
= esk1_0 )
| ( cS @ esk2_0 )
| ( cR @ esk2_0 ) ),
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_32,negated_conjecture,
( ( cR @ esk2_0 )
| ( cS @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
thf(c_0_33,negated_conjecture,
! [X2: b] :
( ( cS @ esk2_0 )
| ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cR @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_32]),c_0_21])]) ).
thf(c_0_34,negated_conjecture,
cS @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_21])]) ).
thf(c_0_35,negated_conjecture,
! [X2: b] :
( ( ( cF @ X2 )
!= esk1_0 )
| ~ ( cS @ X2 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_34]),c_0_21])]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU899^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.07/0.18 % Computer : n020.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 14:45:19 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 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.bqNQKQUNHp/E---3.1_1146832.p
% 0.07/0.27 % Version: 3.5.1-ho
% 0.07/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.07/0.27 % Starting sh4l with 300s (1) cores
% 0.07/0.27 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.07/0.27 % sh4l with pid 1146850 completed with status 0
% 0.07/0.27 % Result found by sh4l
% 0.07/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.07/0.27 % Starting sh4l with 300s (1) cores
% 0.07/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.27 % No SInE strategy applied
% 0.07/0.27 % Search class: HGHSF-FFSM11-SFFFFFNN
% 0.07/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.27 % SubtermCWHack with pid 1146854 completed with status 0
% 0.07/0.27 % Result found by SubtermCWHack
% 0.07/0.27 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.07/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.27 % Starting new_ho_10 with 1500s (5) cores
% 0.07/0.27 % Starting ho_unfolding_6 with 300s (1) cores
% 0.07/0.27 % Starting sh4l with 300s (1) cores
% 0.07/0.27 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.27 % No SInE strategy applied
% 0.07/0.27 % Search class: HGHSF-FFSM11-SFFFFFNN
% 0.07/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.27 % Preprocessing time : 0.001 s
% 0.07/0.27
% 0.07/0.27 % Proof found!
% 0.07/0.27 % SZS status Theorem
% 0.07/0.27 % SZS output start CNFRefutation
% See solution above
% 0.07/0.27 % Parsed axioms : 6
% 0.07/0.27 % Removed by relevancy pruning/SinE : 0
% 0.07/0.27 % Initial clauses : 17
% 0.07/0.27 % Removed in clause preprocessing : 5
% 0.07/0.27 % Initial clauses in saturation : 12
% 0.07/0.27 % Processed clauses : 42
% 0.07/0.27 % ...of these trivial : 0
% 0.07/0.27 % ...subsumed : 5
% 0.07/0.27 % ...remaining for further processing : 37
% 0.07/0.27 % Other redundant clauses eliminated : 0
% 0.07/0.27 % Clauses deleted for lack of memory : 0
% 0.07/0.27 % Backward-subsumed : 22
% 0.07/0.27 % Backward-rewritten : 8
% 0.07/0.27 % Generated clauses : 65
% 0.07/0.27 % ...of the previous two non-redundant : 54
% 0.07/0.27 % ...aggressively subsumed : 0
% 0.07/0.27 % Contextual simplify-reflections : 14
% 0.07/0.27 % Paramodulations : 63
% 0.07/0.27 % Factorizations : 0
% 0.07/0.27 % NegExts : 0
% 0.07/0.27 % Equation resolutions : 0
% 0.07/0.27 % Disequality decompositions : 0
% 0.07/0.27 % Total rewrite steps : 23
% 0.07/0.27 % ...of those cached : 21
% 0.07/0.27 % Propositional unsat checks : 0
% 0.07/0.27 % Propositional check models : 0
% 0.07/0.27 % Propositional check unsatisfiable : 0
% 0.07/0.27 % Propositional clauses : 0
% 0.07/0.27 % Propositional clauses after purity: 0
% 0.07/0.27 % Propositional unsat core size : 0
% 0.07/0.27 % Propositional preprocessing time : 0.000
% 0.07/0.27 % Propositional encoding time : 0.000
% 0.07/0.27 % Propositional solver time : 0.000
% 0.07/0.27 % Success case prop preproc time : 0.000
% 0.07/0.27 % Success case prop encoding time : 0.000
% 0.07/0.27 % Success case prop solver time : 0.000
% 0.07/0.27 % Current number of processed clauses : 5
% 0.07/0.27 % Positive orientable unit clauses : 2
% 0.07/0.27 % Positive unorientable unit clauses: 0
% 0.07/0.27 % Negative unit clauses : 1
% 0.07/0.27 % Non-unit-clauses : 2
% 0.07/0.27 % Current number of unprocessed clauses: 16
% 0.07/0.27 % ...number of literals in the above : 81
% 0.07/0.27 % Current number of archived formulas : 0
% 0.07/0.27 % Current number of archived clauses : 32
% 0.07/0.27 % Clause-clause subsumption calls (NU) : 72
% 0.07/0.27 % Rec. Clause-clause subsumption calls : 42
% 0.07/0.27 % Non-unit clause-clause subsumptions : 38
% 0.07/0.27 % Unit Clause-clause subsumption calls : 10
% 0.07/0.27 % Rewrite failures with RHS unbound : 0
% 0.07/0.27 % BW rewrite match attempts : 2
% 0.07/0.27 % BW rewrite match successes : 2
% 0.07/0.27 % Condensation attempts : 0
% 0.07/0.27 % Condensation successes : 0
% 0.07/0.27 % Termbank termtop insertions : 1737
% 0.07/0.27 % Search garbage collected termcells : 194
% 0.07/0.27
% 0.07/0.27 % -------------------------------------------------
% 0.07/0.27 % User time : 0.006 s
% 0.07/0.27 % System time : 0.002 s
% 0.07/0.27 % Total time : 0.008 s
% 0.07/0.27 % Maximum resident set size: 3632 pages
% 0.07/0.27
% 0.07/0.27 % -------------------------------------------------
% 0.07/0.27 % User time : 0.007 s
% 0.07/0.27 % System time : 0.007 s
% 0.07/0.27 % Total time : 0.014 s
% 0.07/0.27 % Maximum resident set size: 4608 pages
% 0.07/0.27 % E exiting
%------------------------------------------------------------------------------