%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYO276^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 : n009.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:42:41 AM UTC 2026
% Result : Theorem 0.11s 0.28s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 10 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 132 ( 10 ~; 11 |; 7 &; 98 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 8 ^; 11 !; 0 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
m: $i ).
thf(decl_24,type,
cP: $i > $o ).
thf(decl_25,type,
n: $i ).
thf(decl_26,type,
s: $i > $i ).
thf(decl_27,type,
cO: $i ).
thf(decl_28,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_29,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(cBLEDSOE_FENG_SV_I2,conjecture,
( ( ! [X1: $i > $i > $o] :
( ( ( X1 @ cO @ cO )
& ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ ( s @ X2 ) @ ( s @ X3 ) ) ) )
=> ( X1 @ n @ m ) )
& ( cP @ n ) )
=> ( cP @ m ) ),
file('/export/starexec/sandbox/tmp/tmp.geMD4y5YaN/E---3.1_42820.p',cBLEDSOE_FENG_SV_I2) ).
thf(c_0_1,negated_conjecture,
~ ( ( ! [X1: $i > $i > $o] :
( ( ( X1 @ cO @ cO )
& ! [X2: $i,X3: $i] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ ( s @ X2 ) @ ( s @ X3 ) ) ) )
=> ( X1 @ n @ m ) )
& ( cP @ n ) )
=> ( cP @ m ) ),
inference(assume_negation,[status(cth)],[cBLEDSOE_FENG_SV_I2]) ).
thf(c_0_2,negated_conjecture,
! [X7: $i > $i > $o] :
( ( ( X7 @ ( esk1_1 @ X7 ) @ ( esk2_1 @ X7 ) )
| ~ ( X7 @ cO @ cO )
| ( X7 @ n @ m ) )
& ( ~ ( X7 @ ( s @ ( esk1_1 @ X7 ) ) @ ( s @ ( esk2_1 @ X7 ) ) )
| ~ ( X7 @ cO @ cO )
| ( X7 @ n @ m ) )
& ( cP @ n )
& ~ ( cP @ m ) ),
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,
! [X1: $i > $i > $o] :
( ( X1 @ ( esk1_1 @ X1 ) @ ( esk2_1 @ X1 ) )
| ( X1 @ n @ m )
| ~ ( X1 @ cO @ cO ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X10: $i > $i > $i,X11: $i > $i > $i] :
( ( ( X10
@ ( esk1_1
@ ^ [Z0: $i,Z1: $i] :
( ( X10 @ Z0 @ Z1 )
= ( X11 @ Z0 @ Z1 ) ) )
@ ( esk2_1
@ ^ [Z0: $i,Z1: $i] :
( ( X10 @ Z0 @ Z1 )
= ( X11 @ Z0 @ Z1 ) ) ) )
= ( X11
@ ( esk1_1
@ ^ [Z0: $i,Z1: $i] :
( ( X10 @ Z0 @ Z1 )
= ( X11 @ Z0 @ Z1 ) ) )
@ ( esk2_1
@ ^ [Z0: $i,Z1: $i] :
( ( X10 @ Z0 @ Z1 )
= ( X11 @ Z0 @ Z1 ) ) ) ) )
| ( ( X10 @ n @ m )
= ( X11 @ n @ m ) )
| ( ( X10 @ cO @ cO )
!= ( X11 @ cO @ cO ) ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i > $i > $o] :
( ( X1 @ n @ m )
| ~ ( X1 @ ( s @ ( esk1_1 @ X1 ) ) @ ( s @ ( esk2_1 @ X1 ) ) )
| ~ ( X1 @ cO @ cO ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( ( esk2_1 @ $eq )
= ( esk1_1 @ $eq ) )
| ( m = n ) ),
inference(er,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
~ ( cP @ m ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_8,negated_conjecture,
m = n,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])])]) ).
thf(c_0_9,negated_conjecture,
cP @ n,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO276^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.11/0.19 % Computer : n009.cluster.edu
% 0.11/0.19 % Model : x86_64 x86_64
% 0.11/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.19 % Memory : 8046.5625MB
% 0.11/0.19 % OS : Linux 6.8.0-71-generic
% 0.11/0.19 % CPULimit : 300
% 0.11/0.19 % WCLimit : 300
% 0.11/0.19 % DateTime : Tue Sep 29 16:42:45 UTC 2026
% 0.11/0.19 % CPUTime :
% 0.11/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.24 Running higher-order theorem proving
% 0.11/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.geMD4y5YaN/E---3.1_42820.p
% 0.11/0.28 % Version: 3.5.1-ho
% 0.11/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.28 % Starting new_bool_9 with 300s (1) cores
% 0.11/0.28 % Starting post_as_ho1 with 300s (1) cores
% 0.11/0.28 % Starting post_as_ho4 with 300s (1) cores
% 0.11/0.28 % Starting post_as_ho2 with 300s (1) cores
% 0.11/0.28 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.11/0.28 % Starting full_lambda_10 with 300s (1) cores
% 0.11/0.28 % Starting new_ho_8 with 300s (1) cores
% 0.11/0.28 % post_as_ho12 with pid 42833 completed with status 0
% 0.11/0.28 % Result found by post_as_ho12
% 0.11/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.28 % No SInE strategy applied
% 0.11/0.28 % Search class: HGUNF-FFSF11-SSSFFMBN
% 0.11/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.28 % SubtermCWHack with pid 42839 completed with status 10
% 0.11/0.28 % Starting post_as_ho12 with 31s (1) cores
% 0.11/0.28 % post_as_ho12 with pid 42843 completed with status 0
% 0.11/0.28 % Result found by post_as_ho12
% 0.11/0.28 % Preprocessing class: HSSSSMSSSSSNSSA.
% 0.11/0.28 % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.28 % Starting post_as_ho12 with 300s (1) cores
% 0.11/0.28 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.28 % No SInE strategy applied
% 0.11/0.28 % Search class: HGUNF-FFSF11-SSSFFMBN
% 0.11/0.28 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.28 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.28 % SubtermCWHack with pid 42839 completed with status 10
% 0.11/0.28 % Starting post_as_ho12 with 31s (1) cores
% 0.11/0.28 % Preprocessing time : 0.001 s
% 0.11/0.28 % Presaturation interreduction done
% 0.11/0.28
% 0.11/0.28 % Proof found!
% 0.11/0.28 % SZS status Theorem
% 0.11/0.28 % SZS output start CNFRefutation
% See solution above
% 0.11/0.28 % Parsed axioms : 6
% 0.11/0.28 % Removed by relevancy pruning/SinE : 0
% 0.11/0.28 % Initial clauses : 9
% 0.11/0.28 % Removed in clause preprocessing : 5
% 0.11/0.28 % Initial clauses in saturation : 4
% 0.11/0.28 % Processed clauses : 12
% 0.11/0.28 % ...of these trivial : 0
% 0.11/0.28 % ...subsumed : 0
% 0.11/0.28 % ...remaining for further processing : 12
% 0.11/0.28 % Other redundant clauses eliminated : 0
% 0.11/0.28 % Clauses deleted for lack of memory : 0
% 0.11/0.28 % Backward-subsumed : 0
% 0.11/0.28 % Backward-rewritten : 6
% 0.11/0.28 % Generated clauses : 17
% 0.11/0.28 % ...of the previous two non-redundant : 9
% 0.11/0.28 % ...aggressively subsumed : 0
% 0.11/0.28 % Contextual simplify-reflections : 0
% 0.11/0.28 % Paramodulations : 1
% 0.11/0.28 % Factorizations : 0
% 0.11/0.28 % NegExts : 0
% 0.11/0.28 % Equation resolutions : 10
% 0.11/0.28 % Disequality decompositions : 0
% 0.11/0.28 % Total rewrite steps : 7
% 0.11/0.28 % ...of those cached : 5
% 0.11/0.28 % Propositional unsat checks : 0
% 0.11/0.28 % Propositional check models : 0
% 0.11/0.28 % Propositional check unsatisfiable : 0
% 0.11/0.28 % Propositional clauses : 0
% 0.11/0.28 % Propositional clauses after purity: 0
% 0.11/0.28 % Propositional unsat core size : 0
% 0.11/0.28 % Propositional preprocessing time : 0.000
% 0.11/0.28 % Propositional encoding time : 0.000
% 0.11/0.28 % Propositional solver time : 0.000
% 0.11/0.28 % Success case prop preproc time : 0.000
% 0.11/0.28 % Success case prop encoding time : 0.000
% 0.11/0.28 % Success case prop solver time : 0.000
% 0.11/0.28 % Current number of processed clauses : 2
% 0.11/0.28 % Positive orientable unit clauses : 2
% 0.11/0.28 % Positive unorientable unit clauses: 0
% 0.11/0.28 % Negative unit clauses : 0
% 0.11/0.28 % Non-unit-clauses : 0
% 0.11/0.28 % Current number of unprocessed clauses: 2
% 0.11/0.28 % ...number of literals in the above : 4
% 0.11/0.28 % Current number of archived formulas : 0
% 0.11/0.28 % Current number of archived clauses : 10
% 0.11/0.28 % Clause-clause subsumption calls (NU) : 3
% 0.11/0.28 % Rec. Clause-clause subsumption calls : 3
% 0.11/0.28 % Non-unit clause-clause subsumptions : 0
% 0.11/0.28 % Unit Clause-clause subsumption calls : 0
% 0.11/0.28 % Rewrite failures with RHS unbound : 0
% 0.11/0.28 % BW rewrite match attempts : 1
% 0.11/0.28 % BW rewrite match successes : 1
% 0.11/0.28 % Condensation attempts : 0
% 0.11/0.28 % Condensation successes : 0
% 0.11/0.28 % Termbank termtop insertions : 2105
% 0.11/0.28 % Search garbage collected termcells : 135
% 0.11/0.28
% 0.11/0.28 % -------------------------------------------------
% 0.11/0.28 % User time : 0.005 s
% 0.11/0.28 % System time : 0.001 s
% 0.11/0.28 % Total time : 0.005 s
% 0.11/0.28 % Maximum resident set size: 3888 pages
% 0.11/0.28
% 0.11/0.28 % -------------------------------------------------
% 0.11/0.28 % User time : 0.006 s
% 0.11/0.28 % System time : 0.006 s
% 0.11/0.28 % Total time : 0.012 s
% 0.11/0.28 % Maximum resident set size: 4864 pages
% 0.11/0.28 % E exiting
%------------------------------------------------------------------------------