%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV080^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 : 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:34:50 AM UTC 2026
% Result : Theorem 196.62s 28.72s
% Output : CNFRefutation 196.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 60 ( 30 equ; 0 cnn)
% Maximal formula atoms : 24 ( 3 avg)
% Number of connectives : 229 ( 22 ~; 31 |; 13 &; 156 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 49 ( 20 ^; 23 !; 6 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
esk1_1: ( a > a ) > a ).
thf(decl_25,type,
esk2_1: ( a > a ) > a ).
thf(decl_26,type,
esk3_2: ( a > a ) > a > a ).
thf(cEQP_1A_pme,conjecture,
! [X1: a > $o] :
? [X2: a > a] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X4
= ( X2 @ X3 ) ) ) )
= ( ^ [X6: a,X4: a] : ( X6 = X4 )
@ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.sC1bt1Lrxm/E---3.1_1169084.p',cEQP_1A_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > $o] :
? [X2: a > a] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
( ( ^ [X3: a] :
( ( X1 @ X3 )
& ( X4
= ( X2 @ X3 ) ) ) )
= ( ^ [X6: a,X4: a] : ( X6 = X4 )
@ X5 ) ) ) ),
inference(assume_negation,[status(cth)],[cEQP_1A_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > $o] :
? [X2: a > a] :
( ! [X3: a] :
( ( X1 @ X3 )
=> ( X1 @ ( X2 @ X3 ) ) )
& ! [X4: a] :
( ( X1 @ X4 )
=> ? [X5: a] :
! [X12: a] :
( ( ( X1 @ X12 )
& ( X4
= ( X2 @ X12 ) ) )
<=> ( X5 = X12 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])]) ).
thf(c_0_3,negated_conjecture,
! [X14: a > a,X17: a] :
( ( ( epred1_0 @ ( esk2_1 @ X14 ) )
| ( epred1_0 @ ( esk1_1 @ X14 ) ) )
& ( ~ ( epred1_0 @ ( esk3_2 @ X14 @ X17 ) )
| ( ( esk2_1 @ X14 )
!= ( X14 @ ( esk3_2 @ X14 @ X17 ) ) )
| ( X17
!= ( esk3_2 @ X14 @ X17 ) )
| ( epred1_0 @ ( esk1_1 @ X14 ) ) )
& ( ( epred1_0 @ ( esk3_2 @ X14 @ X17 ) )
| ( X17
= ( esk3_2 @ X14 @ X17 ) )
| ( epred1_0 @ ( esk1_1 @ X14 ) ) )
& ( ( ( esk2_1 @ X14 )
= ( X14 @ ( esk3_2 @ X14 @ X17 ) ) )
| ( X17
= ( esk3_2 @ X14 @ X17 ) )
| ( epred1_0 @ ( esk1_1 @ X14 ) ) )
& ( ( epred1_0 @ ( esk2_1 @ X14 ) )
| ~ ( epred1_0 @ ( X14 @ ( esk1_1 @ X14 ) ) ) )
& ( ~ ( epred1_0 @ ( esk3_2 @ X14 @ X17 ) )
| ( ( esk2_1 @ X14 )
!= ( X14 @ ( esk3_2 @ X14 @ X17 ) ) )
| ( X17
!= ( esk3_2 @ X14 @ X17 ) )
| ~ ( epred1_0 @ ( X14 @ ( esk1_1 @ X14 ) ) ) )
& ( ( epred1_0 @ ( esk3_2 @ X14 @ X17 ) )
| ( X17
= ( esk3_2 @ X14 @ X17 ) )
| ~ ( epred1_0 @ ( X14 @ ( esk1_1 @ X14 ) ) ) )
& ( ( ( esk2_1 @ X14 )
= ( X14 @ ( esk3_2 @ X14 @ X17 ) ) )
| ( X17
= ( esk3_2 @ X14 @ X17 ) )
| ~ ( epred1_0 @ ( X14 @ ( esk1_1 @ 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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X2: a > a] :
( ( ( esk2_1 @ X2 )
= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ( X3
= ( esk3_2 @ X2 @ X3 ) )
| ( epred1_0 @ ( esk1_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: a > a,X3: a] :
( ( epred1_0 @ ( esk1_1 @ X2 ) )
| ~ ( epred1_0 @ ( esk3_2 @ X2 @ X3 ) )
| ( ( esk2_1 @ X2 )
!= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ( X3
!= ( esk3_2 @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( ( esk3_2
@ ^ [Z0: a] : Z0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) )
= ( esk2_1
@ ^ [Z0: a] : Z0 ) )
| ( epred1_0
@ ( esk1_1
@ ^ [Z0: a] : Z0 ) ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_4])]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0
@ ( esk1_1
@ ^ [Z0: a] : Z0 ) )
| ~ ( epred1_0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X2: a > a] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ( epred1_0 @ ( esk1_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X3: a,X2: a > a] :
( ( ( esk2_1 @ X2 )
= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ( X3
= ( esk3_2 @ X2 @ X3 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_10,negated_conjecture,
( epred1_0
@ ( esk1_1
@ ^ [Z0: a] : Z0 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X3: a] :
( ( ( esk2_1
@ ^ [Z0: a] : Z0 )
= ( esk3_2
@ ^ [Z0: a] : Z0
@ X3 ) )
| ( ( esk3_2
@ ^ [Z0: a] : Z0
@ X3 )
= X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,negated_conjecture,
! [X2: a > a] :
( ( epred1_0 @ ( esk2_1 @ X2 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_13,negated_conjecture,
! [X3: a,X2: a > a] :
( ~ ( epred1_0 @ ( esk3_2 @ X2 @ X3 ) )
| ( ( esk2_1 @ X2 )
!= ( X2 @ ( esk3_2 @ X2 @ X3 ) ) )
| ( X3
!= ( esk3_2 @ X2 @ X3 ) )
| ~ ( epred1_0 @ ( X2 @ ( esk1_1 @ X2 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_14,negated_conjecture,
( ( esk3_2
@ ^ [Z0: a] : Z0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) )
= ( esk2_1
@ ^ [Z0: a] : Z0 ) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_11])]) ).
thf(c_0_15,negated_conjecture,
( epred1_0
@ ( esk2_1
@ ^ [Z0: a] : Z0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV080^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.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 15:07:49 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.07/0.24 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.sC1bt1Lrxm/E---3.1_1169084.p
% 196.62/28.72 % Version: 3.5.1-ho
% 196.62/28.72 % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.62/28.72 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.62/28.72 % Starting post_as_ho12 with 300s (1) cores
% 196.62/28.72 % Starting new_bool_9 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho1 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho4 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho2 with 300s (1) cores
% 196.62/28.72 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 196.62/28.72 % Starting full_lambda_10 with 300s (1) cores
% 196.62/28.72 % Starting new_ho_8 with 300s (1) cores
% 196.62/28.72 % post_as_ho2 with pid 1169101 completed with status 0
% 196.62/28.72 % Result found by post_as_ho2
% 196.62/28.72 % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.62/28.72 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.62/28.72 % Starting post_as_ho12 with 300s (1) cores
% 196.62/28.72 % Starting new_bool_9 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho1 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho4 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho2 with 300s (1) cores
% 196.62/28.72 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 196.62/28.72 % No SInE strategy applied
% 196.62/28.72 % Search class: HGHSF-FFSF21-SSSFFMNN
% 196.62/28.72 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.62/28.72 % Starting SubtermCWHack with 28s (1) cores
% 196.62/28.72 % SubtermCWHack with pid 1169108 completed with status 8
% 196.62/28.72 % Starting post_as_ho2 with 31s (1) cores
% 196.62/28.72 % post_as_ho2 with pid 1169939 completed with status 0
% 196.62/28.72 % Result found by post_as_ho2
% 196.62/28.72 % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.62/28.72 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.62/28.72 % Starting post_as_ho12 with 300s (1) cores
% 196.62/28.72 % Starting new_bool_9 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho1 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho4 with 300s (1) cores
% 196.62/28.72 % Starting post_as_ho2 with 300s (1) cores
% 196.62/28.72 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 196.62/28.72 % No SInE strategy applied
% 196.62/28.72 % Search class: HGHSF-FFSF21-SSSFFMNN
% 196.62/28.72 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.62/28.72 % Starting SubtermCWHack with 28s (1) cores
% 196.62/28.72 % SubtermCWHack with pid 1169108 completed with status 8
% 196.62/28.72 % Starting post_as_ho2 with 31s (1) cores
% 196.62/28.72 % Preprocessing time : 0.001 s
% 196.62/28.72 % Presaturation interreduction done
% 196.62/28.72
% 196.62/28.72 % Proof found!
% 196.62/28.72 % SZS status Theorem
% 196.62/28.72 % SZS output start CNFRefutation
% See solution above
% 196.62/28.72 % Parsed axioms : 2
% 196.62/28.72 % Removed by relevancy pruning/SinE : 0
% 196.62/28.72 % Initial clauses : 9
% 196.62/28.72 % Removed in clause preprocessing : 1
% 196.62/28.72 % Initial clauses in saturation : 8
% 196.62/28.72 % Processed clauses : 101
% 196.62/28.72 % ...of these trivial : 5
% 196.62/28.72 % ...subsumed : 19
% 196.62/28.72 % ...remaining for further processing : 77
% 196.62/28.72 % Other redundant clauses eliminated : 16
% 196.62/28.72 % Clauses deleted for lack of memory : 0
% 196.62/28.72 % Backward-subsumed : 8
% 196.62/28.72 % Backward-rewritten : 2
% 196.62/28.72 % Generated clauses : 1728
% 196.62/28.72 % ...of the previous two non-redundant : 1487
% 196.62/28.72 % ...aggressively subsumed : 0
% 196.62/28.72 % Contextual simplify-reflections : 7
% 196.62/28.72 % Paramodulations : 1700
% 196.62/28.72 % Factorizations : 8
% 196.62/28.72 % NegExts : 0
% 196.62/28.72 % Equation resolutions : 20
% 196.62/28.72 % Disequality decompositions : 0
% 196.62/28.72 % Total rewrite steps : 230
% 196.62/28.72 % ...of those cached : 225
% 196.62/28.72 % Propositional unsat checks : 0
% 196.62/28.72 % Propositional check models : 0
% 196.62/28.72 % Propositional check unsatisfiable : 0
% 196.62/28.72 % Propositional clauses : 0
% 196.62/28.72 % Propositional clauses after purity: 0
% 196.62/28.72 % Propositional unsat core size : 0
% 196.62/28.72 % Propositional preprocessing time : 0.000
% 196.62/28.72 % Propositional encoding time : 0.000
% 196.62/28.72 % Propositional solver time : 0.000
% 196.62/28.72 % Success case prop preproc time : 0.000
% 196.62/28.72 % Success case prop encoding time : 0.000
% 196.62/28.72 % Success case prop solver time : 0.000
% 196.62/28.72 % Current number of processed clauses : 59
% 196.62/28.72 % Positive orientable unit clauses : 7
% 196.62/28.72 % Positive unorientable unit clauses: 0
% 196.62/28.72 % Negative unit clauses : 0
% 196.62/28.72 % Non-unit-clauses : 52
% 196.62/28.72 % Current number of unprocessed clauses: 1367
% 196.62/28.72 % ...number of literals in the above : 7072
% 196.62/28.72 % Current number of archived formulas : 0
% 196.62/28.72 % Current number of archived clauses : 18
% 196.62/28.72 % Clause-clause subsumption calls (NU) : 706
% 196.62/28.72 % Rec. Clause-clause subsumption calls : 218
% 196.62/28.72 % Non-unit clause-clause subsumptions : 32
% 196.62/28.72 % Unit Clause-clause subsumption calls : 30
% 196.62/28.72 % Rewrite failures with RHS unbound : 0
% 196.62/28.72 % BW rewrite match attempts : 33
% 196.62/28.72 % BW rewrite match successes : 3
% 196.62/28.72 % Condensation attempts : 0
% 196.62/28.72 % Condensation successes : 0
% 196.62/28.72 % Termbank termtop insertions : 695015
% 196.62/28.72 % Search garbage collected termcells : 222
% 196.62/28.72
% 196.62/28.72 % -------------------------------------------------
% 196.62/28.72 % User time : 27.893 s
% 196.62/28.72 % System time : 0.387 s
% 196.62/28.72 % Total time : 28.280 s
% 196.62/28.72 % Maximum resident set size: 3632 pages
% 196.62/28.72
% 196.62/28.72 % -------------------------------------------------
% 196.62/28.72 % User time : 27.897 s
% 196.62/28.72 % System time : 0.393 s
% 196.62/28.72 % Total time : 28.289 s
% 196.62/28.72 % Maximum resident set size: 4864 pages
% 196.62/28.72 % E exiting
%------------------------------------------------------------------------------