%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM700^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:29 AM UTC 2026
% Result : Theorem 0.27s 0.39s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 33 ( 0 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 105 ( 17 ~; 7 |; 0 &; 76 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 0 ^; 24 !; 0 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_23,type,
x: nat ).
thf(decl_24,type,
y: nat ).
thf(decl_25,type,
less: nat > nat > $o ).
thf(decl_26,type,
pl: nat > nat > nat ).
thf(decl_27,type,
n_1: nat ).
thf(decl_28,type,
lessis: nat > nat > $o ).
thf(decl_29,type,
more: nat > nat > $o ).
thf(decl_30,type,
moreis: nat > nat > $o ).
thf(satz10h,axiom,
! [X1: nat,X2: nat] :
( ( less @ X1 @ X2 )
=> ~ ( moreis @ X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.bCrWZNIA5i/E---3.1_34224.p',satz10h) ).
thf(satz25,axiom,
! [X1: nat,X2: nat] :
( ( more @ X2 @ X1 )
=> ( moreis @ X2 @ ( pl @ X1 @ n_1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bCrWZNIA5i/E---3.1_34224.p',satz25) ).
thf(satz26,conjecture,
lessis @ y @ x,
file('/export/starexec/sandbox/tmp/tmp.bCrWZNIA5i/E---3.1_34224.p',satz26) ).
thf(satz10e,axiom,
! [X1: nat,X2: nat] :
( ~ ( more @ X1 @ X2 )
=> ( lessis @ X1 @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.bCrWZNIA5i/E---3.1_34224.p',satz10e) ).
thf(l,axiom,
less @ y @ ( pl @ x @ n_1 ),
file('/export/starexec/sandbox/tmp/tmp.bCrWZNIA5i/E---3.1_34224.p',l) ).
thf(c_0_5,plain,
! [X1: nat,X2: nat] :
( ( less @ X1 @ X2 )
=> ~ ( moreis @ X1 @ X2 ) ),
inference(fof_simplification,[status(thm)],[satz10h]) ).
thf(c_0_6,plain,
! [X11: nat,X12: nat] :
( ~ ( less @ X11 @ X12 )
| ~ ( moreis @ X11 @ X12 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
thf(c_0_7,plain,
! [X13: nat,X14: nat] :
( ~ ( more @ X14 @ X13 )
| ( moreis @ X14 @ ( pl @ X13 @ n_1 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz25])])]) ).
thf(c_0_8,negated_conjecture,
~ ( lessis @ y @ x ),
inference(assume_negation,[status(cth)],[satz26]) ).
thf(c_0_9,plain,
! [X1: nat,X2: nat] :
( ~ ( less @ X1 @ X2 )
| ~ ( moreis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: nat,X2: nat] :
( ( moreis @ X1 @ ( pl @ X2 @ n_1 ) )
| ~ ( more @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: nat,X2: nat] :
( ~ ( more @ X1 @ X2 )
=> ( lessis @ X1 @ X2 ) ),
inference(fof_simplification,[status(thm)],[satz10e]) ).
thf(c_0_12,negated_conjecture,
~ ( lessis @ y @ x ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
! [X1: nat,X2: nat] :
( ~ ( less @ X1 @ ( pl @ X2 @ n_1 ) )
| ~ ( more @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_14,plain,
less @ y @ ( pl @ x @ n_1 ),
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_15,plain,
! [X9: nat,X10: nat] :
( ( more @ X9 @ X10 )
| ( lessis @ X9 @ X10 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
thf(c_0_16,negated_conjecture,
~ ( lessis @ y @ x ),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
thf(c_0_17,plain,
~ ( more @ y @ x ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_18,plain,
! [X1: nat,X2: nat] :
( ( more @ X1 @ X2 )
| ( lessis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_19,negated_conjecture,
~ ( lessis @ y @ x ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM700^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.28 % Computer : n011.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8046.5625MB
% 0.10/0.28 % OS : Linux 6.8.0-71-generic
% 0.10/0.28 % CPULimit : 300
% 0.10/0.28 % WCLimit : 300
% 0.10/0.28 % DateTime : Tue Sep 29 12:41:31 UTC 2026
% 0.10/0.28 % CPUTime :
% 0.10/0.28 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.34 Running higher-order theorem proving
% 0.27/0.36 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.bCrWZNIA5i/E---3.1_34224.p
% 0.27/0.39 % Version: 3.5.1-ho
% 0.27/0.39 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10 with 1500s (5) cores
% 0.27/0.39 % Starting ho_unfolding_6 with 300s (1) cores
% 0.27/0.39 % Starting sh4l with 300s (1) cores
% 0.27/0.39 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.27/0.39 % ho_unfolding_6 with pid 34238 completed with status 0
% 0.27/0.39 % Result found by ho_unfolding_6
% 0.27/0.39 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10 with 1500s (5) cores
% 0.27/0.39 % Starting ho_unfolding_6 with 300s (1) cores
% 0.27/0.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.39 % No SInE strategy applied
% 0.27/0.39 % Search class: HGHNF-FFSF22-SFFFFFNN
% 0.27/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.39 % SubtermCWHack with pid 34242 completed with status 0
% 0.27/0.39 % Result found by SubtermCWHack
% 0.27/0.39 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.27/0.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.39 % Starting new_ho_10 with 1500s (5) cores
% 0.27/0.39 % Starting ho_unfolding_6 with 300s (1) cores
% 0.27/0.39 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.39 % No SInE strategy applied
% 0.27/0.39 % Search class: HGHNF-FFSF22-SFFFFFNN
% 0.27/0.39 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.39 % Starting SubtermCWHack with 28s (1) cores
% 0.27/0.39 % Preprocessing time : 0.002 s
% 0.27/0.39
% 0.27/0.39 % Proof found!
% 0.27/0.39 % SZS status Theorem
% 0.27/0.39 % SZS output start CNFRefutation
% See solution above
% 0.27/0.39 % Parsed axioms : 14
% 0.27/0.39 % Removed by relevancy pruning/SinE : 0
% 0.27/0.39 % Initial clauses : 14
% 0.27/0.39 % Removed in clause preprocessing : 9
% 0.27/0.39 % Initial clauses in saturation : 5
% 0.27/0.39 % Processed clauses : 7
% 0.27/0.39 % ...of these trivial : 0
% 0.27/0.39 % ...subsumed : 0
% 0.27/0.39 % ...remaining for further processing : 7
% 0.27/0.39 % Other redundant clauses eliminated : 0
% 0.27/0.39 % Clauses deleted for lack of memory : 0
% 0.27/0.39 % Backward-subsumed : 0
% 0.27/0.39 % Backward-rewritten : 0
% 0.27/0.39 % Generated clauses : 3
% 0.27/0.39 % ...of the previous two non-redundant : 2
% 0.27/0.39 % ...aggressively subsumed : 0
% 0.27/0.39 % Contextual simplify-reflections : 0
% 0.27/0.39 % Paramodulations : 3
% 0.27/0.39 % Factorizations : 0
% 0.27/0.39 % NegExts : 0
% 0.27/0.39 % Equation resolutions : 0
% 0.27/0.39 % Disequality decompositions : 0
% 0.27/0.39 % Total rewrite steps : 0
% 0.27/0.39 % ...of those cached : 0
% 0.27/0.39 % Propositional unsat checks : 0
% 0.27/0.39 % Propositional check models : 0
% 0.27/0.39 % Propositional check unsatisfiable : 0
% 0.27/0.39 % Propositional clauses : 0
% 0.27/0.39 % Propositional clauses after purity: 0
% 0.27/0.39 % Propositional unsat core size : 0
% 0.27/0.39 % Propositional preprocessing time : 0.000
% 0.27/0.39 % Propositional encoding time : 0.000
% 0.27/0.39 % Propositional solver time : 0.000
% 0.27/0.39 % Success case prop preproc time : 0.000
% 0.27/0.39 % Success case prop encoding time : 0.000
% 0.27/0.39 % Success case prop solver time : 0.000
% 0.27/0.39 % Current number of processed clauses : 7
% 0.27/0.39 % Positive orientable unit clauses : 1
% 0.27/0.39 % Positive unorientable unit clauses: 0
% 0.27/0.39 % Negative unit clauses : 2
% 0.27/0.39 % Non-unit-clauses : 4
% 0.27/0.39 % Current number of unprocessed clauses: 0
% 0.27/0.39 % ...number of literals in the above : 0
% 0.27/0.39 % Current number of archived formulas : 0
% 0.27/0.39 % Current number of archived clauses : 0
% 0.27/0.39 % Clause-clause subsumption calls (NU) : 1
% 0.27/0.39 % Rec. Clause-clause subsumption calls : 1
% 0.27/0.39 % Non-unit clause-clause subsumptions : 0
% 0.27/0.39 % Unit Clause-clause subsumption calls : 0
% 0.27/0.39 % Rewrite failures with RHS unbound : 0
% 0.27/0.39 % BW rewrite match attempts : 0
% 0.27/0.39 % BW rewrite match successes : 0
% 0.27/0.39 % Condensation attempts : 0
% 0.27/0.39 % Condensation successes : 0
% 0.27/0.39 % Termbank termtop insertions : 477
% 0.27/0.39 % Search garbage collected termcells : 58
% 0.27/0.39
% 0.27/0.39 % -------------------------------------------------
% 0.27/0.39 % User time : 0.004 s
% 0.27/0.39 % System time : 0.004 s
% 0.27/0.39 % Total time : 0.008 s
% 0.27/0.39 % Maximum resident set size: 3580 pages
% 0.27/0.39
% 0.27/0.39 % -------------------------------------------------
% 0.27/0.39 % User time : 0.005 s
% 0.27/0.39 % System time : 0.009 s
% 0.27/0.39 % Total time : 0.014 s
% 0.27/0.39 % Maximum resident set size: 4864 pages
% 0.27/0.39 % E exiting
%------------------------------------------------------------------------------