%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV136^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 : n002.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:05 AM UTC 2026
% Result : Theorem 0.26s 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 0 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 222 ( 22 ~; 24 |; 14 &; 148 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 20 ( 20 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 0 ^; 48 !; 0 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_23,type,
epred1_0: a > a > $o ).
thf(decl_24,type,
epred2_0: ( a > a > $o ) > a > a > $o ).
thf(decl_25,type,
esk1_0: a ).
thf(decl_26,type,
esk2_0: a ).
thf(decl_27,type,
esk3_1: ( a > $o ) > a ).
thf(decl_28,type,
esk4_1: ( a > $o ) > a ).
thf(cTHM203_pme,conjecture,
! [X1: a > a > $o,X2: ( a > a > $o ) > a > a > $o] :
( ( ! [X3: a] : ( X2 @ X1 @ X3 @ X3 )
& ! [X3: a,X4: a,X5: a] :
( ( ( X2 @ X1 @ X3 @ X4 )
& ( X2 @ X1 @ X4 @ X5 ) )
=> ( X2 @ X1 @ X3 @ X5 ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X1 @ X3 @ X4 ) ) )
=> ! [X3: a,X4: a] :
( ! [X6: a > $o] :
( ! [X7: a,X5: a] :
( ( ( X1 @ X7 @ X5 )
& ( X6 @ X7 ) )
=> ( X6 @ X5 ) )
=> ( ( X6 @ X3 )
=> ( X6 @ X4 ) ) )
=> ( X2 @ X1 @ X3 @ X4 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6b0OH5OpXB/E---3.1_1417134.p',cTHM203_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a > a > $o,X2: ( a > a > $o ) > a > a > $o] :
( ( ! [X3: a] : ( X2 @ X1 @ X3 @ X3 )
& ! [X3: a,X4: a,X5: a] :
( ( ( X2 @ X1 @ X3 @ X4 )
& ( X2 @ X1 @ X4 @ X5 ) )
=> ( X2 @ X1 @ X3 @ X5 ) )
& ! [X3: a,X4: a] :
( ( X1 @ X3 @ X4 )
=> ( X2 @ X1 @ X3 @ X4 ) ) )
=> ! [X3: a,X4: a] :
( ! [X6: a > $o] :
( ! [X7: a,X5: a] :
( ( ( X1 @ X7 @ X5 )
& ( X6 @ X7 ) )
=> ( X6 @ X5 ) )
=> ( ( X6 @ X3 )
=> ( X6 @ X4 ) ) )
=> ( X2 @ X1 @ X3 @ X4 ) ) ),
inference(assume_negation,[status(cth)],[cTHM203_pme]) ).
thf(c_0_2,negated_conjecture,
! [X23: a,X24: a,X25: a,X26: a,X27: a,X28: a,X31: a > $o] :
( ( epred2_0 @ epred1_0 @ X23 @ X23 )
& ( ~ ( epred2_0 @ epred1_0 @ X24 @ X25 )
| ~ ( epred2_0 @ epred1_0 @ X25 @ X26 )
| ( epred2_0 @ epred1_0 @ X24 @ X26 ) )
& ( ~ ( epred1_0 @ X27 @ X28 )
| ( epred2_0 @ epred1_0 @ X27 @ X28 ) )
& ( ( epred1_0 @ ( esk3_1 @ X31 ) @ ( esk4_1 @ X31 ) )
| ~ ( X31 @ esk1_0 )
| ( X31 @ esk2_0 ) )
& ( ( X31 @ ( esk3_1 @ X31 ) )
| ~ ( X31 @ esk1_0 )
| ( X31 @ esk2_0 ) )
& ( ~ ( X31 @ ( esk4_1 @ X31 ) )
| ~ ( X31 @ esk1_0 )
| ( X31 @ esk2_0 ) )
& ~ ( epred2_0 @ epred1_0 @ esk1_0 @ esk2_0 ) ),
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,
! [X3: a,X4: a,X5: a] :
( ( epred2_0 @ epred1_0 @ X3 @ X5 )
| ~ ( epred2_0 @ epred1_0 @ X3 @ X4 )
| ~ ( epred2_0 @ epred1_0 @ X4 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X3: a,X4: a] :
( ( epred2_0 @ epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
! [X3: a,X5: a,X4: a] :
( ( epred2_0 @ epred1_0 @ X3 @ X4 )
| ~ ( epred2_0 @ epred1_0 @ X3 @ X5 )
| ~ ( epred1_0 @ X5 @ X4 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X6: a > $o] :
( ( X6 @ ( esk3_1 @ X6 ) )
| ( X6 @ esk2_0 )
| ~ ( X6 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X4: a,X3: a] :
( ( epred2_0 @ epred1_0 @ X3 @ esk2_0 )
| ( epred2_0 @ epred1_0 @ X3 @ X4 )
| ~ ( epred1_0 @ ( esk3_1 @ ( epred2_0 @ epred1_0 @ X3 ) ) @ X4 )
| ~ ( epred2_0 @ epred1_0 @ X3 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
thf(c_0_8,negated_conjecture,
! [X6: a > $o] :
( ( epred1_0 @ ( esk3_1 @ X6 ) @ ( esk4_1 @ X6 ) )
| ( X6 @ esk2_0 )
| ~ ( X6 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
! [X6: a > $o] :
( ( X6 @ esk2_0 )
| ~ ( X6 @ ( esk4_1 @ X6 ) )
| ~ ( X6 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
! [X3: a] :
( ( epred2_0 @ epred1_0 @ X3 @ esk2_0 )
| ~ ( epred2_0 @ epred1_0 @ X3 @ esk1_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_11,negated_conjecture,
! [X3: a] : ( epred2_0 @ epred1_0 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_12,negated_conjecture,
~ ( epred2_0 @ epred1_0 @ esk1_0 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV136^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 : n002.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:18:22 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 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.6b0OH5OpXB/E---3.1_1417134.p
% 0.26/0.26 % Version: 3.5.1-ho
% 0.26/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.26/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting sh2lt with 1200s (4) cores
% 0.26/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.26/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.26/0.26 % Starting post_as_ho1 with 300s (1) cores
% 0.26/0.26 % Starting ehoh_best3_rw with 300s (1) cores
% 0.26/0.26 % full_lambda_6 with pid 1417149 completed with status 0
% 0.26/0.26 % Result found by full_lambda_6
% 0.26/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.26/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting sh2lt with 1200s (4) cores
% 0.26/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.26/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.26/0.26 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.26/0.26 % Search class: HGUNF-FFSF11-SHHFFSBN
% 0.26/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.26 % SubtermCWHack with pid 1417152 completed with status 0
% 0.26/0.26 % Result found by SubtermCWHack
% 0.26/0.26 % Preprocessing class: HSSSSMSSSSSNHHA.
% 0.26/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26 % Starting sh2lt with 1200s (4) cores
% 0.26/0.26 % Starting new_ho_10_unif with 300s (1) cores
% 0.26/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.26/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountTerms,hypos,4,,4,20000,1.0,true))
% 0.26/0.26 % SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.26/0.26 % Search class: HGUNF-FFSF11-SHHFFSBN
% 0.26/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.26 % Preprocessing time : 0.001 s
% 0.26/0.26
% 0.26/0.26 % Proof found!
% 0.26/0.26 % SZS status Theorem
% 0.26/0.26 % SZS output start CNFRefutation
% See solution above
% 0.26/0.26 % Parsed axioms : 2
% 0.26/0.26 % Removed by relevancy pruning/SinE : 1
% 0.26/0.26 % Initial clauses : 7
% 0.26/0.26 % Removed in clause preprocessing : 0
% 0.26/0.26 % Initial clauses in saturation : 7
% 0.26/0.26 % Processed clauses : 20
% 0.26/0.26 % ...of these trivial : 0
% 0.26/0.26 % ...subsumed : 1
% 0.26/0.26 % ...remaining for further processing : 19
% 0.26/0.26 % Other redundant clauses eliminated : 0
% 0.26/0.26 % Clauses deleted for lack of memory : 0
% 0.26/0.26 % Backward-subsumed : 3
% 0.26/0.26 % Backward-rewritten : 0
% 0.26/0.26 % Generated clauses : 23
% 0.26/0.26 % ...of the previous two non-redundant : 21
% 0.26/0.26 % ...aggressively subsumed : 0
% 0.26/0.26 % Contextual simplify-reflections : 1
% 0.26/0.26 % Paramodulations : 23
% 0.26/0.26 % Factorizations : 0
% 0.26/0.26 % NegExts : 0
% 0.26/0.26 % Equation resolutions : 0
% 0.26/0.26 % Disequality decompositions : 0
% 0.26/0.26 % Total rewrite steps : 0
% 0.26/0.26 % ...of those cached : 0
% 0.26/0.26 % Propositional unsat checks : 0
% 0.26/0.26 % Propositional check models : 0
% 0.26/0.26 % Propositional check unsatisfiable : 0
% 0.26/0.26 % Propositional clauses : 0
% 0.26/0.26 % Propositional clauses after purity: 0
% 0.26/0.26 % Propositional unsat core size : 0
% 0.26/0.26 % Propositional preprocessing time : 0.000
% 0.26/0.26 % Propositional encoding time : 0.000
% 0.26/0.26 % Propositional solver time : 0.000
% 0.26/0.26 % Success case prop preproc time : 0.000
% 0.26/0.26 % Success case prop encoding time : 0.000
% 0.26/0.26 % Success case prop solver time : 0.000
% 0.26/0.26 % Current number of processed clauses : 16
% 0.26/0.26 % Positive orientable unit clauses : 1
% 0.26/0.26 % Positive unorientable unit clauses: 0
% 0.26/0.26 % Negative unit clauses : 2
% 0.26/0.26 % Non-unit-clauses : 13
% 0.26/0.26 % Current number of unprocessed clauses: 7
% 0.26/0.26 % ...number of literals in the above : 35
% 0.26/0.26 % Current number of archived formulas : 0
% 0.26/0.26 % Current number of archived clauses : 3
% 0.26/0.26 % Clause-clause subsumption calls (NU) : 117
% 0.26/0.26 % Rec. Clause-clause subsumption calls : 97
% 0.26/0.26 % Non-unit clause-clause subsumptions : 5
% 0.26/0.26 % Unit Clause-clause subsumption calls : 1
% 0.26/0.26 % Rewrite failures with RHS unbound : 0
% 0.26/0.26 % BW rewrite match attempts : 0
% 0.26/0.26 % BW rewrite match successes : 0
% 0.26/0.26 % Condensation attempts : 0
% 0.26/0.26 % Condensation successes : 0
% 0.26/0.26 % Termbank termtop insertions : 1516
% 0.26/0.26 % Search garbage collected termcells : 356
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.004 s
% 0.26/0.26 % System time : 0.002 s
% 0.26/0.26 % Total time : 0.006 s
% 0.26/0.26 % Maximum resident set size: 3640 pages
% 0.26/0.26
% 0.26/0.26 % -------------------------------------------------
% 0.26/0.26 % User time : 0.004 s
% 0.26/0.26 % System time : 0.008 s
% 0.26/0.26 % Total time : 0.012 s
% 0.26/0.26 % Maximum resident set size: 4864 pages
% 0.26/0.26 % E exiting
%------------------------------------------------------------------------------