%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:17:46 AM UTC 2026
% Result : Theorem 0.23s 0.27s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 25 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 132 ( 20 ~; 9 |; 11 &; 76 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 7 ^; 31 !; 3 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
c0: $i ).
thf(decl_24,type,
cS: $i > $i ).
thf(decl_25,type,
cEVEN1: $i > $o ).
thf(decl_26,type,
cODD1: $i > $o ).
thf(decl_27,type,
esk1_2: $i > ( $i > $o ) > $i ).
thf(cODD1_def,axiom,
( cODD1
= ( ^ [X1: $i] :
~ ( cEVEN1 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3ovx4UhFNq/E---3.1_309215.p',cODD1_def) ).
thf(cEVEN1_def,axiom,
( cEVEN1
= ( ^ [X1: $i] :
! [X2: $i > $o] :
( ( ( X2 @ c0 )
& ! [X3: $i] :
( ( X2 @ X3 )
=> ( X2 @ ( cS @ ( cS @ X3 ) ) ) ) )
=> ( X2 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3ovx4UhFNq/E---3.1_309215.p',cEVEN1_def) ).
thf(cTHM405,conjecture,
( ( ! [X4: $i] :
( ( cS @ X4 )
!= c0 )
& ! [X5: $i,X6: $i] :
( ( ( cS @ X5 )
= ( cS @ X6 ) )
=> ( X5 = X6 ) ) )
=> ? [X1: $i] : ( cODD1 @ X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.3ovx4UhFNq/E---3.1_309215.p',cTHM405) ).
thf(c_0_3,plain,
( cODD1
= ( ^ [Z0: $i] :
~ ! [X11: $i > $o] :
( ( ( X11 @ c0 )
& ! [X12: $i] :
( ( X11 @ X12 )
=> ( X11 @ ( cS @ ( cS @ X12 ) ) ) ) )
=> ( X11 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[cODD1_def]) ).
thf(c_0_4,plain,
( cEVEN1
= ( ^ [Z0: $i] :
! [X2: $i > $o] :
( ( ( X2 @ c0 )
& ! [X3: $i] :
( ( X2 @ X3 )
=> ( X2 @ ( cS @ ( cS @ X3 ) ) ) ) )
=> ( X2 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[cEVEN1_def]) ).
thf(c_0_5,negated_conjecture,
~ ( ( ! [X4: $i] :
( ( cS @ X4 )
!= c0 )
& ! [X5: $i,X6: $i] :
( ( ( cS @ X5 )
= ( cS @ X6 ) )
=> ( X5 = X6 ) ) )
=> ? [X1: $i] : ( cODD1 @ X1 ) ),
inference(assume_negation,[status(cth)],[cTHM405]) ).
thf(c_0_6,plain,
( cODD1
= ( ^ [Z0: $i] :
~ ! [X11: $i > $o] :
( ( ( X11 @ c0 )
& ! [X12: $i] :
( ( X11 @ X12 )
=> ( X11 @ ( cS @ ( cS @ X12 ) ) ) ) )
=> ( X11 @ Z0 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_3,c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( ( ! [X4: $i] :
( ( cS @ X4 )
!= c0 )
& ! [X5: $i,X6: $i] :
( ( ( cS @ X5 )
= ( cS @ X6 ) )
=> ( X5 = X6 ) ) )
=> ? [X1: $i] :
~ ! [X13: $i > $o] :
( ( ( X13 @ c0 )
& ! [X14: $i] :
( ( X13 @ X14 )
=> ( X13 @ ( cS @ ( cS @ X14 ) ) ) ) )
=> ( X13 @ X1 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_6])]) ).
thf(c_0_8,negated_conjecture,
! [X15: $i,X16: $i,X17: $i,X18: $i,X19: $i > $o] :
( ( ( cS @ X15 )
!= c0 )
& ( ( ( cS @ X16 )
!= ( cS @ X17 ) )
| ( X16 = X17 ) )
& ( ( X19 @ ( esk1_2 @ X18 @ X19 ) )
| ~ ( X19 @ c0 )
| ( X19 @ X18 ) )
& ( ~ ( X19 @ ( cS @ ( cS @ ( esk1_2 @ X18 @ X19 ) ) ) )
| ~ ( X19 @ c0 )
| ( X19 @ X18 ) ) ),
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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X2: $i > $o] :
( ( X2 @ X1 )
| ~ ( X2 @ ( cS @ ( cS @ ( esk1_2 @ X1 @ X2 ) ) ) )
| ~ ( X2 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i,X3: $i] :
( ( X1 = X3 )
| ( ( cS @ X1 )
!= ( cS @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i] :
( ( ( cS
@ ( cS
@ ( esk1_2 @ X1
@ ^ [Z0: $i] : ( Z0 != X1 ) ) ) )
= X1 )
| ( c0 = X1 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i] :
( ( cS @ X1 )
!= c0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ( cS
@ ( esk1_2 @ ( cS @ X1 )
@ ^ [Z0: $i] :
( Z0
!= ( cS @ X1 ) ) ) )
= X1 ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]),c_0_12]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM817^5 : TPTP v9.3.1. Bugfixed v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n016.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 13:07:34 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 Running higher-order theorem proving
% 0.08/0.25 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.3ovx4UhFNq/E---3.1_309215.p
% 0.23/0.27 % Version: 3.5.1-ho
% 0.23/0.27 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.27 % Starting post_as_ho5 with 300s (1) cores
% 0.23/0.27 % Starting sh4l with 300s (1) cores
% 0.23/0.27 % Starting ho_unfolding_2 with 300s (1) cores
% 0.23/0.27 % ho_unfolding_3 with pid 309228 completed with status 0
% 0.23/0.27 % Result found by ho_unfolding_3
% 0.23/0.27 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HGUSF-FFSF21-MSFFMMBN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Starting ho_unfolding_3 with 901s (1) cores
% 0.23/0.27 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.23/0.27 % Starting sh5l with 151s (1) cores
% 0.23/0.27 % Starting new_bool_3 with 146s (1) cores
% 0.23/0.27 % SubtermCWHack with pid 309232 completed with status 10
% 0.23/0.27 % sh5l with pid 309235 completed with status 0
% 0.23/0.27 % Result found by sh5l
% 0.23/0.27 % Preprocessing class: HSSSSMSSSLSNSFN.
% 0.23/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.27 % Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.27 % No SInE strategy applied
% 0.23/0.27 % Search class: HGUSF-FFSF21-MSFFMMBN
% 0.23/0.27 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.27 % Starting SubtermCWHack with 151s (1) cores
% 0.23/0.27 % Starting ho_unfolding_3 with 901s (1) cores
% 0.23/0.27 % Starting ehoh_best_sine_rwall with 151s (1) cores
% 0.23/0.27 % Starting sh5l with 151s (1) cores
% 0.23/0.27 % Preprocessing time : 0.001 s
% 0.23/0.27 % Presaturation interreduction done
% 0.23/0.27
% 0.23/0.27 % Proof found!
% 0.23/0.27 % SZS status Theorem
% 0.23/0.27 % SZS output start CNFRefutation
% See solution above
% 0.23/0.27 % Parsed axioms : 7
% 0.23/0.27 % Removed by relevancy pruning/SinE : 0
% 0.23/0.27 % Initial clauses : 8
% 0.23/0.27 % Removed in clause preprocessing : 4
% 0.23/0.27 % Initial clauses in saturation : 4
% 0.23/0.27 % Processed clauses : 18
% 0.23/0.27 % ...of these trivial : 0
% 0.23/0.27 % ...subsumed : 3
% 0.23/0.27 % ...remaining for further processing : 15
% 0.23/0.27 % Other redundant clauses eliminated : 5
% 0.23/0.27 % Clauses deleted for lack of memory : 0
% 0.23/0.27 % Backward-subsumed : 0
% 0.23/0.27 % Backward-rewritten : 0
% 0.23/0.27 % Generated clauses : 37
% 0.23/0.27 % ...of the previous two non-redundant : 18
% 0.23/0.27 % ...aggressively subsumed : 0
% 0.23/0.27 % Contextual simplify-reflections : 0
% 0.23/0.27 % Paramodulations : 27
% 0.23/0.27 % Factorizations : 0
% 0.23/0.27 % NegExts : 0
% 0.23/0.27 % Equation resolutions : 6
% 0.23/0.27 % Disequality decompositions : 0
% 0.23/0.27 % Total rewrite steps : 7
% 0.23/0.27 % ...of those cached : 5
% 0.23/0.27 % Propositional unsat checks : 0
% 0.23/0.27 % Propositional check models : 0
% 0.23/0.27 % Propositional check unsatisfiable : 0
% 0.23/0.27 % Propositional clauses : 0
% 0.23/0.27 % Propositional clauses after purity: 0
% 0.23/0.27 % Propositional unsat core size : 0
% 0.23/0.27 % Propositional preprocessing time : 0.000
% 0.23/0.27 % Propositional encoding time : 0.000
% 0.23/0.27 % Propositional solver time : 0.000
% 0.23/0.27 % Success case prop preproc time : 0.000
% 0.23/0.27 % Success case prop encoding time : 0.000
% 0.23/0.27 % Success case prop solver time : 0.000
% 0.23/0.27 % Current number of processed clauses : 11
% 0.23/0.27 % Positive orientable unit clauses : 2
% 0.23/0.27 % Positive unorientable unit clauses: 0
% 0.23/0.27 % Negative unit clauses : 1
% 0.23/0.27 % Non-unit-clauses : 8
% 0.23/0.27 % Current number of unprocessed clauses: 3
% 0.23/0.27 % ...number of literals in the above : 6
% 0.23/0.27 % Current number of archived formulas : 0
% 0.23/0.27 % Current number of archived clauses : 4
% 0.23/0.27 % Clause-clause subsumption calls (NU) : 16
% 0.23/0.27 % Rec. Clause-clause subsumption calls : 16
% 0.23/0.27 % Non-unit clause-clause subsumptions : 1
% 0.23/0.27 % Unit Clause-clause subsumption calls : 1
% 0.23/0.27 % Rewrite failures with RHS unbound : 0
% 0.23/0.27 % BW rewrite match attempts : 0
% 0.23/0.27 % BW rewrite match successes : 0
% 0.23/0.27 % Condensation attempts : 18
% 0.23/0.27 % Condensation successes : 1
% 0.23/0.27 % Termbank termtop insertions : 2336
% 0.23/0.27 % Search garbage collected termcells : 212
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.006 s
% 0.23/0.27 % System time : 0.003 s
% 0.23/0.27 % Total time : 0.008 s
% 0.23/0.27 % Maximum resident set size: 3580 pages
% 0.23/0.27
% 0.23/0.27 % -------------------------------------------------
% 0.23/0.27 % User time : 0.009 s
% 0.23/0.27 % System time : 0.015 s
% 0.23/0.27 % Total time : 0.024 s
% 0.23/0.27 % Maximum resident set size: 4864 pages
% 0.23/0.27 % E exiting
%------------------------------------------------------------------------------