%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP118^1 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:05:34 AM UTC 2026
% Result : Theorem 0.24s 0.37s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 15 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 14 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 100 ( 4 ~; 0 |; 0 &; 96 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 ^; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
real: $tType ).
thf(decl_sort2,type,
int: $tType ).
thf(decl_sort3,type,
n: $tType ).
thf(decl_sort4,type,
finite1489363574real_n: $tType ).
thf(decl_40,type,
finite772340589real_n: finite1489363574real_n > n > real ).
thf(decl_45,type,
abs_abs_int: int > int ).
thf(decl_46,type,
abs_abs_real: real > real ).
thf(decl_50,type,
minus_1037315151real_n: finite1489363574real_n > finite1489363574real_n > finite1489363574real_n ).
thf(decl_52,type,
minus_minus_real: real > real > real ).
thf(decl_71,type,
ring_1_of_int_real: int > real ).
thf(decl_105,type,
i: n ).
thf(decl_106,type,
m: int ).
thf(decl_107,type,
x: finite1489363574real_n ).
thf(decl_108,type,
y: finite1489363574real_n ).
thf(conj_0,conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6U2OsWMWeK/E---3.1_3325881.p',conj_0) ).
thf(fact_6_vector__minus__component,axiom,
! [X8: finite1489363574real_n,X9: finite1489363574real_n,X10: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X8 @ X9 ) @ X10 )
= ( minus_minus_real @ ( finite772340589real_n @ X8 @ X10 ) @ ( finite772340589real_n @ X9 @ X10 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6U2OsWMWeK/E---3.1_3325881.p',fact_6_vector__minus__component) ).
thf(fact_2_m,axiom,
( ( ring_1_of_int_real @ m )
= ( minus_minus_real @ ( finite772340589real_n @ x @ i ) @ ( finite772340589real_n @ y @ i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6U2OsWMWeK/E---3.1_3325881.p',fact_2_m) ).
thf(fact_9_of__int__abs,axiom,
! [X14: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X14 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X14 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6U2OsWMWeK/E---3.1_3325881.p',fact_9_of__int__abs) ).
thf(c_0_4,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
thf(c_0_5,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X1341: finite1489363574real_n,X1342: finite1489363574real_n,X1343: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X1341 @ X1342 ) @ X1343 )
= ( minus_minus_real @ ( finite772340589real_n @ X1341 @ X1343 ) @ ( finite772340589real_n @ X1342 @ X1343 ) ) ),
inference(variable_rename,[status(thm)],[fact_6_vector__minus__component]) ).
thf(c_0_7,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( ring_1_of_int_real @ m )
= ( minus_minus_real @ ( finite772340589real_n @ x @ i ) @ ( finite772340589real_n @ y @ i ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_m]) ).
thf(c_0_9,plain,
! [X9: finite1489363574real_n,X8: finite1489363574real_n,X7: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X8 @ X9 ) @ X7 )
= ( minus_minus_real @ ( finite772340589real_n @ X8 @ X7 ) @ ( finite772340589real_n @ X9 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1279: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X1279 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X1279 ) ) ),
inference(variable_rename,[status(thm)],[fact_9_of__int__abs]) ).
thf(c_0_11,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,plain,
( ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i )
= ( ring_1_of_int_real @ m ) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
! [X1: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X1 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP118^1 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n010.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 19:56:48 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.24/0.28 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.6U2OsWMWeK/E---3.1_3325881.p
% 0.24/0.37 % Version: 3.5.1-ho
% 0.24/0.37 % Preprocessing class: HSLSSMSMSSMNHFA.
% 0.24/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.37 % Starting new_ho_3 with 1500s (5) cores
% 0.24/0.37 % Starting sh7 with 300s (1) cores
% 0.24/0.37 % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.37 % Starting pre_casc_7 with 300s (1) cores
% 0.24/0.37 % new_ho_3 with pid 3325894 completed with status 0
% 0.24/0.37 % Result found by new_ho_3
% 0.24/0.37 % Preprocessing class: HSLSSMSMSSMNHFA.
% 0.24/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.37 % Starting new_ho_3 with 1500s (5) cores
% 0.24/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.24/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.24/0.37 % Search class: HGHSM-FSLM32-MHFFFSBN
% 0.24/0.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.37 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.37 % Starting new_ho_3 with 151s (1) cores
% 0.24/0.37 % Starting post_as_ho6 with 136s (1) cores
% 0.24/0.37 % Starting almost_fo_1 with 136s (1) cores
% 0.24/0.37 % Starting lpo6_lambda_fix with 136s (1) cores
% 0.24/0.37 % post_as_ho6 with pid 3325900 completed with status 0
% 0.24/0.37 % Result found by post_as_ho6
% 0.24/0.37 % Preprocessing class: HSLSSMSMSSMNHFA.
% 0.24/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.37 % Starting new_ho_3 with 1500s (5) cores
% 0.24/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,5,,4,20000,1.0,true))
% 0.24/0.37 % SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.24/0.37 % Search class: HGHSM-FSLM32-MHFFFSBN
% 0.24/0.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.37 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.37 % Starting new_ho_3 with 151s (1) cores
% 0.24/0.37 % Starting post_as_ho6 with 136s (1) cores
% 0.24/0.37 % Preprocessing time : 0.009 s
% 0.24/0.37 % Presaturation interreduction done
% 0.24/0.37
% 0.24/0.37 % Proof found!
% 0.24/0.37 % SZS status Theorem
% 0.24/0.37 % SZS output start CNFRefutation
% See solution above
% 0.24/0.37 % Parsed axioms : 466
% 0.24/0.37 % Removed by relevancy pruning/SinE : 172
% 0.24/0.37 % Initial clauses : 537
% 0.24/0.37 % Removed in clause preprocessing : 21
% 0.24/0.37 % Initial clauses in saturation : 516
% 0.24/0.37 % Processed clauses : 247
% 0.24/0.37 % ...of these trivial : 13
% 0.24/0.37 % ...subsumed : 26
% 0.24/0.37 % ...remaining for further processing : 208
% 0.24/0.37 % Other redundant clauses eliminated : 30
% 0.24/0.37 % Clauses deleted for lack of memory : 0
% 0.24/0.37 % Backward-subsumed : 1
% 0.24/0.37 % Backward-rewritten : 5
% 0.24/0.37 % Generated clauses : 30
% 0.24/0.37 % ...of the previous two non-redundant : 10
% 0.24/0.37 % ...aggressively subsumed : 0
% 0.24/0.37 % Contextual simplify-reflections : 1
% 0.24/0.37 % Paramodulations : 0
% 0.24/0.37 % Factorizations : 0
% 0.24/0.37 % NegExts : 0
% 0.24/0.37 % Equation resolutions : 30
% 0.24/0.37 % Disequality decompositions : 0
% 0.24/0.37 % Total rewrite steps : 58
% 0.24/0.37 % ...of those cached : 18
% 0.24/0.37 % Propositional unsat checks : 0
% 0.24/0.37 % Propositional check models : 0
% 0.24/0.37 % Propositional check unsatisfiable : 0
% 0.24/0.37 % Propositional clauses : 0
% 0.24/0.37 % Propositional clauses after purity: 0
% 0.24/0.37 % Propositional unsat core size : 0
% 0.24/0.37 % Propositional preprocessing time : 0.000
% 0.24/0.37 % Propositional encoding time : 0.000
% 0.24/0.37 % Propositional solver time : 0.000
% 0.24/0.37 % Success case prop preproc time : 0.000
% 0.24/0.37 % Success case prop encoding time : 0.000
% 0.24/0.37 % Success case prop solver time : 0.000
% 0.24/0.37 % Current number of processed clauses : 172
% 0.24/0.37 % Positive orientable unit clauses : 72
% 0.24/0.37 % Positive unorientable unit clauses: 7
% 0.24/0.37 % Negative unit clauses : 2
% 0.24/0.37 % Non-unit-clauses : 91
% 0.24/0.37 % Current number of unprocessed clauses: 279
% 0.24/0.37 % ...number of literals in the above : 990
% 0.24/0.37 % Current number of archived formulas : 0
% 0.24/0.37 % Current number of archived clauses : 6
% 0.24/0.37 % Clause-clause subsumption calls (NU) : 1820
% 0.24/0.37 % Rec. Clause-clause subsumption calls : 1715
% 0.24/0.37 % Non-unit clause-clause subsumptions : 26
% 0.24/0.37 % Unit Clause-clause subsumption calls : 13
% 0.24/0.37 % Rewrite failures with RHS unbound : 0
% 0.24/0.37 % BW rewrite match attempts : 16
% 0.24/0.37 % BW rewrite match successes : 15
% 0.24/0.37 % Condensation attempts : 247
% 0.24/0.37 % Condensation successes : 0
% 0.24/0.37 % Termbank termtop insertions : 35595
% 0.24/0.37 % Search garbage collected termcells : 9052
% 0.24/0.37
% 0.24/0.37 % -------------------------------------------------
% 0.24/0.37 % User time : 0.038 s
% 0.24/0.37 % System time : 0.020 s
% 0.24/0.37 % Total time : 0.059 s
% 0.24/0.37 % Maximum resident set size: 6312 pages
% 0.24/0.37
% 0.24/0.37 % -------------------------------------------------
% 0.24/0.37 % User time : 0.101 s
% 0.24/0.37 % System time : 0.043 s
% 0.24/0.37 % Total time : 0.144 s
% 0.24/0.37 % Maximum resident set size: 5376 pages
% 0.24/0.37 % E exiting
%------------------------------------------------------------------------------