%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL734^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 : n008.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:12:07 AM UTC 2026
% Result : Theorem 0.10s 0.26s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ; 0 cnn)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 107 ( 7 ~; 10 |; 3 &; 81 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 44 ( 44 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 1 con; 0-3 aty)
% Number of variables : 31 ( 0 ^; 23 !; 8 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
b: $tType ).
thf(decl_23,type,
epred1_2: ( ( b > $o ) > b > $o ) > ( ( b > $o ) > b > $o ) > b > $o ).
thf(decl_24,type,
esk1_2: ( ( b > $o ) > b > $o ) > ( ( b > $o ) > b > $o ) > ( b > $o ) > b ).
thf(decl_25,type,
epred2_1: ( ( b > $o ) > b ) > b > $o ).
thf(decl_26,type,
esk2_1: ( ( b > $o ) > b ) > b ).
thf(decl_27,type,
esk3_0: ( b > $o ) > b ).
thf(cX5310B,conjecture,
( ! [X1: ( b > $o ) > b > $o,X2: ( b > $o ) > b > $o] :
( ! [X3: b > $o] :
? [X4: b] :
( ( X1 @ X3 @ X4 )
| ( X2 @ X3 @ X4 ) )
=> ? [X5: ( b > $o ) > b] :
! [X3: b > $o] :
( ( X1 @ X3 @ ( X5 @ X3 ) )
| ( X2 @ X3 @ ( X5 @ X3 ) ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.p2eG3iMftW/E---3.1_2950397.p',cX5310B) ).
thf(c_0_1,negated_conjecture,
~ ( ! [X1: ( b > $o ) > b > $o,X2: ( b > $o ) > b > $o] :
( ! [X3: b > $o] :
? [X4: b] :
( ( X1 @ X3 @ X4 )
| ( X2 @ X3 @ X4 ) )
=> ? [X5: ( b > $o ) > b] :
! [X3: b > $o] :
( ( X1 @ X3 @ ( X5 @ X3 ) )
| ( X2 @ X3 @ ( X5 @ X3 ) ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[cX5310B]) ).
thf(c_0_2,negated_conjecture,
! [X18: ( b > $o ) > b > $o,X19: ( b > $o ) > b > $o,X21: b,X22: b,X24: b > $o,X25: ( b > $o ) > b] :
( ( ~ ( X18 @ ( epred1_2 @ X18 @ X19 ) @ X21 )
| ( X18 @ X24 @ ( esk1_2 @ X18 @ X19 @ X24 ) )
| ( X19 @ X24 @ ( esk1_2 @ X18 @ X19 @ X24 ) ) )
& ( ~ ( X19 @ ( epred1_2 @ X18 @ X19 ) @ X22 )
| ( X18 @ X24 @ ( esk1_2 @ X18 @ X19 @ X24 ) )
| ( X19 @ X24 @ ( esk1_2 @ X18 @ X19 @ X24 ) ) )
& ( epred2_1 @ X25 @ ( esk2_1 @ X25 ) )
& ~ ( epred2_1 @ X25 @ ( X25 @ ( epred2_1 @ X25 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X5: ( b > $o ) > b] :
~ ( epred2_1 @ X5 @ ( X5 @ ( epred2_1 @ X5 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X28: b > $o,X29: b] :
( ( X28 @ ( esk3_0 @ X28 ) )
| ~ ( X28 @ X29 ) ),
inference(introduce_choice_axiom,[status(thm)],[]) ).
thf(c_0_5,negated_conjecture,
! [X5: ( b > $o ) > b,X4: b] :
( ( epred2_1 @ X5 @ ( esk3_0 @ ( epred2_1 @ X5 ) ) )
| ~ ( epred2_1 @ X5 @ X4 ) ),
inference(choice_inst,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X5: ( b > $o ) > b] : ( epred2_1 @ X5 @ ( esk2_1 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X5: ( b > $o ) > b] : ( epred2_1 @ X5 @ ( esk3_0 @ ( epred2_1 @ X5 ) ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_3,c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL734^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.10/0.18 % Computer : n008.cluster.edu
% 0.10/0.18 % Model : x86_64 x86_64
% 0.10/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18 % Memory : 8046.5625MB
% 0.10/0.18 % OS : Linux 6.8.0-71-generic
% 0.10/0.18 % CPULimit : 300
% 0.10/0.18 % WCLimit : 300
% 0.10/0.18 % DateTime : Tue Sep 29 10:08:24 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.22 Running higher-order theorem proving
% 0.10/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.p2eG3iMftW/E---3.1_2950397.p
% 0.10/0.26 % Version: 3.5.1-ho
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting sh2lt with 1200s (4) cores
% 0.10/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.26 % Starting ehoh_best3_rw with 300s (1) cores
% 0.10/0.26 % ehoh_best3_rw with pid 2950414 completed with status 0
% 0.10/0.26 % Result found by ehoh_best3_rw
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting sh2lt with 1200s (4) cores
% 0.10/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.26 % Starting ehoh_best3_rw with 300s (1) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf120_gu_RUU_F100_L01000)
% 0.10/0.26 % SinE strategy is gf120_gu_RUU_F100_L01000
% 0.10/0.26 % Search class: HGUNF-FFSF21-SHHFFMBN
% 0.10/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.26 % SubtermCWHack with pid 2950421 completed with status 0
% 0.10/0.26 % Result found by SubtermCWHack
% 0.10/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.10/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.26 % Starting sh2lt with 1200s (4) cores
% 0.10/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.10/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.10/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.10/0.26 % Starting ehoh_best3_rw with 300s (1) cores
% 0.10/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf120_gu_RUU_F100_L01000)
% 0.10/0.26 % SinE strategy is gf120_gu_RUU_F100_L01000
% 0.10/0.26 % Search class: HGUNF-FFSF21-SHHFFMBN
% 0.10/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.26 % Preprocessing time : 0.001 s
% 0.10/0.26
% 0.10/0.26 % Proof found!
% 0.10/0.26 % SZS status Theorem
% 0.10/0.26 % SZS output start CNFRefutation
% See solution above
% 0.10/0.26 % Parsed axioms : 2
% 0.10/0.26 % Removed by relevancy pruning/SinE : 1
% 0.10/0.26 % Initial clauses : 4
% 0.10/0.26 % Removed in clause preprocessing : 0
% 0.10/0.26 % Initial clauses in saturation : 4
% 0.10/0.26 % Processed clauses : 4
% 0.10/0.26 % ...of these trivial : 0
% 0.10/0.26 % ...subsumed : 0
% 0.10/0.26 % ...remaining for further processing : 4
% 0.10/0.26 % Other redundant clauses eliminated : 0
% 0.10/0.26 % Clauses deleted for lack of memory : 0
% 0.10/0.26 % Backward-subsumed : 0
% 0.10/0.26 % Backward-rewritten : 1
% 0.10/0.26 % Generated clauses : 4
% 0.10/0.26 % ...of the previous two non-redundant : 3
% 0.10/0.26 % ...aggressively subsumed : 0
% 0.10/0.26 % Contextual simplify-reflections : 0
% 0.10/0.26 % Paramodulations : 2
% 0.10/0.26 % Factorizations : 0
% 0.10/0.26 % NegExts : 0
% 0.10/0.26 % Equation resolutions : 0
% 0.10/0.26 % Disequality decompositions : 0
% 0.10/0.26 % Total rewrite steps : 1
% 0.10/0.26 % ...of those cached : 0
% 0.10/0.26 % Propositional unsat checks : 0
% 0.10/0.26 % Propositional check models : 0
% 0.10/0.26 % Propositional check unsatisfiable : 0
% 0.10/0.26 % Propositional clauses : 0
% 0.10/0.26 % Propositional clauses after purity: 0
% 0.10/0.26 % Propositional unsat core size : 0
% 0.10/0.26 % Propositional preprocessing time : 0.000
% 0.10/0.26 % Propositional encoding time : 0.000
% 0.10/0.26 % Propositional solver time : 0.000
% 0.10/0.26 % Success case prop preproc time : 0.000
% 0.10/0.26 % Success case prop encoding time : 0.000
% 0.10/0.26 % Success case prop solver time : 0.000
% 0.10/0.26 % Current number of processed clauses : 3
% 0.10/0.26 % Positive orientable unit clauses : 2
% 0.10/0.26 % Positive unorientable unit clauses: 0
% 0.10/0.26 % Negative unit clauses : 1
% 0.10/0.26 % Non-unit-clauses : 0
% 0.10/0.26 % Current number of unprocessed clauses: 3
% 0.10/0.26 % ...number of literals in the above : 8
% 0.10/0.26 % Current number of archived formulas : 0
% 0.10/0.26 % Current number of archived clauses : 2
% 0.10/0.26 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.26 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.26 % Non-unit clause-clause subsumptions : 0
% 0.10/0.26 % Unit Clause-clause subsumption calls : 0
% 0.10/0.26 % Rewrite failures with RHS unbound : 0
% 0.10/0.26 % BW rewrite match attempts : 1
% 0.10/0.26 % BW rewrite match successes : 1
% 0.10/0.26 % Condensation attempts : 0
% 0.10/0.26 % Condensation successes : 0
% 0.10/0.26 % Termbank termtop insertions : 599
% 0.10/0.26 % Search garbage collected termcells : 214
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.001 s
% 0.10/0.26 % System time : 0.003 s
% 0.10/0.26 % Total time : 0.004 s
% 0.10/0.26 % Maximum resident set size: 3584 pages
% 0.10/0.26
% 0.10/0.26 % -------------------------------------------------
% 0.10/0.26 % User time : 0.001 s
% 0.10/0.26 % System time : 0.010 s
% 0.10/0.26 % Total time : 0.011 s
% 0.10/0.26 % Maximum resident set size: 4864 pages
% 0.10/0.26 % E exiting
%------------------------------------------------------------------------------