%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP325_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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.14s 0.67s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of types : 9 ( 9 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'N$': $tType ).
tff(decl_sort2,type,
'N_a_b_vec_fun$': $tType ).
tff(decl_sort3,type,
'A_b_vec$': $tType ).
tff(decl_sort4,type,
'A_b_vec_n_vec$': $tType ).
tff(decl_sort5,type,
'B$': $tType ).
tff(decl_sort6,type,
'A_a_b_vec_n_vec_fun$': $tType ).
tff(decl_sort7,type,
'A_a_fun$': $tType ).
tff(decl_sort8,type,
'B_a_fun$': $tType ).
tff(decl_sort9,type,
'A$': $tType ).
tff(decl_55,type,
'a$a': 'A_b_vec_n_vec$' ).
tff(decl_91,type,
'vec_nth$a': 'A_b_vec_n_vec$' > 'N_a_b_vec_fun$' ).
tff(decl_95,type,
'fun_app$a': ( 'B$' * 'B_a_fun$' ) > 'A$' ).
tff(decl_102,type,
'i$': 'N$' ).
tff(decl_116,type,
'one$': 'A$' ).
tff(decl_148,type,
'j$': 'B$' ).
tff(decl_170,type,
'divide$': 'A$' > 'A_a_fun$' ).
tff(decl_173,type,
'fun_app$m': ( 'A$' * 'A_a_fun$' ) > 'A$' ).
tff(decl_192,type,
'fun_app$n': ( 'A$' * 'A_a_b_vec_n_vec_fun$' ) > 'A_b_vec_n_vec$' ).
tff(decl_215,type,
'interchange_A$': 'A_b_vec_n_vec$' ).
tff(decl_221,type,
'fun_app$b': ( 'N$' * 'N_a_b_vec_fun$' ) > 'A_b_vec$' ).
tff(decl_225,type,
'vec_nth$': 'A_b_vec$' > 'B_a_fun$' ).
tff(decl_231,type,
'mult_row$': ( 'N$' * 'A_b_vec_n_vec$' ) > 'A_a_b_vec_n_vec_fun$' ).
tff(conjecture104,conjecture,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture104) ).
tff(axiom105,axiom,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom105) ).
tff(c_0_2,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(assume_negation,[status(cth)],[conjecture104]) ).
tff(c_0_3,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
tff(c_0_4,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
tcf(c_0_5,plain,
'a$a' = 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(split_conjunct,[status(thm)],[axiom105]) ).
tcf(c_0_6,negated_conjecture,
'a$a' != 'fun_app$n'('mult_row$'('interchange_A$','i$'),'fun_app$m'('divide$'('one$'),'fun_app$a'('vec_nth$'('fun_app$b'('vec_nth$a'('interchange_A$'),'i$')),'j$'))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
$false,
inference(sr,[status(thm)],[c_0_5,c_0_6]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP325_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.55 % Computer : n020.cluster.edu
% 0.11/0.55 % Model : x86_64 x86_64
% 0.11/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.55 % Memory : 8046.5625MB
% 0.11/0.55 % OS : Linux 6.8.0-71-generic
% 0.11/0.55 % CPULimit : 300
% 0.11/0.55 % WCLimit : 300
% 0.11/0.55 % DateTime : Sun Sep 20 22:35:33 UTC 2026
% 0.11/0.55 % CPUTime :
% 0.11/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.59 Running first-order theorem proving
% 0.14/0.59 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.67 % Version: 3.5.1
% 0.14/0.67 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.67 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/0.67 % Starting new_bool_3 with 600s (2) cores
% 0.14/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.67 % Starting sh5l with 300s (1) cores
% 0.14/0.67 % new_bool_3 with pid 1369519 completed with status 0
% 0.14/0.67 % Result found by new_bool_3
% 0.14/0.67 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.67 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/0.67 % Starting new_bool_3 with 600s (2) cores
% 0.14/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.67 % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.14/0.67 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.67 % Starting SubtermCWHack with 55s (1) cores
% 0.14/0.67 % Starting new_bool_3 with 61s (1) cores
% 0.14/0.67 % new_bool_3 with pid 1369523 completed with status 0
% 0.14/0.67 % Result found by new_bool_3
% 0.14/0.67 % Preprocessing class: FSLMSMSMSSSNFFN.
% 0.14/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.67 % Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2S with 1200s (4) cores
% 0.14/0.67 % Starting new_bool_3 with 600s (2) cores
% 0.14/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.67 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.67 % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.14/0.67 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.14/0.67 % Starting SubtermCWHack with 55s (1) cores
% 0.14/0.67 % Starting new_bool_3 with 61s (1) cores
% 0.14/0.67 % Preprocessing time : 0.008 s
% 0.14/0.67 % Presaturation interreduction done
% 0.14/0.67
% 0.14/0.67 % Proof found!
% 0.14/0.67 % SZS status Theorem
% 0.14/0.67 % SZS output start CNFRefutation
% See solution above
% 0.14/0.67 % Parsed axioms : 803
% 0.14/0.67 % Removed by relevancy pruning/SinE : 597
% 0.14/0.67 % Initial clauses : 855
% 0.14/0.67 % Removed in clause preprocessing : 492
% 0.14/0.67 % Initial clauses in saturation : 363
% 0.14/0.67 % Processed clauses : 13
% 0.14/0.67 % ...of these trivial : 0
% 0.14/0.67 % ...subsumed : 3
% 0.14/0.67 % ...remaining for further processing : 9
% 0.14/0.67 % Other redundant clauses eliminated : 0
% 0.14/0.67 % Clauses deleted for lack of memory : 0
% 0.14/0.67 % Backward-subsumed : 0
% 0.14/0.67 % Backward-rewritten : 0
% 0.14/0.67 % Generated clauses : 0
% 0.14/0.67 % ...of the previous two non-redundant : 0
% 0.14/0.67 % ...aggressively subsumed : 0
% 0.14/0.67 % Contextual simplify-reflections : 0
% 0.14/0.67 % Paramodulations : 0
% 0.14/0.67 % Factorizations : 0
% 0.14/0.67 % NegExts : 0
% 0.14/0.67 % Equation resolutions : 0
% 0.14/0.67 % Disequality decompositions : 0
% 0.14/0.67 % Total rewrite steps : 0
% 0.14/0.67 % ...of those cached : 0
% 0.14/0.67 % Propositional unsat checks : 0
% 0.14/0.67 % Propositional check models : 0
% 0.14/0.67 % Propositional check unsatisfiable : 0
% 0.14/0.67 % Propositional clauses : 0
% 0.14/0.67 % Propositional clauses after purity: 0
% 0.14/0.67 % Propositional unsat core size : 0
% 0.14/0.67 % Propositional preprocessing time : 0.000
% 0.14/0.67 % Propositional encoding time : 0.000
% 0.14/0.67 % Propositional solver time : 0.000
% 0.14/0.67 % Success case prop preproc time : 0.000
% 0.14/0.67 % Success case prop encoding time : 0.000
% 0.14/0.67 % Success case prop solver time : 0.000
% 0.14/0.67 % Current number of processed clauses : 9
% 0.14/0.67 % Positive orientable unit clauses : 3
% 0.14/0.67 % Positive unorientable unit clauses: 0
% 0.14/0.67 % Negative unit clauses : 6
% 0.14/0.67 % Non-unit-clauses : 0
% 0.14/0.67 % Current number of unprocessed clauses: 350
% 0.14/0.67 % ...number of literals in the above : 1018
% 0.14/0.67 % Current number of archived formulas : 0
% 0.14/0.67 % Current number of archived clauses : 0
% 0.14/0.67 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.67 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.67 % Non-unit clause-clause subsumptions : 0
% 0.14/0.67 % Unit Clause-clause subsumption calls : 8
% 0.14/0.67 % Rewrite failures with RHS unbound : 0
% 0.14/0.67 % BW rewrite match attempts : 0
% 0.14/0.67 % BW rewrite match successes : 0
% 0.14/0.67 % Condensation attempts : 0
% 0.14/0.67 % Condensation successes : 0
% 0.14/0.67 % Termbank termtop insertions : 43597
% 0.14/0.67 % Search garbage collected termcells : 10059
% 0.14/0.67
% 0.14/0.67 % -------------------------------------------------
% 0.14/0.67 % User time : 0.027 s
% 0.14/0.67 % System time : 0.011 s
% 0.14/0.67 % Total time : 0.038 s
% 0.14/0.67 % Maximum resident set size: 6704 pages
% 0.14/0.67
% 0.14/0.67 % -------------------------------------------------
% 0.14/0.67 % User time : 0.051 s
% 0.14/0.67 % System time : 0.027 s
% 0.14/0.67 % Total time : 0.078 s
% 0.14/0.67 % Maximum resident set size: 5888 pages
% 0.14/0.67 % E exiting
%------------------------------------------------------------------------------