%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV235^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 : n013.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:15 AM UTC 2026
% Result : Theorem 0.07s 0.28s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 137 ( 0 equ; 0 cnn)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 307 ( 59 ~; 83 |; 15 &; 142 @)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 23 ( 0 ^; 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cE: $i > $o ).
thf(decl_24,type,
cD: $i > $o ).
thf(decl_25,type,
epred1_0: $i > $o ).
thf(decl_26,type,
esk1_0: $i ).
thf(decl_27,type,
esk2_0: $i ).
thf(decl_28,type,
esk3_0: $i ).
thf(cTHM46A_pme,conjecture,
! [X1: $i > $o] :
( ! [X2: $i] :
( ( X1 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) )
<=> ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( cD @ X2 ) )
& ! [X2: $i] :
( ( X1 @ X2 )
=> ( cE @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.puyDoyvi8q/E---3.1_2247295.p',cTHM46A_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: $i > $o] :
( ! [X2: $i] :
( ( X1 @ X2 )
=> ( ( cD @ X2 )
& ( cE @ X2 ) ) )
<=> ( ! [X2: $i] :
( ( X1 @ X2 )
=> ( cD @ X2 ) )
& ! [X2: $i] :
( ( X1 @ X2 )
=> ( cE @ X2 ) ) ) ),
inference(assume_negation,[status(cth)],[cTHM46A_pme]) ).
thf(c_0_2,negated_conjecture,
! [X11: $i,X12: $i,X13: $i] :
( ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cD @ X12 )
| ( cD @ X11 )
| ~ ( epred1_0 @ X11 ) )
& ( ~ ( epred1_0 @ X13 )
| ( cE @ X13 )
| ( cD @ X11 )
| ~ ( epred1_0 @ X11 ) )
& ( ~ ( epred1_0 @ X12 )
| ( cD @ X12 )
| ( cE @ X11 )
| ~ ( epred1_0 @ X11 ) )
& ( ~ ( epred1_0 @ X13 )
| ( cE @ X13 )
| ( cE @ X11 )
| ~ ( epred1_0 @ X11 ) ) ),
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,
! [X2: $i,X4: $i] :
( ( cE @ X2 )
| ( cE @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i,X4: $i] :
( ( cD @ X2 )
| ( cD @ X4 )
| ~ ( epred1_0 @ X2 )
| ~ ( epred1_0 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk2_0 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk1_0 )
| ( cD @ esk2_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
( ( cD @ esk2_0 )
| ( epred1_0 @ esk1_0 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
thf(c_0_12,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_13,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( cE @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
thf(c_0_15,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk1_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_13]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i] :
( ( cE @ esk1_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_3,c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X2: $i] :
( ( cD @ esk1_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
thf(c_0_19,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ( epred1_0 @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_20,negated_conjecture,
cE @ esk1_0,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
thf(c_0_21,negated_conjecture,
cD @ esk1_0,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
thf(c_0_22,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( cE @ esk3_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_23,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ( epred1_0 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),c_0_21])]) ).
thf(c_0_24,negated_conjecture,
( ( epred1_0 @ esk2_0 )
| ~ ( cE @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_20])]),c_0_21])]) ).
thf(c_0_25,negated_conjecture,
! [X2: $i] :
( ( epred1_0 @ esk2_0 )
| ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_23]),c_0_24]) ).
thf(c_0_26,negated_conjecture,
epred1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]) ).
thf(c_0_27,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_28,negated_conjecture,
! [X2: $i] :
( ( cD @ esk2_0 )
| ( cD @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_7,c_0_26]) ).
thf(c_0_29,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 )
| ~ ( cD @ esk1_0 )
| ~ ( cE @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_30,negated_conjecture,
( ( epred1_0 @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_20])]),c_0_21])]) ).
thf(c_0_31,negated_conjecture,
cD @ esk2_0,
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
thf(c_0_32,negated_conjecture,
( ~ ( cE @ esk3_0 )
| ~ ( cD @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_20])]),c_0_21])]) ).
thf(c_0_33,negated_conjecture,
epred1_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
thf(c_0_34,negated_conjecture,
~ ( cE @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31])]) ).
thf(c_0_35,negated_conjecture,
! [X2: $i] :
( ( cE @ X2 )
| ~ ( epred1_0 @ X2 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_33]),c_0_34]) ).
thf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV235^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.07/0.19 % Computer : n013.cluster.edu
% 0.07/0.19 % Model : x86_64 x86_64
% 0.07/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19 % Memory : 8046.5625MB
% 0.07/0.19 % OS : Linux 6.8.0-71-generic
% 0.07/0.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Tue Sep 29 15:26:10 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.24 Running higher-order theorem proving
% 0.07/0.25 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.puyDoyvi8q/E---3.1_2247295.p
% 0.07/0.28 % Version: 3.5.1-ho
% 0.07/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.28 % Starting full_lambda_10 with 300s (1) cores
% 0.07/0.28 % Starting new_ho_8 with 300s (1) cores
% 0.07/0.28 % post_as_ho2 with pid 2247332 completed with status 0
% 0.07/0.28 % Result found by post_as_ho2
% 0.07/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.28 % No SInE strategy applied
% 0.07/0.28 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.07/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.28 % SubtermCWHack with pid 2247336 completed with status 0
% 0.07/0.28 % Result found by SubtermCWHack
% 0.07/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.07/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.07/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho4 with 300s (1) cores
% 0.07/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.07/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.28 % No SInE strategy applied
% 0.07/0.28 % Search class: HGHNF-FFSF00-SSSFFFNN
% 0.07/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.28 % Preprocessing time : 0.001 s
% 0.07/0.28
% 0.07/0.28 % Proof found!
% 0.07/0.28 % SZS status Theorem
% 0.07/0.28 % SZS output start CNFRefutation
% See solution above
% 0.07/0.28 % Parsed axioms : 3
% 0.07/0.28 % Removed by relevancy pruning/SinE : 0
% 0.07/0.28 % Initial clauses : 14
% 0.07/0.28 % Removed in clause preprocessing : 2
% 0.07/0.28 % Initial clauses in saturation : 12
% 0.07/0.28 % Processed clauses : 49
% 0.07/0.28 % ...of these trivial : 0
% 0.07/0.28 % ...subsumed : 3
% 0.07/0.28 % ...remaining for further processing : 46
% 0.07/0.28 % Other redundant clauses eliminated : 0
% 0.07/0.28 % Clauses deleted for lack of memory : 0
% 0.07/0.28 % Backward-subsumed : 12
% 0.07/0.28 % Backward-rewritten : 24
% 0.07/0.28 % Generated clauses : 55
% 0.07/0.28 % ...of the previous two non-redundant : 48
% 0.07/0.28 % ...aggressively subsumed : 0
% 0.07/0.28 % Contextual simplify-reflections : 8
% 0.07/0.28 % Paramodulations : 55
% 0.07/0.28 % Factorizations : 0
% 0.07/0.28 % NegExts : 0
% 0.07/0.28 % Equation resolutions : 0
% 0.07/0.28 % Disequality decompositions : 0
% 0.07/0.28 % Total rewrite steps : 35
% 0.07/0.28 % ...of those cached : 28
% 0.07/0.28 % Propositional unsat checks : 0
% 0.07/0.28 % Propositional check models : 0
% 0.07/0.28 % Propositional check unsatisfiable : 0
% 0.07/0.28 % Propositional clauses : 0
% 0.07/0.28 % Propositional clauses after purity: 0
% 0.07/0.28 % Propositional unsat core size : 0
% 0.07/0.28 % Propositional preprocessing time : 0.000
% 0.07/0.28 % Propositional encoding time : 0.000
% 0.07/0.28 % Propositional solver time : 0.000
% 0.07/0.28 % Success case prop preproc time : 0.000
% 0.07/0.28 % Success case prop encoding time : 0.000
% 0.07/0.28 % Success case prop solver time : 0.000
% 0.07/0.28 % Current number of processed clauses : 10
% 0.07/0.28 % Positive orientable unit clauses : 7
% 0.07/0.28 % Positive unorientable unit clauses: 0
% 0.07/0.28 % Negative unit clauses : 1
% 0.07/0.28 % Non-unit-clauses : 2
% 0.07/0.28 % Current number of unprocessed clauses: 1
% 0.07/0.28 % ...number of literals in the above : 3
% 0.07/0.28 % Current number of archived formulas : 0
% 0.07/0.28 % Current number of archived clauses : 36
% 0.07/0.28 % Clause-clause subsumption calls (NU) : 39
% 0.07/0.28 % Rec. Clause-clause subsumption calls : 31
% 0.07/0.28 % Non-unit clause-clause subsumptions : 22
% 0.07/0.28 % Unit Clause-clause subsumption calls : 1
% 0.07/0.28 % Rewrite failures with RHS unbound : 0
% 0.07/0.28 % BW rewrite match attempts : 6
% 0.07/0.28 % BW rewrite match successes : 6
% 0.07/0.28 % Condensation attempts : 0
% 0.07/0.28 % Condensation successes : 0
% 0.07/0.28 % Termbank termtop insertions : 1655
% 0.07/0.28 % Search garbage collected termcells : 229
% 0.07/0.28
% 0.07/0.28 % -------------------------------------------------
% 0.07/0.28 % User time : 0.004 s
% 0.07/0.28 % System time : 0.001 s
% 0.07/0.28 % Total time : 0.005 s
% 0.07/0.28 % Maximum resident set size: 3628 pages
% 0.07/0.28
% 0.07/0.28 % -------------------------------------------------
% 0.07/0.28 % User time : 0.007 s
% 0.07/0.28 % System time : 0.004 s
% 0.07/0.28 % Total time : 0.011 s
% 0.07/0.28 % Maximum resident set size: 4608 pages
% 0.07/0.28 % E exiting
%------------------------------------------------------------------------------