%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEV384^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:35:26 AM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 140 ( 21 ~; 16 |; 12 &; 79 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 4 ^; 31 !; 2 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
cP: $i > $o ).
thf(decl_24,type,
s: $i > $o ).
thf(decl_25,type,
cR: $i > $i > $o ).
thf(decl_26,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_27,type,
esk2_1: $i > $i ).
thf(decl_28,type,
esk3_0: $i ).
thf(cTHM117B,conjecture,
( ( ! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ? [X3: $i] :
( ( X1 @ X3 )
& ! [X4: $i] :
( ( cR @ X3 @ X4 )
=> ~ ( X1 @ X4 ) ) ) )
& ! [X5: $i] :
( ! [X6: $i] :
( ( ( s @ X6 )
& ( cR @ X5 @ X6 ) )
=> ( cP @ X6 ) )
=> ( cP @ X5 ) ) )
=> ! [X7: $i] :
( ( s @ X7 )
=> ( cP @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.XEiYOqiFTG/E---3.1_1826607.p',cTHM117B) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
=> ? [X3: $i] :
( ( X1 @ X3 )
& ! [X4: $i] :
( ( cR @ X3 @ X4 )
=> ~ ( X1 @ X4 ) ) ) )
& ! [X5: $i] :
( ! [X6: $i] :
( ( ( s @ X6 )
& ( cR @ X5 @ X6 ) )
=> ( cP @ X6 ) )
=> ( cP @ X5 ) ) )
=> ! [X7: $i] :
( ( s @ X7 )
=> ( cP @ X7 ) ) ),
inference(assume_negation,[status(cth)],[cTHM117B]) ).
thf(c_0_2,negated_conjecture,
! [X15: $i > $o,X16: $i,X18: $i,X19: $i] :
( ( ( X15 @ ( esk1_1 @ X15 ) )
| ~ ( X15 @ X16 ) )
& ( ~ ( cR @ ( esk1_1 @ X15 ) @ X18 )
| ~ ( X15 @ X18 )
| ~ ( X15 @ X16 ) )
& ( ( s @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( ( cR @ X19 @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( ~ ( cP @ ( esk2_1 @ X19 ) )
| ( cP @ X19 ) )
& ( s @ esk3_0 )
& ~ ( cP @ esk3_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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X1: $i > $o,X2: $i,X3: $i] :
( ~ ( cR @ ( esk1_1 @ X1 ) @ X2 )
| ~ ( X1 @ X2 )
| ~ ( X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X1: $i > $o,X3: $i,X2: $i] :
( ( X1 @ X2 )
| ( X1 @ X3 )
| ~ ( cR
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) )
@ X2 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i] :
( ( cR @ X2 @ ( esk2_1 @ X2 ) )
| ( cP @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( X1 @ ( esk1_1 @ X1 ) )
| ~ ( X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_7,negated_conjecture,
! [X2: $i] :
( ( cP @ X2 )
| ~ ( cP @ ( esk2_1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
! [X1: $i > $o,X2: $i] :
( ( X1
@ ( esk2_1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) )
| ( cP
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) )
| ( X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i,X1: $i > $o] :
( ( X1 @ X2 )
| ~ ( X1
@ ( esk1_1
@ ^ [Z0: $i] :
~ ( X1 @ Z0 ) ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_10,negated_conjecture,
~ ( cP @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_11,negated_conjecture,
! [X2: $i] : ( cP @ X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV384^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.08/0.18 % Computer : n005.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:43:01 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.23 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.XEiYOqiFTG/E---3.1_1826607.p
% 0.21/0.29 % Version: 3.5.1-ho
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.21/0.29 % Starting new_bool_9 with 300s (1) cores
% 0.21/0.29 % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.29 % Starting post_as_ho4 with 300s (1) cores
% 0.21/0.29 % Starting post_as_ho2 with 300s (1) cores
% 0.21/0.29 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.29 % Starting full_lambda_10 with 300s (1) cores
% 0.21/0.29 % Starting new_ho_8 with 300s (1) cores
% 0.21/0.29 % post_as_ho1 with pid 1826622 completed with status 0
% 0.21/0.29 % Result found by post_as_ho1
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.21/0.29 % Starting new_bool_9 with 300s (1) cores
% 0.21/0.29 % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.29 % No SInE strategy applied
% 0.21/0.29 % Search class: HGHNF-FFSF11-SSSFFSBC
% 0.21/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.29 % SubtermCWHack with pid 1826631 completed with status 10
% 0.21/0.29 % Starting post_as_ho1 with 31s (1) cores
% 0.21/0.29 % post_as_ho1 with pid 1826637 completed with status 10
% 0.21/0.29 % Starting new_bool_3 with 28s (1) cores
% 0.21/0.29 % new_bool_3 with pid 1826640 completed with status 0
% 0.21/0.29 % Result found by new_bool_3
% 0.21/0.29 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.21/0.29 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.29 % Starting post_as_ho12 with 300s (1) cores
% 0.21/0.29 % Starting new_bool_9 with 300s (1) cores
% 0.21/0.29 % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.29 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.29 % No SInE strategy applied
% 0.21/0.29 % Search class: HGHNF-FFSF11-SSSFFSBC
% 0.21/0.29 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.29 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.29 % SubtermCWHack with pid 1826631 completed with status 10
% 0.21/0.29 % Starting post_as_ho1 with 31s (1) cores
% 0.21/0.29 % post_as_ho1 with pid 1826637 completed with status 10
% 0.21/0.29 % Starting new_bool_3 with 28s (1) cores
% 0.21/0.29 % Preprocessing time : 0.001 s
% 0.21/0.29 % Presaturation interreduction done
% 0.21/0.29
% 0.21/0.29 % Proof found!
% 0.21/0.29 % SZS status Theorem
% 0.21/0.29 % SZS output start CNFRefutation
% See solution above
% 0.21/0.29 % Parsed axioms : 4
% 0.21/0.29 % Removed by relevancy pruning/SinE : 0
% 0.21/0.29 % Initial clauses : 10
% 0.21/0.29 % Removed in clause preprocessing : 3
% 0.21/0.29 % Initial clauses in saturation : 7
% 0.21/0.29 % Processed clauses : 161
% 0.21/0.29 % ...of these trivial : 14
% 0.21/0.29 % ...subsumed : 55
% 0.21/0.29 % ...remaining for further processing : 92
% 0.21/0.29 % Other redundant clauses eliminated : 10
% 0.21/0.29 % Clauses deleted for lack of memory : 0
% 0.21/0.29 % Backward-subsumed : 6
% 0.21/0.29 % Backward-rewritten : 33
% 0.21/0.29 % Generated clauses : 630
% 0.21/0.29 % ...of the previous two non-redundant : 498
% 0.21/0.29 % ...aggressively subsumed : 0
% 0.21/0.29 % Contextual simplify-reflections : 2
% 0.21/0.29 % Paramodulations : 569
% 0.21/0.29 % Factorizations : 0
% 0.21/0.29 % NegExts : 11
% 0.21/0.29 % Equation resolutions : 12
% 0.21/0.29 % Disequality decompositions : 0
% 0.21/0.29 % Total rewrite steps : 202
% 0.21/0.29 % ...of those cached : 183
% 0.21/0.29 % Propositional unsat checks : 0
% 0.21/0.29 % Propositional check models : 0
% 0.21/0.29 % Propositional check unsatisfiable : 0
% 0.21/0.29 % Propositional clauses : 0
% 0.21/0.29 % Propositional clauses after purity: 0
% 0.21/0.29 % Propositional unsat core size : 0
% 0.21/0.29 % Propositional preprocessing time : 0.000
% 0.21/0.29 % Propositional encoding time : 0.000
% 0.21/0.29 % Propositional solver time : 0.000
% 0.21/0.29 % Success case prop preproc time : 0.000
% 0.21/0.29 % Success case prop encoding time : 0.000
% 0.21/0.29 % Success case prop solver time : 0.000
% 0.21/0.29 % Current number of processed clauses : 41
% 0.21/0.29 % Positive orientable unit clauses : 3
% 0.21/0.29 % Positive unorientable unit clauses: 2
% 0.21/0.29 % Negative unit clauses : 6
% 0.21/0.29 % Non-unit-clauses : 30
% 0.21/0.29 % Current number of unprocessed clauses: 351
% 0.21/0.29 % ...number of literals in the above : 1038
% 0.21/0.29 % Current number of archived formulas : 0
% 0.21/0.29 % Current number of archived clauses : 51
% 0.21/0.29 % Clause-clause subsumption calls (NU) : 1086
% 0.21/0.29 % Rec. Clause-clause subsumption calls : 824
% 0.21/0.29 % Non-unit clause-clause subsumptions : 46
% 0.21/0.29 % Unit Clause-clause subsumption calls : 88
% 0.21/0.29 % Rewrite failures with RHS unbound : 0
% 0.21/0.29 % BW rewrite match attempts : 142
% 0.21/0.29 % BW rewrite match successes : 59
% 0.21/0.29 % Condensation attempts : 0
% 0.21/0.29 % Condensation successes : 0
% 0.21/0.29 % Termbank termtop insertions : 54921
% 0.21/0.29 % Search garbage collected termcells : 252
% 0.21/0.29
% 0.21/0.29 % -------------------------------------------------
% 0.21/0.29 % User time : 0.034 s
% 0.21/0.29 % System time : 0.005 s
% 0.21/0.29 % Total time : 0.039 s
% 0.21/0.29 % Maximum resident set size: 3888 pages
% 0.21/0.29
% 0.21/0.29 % -------------------------------------------------
% 0.21/0.29 % User time : 0.036 s
% 0.21/0.29 % System time : 0.010 s
% 0.21/0.29 % Total time : 0.046 s
% 0.21/0.29 % Maximum resident set size: 4864 pages
% 0.21/0.29 % E exiting
%------------------------------------------------------------------------------