%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU897^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:25:54 AM UTC 2026
% Result : Theorem 0.35s 0.27s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 33 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 112 ( 27 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 286 ( 39 ~; 62 |; 11 &; 168 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 ^; 46 !; 4 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
cS: a > $o ).
thf(decl_24,type,
cR: a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a > a ).
thf(decl_27,type,
esk3_0: a ).
thf(decl_28,type,
esk4_0: a ).
thf(decl_29,type,
esk5_2: ( a > a ) > a > a ).
thf(cTHM30_pme,conjecture,
( ! [X1: a] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ! [X2: a > a,X1: a] :
( ? [X3: a] :
( ( cR @ X3 )
& ( X1
= ( X2 @ X3 ) ) )
=> ? [X3: a] :
( ( cS @ X3 )
& ( X1
= ( X2 @ X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7gBiVaqJWe/E---3.1_1759510.p',cTHM30_pme) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: a] :
( ( cR @ X1 )
=> ( cS @ X1 ) )
<=> ! [X2: a > a,X1: a] :
( ? [X3: a] :
( ( cR @ X3 )
& ( X1
= ( X2 @ X3 ) ) )
=> ? [X3: a] :
( ( cS @ X3 )
& ( X1
= ( X2 @ X3 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM30_pme]) ).
thf(c_0_2,negated_conjecture,
! [X13: a,X14: a,X15: a > a,X16: a,X17: a] :
( ( ( cR @ esk4_0 )
| ( cR @ esk1_0 ) )
& ( ( esk3_0
= ( esk2_0 @ esk4_0 ) )
| ( cR @ esk1_0 ) )
& ( ~ ( cS @ X13 )
| ( esk3_0
!= ( esk2_0 @ X13 ) )
| ( cR @ esk1_0 ) )
& ( ( cR @ esk4_0 )
| ~ ( cS @ esk1_0 ) )
& ( ( esk3_0
= ( esk2_0 @ esk4_0 ) )
| ~ ( cS @ esk1_0 ) )
& ( ~ ( cS @ X13 )
| ( esk3_0
!= ( esk2_0 @ X13 ) )
| ~ ( cS @ esk1_0 ) )
& ( ( cS @ ( esk5_2 @ X15 @ X16 ) )
| ~ ( cR @ X17 )
| ( X16
!= ( X15 @ X17 ) )
| ~ ( cR @ X14 )
| ( cS @ X14 ) )
& ( ( X16
= ( X15 @ ( esk5_2 @ X15 @ X16 ) ) )
| ~ ( cR @ X17 )
| ( X16
!= ( X15 @ X17 ) )
| ~ ( cR @ X14 )
| ( cS @ X14 ) ) ),
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,
! [X1: a,X2: a > a,X3: a,X4: a] :
( ( cS @ ( esk5_2 @ X2 @ X1 ) )
| ( cS @ X4 )
| ~ ( cR @ X3 )
| ( X1
!= ( X2 @ X3 ) )
| ~ ( cR @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: a,X2: a > a,X3: a,X4: a] :
( ( X1
= ( X2 @ ( esk5_2 @ X2 @ X1 ) ) )
| ( cS @ X4 )
| ~ ( cR @ X3 )
| ( X1
!= ( X2 @ X3 ) )
| ~ ( cR @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X2: a > a,X1: a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ X1 ) ) )
| ( cS @ X3 )
| ~ ( cR @ X3 )
| ~ ( cR @ X1 ) ),
inference(er,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( cR @ esk4_0 )
| ( cR @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X3: a,X2: a > a,X1: a] :
( ( ( X2 @ X1 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ X1 ) ) ) )
| ( cS @ X3 )
| ~ ( cR @ X3 )
| ~ ( cR @ X1 ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > a,X1: a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) )
| ( cR @ esk1_0 )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X2: a > a,X1: a] :
( ( ( X2 @ esk4_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) ) )
| ( cR @ esk1_0 )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X2: a > a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) )
| ( cS @ esk4_0 )
| ( cR @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
thf(c_0_11,negated_conjecture,
! [X2: a > a] :
( ( ( X2 @ esk4_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) ) )
| ( cS @ esk4_0 )
| ( cR @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
thf(c_0_12,negated_conjecture,
! [X1: a] :
( ( cR @ esk1_0 )
| ~ ( cS @ X1 )
| ( esk3_0
!= ( esk2_0 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( cR @ esk1_0 )
| ( cS @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( esk3_0
= ( esk2_0 @ esk4_0 ) )
| ( cR @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_15,negated_conjecture,
cR @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X2: a > a,X1: a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk1_0 ) ) )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X2: a > a,X1: a] :
( ( ( X2 @ esk1_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk1_0 ) ) ) )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
thf(c_0_18,negated_conjecture,
! [X2: a > a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk1_0 ) ) )
| ( cS @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
thf(c_0_19,negated_conjecture,
! [X2: a > a] :
( ( ( X2 @ esk1_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk1_0 ) ) ) )
| ( cS @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
thf(c_0_20,negated_conjecture,
( ( cR @ esk4_0 )
| ~ ( cS @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_21,negated_conjecture,
cS @ esk1_0,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
cR @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_23,negated_conjecture,
! [X2: a > a,X1: a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X2: a > a,X1: a] :
( ( ( X2 @ esk4_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) ) )
| ( cS @ X1 )
| ~ ( cR @ X1 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X1: a] :
( ~ ( cS @ X1 )
| ( esk3_0
!= ( esk2_0 @ X1 ) )
| ~ ( cS @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_26,negated_conjecture,
! [X2: a > a] :
( ( cS @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) )
| ( cS @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X2: a > a] :
( ( ( X2 @ esk4_0 )
= ( X2 @ ( esk5_2 @ X2 @ ( X2 @ esk4_0 ) ) ) )
| ( cS @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
thf(c_0_28,negated_conjecture,
( ( esk3_0
= ( esk2_0 @ esk4_0 ) )
| ~ ( cS @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_29,negated_conjecture,
! [X1: a] :
( ( ( esk2_0 @ X1 )
!= esk3_0 )
| ~ ( cS @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_21])]) ).
thf(c_0_30,negated_conjecture,
cS @ esk4_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_31,negated_conjecture,
( ( esk2_0 @ esk4_0 )
= esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_21])]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU897^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n005.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 14:44:31 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.7gBiVaqJWe/E---3.1_1759510.p
% 0.35/0.27 % Version: 3.5.1-ho
% 0.35/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.35/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.35/0.27 % Starting new_bool_9 with 300s (1) cores
% 0.35/0.27 % Starting post_as_ho1 with 300s (1) cores
% 0.35/0.27 % Starting post_as_ho4 with 300s (1) cores
% 0.35/0.27 % Starting post_as_ho2 with 300s (1) cores
% 0.35/0.27 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.35/0.27 % Starting full_lambda_10 with 300s (1) cores
% 0.35/0.27 % Starting new_ho_8 with 300s (1) cores
% 0.35/0.27 % post_as_ho12 with pid 1759543 completed with status 0
% 0.35/0.27 % Result found by post_as_ho12
% 0.35/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.35/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.35/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.27 % No SInE strategy applied
% 0.35/0.27 % Search class: HGHSF-FFSF22-SSSFFSNN
% 0.35/0.27 % partial match(1): HGHSF-FFSF22-SSSFFSBN
% 0.35/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.35/0.27 % SubtermCWHack with pid 1759550 completed with status 10
% 0.35/0.27 % Starting post_as_ho12 with 31s (1) cores
% 0.35/0.27 % post_as_ho12 with pid 1759556 completed with status 0
% 0.35/0.27 % Result found by post_as_ho12
% 0.35/0.27 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.35/0.27 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.27 % Starting post_as_ho12 with 300s (1) cores
% 0.35/0.27 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.27 % No SInE strategy applied
% 0.35/0.27 % Search class: HGHSF-FFSF22-SSSFFSNN
% 0.35/0.27 % partial match(1): HGHSF-FFSF22-SSSFFSBN
% 0.35/0.27 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.35/0.27 % Starting SubtermCWHack with 28s (1) cores
% 0.35/0.27 % SubtermCWHack with pid 1759550 completed with status 10
% 0.35/0.27 % Starting post_as_ho12 with 31s (1) cores
% 0.35/0.27 % Preprocessing time : 0.001 s
% 0.35/0.27 % Presaturation interreduction done
% 0.35/0.27
% 0.35/0.27 % Proof found!
% 0.35/0.27 % SZS status Theorem
% 0.35/0.27 % SZS output start CNFRefutation
% See solution above
% 0.35/0.27 % Parsed axioms : 4
% 0.35/0.27 % Removed by relevancy pruning/SinE : 0
% 0.35/0.27 % Initial clauses : 11
% 0.35/0.27 % Removed in clause preprocessing : 3
% 0.35/0.27 % Initial clauses in saturation : 8
% 0.35/0.27 % Processed clauses : 102
% 0.35/0.27 % ...of these trivial : 2
% 0.35/0.27 % ...subsumed : 47
% 0.35/0.27 % ...remaining for further processing : 53
% 0.35/0.27 % Other redundant clauses eliminated : 2
% 0.35/0.27 % Clauses deleted for lack of memory : 0
% 0.35/0.27 % Backward-subsumed : 11
% 0.35/0.27 % Backward-rewritten : 18
% 0.35/0.27 % Generated clauses : 186
% 0.35/0.27 % ...of the previous two non-redundant : 169
% 0.35/0.27 % ...aggressively subsumed : 0
% 0.35/0.27 % Contextual simplify-reflections : 1
% 0.35/0.27 % Paramodulations : 184
% 0.35/0.27 % Factorizations : 0
% 0.35/0.27 % NegExts : 0
% 0.35/0.27 % Equation resolutions : 2
% 0.35/0.27 % Disequality decompositions : 0
% 0.35/0.27 % Total rewrite steps : 42
% 0.35/0.27 % ...of those cached : 36
% 0.35/0.27 % Propositional unsat checks : 0
% 0.35/0.27 % Propositional check models : 0
% 0.35/0.27 % Propositional check unsatisfiable : 0
% 0.35/0.27 % Propositional clauses : 0
% 0.35/0.27 % Propositional clauses after purity: 0
% 0.35/0.27 % Propositional unsat core size : 0
% 0.35/0.27 % Propositional preprocessing time : 0.000
% 0.35/0.27 % Propositional encoding time : 0.000
% 0.35/0.27 % Propositional solver time : 0.000
% 0.35/0.27 % Success case prop preproc time : 0.000
% 0.35/0.27 % Success case prop encoding time : 0.000
% 0.35/0.27 % Success case prop solver time : 0.000
% 0.35/0.27 % Current number of processed clauses : 14
% 0.35/0.27 % Positive orientable unit clauses : 6
% 0.35/0.27 % Positive unorientable unit clauses: 1
% 0.35/0.27 % Negative unit clauses : 1
% 0.35/0.27 % Non-unit-clauses : 6
% 0.35/0.27 % Current number of unprocessed clauses: 49
% 0.35/0.27 % ...number of literals in the above : 93
% 0.35/0.27 % Current number of archived formulas : 0
% 0.35/0.27 % Current number of archived clauses : 37
% 0.35/0.27 % Clause-clause subsumption calls (NU) : 87
% 0.35/0.27 % Rec. Clause-clause subsumption calls : 75
% 0.35/0.27 % Non-unit clause-clause subsumptions : 45
% 0.35/0.27 % Unit Clause-clause subsumption calls : 10
% 0.35/0.27 % Rewrite failures with RHS unbound : 0
% 0.35/0.27 % BW rewrite match attempts : 70
% 0.35/0.27 % BW rewrite match successes : 9
% 0.35/0.27 % Condensation attempts : 0
% 0.35/0.27 % Condensation successes : 0
% 0.35/0.27 % Termbank termtop insertions : 11343
% 0.35/0.27 % Search garbage collected termcells : 208
% 0.35/0.27
% 0.35/0.27 % -------------------------------------------------
% 0.35/0.27 % User time : 0.008 s
% 0.35/0.27 % System time : 0.004 s
% 0.35/0.27 % Total time : 0.012 s
% 0.35/0.27 % Maximum resident set size: 3628 pages
% 0.35/0.27
% 0.35/0.27 % -------------------------------------------------
% 0.35/0.27 % User time : 0.010 s
% 0.35/0.27 % System time : 0.010 s
% 0.35/0.27 % Total time : 0.020 s
% 0.35/0.27 % Maximum resident set size: 4608 pages
% 0.35/0.27 % E exiting
%------------------------------------------------------------------------------