%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV321^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 : n019.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:35:23 AM UTC 2026
% Result : Theorem 39.02s 5.95s
% Output : CNFRefutation 39.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 0 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 348 ( 20 ~; 21 |; 21 &; 265 @)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 86 ( 14 ^; 69 !; 3 ?; 86 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > a > $o ).
thf(decl_24,type,
esk1_0: ( a > $o ) > a ).
thf(decl_25,type,
esk2_2: ( a > $o ) > a > a ).
thf(decl_26,type,
esk3_0: a > a ).
thf(cTHM145_C_pme,conjecture,
! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X3 @ X5 ) )
& ! [X6: a > $o] :
( ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( ( X6 @ X8 )
& ( X6 @ X8 ) )
=> ( X1 @ X8 @ X7 ) )
=> ( ( X1 @ ( X2 @ X6 ) @ X7 )
& ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) ) )
=> ! [X9: a > a] :
( ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
=> ? [X10: a] :
( ( X1 @ X10 @ ( X9 @ X10 ) )
& ( X1 @ ( X9 @ X10 ) @ X10 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Cs2UQhvHj7/E---3.1_927445.p',cTHM145_C_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X3 @ X5 ) )
& ! [X6: a > $o] :
( ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( ( X6 @ X8 )
& ( X6 @ X8 ) )
=> ( X1 @ X8 @ X7 ) )
=> ( ( X1 @ ( X2 @ X6 ) @ X7 )
& ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) ) )
=> ! [X9: a > a] :
( ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
=> ? [X10: a] :
( ( X1 @ X10 @ ( X9 @ X10 ) )
& ( X1 @ ( X9 @ X10 ) @ X10 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM145_C_pme]) ).
thf(c_0_2,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ( ! [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
& ( X1 @ X4 @ X5 ) )
=> ( X1 @ X3 @ X5 ) )
& ! [X6: a > $o] :
( ! [X5: a] :
( ( X6 @ X5 )
=> ( X1 @ X5 @ ( X2 @ X6 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( X6 @ X8 )
=> ( X1 @ X8 @ X7 ) )
=> ( X1 @ ( X2 @ X6 ) @ X7 ) ) ) )
=> ! [X9: a > a] :
( ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X1 @ ( X9 @ X3 ) @ ( X9 @ X4 ) ) )
=> ? [X10: a] :
( ( X1 @ X10 @ ( X9 @ X10 ) )
& ( X1 @ ( X9 @ X10 ) @ X10 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X26: a,X27: a,X28: a,X29: a > $o,X30: a,X31: a,X34: a,X35: a,X36: a] :
( ( ~ ( epred1_0 @ X26 @ X27 )
| ~ ( epred1_0 @ X27 @ X28 )
| ( epred1_0 @ X26 @ X28 ) )
& ( ~ ( X29 @ X30 )
| ( epred1_0 @ X30 @ ( esk1_0 @ X29 ) ) )
& ( ( X29 @ ( esk2_2 @ X29 @ X31 ) )
| ( epred1_0 @ ( esk1_0 @ X29 ) @ X31 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X29 @ X31 ) @ X31 )
| ( epred1_0 @ ( esk1_0 @ X29 ) @ X31 ) )
& ( ~ ( epred1_0 @ X34 @ X35 )
| ( epred1_0 @ ( esk3_0 @ X34 ) @ ( esk3_0 @ X35 ) ) )
& ( ~ ( epred1_0 @ X36 @ ( esk3_0 @ X36 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X36 ) @ X36 ) ) ),
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,X4: a,X5: a] :
( ( epred1_0 @ X3 @ X5 )
| ~ ( epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X4: a] :
( ( epred1_0 @ ( esk3_0 @ X3 ) @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( epred1_0 @ X3 @ ( esk3_0 @ X4 ) )
| ~ ( epred1_0 @ X3 @ ( esk3_0 @ X5 ) )
| ~ ( epred1_0 @ X5 @ X4 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( X6 @ ( esk2_2 @ X6 @ X3 ) )
| ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ X3 @ ( esk1_0 @ X6 ) )
| ~ ( X6 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_9,negated_conjecture,
! [X3: a,X20: a > a,X9: a > a,X4: a] :
( ( epred1_0
@ ( X9
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X20 @ Z0 ) ) )
@ X3 ) )
@ ( esk3_0 @ X4 ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X20 @ Z0 ) ) ) )
@ X3 )
| ~ ( epred1_0
@ ( X20
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X9 @ Z0 ) @ ( esk3_0 @ ( X20 @ Z0 ) ) )
@ X3 ) )
@ X4 ) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X1: a > a > $o,X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 )
@ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( X1 @ Z0 @ Z0 ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_11,negated_conjecture,
! [X6: a > $o,X3: a] :
( ( epred1_0 @ ( esk1_0 @ X6 ) @ X3 )
| ~ ( epred1_0 @ ( esk2_2 @ X6 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_12,negated_conjecture,
! [X3: a] :
( ( epred1_0
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) )
@ X3 )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X9: a > a,X3: a] :
( ( epred1_0 @ ( esk3_0 @ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ ( X9 @ Z0 ) ) ) ) )
| ~ ( epred1_0 @ X3 @ ( X9 @ ( esk3_0 @ X3 ) ) ) ),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
thf(c_0_14,negated_conjecture,
( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) )
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,negated_conjecture,
! [X3: a] :
( ~ ( epred1_0 @ X3 @ ( esk3_0 @ X3 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X3 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_16,negated_conjecture,
( epred1_0
@ ( esk3_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ Z0 ) ) ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV321^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n019.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 15:36:47 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.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.Cs2UQhvHj7/E---3.1_927445.p
% 39.02/5.95 % Version: 3.5.1-ho
% 39.02/5.95 % Preprocessing class: HSSSSMSSSSSNHHA.
% 39.02/5.95 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 39.02/5.95 % Starting sh2lt with 1200s (4) cores
% 39.02/5.95 % Starting new_ho_10_unif with 300s (1) cores
% 39.02/5.95 % Starting full_lambda_6 with 300s (1) cores
% 39.02/5.95 % Starting post_as_ho1 with 300s (1) cores
% 39.02/5.95 % Starting ehoh_best3_rw with 300s (1) cores
% 39.02/5.95 % sh2lt with pid 927475 completed with status 0
% 39.02/5.95 % Result found by sh2lt
% 39.02/5.95 % Preprocessing class: HSSSSMSSSSSNHHA.
% 39.02/5.95 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 39.02/5.95 % Starting sh2lt with 1200s (4) cores
% 39.02/5.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 39.02/5.95 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 39.02/5.95 % Search class: HGHNF-FFSF22-SHHFFSBN
% 39.02/5.95 % Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 39.02/5.95 % Starting SubtermCWHack with 121s (1) cores
% 39.02/5.95 % Starting new_ho_10_unif with 400s (1) cores
% 39.02/5.95 % Starting lpo8_s with 201s (1) cores
% 39.02/5.95 % Starting sh5l with 201s (1) cores
% 39.02/5.95 % new_ho_10_unif with pid 927484 completed with status 0
% 39.02/5.95 % Result found by new_ho_10_unif
% 39.02/5.95 % Preprocessing class: HSSSSMSSSSSNHHA.
% 39.02/5.95 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 39.02/5.95 % Starting sh2lt with 1200s (4) cores
% 39.02/5.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 39.02/5.95 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 39.02/5.95 % Search class: HGHNF-FFSF22-SHHFFSBN
% 39.02/5.95 % Scheduled 6 strats onto 4 cores with 1200 seconds (1200 total)
% 39.02/5.95 % Starting SubtermCWHack with 121s (1) cores
% 39.02/5.95 % Starting new_ho_10_unif with 400s (1) cores
% 39.02/5.95 % Preprocessing time : 0.002 s
% 39.02/5.95 % Presaturation interreduction done
% 39.02/5.95
% 39.02/5.95 % Proof found!
% 39.02/5.95 % SZS status Theorem
% 39.02/5.95 % SZS output start CNFRefutation
% See solution above
% 39.02/5.95 % Parsed axioms : 2
% 39.02/5.95 % Removed by relevancy pruning/SinE : 1
% 39.02/5.95 % Initial clauses : 6
% 39.02/5.95 % Removed in clause preprocessing : 0
% 39.02/5.95 % Initial clauses in saturation : 6
% 39.02/5.95 % Processed clauses : 865
% 39.02/5.95 % ...of these trivial : 128
% 39.02/5.95 % ...subsumed : 272
% 39.02/5.95 % ...remaining for further processing : 465
% 39.02/5.95 % Other redundant clauses eliminated : 0
% 39.02/5.95 % Clauses deleted for lack of memory : 0
% 39.02/5.95 % Backward-subsumed : 29
% 39.02/5.95 % Backward-rewritten : 47
% 39.02/5.95 % Generated clauses : 48580
% 39.02/5.95 % ...of the previous two non-redundant : 41700
% 39.02/5.95 % ...aggressively subsumed : 0
% 39.02/5.95 % Contextual simplify-reflections : 0
% 39.02/5.95 % Paramodulations : 48396
% 39.02/5.95 % Factorizations : 183
% 39.02/5.95 % NegExts : 0
% 39.02/5.95 % Equation resolutions : 1
% 39.02/5.95 % Disequality decompositions : 0
% 39.02/5.95 % Total rewrite steps : 7285
% 39.02/5.95 % ...of those cached : 6320
% 39.02/5.95 % Propositional unsat checks : 0
% 39.02/5.95 % Propositional check models : 0
% 39.02/5.95 % Propositional check unsatisfiable : 0
% 39.02/5.95 % Propositional clauses : 0
% 39.02/5.95 % Propositional clauses after purity: 0
% 39.02/5.95 % Propositional unsat core size : 0
% 39.02/5.95 % Propositional preprocessing time : 0.000
% 39.02/5.95 % Propositional encoding time : 0.000
% 39.02/5.95 % Propositional solver time : 0.000
% 39.02/5.95 % Success case prop preproc time : 0.000
% 39.02/5.95 % Success case prop encoding time : 0.000
% 39.02/5.95 % Success case prop solver time : 0.000
% 39.02/5.95 % Current number of processed clauses : 383
% 39.02/5.95 % Positive orientable unit clauses : 92
% 39.02/5.95 % Positive unorientable unit clauses: 0
% 39.02/5.95 % Negative unit clauses : 15
% 39.02/5.95 % Non-unit-clauses : 276
% 39.02/5.95 % Current number of unprocessed clauses: 40342
% 39.02/5.95 % ...number of literals in the above : 125900
% 39.02/5.95 % Current number of archived formulas : 0
% 39.02/5.95 % Current number of archived clauses : 82
% 39.02/5.95 % Clause-clause subsumption calls (NU) : 11966
% 39.02/5.95 % Rec. Clause-clause subsumption calls : 10032
% 39.02/5.95 % Non-unit clause-clause subsumptions : 293
% 39.02/5.95 % Unit Clause-clause subsumption calls : 2671
% 39.02/5.95 % Rewrite failures with RHS unbound : 0
% 39.02/5.95 % BW rewrite match attempts : 2202
% 39.02/5.95 % BW rewrite match successes : 57
% 39.02/5.95 % Condensation attempts : 865
% 39.02/5.95 % Condensation successes : 9
% 39.02/5.95 % Termbank termtop insertions : 12460812
% 39.02/5.95 % Search garbage collected termcells : 384
% 39.02/5.95
% 39.02/5.95 % -------------------------------------------------
% 39.02/5.95 % User time : 5.358 s
% 39.02/5.95 % System time : 0.193 s
% 39.02/5.95 % Total time : 5.551 s
% 39.02/5.95 % Maximum resident set size: 3592 pages
% 39.02/5.95
% 39.02/5.95 % -------------------------------------------------
% 39.02/5.95 % User time : 21.566 s
% 39.02/5.95 % System time : 0.670 s
% 39.02/5.95 % Total time : 22.236 s
% 39.02/5.95 % Maximum resident set size: 4864 pages
% 39.02/5.95 % E exiting
%------------------------------------------------------------------------------