%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP327_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 : Thu Sep 24 12:57:35 PM UTC 2026
% Result : Theorem 0.15s 5.58s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 7 ( 7 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_a_a_fun_fun$': $tType ).
tff(decl_sort2,type,
'A$': $tType ).
tff(decl_sort3,type,
'A_a_fun$': $tType ).
tff(decl_sort4,type,
'A_n_vec$': $tType ).
tff(decl_sort5,type,
'N$': $tType ).
tff(decl_sort6,type,
'N_a_fun$': $tType ).
tff(decl_sort7,type,
'N_bool_fun$': $tType ).
tff(decl_28,type,
'fun_app$n': ( 'A$' * 'A_a_a_fun_fun$' ) > 'A_a_fun$' ).
tff(decl_105,type,
'the$': 'N_bool_fun$' > 'N$' ).
tff(decl_107,type,
'i$': 'N$' ).
tff(decl_123,type,
'vec_nth$b': 'A_n_vec$' > 'N_a_fun$' ).
tff(decl_135,type,
'times$e': 'A_a_a_fun_fun$' ).
tff(decl_185,type,
'uu$': 'N_bool_fun$' ).
tff(decl_199,type,
'fun_app$m': ( 'A$' * 'A_a_fun$' ) > 'A$' ).
tff(decl_213,type,
'xa$': 'A_n_vec$' ).
tff(decl_257,type,
'zero$': 'A$' ).
tff(decl_267,type,
'fun_app$d': ( 'N$' * 'N_a_fun$' ) > 'A$' ).
tff(decl_279,type,
'x$': 'A_n_vec$' ).
tff(conjecture118,conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) = 'zero$',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conjecture118) ).
tff(axiom119,axiom,
'fun_app$d'('vec_nth$b'('xa$'),'i$') = 'zero$',
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom119) ).
tff(axiom142,axiom,
! [X308: 'A$'] : ( 'fun_app$m'('fun_app$n'('times$e',X308),'zero$') = 'zero$' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom142) ).
tff(c_0_3,negated_conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
inference(assume_negation,[status(cth)],[conjecture118]) ).
tff(c_0_4,negated_conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,negated_conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_6,negated_conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'fun_app$d'('vec_nth$b'('xa$'),'i$')) != 'zero$',
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_7,plain,
'fun_app$d'('vec_nth$b'('xa$'),'i$') = 'zero$',
inference(split_conjunct,[status(thm)],[axiom119]) ).
tff(c_0_8,plain,
! [X2010: 'A$'] : ( 'fun_app$m'('fun_app$n'('times$e',X2010),'zero$') = 'zero$' ),
inference(variable_rename,[status(thm)],[axiom142]) ).
tcf(c_0_9,negated_conjecture,
'fun_app$m'('fun_app$n'('times$e','fun_app$d'('vec_nth$b'('x$'),'the$'('uu$'))),'zero$') != 'zero$',
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
tcf(c_0_10,plain,
! [X21: 'A$'] : 'fun_app$m'('fun_app$n'('times$e',X21),'zero$') = 'zero$',
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP327_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.39 % Computer : n017.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Sun Sep 20 22:29:47 UTC 2026
% 0.12/5.40 % CPUTime :
% 0.12/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.44 Running first-order theorem proving
% 0.15/5.44 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.58 % Version: 3.5.1
% 0.15/5.58 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.58 % Starting sh5l with 300s (1) cores
% 0.15/5.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 774199 completed with status 0
% 0.15/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.58 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.15/5.58 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 0.15/5.58 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 0.15/5.58 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 774210 completed with status 0
% 0.15/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.15/5.58 % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58 % No SInE strategy applied
% 0.15/5.58 % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.15/5.58 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 0.15/5.58 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 0.15/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 0.15/5.58 % Preprocessing time : 0.011 s
% 0.15/5.58 % Presaturation interreduction done
% 0.15/5.58
% 0.15/5.58 % Proof found!
% 0.15/5.58 % SZS status Theorem
% 0.15/5.58 % SZS output start CNFRefutation
% See solution above
% 0.15/5.58 % Parsed axioms : 1128
% 0.15/5.58 % Removed by relevancy pruning/SinE : 0
% 0.15/5.58 % Initial clauses : 1646
% 0.15/5.58 % Removed in clause preprocessing : 542
% 0.15/5.58 % Initial clauses in saturation : 1104
% 0.15/5.58 % Processed clauses : 24
% 0.15/5.58 % ...of these trivial : 1
% 0.15/5.58 % ...subsumed : 1
% 0.15/5.58 % ...remaining for further processing : 22
% 0.15/5.58 % Other redundant clauses eliminated : 0
% 0.15/5.58 % Clauses deleted for lack of memory : 0
% 0.15/5.58 % Backward-subsumed : 0
% 0.15/5.58 % Backward-rewritten : 1
% 0.15/5.58 % Generated clauses : 0
% 0.15/5.58 % ...of the previous two non-redundant : 0
% 0.15/5.58 % ...aggressively subsumed : 0
% 0.15/5.58 % Contextual simplify-reflections : 0
% 0.15/5.58 % Paramodulations : 0
% 0.15/5.58 % Factorizations : 0
% 0.15/5.58 % NegExts : 0
% 0.15/5.58 % Equation resolutions : 0
% 0.15/5.58 % Disequality decompositions : 0
% 0.15/5.58 % Total rewrite steps : 5
% 0.15/5.58 % ...of those cached : 1
% 0.15/5.58 % Propositional unsat checks : 0
% 0.15/5.58 % Propositional check models : 0
% 0.15/5.58 % Propositional check unsatisfiable : 0
% 0.15/5.58 % Propositional clauses : 0
% 0.15/5.58 % Propositional clauses after purity: 0
% 0.15/5.58 % Propositional unsat core size : 0
% 0.15/5.58 % Propositional preprocessing time : 0.000
% 0.15/5.58 % Propositional encoding time : 0.000
% 0.15/5.58 % Propositional solver time : 0.000
% 0.15/5.58 % Success case prop preproc time : 0.000
% 0.15/5.58 % Success case prop encoding time : 0.000
% 0.15/5.58 % Success case prop solver time : 0.000
% 0.15/5.58 % Current number of processed clauses : 21
% 0.15/5.58 % Positive orientable unit clauses : 10
% 0.15/5.58 % Positive unorientable unit clauses: 0
% 0.15/5.58 % Negative unit clauses : 11
% 0.15/5.58 % Non-unit-clauses : 0
% 0.15/5.58 % Current number of unprocessed clauses: 1080
% 0.15/5.58 % ...number of literals in the above : 2479
% 0.15/5.58 % Current number of archived formulas : 0
% 0.15/5.58 % Current number of archived clauses : 38
% 0.15/5.58 % Clause-clause subsumption calls (NU) : 0
% 0.15/5.58 % Rec. Clause-clause subsumption calls : 0
% 0.15/5.58 % Non-unit clause-clause subsumptions : 0
% 0.15/5.58 % Unit Clause-clause subsumption calls : 16
% 0.15/5.58 % Rewrite failures with RHS unbound : 0
% 0.15/5.58 % BW rewrite match attempts : 1
% 0.15/5.58 % BW rewrite match successes : 1
% 0.15/5.58 % Condensation attempts : 0
% 0.15/5.58 % Condensation successes : 0
% 0.15/5.58 % Termbank termtop insertions : 85754
% 0.15/5.58 % Search garbage collected termcells : 16830
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.063 s
% 0.15/5.58 % System time : 0.014 s
% 0.15/5.58 % Total time : 0.076 s
% 0.15/5.58 % Maximum resident set size: 9676 pages
% 0.15/5.58
% 0.15/5.58 % -------------------------------------------------
% 0.15/5.58 % User time : 0.141 s
% 0.15/5.58 % System time : 0.054 s
% 0.15/5.58 % Total time : 0.195 s
% 0.15/5.58 % Maximum resident set size: 6400 pages
% 0.15/5.58 % E exiting
%------------------------------------------------------------------------------