%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO338^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:42:47 AM UTC 2026
% Result : Theorem 282.54s 37.41s
% Output : CNFRefutation 282.54s
% 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 : 50 ( 0 equ; 0 cnn)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 454 ( 46 ~; 62 |; 24 &; 322 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 ^; 45 !; 27 ?; 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(cT145_DOUBLE,conjecture,
! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ? [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
| ( X1 @ X3 @ X4 ) )
& ( ( X1 @ X4 @ X5 )
| ( X1 @ X4 @ X5 ) )
& ( ~ ( X1 @ X3 @ X5 )
| ~ ( X1 @ X3 @ X5 ) ) )
| ? [X6: a > $o] :
( ? [X7: a] :
( ( ( X6 @ X7 )
| ( X6 @ X7 ) )
& ( ~ ( X1 @ X7 @ ( X2 @ X6 ) )
| ~ ( X1 @ X7 @ ( X2 @ X6 ) ) ) )
| ? [X8: a] :
( ! [X9: a] :
( ~ ( X6 @ X9 )
| ~ ( X6 @ X9 )
| ( X1 @ X9 @ X8 )
| ( X1 @ X9 @ X8 ) )
& ( ~ ( X1 @ ( X2 @ X6 ) @ X8 )
| ~ ( X1 @ ( X2 @ X6 ) @ X8 ) ) ) )
| ! [X10: a > a] :
( ? [X11: a,X12: a] :
( ( ( X1 @ X11 @ X12 )
| ( X1 @ X11 @ X12 ) )
& ( ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) )
| ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) ) ) )
| ? [X13: a] :
( ( ( X1 @ X13 @ ( X10 @ X13 ) )
| ( X1 @ X13 @ ( X10 @ X13 ) ) )
& ( ( X1 @ ( X10 @ X13 ) @ X13 )
| ( X1 @ ( X10 @ X13 ) @ X13 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.xJwnPgpnM7/E---3.1_1906655.p',cT145_DOUBLE) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > $o ) > a] :
( ? [X3: a,X4: a,X5: a] :
( ( ( X1 @ X3 @ X4 )
| ( X1 @ X3 @ X4 ) )
& ( ( X1 @ X4 @ X5 )
| ( X1 @ X4 @ X5 ) )
& ( ~ ( X1 @ X3 @ X5 )
| ~ ( X1 @ X3 @ X5 ) ) )
| ? [X6: a > $o] :
( ? [X7: a] :
( ( ( X6 @ X7 )
| ( X6 @ X7 ) )
& ( ~ ( X1 @ X7 @ ( X2 @ X6 ) )
| ~ ( X1 @ X7 @ ( X2 @ X6 ) ) ) )
| ? [X8: a] :
( ! [X9: a] :
( ~ ( X6 @ X9 )
| ~ ( X6 @ X9 )
| ( X1 @ X9 @ X8 )
| ( X1 @ X9 @ X8 ) )
& ( ~ ( X1 @ ( X2 @ X6 ) @ X8 )
| ~ ( X1 @ ( X2 @ X6 ) @ X8 ) ) ) )
| ! [X10: a > a] :
( ? [X11: a,X12: a] :
( ( ( X1 @ X11 @ X12 )
| ( X1 @ X11 @ X12 ) )
& ( ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) )
| ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) ) ) )
| ? [X13: a] :
( ( ( X1 @ X13 @ ( X10 @ X13 ) )
| ( X1 @ X13 @ ( X10 @ X13 ) ) )
& ( ( X1 @ ( X10 @ X13 ) @ X13 )
| ( X1 @ ( X10 @ X13 ) @ X13 ) ) ) ) ),
inference(assume_negation,[status(cth)],[cT145_DOUBLE]) ).
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] :
( ? [X7: a] :
( ( X6 @ X7 )
& ~ ( X1 @ X7 @ ( X2 @ X6 ) ) )
| ? [X8: a] :
( ! [X9: a] :
( ~ ( X6 @ X9 )
| ( X1 @ X9 @ X8 )
| ( X1 @ X9 @ X8 ) )
& ~ ( X1 @ ( X2 @ X6 ) @ X8 ) ) )
| ! [X10: a > a] :
( ? [X11: a,X12: a] :
( ( X1 @ X11 @ X12 )
& ~ ( X1 @ ( X10 @ X11 ) @ ( X10 @ X12 ) ) )
| ? [X13: a] :
( ( X1 @ X13 @ ( X10 @ X13 ) )
& ( X1 @ ( X10 @ X13 ) @ X13 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
thf(c_0_3,negated_conjecture,
! [X29: a,X30: a,X31: a,X32: a > $o,X33: a,X34: a,X37: a,X38: a,X39: a] :
( ( ~ ( epred1_0 @ X29 @ X30 )
| ~ ( epred1_0 @ X30 @ X31 )
| ( epred1_0 @ X29 @ X31 ) )
& ( ~ ( X32 @ X33 )
| ( epred1_0 @ X33 @ ( esk1_0 @ X32 ) ) )
& ( ( X32 @ ( esk2_2 @ X32 @ X34 ) )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X32 @ X34 ) @ X34 )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ ( esk2_2 @ X32 @ X34 ) @ X34 )
| ( epred1_0 @ ( esk1_0 @ X32 ) @ X34 ) )
& ( ~ ( epred1_0 @ X37 @ X38 )
| ( epred1_0 @ ( esk3_0 @ X37 ) @ ( esk3_0 @ X38 ) ) )
& ( ~ ( epred1_0 @ X39 @ ( esk3_0 @ X39 ) )
| ~ ( epred1_0 @ ( esk3_0 @ X39 ) @ X39 ) ) ),
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,X23: a > a,X10: a > a,X4: a] :
( ( epred1_0
@ ( X10
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ Z0 ) ) )
@ X3 ) )
@ ( esk3_0 @ X4 ) )
| ( epred1_0
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ Z0 ) ) ) )
@ X3 )
| ~ ( epred1_0
@ ( X23
@ ( esk2_2
@ ^ [Z0: a] : ( epred1_0 @ ( X10 @ Z0 ) @ ( esk3_0 @ ( X23 @ 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,
! [X10: a > a,X3: a] :
( ( epred1_0 @ ( esk3_0 @ X3 )
@ ( esk1_0
@ ^ [Z0: a] : ( epred1_0 @ Z0 @ ( esk3_0 @ ( X10 @ Z0 ) ) ) ) )
| ~ ( epred1_0 @ X3 @ ( X10 @ ( 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 : SYO338^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.10/0.19 % Computer : n005.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 16:47:46 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running higher-order theorem proving
% 0.10/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.xJwnPgpnM7/E---3.1_1906655.p
% 282.54/37.41 % Version: 3.5.1-ho
% 282.54/37.41 % Preprocessing class: HSMSSMSSSSSNHHA.
% 282.54/37.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 282.54/37.41 % Starting full_lambda_6 with 900s (3) cores
% 282.54/37.41 % Starting post_as_ho1 with 300s (1) cores
% 282.54/37.41 % Starting lpo6_lambda_fix with 300s (1) cores
% 282.54/37.41 % Starting ho_unfolding_1 with 300s (1) cores
% 282.54/37.41 % Starting new_ho_10_unif with 300s (1) cores
% 282.54/37.41 % Starting ho_unfolding_2 with 300s (1) cores
% 282.54/37.41 % new_ho_10_unif with pid 1906672 completed with status 0
% 282.54/37.41 % Result found by new_ho_10_unif
% 282.54/37.41 % Preprocessing class: HSMSSMSSSSSNHHA.
% 282.54/37.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 282.54/37.41 % Starting full_lambda_6 with 900s (3) cores
% 282.54/37.41 % Starting post_as_ho1 with 300s (1) cores
% 282.54/37.41 % Starting lpo6_lambda_fix with 300s (1) cores
% 282.54/37.41 % Starting ho_unfolding_1 with 300s (1) cores
% 282.54/37.41 % Starting new_ho_10_unif with 300s (1) cores
% 282.54/37.41 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 282.54/37.41 % No SInE strategy applied
% 282.54/37.41 % Search class: HGHNF-FFSF22-SHHFFSBN
% 282.54/37.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 282.54/37.41 % Starting SubtermCWHack with 31s (1) cores
% 282.54/37.41 % SubtermCWHack with pid 1906681 completed with status 8
% 282.54/37.41 % Starting new_ho_10_unif with 100s (1) cores
% 282.54/37.41 % new_ho_10_unif with pid 1906731 completed with status 0
% 282.54/37.41 % Result found by new_ho_10_unif
% 282.54/37.41 % Preprocessing class: HSMSSMSSSSSNHHA.
% 282.54/37.41 % Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 282.54/37.41 % Starting full_lambda_6 with 900s (3) cores
% 282.54/37.41 % Starting post_as_ho1 with 300s (1) cores
% 282.54/37.41 % Starting lpo6_lambda_fix with 300s (1) cores
% 282.54/37.41 % Starting ho_unfolding_1 with 300s (1) cores
% 282.54/37.41 % Starting new_ho_10_unif with 300s (1) cores
% 282.54/37.41 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 282.54/37.41 % No SInE strategy applied
% 282.54/37.41 % Search class: HGHNF-FFSF22-SHHFFSBN
% 282.54/37.41 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 282.54/37.41 % Starting SubtermCWHack with 31s (1) cores
% 282.54/37.41 % SubtermCWHack with pid 1906681 completed with status 8
% 282.54/37.41 % Starting new_ho_10_unif with 100s (1) cores
% 282.54/37.41 % Preprocessing time : 0.001 s
% 282.54/37.41 % Presaturation interreduction done
% 282.54/37.41
% 282.54/37.41 % Proof found!
% 282.54/37.41 % SZS status Theorem
% 282.54/37.41 % SZS output start CNFRefutation
% See solution above
% 282.54/37.41 % Parsed axioms : 2
% 282.54/37.41 % Removed by relevancy pruning/SinE : 0
% 282.54/37.41 % Initial clauses : 8
% 282.54/37.41 % Removed in clause preprocessing : 1
% 282.54/37.41 % Initial clauses in saturation : 7
% 282.54/37.41 % Processed clauses : 769
% 282.54/37.41 % ...of these trivial : 118
% 282.54/37.41 % ...subsumed : 235
% 282.54/37.41 % ...remaining for further processing : 416
% 282.54/37.41 % Other redundant clauses eliminated : 0
% 282.54/37.41 % Clauses deleted for lack of memory : 0
% 282.54/37.41 % Backward-subsumed : 29
% 282.54/37.41 % Backward-rewritten : 39
% 282.54/37.41 % Generated clauses : 39504
% 282.54/37.41 % ...of the previous two non-redundant : 33987
% 282.54/37.41 % ...aggressively subsumed : 0
% 282.54/37.41 % Contextual simplify-reflections : 0
% 282.54/37.41 % Paramodulations : 39342
% 282.54/37.41 % Factorizations : 161
% 282.54/37.41 % NegExts : 0
% 282.54/37.41 % Equation resolutions : 1
% 282.54/37.41 % Disequality decompositions : 0
% 282.54/37.41 % Total rewrite steps : 5885
% 282.54/37.41 % ...of those cached : 5134
% 282.54/37.41 % Propositional unsat checks : 0
% 282.54/37.41 % Propositional check models : 0
% 282.54/37.41 % Propositional check unsatisfiable : 0
% 282.54/37.41 % Propositional clauses : 0
% 282.54/37.41 % Propositional clauses after purity: 0
% 282.54/37.41 % Propositional unsat core size : 0
% 282.54/37.41 % Propositional preprocessing time : 0.000
% 282.54/37.41 % Propositional encoding time : 0.000
% 282.54/37.41 % Propositional solver time : 0.000
% 282.54/37.41 % Success case prop preproc time : 0.000
% 282.54/37.41 % Success case prop encoding time : 0.000
% 282.54/37.41 % Success case prop solver time : 0.000
% 282.54/37.41 % Current number of processed clauses : 342
% 282.54/37.41 % Positive orientable unit clauses : 82
% 282.54/37.41 % Positive unorientable unit clauses: 0
% 282.54/37.41 % Negative unit clauses : 14
% 282.54/37.41 % Non-unit-clauses : 246
% 282.54/37.41 % Current number of unprocessed clauses: 32776
% 282.54/37.41 % ...number of literals in the above : 100993
% 282.54/37.41 % Current number of archived formulas : 0
% 282.54/37.41 % Current number of archived clauses : 74
% 282.54/37.41 % Clause-clause subsumption calls (NU) : 10350
% 282.54/37.41 % Rec. Clause-clause subsumption calls : 8765
% 282.54/37.41 % Non-unit clause-clause subsumptions : 258
% 282.54/37.41 % Unit Clause-clause subsumption calls : 2248
% 282.54/37.41 % Rewrite failures with RHS unbound : 0
% 282.54/37.41 % BW rewrite match attempts : 1688
% 282.54/37.41 % BW rewrite match successes : 48
% 282.54/37.41 % Condensation attempts : 769
% 282.54/37.41 % Condensation successes : 9
% 282.54/37.41 % Termbank termtop insertions : 10201379
% 282.54/37.41 % Search garbage collected termcells : 352
% 282.54/37.41
% 282.54/37.41 % -------------------------------------------------
% 282.54/37.41 % User time : 35.058 s
% 282.54/37.41 % System time : 1.092 s
% 282.54/37.41 % Total time : 36.150 s
% 282.54/37.41 % Maximum resident set size: 3600 pages
% 282.54/37.41
% 282.54/37.41 % -------------------------------------------------
% 282.54/37.41 % User time : 35.060 s
% 282.54/37.41 % System time : 1.100 s
% 282.54/37.41 % Total time : 36.160 s
% 282.54/37.41 % Maximum resident set size: 4608 pages
% 282.54/37.41 % E exiting
%------------------------------------------------------------------------------