%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM692^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 : n018.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:16:51 AM UTC 2026
% Result : Theorem 0.08s 0.24s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 37 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 140 ( 17 ~; 11 |; 0 &; 108 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 ^; 28 !; 0 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_23,type,
x: nat ).
thf(decl_24,type,
y: nat ).
thf(decl_25,type,
z: nat ).
thf(decl_26,type,
u: nat ).
thf(decl_27,type,
lessis: nat > nat > $o ).
thf(decl_28,type,
ts: nat > nat > nat ).
thf(decl_29,type,
moreis: nat > nat > $o ).
thf(satz23a,conjecture,
lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ),
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',satz23a) ).
thf(satz13,axiom,
! [X1: nat,X2: nat] :
( ( moreis @ X1 @ X2 )
=> ( lessis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',satz13) ).
thf(satz23,axiom,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( moreis @ X1 @ X2 )
=> ( ( moreis @ X3 @ X4 )
=> ( moreis @ ( ts @ X1 @ X3 ) @ ( ts @ X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',satz23) ).
thf(satz14,axiom,
! [X1: nat,X2: nat] :
( ( lessis @ X1 @ X2 )
=> ( moreis @ X2 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',satz14) ).
thf(k,axiom,
lessis @ z @ u,
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',k) ).
thf(l,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox/tmp/tmp.2A27O1hyjF/E---3.1_17896.p',l) ).
thf(c_0_6,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(assume_negation,[status(cth)],[satz23a]) ).
thf(c_0_7,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
thf(c_0_8,plain,
! [X13: nat,X14: nat] :
( ~ ( moreis @ X13 @ X14 )
| ( lessis @ X14 @ X13 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz13])])]) ).
thf(c_0_9,plain,
! [X15: nat,X16: nat,X17: nat,X18: nat] :
( ~ ( moreis @ X15 @ X16 )
| ~ ( moreis @ X17 @ X18 )
| ( moreis @ ( ts @ X15 @ X17 ) @ ( ts @ X16 @ X18 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz23])])]) ).
thf(c_0_10,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X1: nat,X2: nat] :
( ( lessis @ X2 @ X1 )
| ~ ( moreis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( moreis @ ( ts @ X1 @ X3 ) @ ( ts @ X2 @ X4 ) )
| ~ ( moreis @ X1 @ X2 )
| ~ ( moreis @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X4: nat,X3: nat,X2: nat,X1: nat] :
( ( lessis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X4 ) )
| ~ ( moreis @ X4 @ X2 )
| ~ ( moreis @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_15,plain,
! [X19: nat,X20: nat] :
( ~ ( lessis @ X19 @ X20 )
| ( moreis @ X20 @ X19 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz14])])]) ).
thf(c_0_16,negated_conjecture,
( ~ ( moreis @ u @ z )
| ~ ( moreis @ y @ x ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_17,plain,
! [X1: nat,X2: nat] :
( ( moreis @ X2 @ X1 )
| ~ ( lessis @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_18,plain,
lessis @ z @ u,
inference(split_conjunct,[status(thm)],[k]) ).
thf(c_0_19,negated_conjecture,
~ ( moreis @ y @ x ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
thf(c_0_20,plain,
lessis @ x @ y,
inference(split_conjunct,[status(thm)],[l]) ).
thf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM692^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.16 % Computer : n018.cluster.edu
% 0.08/0.16 % Model : x86_64 x86_64
% 0.08/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.16 % Memory : 8046.5625MB
% 0.08/0.16 % OS : Linux 6.8.0-71-generic
% 0.08/0.16 % CPULimit : 300
% 0.08/0.16 % WCLimit : 300
% 0.08/0.16 % DateTime : Tue Sep 29 12:41:56 UTC 2026
% 0.08/0.16 % CPUTime :
% 0.08/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.22 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.2A27O1hyjF/E---3.1_17896.p
% 0.08/0.24 % Version: 3.5.1-ho
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.24 % Starting sh4l with 300s (1) cores
% 0.08/0.24 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.08/0.24 % sh4l with pid 17911 completed with status 0
% 0.08/0.24 % Result found by sh4l
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.24 % Starting sh4l with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24 % No SInE strategy applied
% 0.08/0.24 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % SubtermCWHack with pid 17913 completed with status 0
% 0.08/0.24 % Result found by SubtermCWHack
% 0.08/0.24 % Preprocessing class: HSSSSMSSSSSNFFN.
% 0.08/0.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24 % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.24 % Starting ho_unfolding_6 with 300s (1) cores
% 0.08/0.24 % Starting sh4l with 300s (1) cores
% 0.08/0.24 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24 % No SInE strategy applied
% 0.08/0.24 % Search class: HHUNF-FFSF22-SFFFFFNN
% 0.08/0.24 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.24 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.24 % Preprocessing time : 0.001 s
% 0.08/0.24
% 0.08/0.24 % Proof found!
% 0.08/0.24 % SZS status Theorem
% 0.08/0.24 % SZS output start CNFRefutation
% See solution above
% 0.08/0.24 % Parsed axioms : 14
% 0.08/0.24 % Removed by relevancy pruning/SinE : 0
% 0.08/0.24 % Initial clauses : 14
% 0.08/0.24 % Removed in clause preprocessing : 8
% 0.08/0.24 % Initial clauses in saturation : 6
% 0.08/0.24 % Processed clauses : 9
% 0.08/0.24 % ...of these trivial : 0
% 0.08/0.24 % ...subsumed : 0
% 0.08/0.24 % ...remaining for further processing : 9
% 0.08/0.24 % Other redundant clauses eliminated : 0
% 0.08/0.24 % Clauses deleted for lack of memory : 0
% 0.08/0.24 % Backward-subsumed : 1
% 0.08/0.24 % Backward-rewritten : 0
% 0.08/0.24 % Generated clauses : 5
% 0.08/0.24 % ...of the previous two non-redundant : 3
% 0.08/0.24 % ...aggressively subsumed : 0
% 0.08/0.24 % Contextual simplify-reflections : 0
% 0.08/0.24 % Paramodulations : 5
% 0.08/0.24 % Factorizations : 0
% 0.08/0.24 % NegExts : 0
% 0.08/0.24 % Equation resolutions : 0
% 0.08/0.24 % Disequality decompositions : 0
% 0.08/0.24 % Total rewrite steps : 2
% 0.08/0.24 % ...of those cached : 0
% 0.08/0.24 % Propositional unsat checks : 0
% 0.08/0.24 % Propositional check models : 0
% 0.08/0.24 % Propositional check unsatisfiable : 0
% 0.08/0.24 % Propositional clauses : 0
% 0.08/0.24 % Propositional clauses after purity: 0
% 0.08/0.24 % Propositional unsat core size : 0
% 0.08/0.24 % Propositional preprocessing time : 0.000
% 0.08/0.24 % Propositional encoding time : 0.000
% 0.08/0.24 % Propositional solver time : 0.000
% 0.08/0.24 % Success case prop preproc time : 0.000
% 0.08/0.24 % Success case prop encoding time : 0.000
% 0.08/0.24 % Success case prop solver time : 0.000
% 0.08/0.24 % Current number of processed clauses : 8
% 0.08/0.24 % Positive orientable unit clauses : 2
% 0.08/0.24 % Positive unorientable unit clauses: 0
% 0.08/0.24 % Negative unit clauses : 2
% 0.08/0.24 % Non-unit-clauses : 4
% 0.08/0.24 % Current number of unprocessed clauses: 0
% 0.08/0.24 % ...number of literals in the above : 0
% 0.08/0.24 % Current number of archived formulas : 0
% 0.08/0.24 % Current number of archived clauses : 1
% 0.08/0.24 % Clause-clause subsumption calls (NU) : 3
% 0.08/0.24 % Rec. Clause-clause subsumption calls : 3
% 0.08/0.24 % Non-unit clause-clause subsumptions : 0
% 0.08/0.24 % Unit Clause-clause subsumption calls : 1
% 0.08/0.24 % Rewrite failures with RHS unbound : 0
% 0.08/0.24 % BW rewrite match attempts : 0
% 0.08/0.24 % BW rewrite match successes : 0
% 0.08/0.24 % Condensation attempts : 0
% 0.08/0.24 % Condensation successes : 0
% 0.08/0.24 % Termbank termtop insertions : 578
% 0.08/0.24 % Search garbage collected termcells : 73
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.003 s
% 0.08/0.24 % System time : 0.001 s
% 0.08/0.24 % Total time : 0.004 s
% 0.08/0.24 % Maximum resident set size: 3580 pages
% 0.08/0.24
% 0.08/0.24 % -------------------------------------------------
% 0.08/0.24 % User time : 0.004 s
% 0.08/0.24 % System time : 0.006 s
% 0.08/0.24 % Total time : 0.010 s
% 0.08/0.24 % Maximum resident set size: 4864 pages
% 0.08/0.24 % E exiting
%------------------------------------------------------------------------------