%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO452+1 : TPTP v9.3.1. Released v7.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:30:13 PM UTC 2026
% Result : Theorem 118.63s 19.08s
% Output : CNFRefutation 118.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aMATRIXu_VECTORu_MUL,conjecture,
! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_VECTORu_MUL) ).
fof(aMATRIXu_WORKS,axiom,
! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aMATRIXu_WORKS) ).
fof(c_0_2,negated_conjecture,
~ ! [X733,X738,X11] :
( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
=> ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
inference(assume_negation,[status(cth)],[aMATRIXu_VECTORu_MUL]) ).
fof(c_0_3,negated_conjecture,
( s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0)))
& p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0)))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,plain,
! [X1396,X1397,X1398,X1399] :
( s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),i(s(fun(cart(cart(real,X1397),X1396),fun(cart(real,X1397),cart(real,X1396))),matrixu_vectoru_mul),s(cart(cart(real,X1397),X1396),i(s(fun(fun(cart(real,X1397),cart(real,X1396)),cart(cart(real,X1397),X1396)),matrix),s(fun(cart(real,X1397),cart(real,X1396)),X1398))))),s(cart(real,X1397),X1399))) = s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),X1398),s(cart(real,X1397),X1399)))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1397),cart(real,X1396)),bool),linear),s(fun(cart(real,X1397),cart(real,X1396)),X1398)))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aMATRIXu_WORKS])])])]) ).
cnf(c_0_5,negated_conjecture,
s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( ~ p(s(bool,i(s(fun(fun(cart(real,X1),cart(real,X2)),bool),linear),s(fun(cart(real,X1),cart(real,X2)),X3))))
| s(cart(real,X2),i(s(fun(cart(real,X1),cart(real,X2)),i(s(fun(cart(cart(real,X1),X2),fun(cart(real,X1),cart(real,X2))),matrixu_vectoru_mul),s(cart(cart(real,X1),X2),i(s(fun(fun(cart(real,X1),cart(real,X2)),cart(cart(real,X1),X2)),matrix),s(fun(cart(real,X1),cart(real,X2)),X3))))),s(cart(real,X1),X4))) = s(cart(real,X2),i(s(fun(cart(real,X1),cart(real,X2)),X3),s(cart(real,X1),X4))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0)))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO452+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 16:21:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 118.63/19.08 % Version: 3.5.1
% 118.63/19.08 % Preprocessing class: FMLMSMSLSSSNFFN.
% 118.63/19.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 118.63/19.08 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 118.63/19.08 % Starting new_bool_3 with 600s (2) cores
% 118.63/19.08 % Starting new_bool_1 with 600s (2) cores
% 118.63/19.08 % Starting sh5l with 300s (1) cores
% 118.63/19.08 % new_bool_1 with pid 805578 completed with status 0
% 118.63/19.08 % Result found by new_bool_1
% 118.63/19.08 % Preprocessing class: FMLMSMSLSSSNFFN.
% 118.63/19.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 118.63/19.08 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 118.63/19.08 % Starting new_bool_3 with 600s (2) cores
% 118.63/19.08 % Starting new_bool_1 with 600s (2) cores
% 118.63/19.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 118.63/19.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 118.63/19.08 % Search class: FGHSM-SMLM33-DFFFFFNN
% 118.63/19.08 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 118.63/19.08 % Starting SubtermCWHack with 55s (1) cores
% 118.63/19.08 % Starting new_bool_1 with 61s (1) cores
% 118.63/19.08 % SubtermCWHack with pid 805580 completed with status 0
% 118.63/19.08 % Result found by SubtermCWHack
% 118.63/19.08 % Preprocessing class: FMLMSMSLSSSNFFN.
% 118.63/19.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 118.63/19.08 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 118.63/19.08 % Starting new_bool_3 with 600s (2) cores
% 118.63/19.08 % Starting new_bool_1 with 600s (2) cores
% 118.63/19.08 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 118.63/19.08 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 118.63/19.08 % Search class: FGHSM-SMLM33-DFFFFFNN
% 118.63/19.08 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 118.63/19.08 % Starting SubtermCWHack with 55s (1) cores
% 118.63/19.08 % Preprocessing time : 0.302 s
% 118.63/19.08
% 118.63/19.08 % Proof found!
% 118.63/19.08 % SZS status Theorem
% 118.63/19.08 % SZS output start CNFRefutation
% See solution above
% 118.63/19.08 % Parsed axioms : 3177
% 118.63/19.08 % Removed by relevancy pruning/SinE : 1754
% 118.63/19.08 % Initial clauses : 3789
% 118.63/19.08 % Removed in clause preprocessing : 183
% 118.63/19.08 % Initial clauses in saturation : 3606
% 118.63/19.08 % Processed clauses : 12826
% 118.63/19.08 % ...of these trivial : 416
% 118.63/19.08 % ...subsumed : 10471
% 118.63/19.08 % ...remaining for further processing : 1939
% 118.63/19.08 % Other redundant clauses eliminated : 0
% 118.63/19.08 % Clauses deleted for lack of memory : 0
% 118.63/19.08 % Backward-subsumed : 9
% 118.63/19.08 % Backward-rewritten : 20
% 118.63/19.08 % Generated clauses : 564369
% 118.63/19.08 % ...of the previous two non-redundant : 444317
% 118.63/19.08 % ...aggressively subsumed : 0
% 118.63/19.08 % Contextual simplify-reflections : 11
% 118.63/19.08 % Paramodulations : 564268
% 118.63/19.08 % Factorizations : 27
% 118.63/19.08 % NegExts : 0
% 118.63/19.08 % Equation resolutions : 74
% 118.63/19.08 % Disequality decompositions : 0
% 118.63/19.08 % Total rewrite steps : 193655
% 118.63/19.08 % ...of those cached : 160347
% 118.63/19.08 % Propositional unsat checks : 0
% 118.63/19.08 % Propositional check models : 0
% 118.63/19.08 % Propositional check unsatisfiable : 0
% 118.63/19.08 % Propositional clauses : 0
% 118.63/19.08 % Propositional clauses after purity: 0
% 118.63/19.08 % Propositional unsat core size : 0
% 118.63/19.08 % Propositional preprocessing time : 0.000
% 118.63/19.08 % Propositional encoding time : 0.000
% 118.63/19.08 % Propositional solver time : 0.000
% 118.63/19.08 % Success case prop preproc time : 0.000
% 118.63/19.08 % Success case prop encoding time : 0.000
% 118.63/19.08 % Success case prop solver time : 0.000
% 118.63/19.08 % Current number of processed clauses : 1910
% 118.63/19.08 % Positive orientable unit clauses : 599
% 118.63/19.08 % Positive unorientable unit clauses: 23
% 118.63/19.08 % Negative unit clauses : 124
% 118.63/19.08 % Non-unit-clauses : 1164
% 118.63/19.08 % Current number of unprocessed clauses: 434898
% 118.63/19.08 % ...number of literals in the above : 1475232
% 118.63/19.08 % Current number of archived formulas : 0
% 118.63/19.08 % Current number of archived clauses : 29
% 118.63/19.08 % Clause-clause subsumption calls (NU) : 226613
% 118.63/19.08 % Rec. Clause-clause subsumption calls : 154503
% 118.63/19.08 % Non-unit clause-clause subsumptions : 7206
% 118.63/19.08 % Unit Clause-clause subsumption calls : 17131
% 118.63/19.08 % Rewrite failures with RHS unbound : 22
% 118.63/19.08 % BW rewrite match attempts : 112049
% 118.63/19.08 % BW rewrite match successes : 84
% 118.63/19.08 % Condensation attempts : 0
% 118.63/19.08 % Condensation successes : 0
% 118.63/19.08 % Termbank termtop insertions : 41627500
% 118.63/19.08 % Search garbage collected termcells : 114029
% 118.63/19.08
% 118.63/19.08 % -------------------------------------------------
% 118.63/19.08 % User time : 17.373 s
% 118.63/19.08 % System time : 0.470 s
% 118.63/19.08 % Total time : 17.843 s
% 118.63/19.08 % Maximum resident set size: 32536 pages
% 118.63/19.08
% 118.63/19.08 % -------------------------------------------------
% 118.63/19.08 % User time : 34.288 s
% 118.63/19.08 % System time : 0.928 s
% 118.63/19.08 % Total time : 35.216 s
% 118.63/19.08 % Maximum resident set size: 14592 pages
% 118.63/19.08 % E exiting
%------------------------------------------------------------------------------