%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP341_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 : n016.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:55:26 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 typ; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'A_n_vec_n_vec$': $tType ).
tff(decl_sort2,type,
'A$': $tType ).
tff(decl_27,type,
'mat$': 'A$' > 'A_n_vec_n_vec$' ).
tff(decl_36,type,
'gauss_Jordan$': 'A_n_vec_n_vec$' > 'A_n_vec_n_vec$' ).
tff(decl_53,type,
'one$': 'A$' ).
tff(decl_55,type,
'matrix_inv$': 'A_n_vec_n_vec$' > 'A_n_vec_n_vec$' ).
tff(decl_71,type,
'a$': 'A_n_vec_n_vec$' ).
tff(decl_81,type,
'matrix_matrix_mult$': ( 'A_n_vec_n_vec$' * 'A_n_vec_n_vec$' ) > 'A_n_vec_n_vec$' ).
tff(decl_115,type,
'p$': 'A_n_vec_n_vec$' ).
tff(conjecture3,conjecture,
'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')) = 'matrix_inv$'('p$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conjecture3) ).
tff(axiom9,axiom,
! [X8: 'A_n_vec_n_vec$'] : ( 'matrix_matrix_mult$'(X8,'mat$'('one$')) = X8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom9) ).
tff(axiom14,axiom,
'gauss_Jordan$'('a$') = 'matrix_matrix_mult$'('p$','a$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom14) ).
tff(axiom15,axiom,
'gauss_Jordan$'('a$') = 'mat$'('one$'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom15) ).
tff(axiom7,axiom,
'a$' = 'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom7) ).
tff(c_0_5,negated_conjecture,
'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')) != 'matrix_inv$'('p$'),
inference(assume_negation,[status(cth)],[conjecture3]) ).
tff(c_0_6,plain,
! [X845: 'A_n_vec_n_vec$'] : ( 'matrix_matrix_mult$'(X845,'mat$'('one$')) = X845 ),
inference(variable_rename,[status(thm)],[axiom9]) ).
tcf(c_0_7,plain,
'gauss_Jordan$'('a$') = 'matrix_matrix_mult$'('p$','a$'),
inference(split_conjunct,[status(thm)],[axiom14]) ).
tcf(c_0_8,plain,
'gauss_Jordan$'('a$') = 'mat$'('one$'),
inference(split_conjunct,[status(thm)],[axiom15]) ).
tff(c_0_9,negated_conjecture,
'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')) != 'matrix_inv$'('p$'),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
tcf(c_0_10,plain,
! [X2: 'A_n_vec_n_vec$'] : 'matrix_matrix_mult$'(X2,'mat$'('one$')) = X2,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_11,plain,
'mat$'('one$') = 'matrix_matrix_mult$'('p$','a$'),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
tff(c_0_12,negated_conjecture,
'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')) != 'matrix_inv$'('p$'),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
tcf(c_0_13,plain,
'a$' = 'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')),
inference(split_conjunct,[status(thm)],[axiom7]) ).
tcf(c_0_14,plain,
! [X2: 'A_n_vec_n_vec$'] : 'matrix_matrix_mult$'(X2,'matrix_matrix_mult$'('p$','a$')) = X2,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_15,negated_conjecture,
'matrix_matrix_mult$'('matrix_inv$'('p$'),'mat$'('one$')) != 'matrix_inv$'('p$'),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_16,plain,
'matrix_inv$'('p$') = 'a$',
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_11]),c_0_14]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP341_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.10/0.35 % Computer : n016.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:39:22 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_3 with pid 941776 completed with status 0
% 0.10/0.44 % Result found by new_bool_3
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.44 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 941781 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.10/0.44 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.44 % Preprocessing time : 0.004 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 533
% 0.10/0.44 % Removed by relevancy pruning/SinE : 357
% 0.10/0.44 % Initial clauses : 257
% 0.10/0.44 % Removed in clause preprocessing : 25
% 0.10/0.44 % Initial clauses in saturation : 232
% 0.10/0.44 % Processed clauses : 91
% 0.10/0.44 % ...of these trivial : 14
% 0.10/0.44 % ...subsumed : 6
% 0.10/0.44 % ...remaining for further processing : 70
% 0.10/0.44 % Other redundant clauses eliminated : 27
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 3
% 0.10/0.44 % Generated clauses : 64
% 0.10/0.44 % ...of the previous two non-redundant : 14
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 37
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 27
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 77
% 0.10/0.44 % ...of those cached : 58
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 40
% 0.10/0.44 % Positive orientable unit clauses : 28
% 0.10/0.44 % Positive unorientable unit clauses: 4
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 7
% 0.10/0.44 % Current number of unprocessed clauses: 154
% 0.10/0.44 % ...number of literals in the above : 314
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 3
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 14
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 14
% 0.10/0.44 % Non-unit clause-clause subsumptions : 6
% 0.10/0.44 % Unit Clause-clause subsumption calls : 2
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 22
% 0.10/0.44 % BW rewrite match successes : 22
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 15001
% 0.10/0.44 % Search garbage collected termcells : 4224
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.010 s
% 0.10/0.44 % System time : 0.005 s
% 0.10/0.44 % Total time : 0.015 s
% 0.10/0.44 % Maximum resident set size: 5000 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.025 s
% 0.10/0.44 % System time : 0.011 s
% 0.10/0.44 % Total time : 0.036 s
% 0.10/0.44 % Maximum resident set size: 5632 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------